收斂迭代法 的英文怎麼說

中文拼音 [shōuliǎndiědàifǎ]
收斂迭代法 英文
convergent iterative procedure
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 迭 : Ⅰ動詞（輪流; 替換） alternate; change Ⅱ副詞1 （屢次） repeatedly; again and again 2 （及） in tim...
  • 代 : Ⅰ動詞1 （代替） take the place of; be in place of 2 （代理） act on behalf of; acting Ⅱ名詞1 （歷...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. This paper is made up of three chapter, which discuss mainly about the astringency of the iterative methods and the application in fact

    本文共分三章，主要討論的是迭代法的收斂性及其在實際中的應用問題。
  2. The new algorithm bases on bisection and secant iteration, which is different cuppen ' s method and newton iteration. the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm

    該演算法以割線法迭代為基礎，明顯不同與傳統的newton迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  3. A constringent analysis of iterative chart radius of the first type iterative method

    一類迭代法的迭代陣譜半徑的收斂性分析
  4. A quadratic convergent iteration method with adjusted parameters without derivative for solving nonlinear equations is discussed in this paper

    摘要討論一種解非線性方程的具有變參數的不帶導數的二階收斂迭代法。
  5. In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance

    本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。
  6. Analysis of the convergence rate on newton iteration method

    牛頓迭代法收斂速度分析
  7. Based on the convergence criterion of root - mean - square ( rms ) of phase and output power, the actual intensity on reflectors are solved with fox - li iteration so that the deformations of mirrors and one - way phaseshifts are calculated. by simulating one - way phaseshifts with zernike polynomial, the laser modes are studied with method of iteration and geometriy. the evaluation factors of components influences on beam quality is discussed

    根據相位均方根值迭代收斂準則和輸出功率，用fox - li迭代法求出反射鏡上實際的光強分佈和熱源，得到鏡面的位移變形和單程附加相移，以zernike多項式擬合單程附加相移，分別用迭代法和幾何法計算了腔鏡變形時的腔模光場，建立了光學元件對光束質量影響的評價因子，研究腔鏡冷卻效果和冷卻方式，對輸出耦合鏡的變形進行了分析。
  8. The necessary and sufficient convergence condition and the optimum relaxation parameter of ussor iterative method

    迭代法收斂的充要條件和最佳鬆弛因子
  9. The usage of preconditioned is to improve the distribution of the eigenvalues. the construction of efficient preconditioned is a hot spot of the study of iterations in these years

    對原線性代數方程組採用預條件技術是解決收斂性問題的有效途徑，成為迭代法中的研究熱點。
  10. Actually, this is to resolve an over - determined nonlinear system including six output values and eight input values. so newton - gauss iterative algorithms is used, set up the target function in the sense of the least squares. it is discussed whether the minimal solution to the function exist and is single one while the astringency of newton - gauss method is analyzed

    對于冗餘驅動振動臺，其位姿正解是求解具有八個輸入、六個輸出的超定非線性方程組，因此本文採用了最小二乘法中的牛頓?高斯迭代法，建立最小二乘目標函數，對目標函數極小解的存在性、唯一性以及牛頓?高斯迭代法的收斂性進行了理論證明和分析，將求出的最小值作為位姿正解的最優解。
  11. The solution formula of dwell time is deduced by using the pulse iteration method and the smoothing fourier transition method, and the formula can be simplified referring to workpiece shape. according to the anastomotic status of the tool and workpiece surface, we present the new model of the inherent relation among local pressure density, removal rate, convergence ratio and residual errors, and the corresponding formulas are given. the forming cause of the edge effect in the polishing process is analyzed, and the means which reduces the edge effect is put forward

    2 、針對計算機控制光學表面成形（ ccos ）的加工方式、誤差收斂特點，研製了去除函數呈高斯分佈的雙轉子結構研拋模；採用脈沖迭代法、平滑因子傅立葉變換法推導出駐留時間的演算法，求解過程中根據工件面形的特點作了各種形式的簡化；提出了工件表面和研拋模的吻合誤差與局部壓強、材料去除率、收斂比之間內在關系的數學模型，並推導出相應的計算公式；分析了邊緣效應產生的原因，在加工過程中採用相對壓力因子對去除函數進行修正，可以消除邊緣效應的影響。
  12. To solve the polynomial equation ? ( z ) = 0, this paper proposes a simultaneous iteration and investigates its convergence and initial condition. it proves that the convergence has order 3 under the initial condition

    摘要採用文[ 1 - 3 ]中提到的加速方法，對經典的牛頓迭代法進行加速，得到了一個新的求多項式方程根的迭代法，主要對其收斂性進行了分析，得到了在較好的初始條件下該法是3階收斂的。
  13. For a long time, we have been keeping on the study on the uniqueness of the solution of equation, the conditions of convergence and error estimates for various iterative methods

    長期以來人們從未放棄過對方程解的唯一性和各種迭代法的收斂性的條件及誤差估計的研究。
  14. According to sparse feature of the matrix, we use gauss - sadel resolution method to solve such equations and use inner and outer iteration and multi - curent poles techniques to improve the quality of image of resistivity structures

    根據反演方程系數的稀疏特徵，採用改進的降維高斯賽德爾迭代法來求解該反演方程，並通過內外迭代的結合，對大型稀疏欠定方程能很快收斂，得到可靠的解答。
  15. However, conventional solution methods such as newton iterative method, quasi - newton iterative method are initialization dependent and maybe could not reliable converge

    傳統的求解方法如牛頓迭代法和擬牛頓迭代法都是典型的局部收斂性方法。
  16. In chapter 2, we present a family of iterative method with the convergence of order three. the family of iterative methods avoid evaluating the second frechet derivative

    第二章，提出了一族具有三階收斂迭代法，這族迭代法避免了求f （ x ）的二階導數。
  17. Comparing with traditional successive approximation process algorithm, our method can improve quality of reconstruction result while speeding up convergence. further, proper threshold is adopted to enhance the robustness of the histogram constraint.,

    和傳統的連續近似迭代法相比，該方法在加快收斂速度同時能夠有效地改善重建質量，同時我們採用閾值對先驗直方圖的影響進行動態地控制，有效地增強了直方圖約束的抗干擾性。
  18. In this paper, we consider the optimal parameter vector a of the modified incomplete gauss _ seidel method ( migs ). we prove that the spectral radius function of the iterative matrix t of migs with parameter vector is strictly monotonic decreasing with respect to a satisfying 0 e if the classical gauss _ seidel method converges for a z _ matrix. some properties of the left and right eigenvectors corresponding to the largest eigenvalue in modulus are given, too. these results are useful to find an optimal parameter for migs

    目前主要的方法有兩類：一是充分利用所給矩陣a的特點，採用適當的主元素選取策略，使分解出的因子盡可能地保持稀疏性；二是迭代法。對于第二種方法，迭代矩陣的選取具有決定作用。只有選取的迭代矩陣的譜半徑小於1才能保證迭代法收斂。
  19. In chapter 4, some examples are given to illustrate that the convergence of saor - al - pcg method is better than the classical iterative method ( such as jacobi. gauss ? seidel. sor ) and the traditional cg method as well as ssor - pcg

    第四章用實例證明了這種預條件共軛梯度法的收斂速度比古典的迭代法（如jacobi ， gs ， sor ）和傳統的cg以及ssor - pcg要快一些。
  20. Finally, when the decomposition is proceeding to a symmetric positive definite matrix, the pivot may be very small or even negative. there provided several methods to overcome this shortcoming. ( 2 ) for the block strictly diagonally dominant matrices, there proved the existence and uniqueness of the block lu decomposition and the existence of the incomplete version

    （ 2 ）證明了嚴格塊對角占優矩陣塊lu分解的存在唯一性與塊不完全lu分解的存在性，以及嚴格塊對角占優矩陣與不可約塊對角占優矩陣的塊jacobi 、塊gs ，塊sor 、塊ssor等基本迭代法的收斂性。
分享友人
分享到 Line

分享到臉書