超線性收斂性 的英文怎麼說

中文拼音 [chāoxiànxìngshōuliǎnxìng]
超線性收斂性 英文
superlinear convergence
  • : Ⅰ動詞1 (越過; 高出) exceed; surpass; overtake 2 (在某個范圍以外; 不受限制) transcend; go beyo...
  • : 名詞1 (用絲、棉、金屬等製成的細長的東西) thread; string; wire 2 [數學] (一個點任意移動所構成的...
  • : Ⅰ名詞1 (性格) nature; character; disposition 2 (性能; 性質) property; quality 3 (性別) sex ...
  • : Ⅰ動詞1 (把攤開的或分散的事物聚集、合攏) put away; take in 2 (收取) collect 3 (收割) harvest...
  • : Ⅰ動詞1 (收起; 收住) hold back; keep back 2 (約束) restrain 3 (收集; 徵收) gather; collect; ...
  • 線性 : [數學] [物理學] linear; linearity線性代數 linear algebra; 線性方程 linear equation; 線性規劃 line...
  • 收斂 : 1 (減弱或消失) weaken or disappear 2 (約束言行) restrain oneself 3 [數學] convergence; constr...
  1. It exploits the structured of the hessian matrix of the objective function sufficiently. an attractive property of the structured bfgs method is its local superlinear / quadratic convergence property for the nonzero / zero residual problems. the local convergence of the structured bfgs method has been well established

    它們充分利用了目標函數的hesse矩陣的結構以提高演算法的效率,該演算法的顯著優點是對于零殘量問題具有二階而對于非零殘量問題具有超線性收斂性
  2. Considering the one - sidedness and inaccuracy of knowledge discovery only from single - color database, an approach is proposed to discover knowledge from 1331 groups of mix - color database with partial least - square regression, based on measuring and learning 400 groups of single - color database. by this method, the mean error decreases when converting from rgb to cmyk, the precision of color matching is improved, and the automatic and general problem in color matching is further solved

    本文基於統計學習理論構造了一種快速自適應隨機搜索演算法,證明了演算法的.給出了一種簡易實用的寬帶天匹配設計新方法.應用該自適應演算法進行天匹配設計,不僅演算法簡單,易於編程實現;而且能夠快速設計出具有較好能的匹配網路,非常適用於各種短波、短波天的匹配設計問題
  3. Superconvergence analysis of linear element in 3 - d on anisotropic meshes

    各向異網格下三維元的分析
  4. Ultraconvergence of finite element method for semilinear two - point boundary problem

    兩點邊值問題有限元強
  5. Third, by means of smale, s point estimates theorem, the existence and the convergence theorem of broyden, s iteration is given, the method has less calculation and the speed of super linear convergence for solving the nonlinear equations with nondifferential terms under the point estimates or weak condition

    第三,本文利用smale提出的點估計理論,給出了在點估計和弱條件下,用計算量小、具有速度的broyden方法來求解帶不可微項的非方程,給出了存在定理及相應的證明。
  6. Aim at the dtc ' s blemish mentioned above and the direction of dtc technique development, the dissertation put great emphasis on the work as follows, with an eye to exalt dtc system function : ( 1 ) a new speed - flux observer of an induction motor is proposed to enhance the accuracy of flux observing, which is an adaptive closed - loop flux observer and different from the traditions. a new adaptive speed - observation - way is deduced out according to the popov ' s stability theories ; ( 2 ) to improve the performance of dtc at low speed operation, we have to exalt the accuracy of the stator flux estimation and a new way of bp neural network based on extended pidbp algorithm is given to estimate and tune the stator resistance of an induction motor to increase the accuracy of the stator flux estimation ; ( 3 ) digital signal processor is adopted to realize digital control. an device of direct torque control system is designed for experiment using tms320lf2407 chip produced by ti company ; ( 4 ) bring up a distributed direct torque control system based on sercos bus, sercos stand for serial real time communication system agreement which is most in keeping with synchronous with moderate motor control ; ( 5 ) the basic design frame of the hardware and software of the whole control system is given here and some concrete problem in the experiments is described here in detail

    針對上面提到的直接轉矩控制的缺陷和未來直接轉矩控制技術發展方向,本論文重點做了以下幾個方面的工作,目的在於提高dtc系統的綜合能: ( 1 )提出一種新型的速度磁鏈觀測器,新型的速度磁鏈觀測器採用自適應閉環磁鏈觀測器代替傳統的積分器從而提高磁鏈觀測的精度,並且根據popov穩定理論推導出轉速的新型自適應律; ( 2 )改善系統的低速運行能,主要從提高低速時對定子磁鏈的估計精度入手,提出了一種提高定子磁鏈觀測精度的新思路? ?利用基於bp網路增廣pidbp學習演算法來實時在地修正定子電阻參數; ( 3 )採用數字信號處理器dsp實現系統全數字化硬體控制,結合ti公司生產的tms320lf2407晶元,設計了直接轉矩控制系統的實驗裝置; ( 4 )提出了基於sercos總網路化分散式的直接轉矩控制系統, sercos ( serialrealtimecommunicationsystem )是目前最適合同步和協調控制的串列實時通信協議; ( 5 )基本勾勒出整個控制系統的硬體和軟體設計基本框架,詳細描述一些實驗中的具體的細節問題。
  7. Actually, this is to resolve an over - determined nonlinear system including six output values and eight input values. so newton - gauss iterative algorithms is used, set up the target function in the sense of the least squares. it is discussed whether the minimal solution to the function exist and is single one while the astringency of newton - gauss method is analyzed

    對于冗餘驅動振動臺,其位姿正解是求解具有八個輸入、六個輸出的定非方程組,因此本文採用了最小二乘法中的牛頓?高斯迭代法,建立最小二乘目標函數,對目標函數極小解的存在、唯一以及牛頓?高斯迭代法的進行了理論證明和分析,將求出的最小值作為位姿正解的最優解。
  8. In this thesis, we study the exponents of convergence of the zero - sequence and the hyper - order of solutions of linear differential equations

    本文研究了微分方程解的零點指數和級。
  9. Using the conic function model local approximation, w. cdavidon ( 1980 ) proposed a class of iterative algorithms with modified matrix combining function value, furthermore under the theory d. c. sorensen has used local quadratic approximation method, then applying collinear scaling idea improving on the above algorithm and generalizing it, getting a class of collinear scaling algorithm, unifying former quasi - newton. in the paper, using local quadratic approximation method, the first, constructing the new collinear scaling gene, getting a class of the new collinear scaling algorithm with briefness and numerical stability, ., we discusses some properties of the algorithm and its local linear convergence, q - superlinear convergence and the whole convergence ; secondly we have made numerical experimentation and numerical analysis ; the last, we have done much discussion for collinear scaling idea and given the several new collinear scaling algorithm

    本文的工作就是基於局部二次逼近原理,首先通過構造新的共調比因子,得到了一類新的更簡潔,數值穩定更好的共調比演算法,進而我們給出了本共調比演算法的局部,全局以及演算法q -速度的理論證明;其次,用經典的無約束優化五大考核函數就本共調比演算法進行了數值試驗和數值分析;最後,就局部二次逼近思想,進行共調比演算法思想進行更廣泛的討論,給出了幾個新共調比演算法。
  10. Using the comparison principle, it is proved that the proposed method is of superlinear convergence

    利用比較原理,間接證明該演算法是一種具有超線性收斂性的近似牛頓法。
  11. Under mild conditions, we prove the global and superlinear convergence of the method

    在較弱的條件下,得到了演算法的全局及其超線性收斂性
  12. A feasible sqp algorithm with superlinear convergence for inequality constrained optimization

    不等式約束優化一個具有的可行序列二次規劃演算法
  13. Lc1 unconstrained optimization problem was discussed in the second chapter, giving a new trust region method and proving its global convergence and superlinear convergence under some mild conditions

    給出了一個新的信賴域演算法,並在一定的條件下證明了演算法的全局和局部超線性收斂性
  14. The general shamanskii modification of the newton method is defined by the iteration and the global and superlinear convergence of the general shamanskii modification of the newton method are proved in this dissertation

    我們不僅證明了改進的sha一mansk燈修正牛頓法的全局,而且也證明該方法具有速度
  15. In the third chapter we discuss lc1 constrained optimization problem. to solve it, we turn it into nonsmooth equations, utilizing inexact theory we give an inexact generalized newton ' s method and under some mild conditions we prove that it is global convergence and superlinear convergence

    首先將其約束問題的求解轉化為非光滑方程組的求解,然後利用不完全求解理論給出了一個非精確的廣義牛頓演算法,在一定的條件下證明了演算法的全局和局部超線性收斂性並給出了lc ~ 1非約束問題的條件。
  16. The convergence of the refined non - interior continuation method for ncps is analyzed, the same global linear convergence as chen - xiu ' s is obtained

    得到了與chen - xiu同樣的全局,推廣了chen - xiu的局部到局部二次
  17. Under mild conditions, we prove that the proposed method is globally convergent. moreover, we show that after finite iterations, the unit step is always accepted, and the method locally reduces to the modified bfgs method

    在較弱的條件下,我們證明所提出的方法具有全局,此外,本文證明在有限次迭代后,單位步長總是可接受的,因此,演算法還原為mbfgs法,從而這種方法具有局部超線性收斂性
  18. We also show that the unit steplength is essentially accepted

    並證明演算法的全局超線性收斂性
  19. We show the proposed algorithm is globally convergen t and locally fast convergent rate even if conditions are reasonalbe

    在合理的假設條件下,我們證明了這一演算法不僅具備整體,而且具有速率。
  20. Moreover, we show that if the second order sufficient conditions holds at a solution of the problem, then the method is 2 - step superlinearly convergent

    而且,我們證明:若在問題的解處二階充分條件成立,則相應的sqp演算法具有2步超線性收斂性
分享友人