演算收斂 的英文怎麼說

中文拼音 [yǎnsuànshōuliǎn]
演算收斂 英文
convergence, algorithm
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 演算 : perform mathematical calculations; calculation; calculus演算器 exerciser
  • 收斂 : 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. 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 、本文對風煙系統和制粉系統等大型管網，建立了簡單實用的流體網路模型演算法，此法在迭代計算中，不僅可以快速收斂和數值計算穩定，而且滿足一定的模擬精度，較好的保證了流體網路的全工況實時模擬。
  4. A globally convergent algorithm for solving bilevel linear programming

    二層線性規劃問題的全局收斂演算法
  5. 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

    數值實驗與理論分析均表明該演算法適用於求解大規模問題，且具有良好的收斂性；其次，研究了電路二等分問題。
  6. 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迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  7. 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陣的條件數，它同樣依賴于罰參數。
  8. Levenberg - marquart optimized algorithm was used to learn the network, and its constringency is rapid

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

    試驗結果表明，用粒子群演算法來訓練樣本集具有容易實現、節省計算成本和提高收斂速度等優點。
  10. 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

    針對在大規模訓練中演算法收斂速度慢、復雜程度高等問題，提出用粒子群演算法求解其中的二次規劃問題的思想。
  11. A lot of simulation results show that the sofia has the high convergency rate, accuracy and good stability. it can be conveniently applied to engineering practice

    大量的模擬結果表明該演算法具有收斂速度快、辨識精度高、穩定性好，便於工程應用。
  12. According to the lms criterion, steps for calculation implement is proposed., and simulations on convergency and ber properties blind algorithm has been done. in addition, as a introduction of blind algorithm, subspace decomposition, minimum output energy ( moe )

    針對該檢測器，將最小均方演算法（ lms ）應用於該檢測器，給出了演算法實現的計算步驟，模擬了演算法收斂特性及課碼性能，分析了自適應能力。
  13. On one hand, numerical derivatives provide proper search directions in optimization, therefore their accuracy is of great importance for fast convergency. on the other hand, derivative evaluation is one of the most time - consuming steps in optimization

    當前的高性能數學規劃演算法大都依賴于導數計算以快速收斂到最優點，所以對求導精度的要求比較高；而導數計算所消耗的時間占優化時間的比例又非常的大。
  14. Linear convergent rate of algorithm tr

    一種非光滑優化演算法收斂速度的估計
  15. The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed

    較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。
  16. People put forward radial basis function networks considering the conventional bp algorithm problems of slow convergence speed and easily getting into local dinky value

    對于傳統bp演算法存在的收斂速度慢和易陷入局部極小值問題，人們提出了徑向基函數網路。
  17. The inversion results of synthetic magnetotelluric sounding data are ideal, which indicates that the algorithm possesses advantages of expediting convergence, avoiding earliness and improving precision, and can be used in mt data analysis

    對各種類型的大地電磁測深理論曲線進行計算，結果表明：採用實數編碼混合遺傳演算法進行反演具有收斂速度快、解的精度高和避免出現早熟等優點，可用於大地電磁資料解釋。
  18. In this paper we improved the traditional sa algorithm, and the heuristic algorithm is applied to the search and move schedule. the neighborhood is changed from the fixable to the alterable, the operation of moving and rotating is alternate, and the precision of the solution is then guaranteed as well as its convergence speed

    本文對傳統的sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，由定鄰域搜索變為變鄰域搜索，平移和旋轉變動交替進行，既保證了解的精度又提高了其收斂速度，取得了良好的布局效果。
  19. Studies on correct convergence of the em algorithm for gaussian mixtures

    演算法正確收斂性的探討
  20. The dynamic glycolysis chaotic oscillation process is identified using vbl network, which shows that this algorithm has better convergence property than other algorithms

    對糖酵解混沌振蕩過程進行動態辨識建模，結果表明本演算法具有較好的辨識效果和收斂性。
分享友人
分享到 Line

分享到臉書