收斂理論 的英文怎麼說

中文拼音 [shōuliǎnlǐlún]
收斂理論 英文
convergence theory
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 理 : Ⅰ名詞1 （物質組織的條紋） texture; grain （in wood skin etc ） 2 （道理;事理） reason; logic; tru...
  • 論 : 論名詞（記錄孔子及其門徒的言行的「論語」） the analects of confucius
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  • 理論 : theory
  1. 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

    數值實驗與理論分析均表明該演算法適用於求解大規模問題，且具有良好的收斂性；其次，研究了電路二等分問題。
  2. 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迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  3. 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陣的條件數，它同樣依賴于罰參數。
  4. In the design process of the project, firstly the principle scheme is figured out with the theory of " black box ". constringency is done after the sub - functional solutions are acquired

    在本機原理方案的設計過程中，首先採用「黑箱」理論對原理方案進行發散求解，在得出分功能解后再進行「收斂」 。
  5. 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

    對各種類型的大地電磁測深理論曲線進行計算，結果表明：採用實數編碼混合遺傳演算法進行反演具有收斂速度快、解的精度高和避免出現早熟等優點，可用於大地電磁資料解釋。
  6. As far as the discussion about the structures is concerned, to some extent, it may be said to be an application to the backlund transformation : fix a solution qn to the system ( l. 3 ), construct a group of solutions qn different from qn through the backlund transformation, and then prove that qn is convergent to qn. in the section 4, it is vital for us to find out the fixed solution n to the equation ( 3. 1 ) in the theorem3. 2, which is completed in the lemma4. 2 and theorem4. 3

    第四節對方程（ 1 . 3 ）的解的性態的討論，在一定程度上也可說是對定理3 . 2的一個應用：給定方程的一個解q _ n ，然後通過貝克朗變換構造了一系列不同於q _ n的解q _ n ，之後證明了q _ n收斂于q _ n 。
  7. Under some suitable conditions, theoretical analysis shows that the sequences generated by the method converge globally to the kkt point of the point

    理論分析表明在一些假設條件下，這一方法產生的序列全局收斂于問題的kkt點。
  8. Disigning coolant channel on the firebox of liquid rocket engine to loxodrome ( equal - angle helix ) groove can improve firebox coolant capability greatly. because the width dimension of loxodrome groove is narrow and the depth is deep, some machining methods are incapable, such as end - milling or electrochemistry. according to the peculiarities, a cnc disk - cutter - milling method which is composed of five motion axes with four simultaneously interpolated ones is researched. because most firebox generatrix is composed of complex curves, it is very difficult to get cnc cutting program with manual means. in order to deal with the problem, the loxodrome mathematics model is studied, and an auto - programming software system is developed. the software system can generate cnc cutting program of loxodrome on many kinds of turned surface. the constriction - distension segment of firebox is the most representative workpiece. the sharp changing of its generatrix slope makes loxodrome milling difficult. with the theory analyzing and practice cutting experiment, some applied techniques, which include milling mode and direction, choosing cutter diameter and cutting start point setting, are developed. adopting the technology above, tens regular workpiece have been manufacturing. the two - year manufacture practice has confirmed the validity and feasibility of developed loxodrome coolant channel milling method. the developed technology is also worth to be referenced to other similar workpiece

    將液體火箭發動機燃燒室的冷卻通道設計為斜航線（等傾角螺旋線）槽形，可以大幅度改善燃燒室的冷卻性能.斜航線冷卻槽的槽寬尺寸較小而槽深尺寸較大，所以無法使用棒銑刀銑削、電化學等加工方式.針對這些特點，提出了五軸控制、四軸聯動的數控片銑刀銑削加工方法.由於燃燒室外表面的母線輪廓復雜，手工編制數控加工程序難度大.為了解決數控加工程序的編制問題，研究了斜航線的數學模型，開發了自動編程軟體系統.使用該系統，可以生成多種母線輪廓回轉體外表面上的斜航線數控加工程序.燃燒室收斂-擴張段的母線斜率變化大，加工難度大，是斜航線冷卻通道加工的最典型工件.經過理論分析和實際切削實驗，研究了針對該類型工件的片銑刀直徑選擇、銑削方式和方向、刀具調整和起刀點的設置等多項實際的加工方案.採用上述的一系列技術，已經成功地加工了數十個合格工件.經過兩年多的實際生產過程應用，驗證了所開發的斜航線冷卻通道加工方法的正確性和可行性.這些加工技術的研製成功，對其他相似類型零件的加工亦具有參考意義
  9. Convergence theorems for fuzzy martingales

    關于模糊鞅的收斂理論
  10. This article puts forward a solution named divide - assemble by deducing the size of bp neural network to overcome entering the local best point, the dividing process is that a big bp neural network is divided into several small bp neural networks, every small bp neural network can study alone, after all small bp neural networks finish their study, we can assemble all these small bp neural networks into the quondam big bp neural networks ; on the basis of divide - assemble solution, this article discusses the preprocessing of input species and how to deduce the size of bp neural network further to make it easy to overcome entering the local best point ; for the study of every small bp neural network, this article adopts a solution named gdr - ga algorithm, which includes two algorithms. gdr ? a algorithm makes the merits of the two algorithms makeup each other to increase searching speed. finally, this article discusses the processing of atm band - width distribution dynamically

    本文從bp網的結構出發，以減小bp神經網路的規模為手段來克服陷入局部極小點，提出了bp神經網路的拆分組裝方法，即將一個大的bp網有機地拆分為幾個小的子bp網，每個子網的權值單獨訓練，訓練好以後，再將每個子網的單元和權值有機地組裝成原先的bp網，從理論和實驗上證明了該方法在解決局部極小值這一問題時是有效的；在拆分組裝方法基礎上，本文詳細闡述了輸入樣本的預處理過程，更進一步地減小了bp網路的規模，使子網的學習更加容易了；對于子網的學習，本文採用了最速梯度? ?遺傳混合演算法（即gdr ? ? ga演算法） ，使gdr演算法和ga演算法的優點互為補充，提高了收斂速度；最後本文闡述了用以上方法進行atm帶寬動態分配的過程。
  11. Secondly, after analyzing the strategic relations between the manufacturer and the supplier, the dissertation brings forward that the manufacturer must category the materials and select different supplier to built relations, explains the features and the advantages and disadvantages of strategic partnerships, and bring forward that the manufacturer must give some special request for the supplier strategic partner. thirdly, the dissertation analyses and summarize the existing methods of supplier selection, and point out their disadvantages. then, the dissertation apply the extenics to the dynamic selection model of the strategic supplier, building the evaluation indexes with implication systems, selecting strategic supplier with rhombus thinking method, looking for the suppliers with the extension of the matter - element, selecting the right supplier with the extension evaluating methods, replacing the dissatisfying features with the transformation matter - element method and making it more better

    本文首先對供應鏈管理和戰略合作夥伴關系的國內外研究現狀和發展趨勢進行了研究；其次，對製造商和供應商的戰略合作夥伴關系進行分析，指出了製造商需要對采購物料分類，針對戰略型物料選擇戰略合作夥伴建立戰略合作夥伴關系，闡明了建立戰略合作夥伴關系的特徵及優缺點，並提出了製造商對供應商戰略合作夥伴的具體要求；再次，對目前存在的供應商選擇方法進行了深入的分析和總結，指出了不足之處，並提出了應用可拓理論進行供應商戰略合作夥伴選擇的思路；然後，應用可拓理論建立供應商戰略合作夥伴選擇動態模型，其中，用蘊含系方法建立評價指標體系，用菱形思維建立選擇模型，利用物元的可擴性來尋找待評供應商，用可拓評價進行收斂，並用物元變換對已經選中供應商的不滿意特徵進行變換，使其完善；最後對r企業的供應商戰略合作夥伴選擇進行了本文模型的實證部分，使模型不僅具有理論意義，更具有實踐意義。
  12. Lin qun, finite element method : accuracy and extrapolation ( to appear )

    朱起定，林群，有限元超收斂理論，湖南科技出版社，長沙， 1989
  13. One is, based on answering the above open problem on a finite dimensional euclidean space by means of partially ordered theory, to research the existence of solutions, global error bounds of proximal solutions and sensitivity of parametric unique solutions and present a class of variable - parameter three - step iterative algorithms for generalized set - valued variational inclusion problems by using - resolvent operator of set - valued mapping. two is to consider the convexity, closedness and boundedness of the solution set of general set - valued variational inclusion problems and the sensitivity of the parametric solution set by means of graphical convergence theory. three is to discuss directly the existence of solutions by using analytical methods for set - valued mixed quasi - variational - like inequalities and suggest a class of direct variable - parameter three - step iterative algorithms for solving generalized set - valued variational inclusions

    研究分有三個方面：一是藉助于偏序理論在有限維歐氏空間中解決了上述公開問題，在此基礎上利用集值映射的-預解運算元，研究了廣義集值變分包含問題解的存在性、逼近解的全局誤差界、參數唯一解的靈敏性，並提出了一類變參數三步迭代演算法；二是藉助于圖收斂理論研究了一般集值變分包含問題解集的凸性、閉性和有界性以及參數解集的靈敏性；三是用分析的方法直接討論了集值混合擬類變分不等式問題解的存在性並提出了一類求解廣義集值變分包含問題的直接變參數三步迭代演算法。
  14. It follows from the general convergence theory that the em algorithm generally converge to a local maximum solution of the likelihood function and cannot be guaranteed to converge to a correct solution, i. e., a consistent solution of the samples

    Em演算法的一般收斂理論認為，演算法只能收斂到似然函數的一個局部極大解，無法保證能夠收斂到與樣本的真實參數相一致的解上。
  15. Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems. a dual algorithm for solving unconstrained minimax problems, based on the penalty function of bertsekas ( 1982 ), is presented. we prove that there exits a threshold of the penalty parameter satisfying that the sequences generated by the dual algorithm converge locally to the kuhn - tuker point of the unconstrained minimax problems when the penalty parameter is less than the threshold

    第3章給出無約束極大極小問題的一個對偶演算法的收斂理論，給出一個基於bertsekas （ 1982 ）罰函數的求解無約束極大極小問題的對偶演算法，證明罰參數存在一個閥值，當罰參數小於這一閥值時，該對偶演算法產生的序列局部收斂到問題的kuhn - tuker點，並建立了參數解的誤差估計式，同樣估計了罰函數的hesse陣的條件數，它也依賴于罰參數。
  16. In this chapter, we establish convergence theorem by using the recurrence relations

    在這一章中，我們是用遞歸法給出了迭代法的收斂理論。
  17. In this chapter, we establish convergence theorem by using the majorizing method

    我們用優序列的技巧給出了這族迭代法收斂理論。
  18. Meanwhile, extend discussions are carried out on the general convergence of iga in the pure mathematical sense, iga is proved to be weakly convergent in the sence of probability, weakly convergent a. e.,

    同時在純數學意義上拓展討論，就iga的一般收斂理論進行分析，證明了概率弱收斂、幾乎處處弱收斂、漸進收斂等性質。
  19. The general nonlinear programming problem and the basic assumptions under which our convergence results hold are introduced in chapter 2. in chapter 3, we give the definition of the mpf which our method is based on, the mpf method and the trust region algorithm. the convergence results for the mpf method, some aspects concerning the practical implementation and some concluded remarks of the method are discussed in chapter 4

    第一章為緒論部分，第二章介紹本文收斂性理論所需要的一般非線性規劃問題的最優性條件和基本的假設條件，第三章給出修改的罰函數的定義，修改的罰函數法，以及第步迭代所用的信賴域演算法，第四章討論修改的罰函數法的收斂理論，數值實驗和由修改的罰函數法得出的一些結論。
  20. Therefore, the research for them has important learning value and certain degree of difficulty. just as weakening convexity of objective functions being a central issue in optimization problems, weakening monotonicity of set - valued mappings is an important research direction in set - valued variational inclusion problems

    對這一問題的研究涉及到凸分析、線性與非線性分析、非光滑分析、集值分析、偏序理論、圖收斂理論等數學分支，有重要的學術價值和相當的難度。
分享友人
分享到 Line

分享到臉書