收斂法 的英文怎麼說

中文拼音 [shōuliǎn]
收斂法 英文
convergence method
  • : Ⅰ動詞1 (把攤開的或分散的事物聚集、合攏) put away; take in 2 (收取) collect 3 (收割) harvest...
  • : Ⅰ動詞1 (收起; 收住) hold back; keep back 2 (約束) restrain 3 (收集; 徵收) gather; collect; ...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 收斂 : 1 (減弱或消失) weaken or disappear 2 (約束言行) restrain oneself 3 [數學] convergence; constr...
  1. Extrapolation method, composed of aitken extrapolation and eigenvalues - based algorithm mainly, can notably reduce iterations commonly. aitken extrapolation algorithm use aitken transform to reduce iterations

    Aitkenextrapolation演算使用aitken變換以減少迭代次數,但aitken變換在多數情況下無確保演算
  2. Genetic annealing algorithm and its convergence analysis

    遺傳退火演算性分析
  3. The two - dimensional henon chaotic nonlinear map is effectively controlled by the proposed approach. secondly, because of the distinguished advantages, such as rapid convergency and strong approachability, the rbf networks is trained as chaotic controller by ogy scheme, then successful of controlling the henon chaotic map

    其次,利用一種學習過程速度快、擬合能力強的rbf神經網路,以ogy為依據,訓練網路成為混沌控制器,仍以henon映射作為混沌控制對象,對其混沌行為實施了成功控制。
  4. He emphasizes, on the basis of healthy qi, the combination of disease and syndrome differentiation, treatment and prevention ; spleen - nourishing medicines are orally and rectally administered : purging and astringing methods are given

    在扶助正氣的基礎上,強調辨病與辨證相結合,防治並舉;用藥首重益氣健脾,採用中藥內服加保留灌腸的方;結合腑病特性,合理應用「攻下」與「
  5. 3. developed simply and practical fluid network algorithm for large - scale of pipe networks, such as air - gas system and powder manufacture system. iterative computation used in this algorithm is not only astringing quickly and numerical calculating steadily but also cater the required ratio of precision and guarantee the real - time and any performance simulation of fluid network

    3 、本文對風煙系統和制粉系統等大型管網,建立了簡單實用的流體網路模型演算,此在迭代計算中,不僅可以快速和數值計算穩定,而且滿足一定的模擬精度,較好的保證了流體網路的全工況實時模擬。
  6. This paper is made up of three chapter, which discuss mainly about the astringency of the iterative methods and the application in fact

    本文共分三章,主要討論的是迭代性及其在實際中的應用問題。
  7. It is superior to traditional multiple regression ' s calculating model and gp in model ' s astringency and predict accuracy

    該模型在性能及預測準確率等方面優于基於傳統的多元回歸方及gp方的信用風險評估模型。
  8. A globally convergent algorithm for solving bilevel linear programming

    二層線性規劃問題的全局演算
  9. Both theoretical proof and numerical experiments indicate that this algorithm is convergent and effective for solving large - scale semidefinite programming. in the following section, we work over the bisection problems

    數值實驗與理論分析均表明該演算適用於求解大規模問題,且具有良好的性;其次,研究了電路二等分問題。
  10. 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迭代,理論和數值實驗表明改進的演算性比經典演算
  11. By the polygonal approximation method, a global approximation solution is constructed for the initial - boundary value problem of nonconvex scalar conservation laws with two - side boundary effect, and its convergence to the global weak entropy solution of the corresponding problem is proved

    摘要使用折線逼近,對具有兩條邊界影響的非凸單個守恆律初邊值問題構造了整體近似解,並證明其到初邊值問題的整體弱熵解。
  12. It is proven that these modified dual algorithms still have the same convergence results as those of the conceptional dual algorithms in chapter 2 and chapter 3. secondly, a dual algorithm is constructed for general constrained nonlinear programming problems and the local convergence theorem is established accordingly. the condition number of modified lagrange function ' s hessian is estimated, which also depends on the penalty parameter

    證明這些修正的對偶演算仍具有同前兩章的概念性對偶演算相同的性結果,我們還進一步構造了一般約束非線性規劃問題的對偶演算,建立了相應的局部理論,最後估計了修正lagrange函數的hesse陣的條件數,它同樣依賴于罰參數。
  13. 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

    導出了曲率半徑與逼近誤差之間的關系和等誤差條件下的參數遞推公式,建立了通過逼近圓弧圓心的直線方程和圓心坐標計算公式.按這種方用圓弧逼近平面參數曲線,不需要求解非線性方程組,避免了計算可能不的麻煩,簡化了非圓曲線的節點計算過程
  14. The cause is that depending strength of government only to hit lawless proprietor and safeguard consumer ' s leigitimate rights and interests is limited, because the proprietor can constringe the action of self due to the government strike it strongly in the short - term, but government can not be persisted over a long period of time because of the restriction of resources such as funds etc. in another aspect, if encouraging consumer to safeguard the leigitimate rights and interests of self, the probability that proprietor ' s tort occurs could reduce generally, moreover it is lasting

    本文首先從靜態的角度來分析消費者權益受到損害的原因。通過分析發現,單純地依靠政府的力量來打擊不經營者、維護消費者合權益的作用是有限的,短期中經營者會因為政府加大打擊力度而自己的行為,但政府由於受經費等資源的限制,不可能長期堅持下去。從另一個角度,如果鼓勵消費者維護自身的合權益,則經營者侵權行為發生的概率會降低,而且具有持久性。
  15. Levenberg - marquart optimized algorithm was used to learn the network, and its constringency is rapid

    網路的學習演算採用levenberg - marquart優化演算(簡稱l - m演算) ,速度快,能滿足實時性要求。
  16. The experimental results indicate that it is easy to be realized, can save the calculating cost and improve the constringency speed

    試驗結果表明,用粒子群演算來訓練樣本集具有容易實現、節省計算成本和提高速度等優點。
  17. According to the low speed of constringency and high complexity of training methods in large scale training, particle swarm algorithm is brought forward to solve the problem

    針對在大規模訓練中演算速度慢、復雜程度高等問題,提出用粒子群演算求解其中的二次規劃問題的思想。
  18. A constringent analysis of iterative chart radius of the first type iterative method

    一類迭代的迭代陣譜半徑的性分析
  19. Many more criteria for the convergence of infinite series were developed by leading mathematicians.

    許多第一流的數學家推導了無窮極數的很多判別則。
  20. This paper has proposed a method controlling iteration number and stability of solution according to thought of integral convergence algorithm minimizing nonlinear equations

    本文利用求非線性方程組極小化全局收斂法的思路,提出了控制迭代次數、控制反演解穩定的方
分享友人