收斂的迭代 的英文怎麼說

中文拼音 [shōuliǎndediědài]
收斂的迭代 英文
convergent iteration
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 的 : 4次方是 The fourth power of 2 is direction
  • 迭 : Ⅰ動詞（輪流; 替換） 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 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. A constringent analysis of iterative chart radius of the first type iterative method

    一類迭代法的迭代陣譜半徑的收斂性分析
  2. Iterative convergence of a class of multivariate contractive - type mappings

    一類多元壓縮型映象的迭代收斂性
  3. 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的總傳導率之比。
  4. Another advantage, contrast to using convolutional codes or turbo codes, is its low complexity while maintain high ber performance because the check equations are used to terminate the both iterations. we develop the theoretical error free feedback bound for bpcm - id and predict the threshold for decder convergence using the extrinsic information ransfer chart ( exit )

    利用非正則ldpc具有不同度的信息節點概率密度演化的差異，對高階星座中具有較高級別的子通道提供額外的保護，可使迭代反饋判決時，星座子集擁有最大的無錯反饋歐氏距離調和均值，從而改善系統的迭代收斂特性。
  5. Through ( multi - level ) bordered block partition of the power system topology matrix, a bbdf coefficient matrix which is suitable for above decomposition is formed. when the equation is solved with parallel iterative method, convergence acceleration is achieved through damping newton method

    通過採用（多重）對角加邊的方法進行電力網路拓撲分割，以形成適合以上分解法求解的對角加邊形式的系數矩陣，并行求解后並對迭代過程進行阻尼牛頓法修正，以達到加速收斂的作用。
  6. The property shows that the maximal solution is well - conditioned. two new iteration methods for finding the maximal solution are proposed. of these two methods, one is a linearly convergent iteration without matrix inversion, and one is related to newton s method and quadratically convergent

    這2種方法，一種是線性收斂的，其優點是迭代過程不需要求矩陣的逆另一種是二次收斂的，數值試驗的結果表明該方法在計算速度和精度方面都明顯地優于現有的其他幾種迭代方法。
  7. A normal transform is introduced, and there are enough much grids in the region between the critical layer and the wall, where the variation of the disturbance is the quickest. the finite - difference of governing equations with fourth - order accuracy in the normal direction is utilized in full regions including points close the wall, and is very important for accurately discreting equations. the combination of global and local methods is implemented, and a new iterative formula is derived

    對于曲線坐標系下的拋物化穩定性方程，文中發展了求解的高效數值方法:引進法向變換，使得在臨界層與壁面之間的擾動量變化最快的區域有更多的法向網格點;導出包含邊界鄰域在內的完全四階精度的法向有限差分格式，這對方程精確離散至關重要;採用全局法和局部法相結合的方法及其新的迭代公式，大大加速收斂並得到更精確的特徵值。
  8. The super - exponential iteration ( sei ) blind equalization algorithm has the advantage of good tracking capability of the time varying channel

    超指數盲均衡演算法的迭代演算法收斂速度快，且便於跟蹤時變通道。
  9. Abstract : based on the iterative bit - filling procedure, a computationally efficient bit and power allocation algorithm is presented. the algorithm improves the conventional bit - filling algorithms by maintaining only a subset of subcarriers for computation in each iteration, which reduces the complexity without any performance degradation. moreover, a modified algorithm with even lower complexity is developed, and equal power allocation is introduced as an initial allocation to accelerate its convergence. simulation results show that the modified algorithm achieves a considerable complexity reduction while causing only a minor drop in performance

    文摘:基於迭代的比特和功率分配機制，提出了一種低復雜度的比特和功率分配演算法.與傳統的迭代分配演算法不同，該演算法在每次迭代中只需要比較幾個特定的子載波.該方法在保持傳統迭代演算法性能的前提下極大地減小了迭代分配演算法的復雜度.此外，通過選擇等功率分配方案作為初始方案加快了演算法的收斂速度，進一步降低了演算法復雜度.模擬結果表明，提出的改進演算法在基本不犧牲系統性能的前提下有效地降低了演算法復雜度
  10. In this paper, we study the finite iterated order of growth and the iterated convergence exponent of the zero sequence of nonzero meromorphic solutions of second order homogeneous linear differential equation, and obtain some precision evaluation

    摘要研究了二階齊次線性微分方程非零亞純解的迭代級與零點迭代收斂指數，得到了它們的精確估計。
  11. In latter part of chapter three, some exciting properties of the revised lagrangian function discussed first, which leads to form a dual algorithm of cora or cot. convergence theorem proved by banach perturbation theorem, bertsekas implicit function theorem ii and by analyzing hesse matrix of revised largrangian function

    另一類是構造相應的lagrange函數及其一種對偶演算法的迭代格式，討論了修正lagrange函數的性質，並藉助banach擾動定理及bertsekas第h隱函數定理，及對修正lagrange函數hesse陣分析，證明了該演算法的收斂性
  12. If the converged ritz values is wanted, it is necessary to keep it in the subsequent of block lanczos factorizations. this is called locking

    如果在迭代過程中所得到收斂的ritz值是想要的，則把它保存在塊lanczos因子分解的子序列中，即所謂鎖定。
  13. As a result, controllers cannot output signals according to the computation result of algorithm, original iterative rules are affected, and it even affects the convergence of the algorithm. in this paper, discussion of this problem was presented

    這樣控制器就無法按照迭代學習演算法的計算結果正常輸出，迭代學習控制律原有的迭代關系被破壞，並有可能破壞迭代學習控制演算法的收斂性。
  14. In addition, the paper makes a research into fft in asynchronous sampling from the angle of iteration, and obtains a iterative formula

    此外，本文從迭代收斂的角度研究了非同步取樣時的fft ，得出了一個迭代公式。
  15. We have deduced the iterative formula by the theory of the dynamic system, proved that the quadratic convergence holds under the weak conditions, and done the numerical experiments

    利用動力系統理論推導出該方法的迭代公式，證明其在某些弱條件下至少是二階收斂的，最後給出了數值結果。
  16. The necessary and sufficient convergence condition and the optimum relaxation parameter of ussor iterative method

    迭代法收斂的充要條件和最佳鬆弛因子
  17. The methods considering the elastoplasticity are the elastic - plastic hinge method and the pseudo load method. based on the need of non - linear analysis, researchers brought forward nonlinear calculation methods to control the iterative constringency, such as the load controlling method, the displacement controlling method, the arc length controlling method and the pseudo load method

    考慮彈塑性的分析方法有：彈性-塑性鉸法和虛擬荷載法根據非線性研究分析的需要，研究人員先後提出了：荷載控製法、位移控製法、弧長控製法和做功控製法等控制迭代收斂的非線性計算方法。
  18. Convergence of iterative sequence with errors for asymptotically nonexpansive type mappings

    漸近非擴張映象具誤差的迭代序列的收斂性
  19. And we point out that iteration ( 2. 1. 1 ) is much better than jarratt - type method if the property of the operator is n ' t good enough

    和ma . hern如dez等人提出了一族帶參數。的三階收斂的迭代方法（見參考文獻{ 1 ， 2 ） 。
  20. By a iterative compilation framework it made the code size under control

    提出了收斂的迭代編譯框架來控制最終代碼生成大小。
分享友人
分享到 Line

分享到臉書