收斂的 的英文怎麼說

中文拼音 [shōuliǎnde]
收斂的 英文
apocrustic
  • : Ⅰ動詞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 (減弱或消失) weaken or disappear 2 (約束言行) restrain oneself 3 [數學] convergence; constr...
  1. Abscissa of absolute convergence

    絕對收斂的橫坐標
  2. There would almost be time to haul out.

    照理是該有所收斂的時候了。
  3. 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 -模意義下得到了至多相差一個關于攝動參數對數因子擬最優階收斂的誤差估計。
  4. The relation of radius of curvature and error as well as formulas of increasing parameters on condition of constant error are diverted. the equation of the line on the center of approximate circular arc is obtained , and it can avoids the trouble that numerical solution owns possibility of no convergence and simplifies node calculation of non - circular curve

    導出了曲率半徑與逼近誤差之間關系和等誤差條件下參數遞推公式,建立了通過逼近圓弧圓心直線方程和圓心坐標計算公式.按這種方法用圓弧逼近平面參數曲線,不需要求解非線性方程組,避免了計算可能不收斂的麻煩,簡化了非圓曲線節點計算過程
  5. The resulting sequence will usually converge.

    解序列一般說是收斂的
  6. The number of terms actually used depends upon the rapidity of the convergence.

    實際要用項數多少取決于收斂的快慢程度。
  7. Many more criteria for the convergence of infinite series were developed by leading mathematicians.

    許多第一流數學家推導了無窮極數收斂的很多判別法則。
  8. We will say that a finite-difference method is convergent if this condition is satisfied.

    若滿足了這個條件,我們就說有限差分法是收斂的
  9. A note on moment convergences for b - valued martingale random variables

    值同分佈鞅隨機變元序列矩收斂的注記
  10. This paper proposed a new genetic algorithm called quasi - genetic algorithm ( qga ) to improve the efficiency of search and avoid precocity

    本文從提高演算法搜索效率和避免過早收斂的角度,提出了一種新型遺傳演算法? ?類遺傳演算法( qga , quasigeneticalgorithm ) 。
  11. In order to quicken styptic v elocity, under - relaxation a nd source term linearization is appilied

    為了加快收斂的速度,採用了欠鬆弛技術和源項線性化。
  12. The present paper firstly represents the model about random walks in time - random environments on the right line, then the studies about recurrence - transience criteria and limit theorem by using some relative theories of markov chains, and finally a center limit theorem of this random walks in the non - recurrence case

    摘要給出了半直線上時間隨機環境下隨機游動模型,並利用馬氏鏈理論研究了該隨機游動常返暫留準則和依概率收斂的大數定律,得到在非常返情形下中心極限定理。
  13. Aiming at the nonlinearity of state and measure equation and measurement being only angle information, which results in poor observability and classical estimate methods such as extended kalman filter not converging, the boost phase states and covariance are estimated using unscented kalman filter ( ukf )

    針對狀態方程和觀測方程都是非線性方程,觀測量只有角度信息,造成可觀測性弱、經典濾波演算法如擴展卡爾曼濾波方法不易收斂的問題,利用unscented卡爾曼濾波ukf演算法對主動段進行狀態和協方差估計。
  14. 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總傳導率之比。
  15. Theorem 1 ( bounded sum test ) a series of nonnegative terms converges if and only if it ' s partial sums are bounded above

    定理1正項級數收斂的充分必要條件是:它部分和數列有上界。
  16. In macroscopic aspect, it is taken as an example about how to model the relationship between the mix proportion of raw materials and the compressive strength of concrete using radial basis function ( rbf ) neural networks, which can achieve a global minimum

    宏觀上,以混凝土強度為例,研究如何利用神經網路建立原材料配方與混凝土強度關系模型。介紹可以全局收斂的徑向基函數( radialbasisfunction , rbf )神經網路。
  17. Further econometric analysis based on the neo - classical convergence framework on inter - provincial economic growth during the transitional period leads to the conclusion of conditional convergence

    本文以新古典模型為框架,對轉型時期各省區經濟發展進行計量分析,得出了條件收斂的結論。
  18. In this paper, we spread common abel and dirichlet test. on the point of bounded variation, we can conclude sevral results in infinite integration convegence

    摘要推廣了一般形式阿貝爾判別法和狄利克雷判別法,從有界變差角度得到了判別無窮積分收斂的幾個結果。
  19. 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

    通過採用(多重)對角加邊方法進行電力網路拓撲分割,以形成適合以上分解法求解對角加邊形式系數矩陣,并行求解后並對迭代過程進行阻尼牛頓法修正,以達到加速收斂的作用。
  20. 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種方法,一種是線性收斂的,其優點是迭代過程不需要求矩陣逆另一種是二次收斂的,數值試驗結果表明該方法在計算速度和精度方面都明顯地優于現有其他幾種迭代方法。
分享友人