收斂的階 的英文怎麼說

中文拼音 [shōuliǎndejiē]
收斂的階 英文
order of convergence
  • 收 : Ⅰ動詞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
  • 階 : 名詞1. （臺階） steps; stairs 2. （等級） rank 3. [醫學] （耳蝸的三個螺旋管的任一個） scala 4. [數學] order 5. [地質學] stage
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. Its biquadratic finite element approximation is considered and under the appropriately graded meshes, quasi - optimal order error estimates in the - weighted h ^ 1 - norm, up to a logarithmic factor in the singular perturbation parameter, are proved

    然後，考慮此方程在分層網格剖分上的雙二次有限元逼近，在-加權h ^ 1 -模意義下得到了至多相差一個關于攝動參數對數因子的擬最優階收斂的誤差估計。
  2. Introduction of prepotency operator in the initialize population step and the improved mutation operator accelerate the convergence process, and the introduction of new operator in forming new population step avoid converging in local optimum, and promote the ability of global convergence

    演算法在初始化種群階段引入了「優生」運算元，以及改進的變異操作使演算法的收斂速度大大提高；在形成新種群階段引入新的運算元避免了局部早熟，提高了全局收斂能力。
  3. If one consigers the fact that the firstderivative of the function may be difficult to compute analytically the new procedure will become an attractive alternative and it has quartic convergence

    這種混和方法對于解決導數求值比較困難的問題是一個良好的選擇，而且它具有四階的收斂性。
  4. Convergence order of double variate combination trigonometric interpolation polynomials

    二元組合型三角插值多項式的收斂階
  5. A quadratic convergent iteration method with adjusted parameters without derivative for solving nonlinear equations is discussed in this paper

    摘要討論一種解非線性方程的具有變參數的不帶導數的二階收斂迭代法。
  6. It is demonstrated that the solution for 141 000 order normal equations for a simulated astro - geodetic network ( 47 057 points ) and a space one ( 476 points ) iterates 4 993 times to converge to 1 10 - 18 second, taking 28 min and 47 seconds, on a pii / 233 computer, showing over 40 times more efficiency, as compared with the coefficients unadjusted

    利用模擬的天文大地網（ 47057點）和空間網（ 476點）在pii / 233微機上解算14 . 1萬階方程組共迭代4993次（收斂至1 10 - 18角秒） ，花費機時28分47秒，與未進行系數調整相比，功效提高40多倍。
  7. 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具有不同度的信息節點概率密度演化的差異，對高階星座中具有較高級別的子通道提供額外的保護，可使迭代反饋判決時，星座子集擁有最大的無錯反饋歐氏距離調和均值，從而改善系統的迭代收斂特性。
  8. A new higher order convergence algorithm for linear complementarity problems

    線性互補問題中一個新的高階收斂演算法
  9. Adopts vdsm process technology however two outstanding problems are faced to ic layout design when the feature size reaches to 0. 18 m or lower : 1. timing convergence problem seriously affects the circuits schedule, and the interconnect - delay has exceeded more than 70 % of the total circuits ’ delay. 2. si problem, usually it consists two aspects of ir - drop and crosstalk. these problems often affect the chip function after tapout

    本篇論文就是針對超深亞微米階段soc晶元後端設計所面臨的挑戰，提出了運用連續收斂的布局布線策略，尤其是虛擬原型的設計理論，來快速驗證布局，進而提高布線的成功率，並且提出了一種改進的布局評估模型，提高對soc晶元預測布線的準確度;同時，對于時鐘驅動元件選擇，文中提出了一種基於正態分佈模型來達到更有效的選取。
  10. 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

    利用動力系統理論推導出該方法的迭代公式，證明其在某些弱條件下至少是二階收斂的，最後給出了數值結果。
  11. A finite element solving the elliptic fourth order singular perturbation problem need to be a convergent plate element and to be convergent, uniformly with respect to the parameter e

    數值結果表明此元有較好的收斂性。求解四階橢圓奇異攝動問題的有限元應是收斂的板元，並且要關于（
  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. We show that the hybrid method is globally and superlinearly convergent for nonzero residual problems and globally and quadratically for zero resi dual problems

    因此，該雜交方法對于零殘量問題是二階收斂的，而對于非零殘量問題是超線性收斂的。
  14. 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 ） 。
  15. In chapter 2, we investigate the problem on the orders of growth and the convergences of the zero - sequence of the solutions of second linear differential equations with entire coefficients to the functions with smaller order of growth

    其中第二章研究了二階整函數系數線性微分方程的解取慢增長函數時的增長級與零點收斂的問題；第三章研究了一類高階亞純系數線性微分方程解的超級。
  16. Abstract : in this paper, we give the definitions of second order moment fuzzy stochastic process and its mean square convergence, and prove the cauchy criterion of mean square convergence of second order moment fuzzy stochastic process, and discuss the properties of mean square convergence of second order momnet fuzzy stochastic process

    文摘:給出二階矩模糊隨機過程及其均方收斂的定義，證明二階矩模糊隨機過程均方收斂的柯西準則，討論二階矩模糊隨機過程均方收斂的性質。
  17. But, pso convergence ' s speed become slow in latter iterative phase, and pso is easy to fall into local optimization. at present, some scholars improve base pso mostly using 3 methods : disperse algorithm, increase convergence speed, enhance particle ' kinds. in the paper, i put forward 2 methods aiming at local best resutl but not whole best result. i modify base pso using the last method. some scholars put forward times initializations, so i select best result after circulating some times to be a parameter of formula. first, put particle into some small region, and ensure every region having one paticle at least. second, every region ' s particle has probability transfer other regions. although increase running time, enhance particle ' kinds, decrese the probability of convergence far from whole best result. nerms ( network educational resource management system ) is one of the research projects in the science and technology development planning of jilin province. the aim of nerms is to organize and manage various twelve kinds of network educational resources effectively so that people can share and gain them easily and efficiently, so as to quicken the development of network education

    但粒子群演算法仍存在如下不足:首先在多峰的情況下，粒子群有可能錯過全局最優解，遠離最優解的空間，最終得到局部最優解;其次在演算法收斂的情況下，由於所有的粒子都向最優解的方向群游，所有的粒子趨向同一，失去了粒子間解的多樣性，使得後期的收斂速度明顯變慢，同時演算法收斂到一定精度時，演算法無法繼續優化，本文對原始粒子群演算法提出了二點改進方案: 1 .演算法迭代到一定代數后，把此時找到的全局最優解當作速度更新公式的另一參數（本文稱之為階段最優解）再進行迭代; 2 .每次迭代過程中除最優解以外的每個粒子都有一定概率「變異」到一個步長以外的區域，其中「變異」的粒子在每一維上都隨機生成一個步長。
  18. Under a prior graded meshes, the quasi - optimal order error estimates in the - weighted h ^ 1 - norm uniformly are proved

    在先驗分層網格剖分基礎上，在-加權h ^ 1 -模意義下得到了擬最優階一致收斂的誤差估計。
  19. Using the regularized greens functions and a duality argument, it is proved that the mixed finite element method proposed in this paper possesses the superconvergence by almost one order maximum norm estimates for the l2 projection of the function and quasi - optimal maximum norm estimates for the associated vector function for a strongly nonlinear second order elliptic problem

    本文利用正規格林函數及對偶論證技術證明了一類強非線性二階橢圓問題混合元方法對函數的l2投影具有幾乎超收斂一階的最大模誤差估計，對伴隨向量函數具有擬最優最大模誤差估計
  20. Various iterative methods have been produced since the seventeenth century. among them, the most classical ones are newton ' s method of two order convergence, chebyshev ' s method of convergence order of three, halley ' s method of convergence order of three, newton ' s convex acceleration ( or super - halley ) iteration method ; and pratical king - werner iteration and so on

    幾百年來，各種各樣的迭代法被人們提了出來其中，最為經典的有二階收斂的newton迭代，三階收斂的chebyshev迭代、 halley迭代及newton凸加速（又稱為超halley ）迭代；還有實用的收斂階為1 + 2 ~ （ 2 / 1 ）的king - werner迭代等等。
分享友人
分享到 Line

分享到臉書