逐步逼近解 的英文怎麼說

中文拼音 [zhúbùbījìnjiě]
逐步逼近解 英文
step by step solution
  • 逐 : 動詞1. （追趕） pursue; chase; run after 2. （驅逐） drive out; expel; banish 3. （挨著次序） one by one
  • 步 : Ⅰ名詞1 （步度; 腳步） pace; step 2 （階段） stage; step 3 （地步; 境地） condition; situation; st...
  • 逼 : Ⅰ動詞1 （逼迫; 給人以威脅） compel; force; drive; threaten 2 （強迫索取） extort; exert pressure ...
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 解 : 解動詞（解送） send under guard
  • 逐步 : 1 （一步一步地） step by step; progressively; gradually; proceed orderly 2 [數學] successive step...
  • 逼近 : 1 （靠近 接近） press on towards; gain on [upon]; approach; crowd on; close in on; draw near 2 [...
  1. Bell system technical, 1970, 49 : 291 - 307. 10 wu f, huberman b a. finding communities in linear time : a physics approach. eur

    本質上， dm演算法是一種啟發式的貪心優化演算法，它採用局部搜索方法能逐步逼近地為預先定義的目標函數找到一個近似最優解。
  2. Secondly, because the operator is associativity, so it is possible to avoid the boring complicated letters thirdly, because the association of resolution and paramodulation is generalized complete, we can use the infimum of the operator to gradually close the false level of cause set. so it is not necessary to choose threshold before resolution and paramodulation. the operator is got from every resolution and paramodulation

    其次，由於算于的運算適合結合律，因而可以避兔令人討厭的復雜文宇1v … kp ） … ）口第三， bofl中的歸結和調解的結合是廣義完備的，可以用每次歸結和調解出來的下確界逐步逼近子句集的恆假水平，從而不必費心在調解前選擇合適的i 』刊b 。
  3. The integral method via a scaling and squaring algorithm with the pade approximation is presented. the three - stage lobatto iii a formula is applied to structural dynamic time history analysis. and the three - stage lobatto a formula to use hermite third order interpolations to solve interpolating middle input between two boundary points is present, which provides more accurate solutions

    提出了基於自適應變尺度pad函數逼近的精細積分方法；建立基於lobatto a一階代數微分方程邊界問題數值求解技術求解結構動力學問題的時程分析方法，提出了中間插值點hermite三次插值lobatto a數值逐步積分時程分析方法。
  4. In part of theory, the paper analyses the present situation of its, presents its theoretical base, constructs a teaching mode of dual - initiative, gives its structure, discuss its writing environment, provides a reference of integrating object - oriented database and ai ; in part of design, the paper combines method of fields knowledge representation, presents teaching strategy reasoning machine based on weight - generation production rule ; according to cognitive learning theory, designs a cognitive model of student which adopts approach method and historical inheritance of study, designs a model which can navigate in learning process and in hyper - text based on student ' s model and knowledge presentation, discusses the design of explanation mechanism and man - machine interface

    在理論部分，本文分析了its的現狀，提出了its的理論基礎，建構了一個雙主的教學模式，並給出了its的結構，討論了智能教學系統的寫作環境的選擇，為本文的面向對象數據庫和人工智慧的結合提供了依據；在設計部分，本文結合領域知識表示方法，給出了一個面向對象的認知的超文本的知識表示方法，提出了基於加權產生式規則的教學策略推理機；依據認知學習理論，設計了一個採用逐步逼近法的有學習歷史繼承的認知學生模型，並根據學生模型和知識表示設計一個學習過程自動導航和超文本導航的教學模型；討論了智能系統解釋機制和人機介面的設計。
  5. Then by a decomposition method, we proved that every state in the decentralized controllable subspace could be conducted to zero state by time - varying decentralized control, which meant that the decentralized controllable subspace had similar property with centralized controllable subspace

    接著，我們用一種逐步分解逼近的方法證明了分散能控子空間中的每一個狀態都是分散能控的，這說明分散能控子空間和集中能控子空間有類似的性質。
  6. Such methods are generally decreasing method, such as, feasible direction methods, constrained variable metric methods, etc. another class is sub - problems method, which approximates the optimal solution by solving a series of simple sub - problems, such as penalty function methods, trust region methods, and successive quadratic programming sub - problems, etc. the same property of two classes of methods is that they determine whether the next iterative point is " good " or " bad " by comparing the objective function value or merit function value at the current point and next iterative point

    另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。
  7. In the second chapter some problems for degree reduction of bezier curves and surfaces are studied. in this chapter, degree reduction of bezier curves with points constraints is proposed and the new approach of constrained optimization is brought in light. the stepwise method for degree reduction of rectangular bezier surfaces is further discussed

    第二章研究b zier曲線曲面的降階逼近問題，在這一章中，提出了b zier曲線的點約束降階逼近新問題，並給出了約束優化方法；討論了張量積b zier曲面的逐步降階逼近新方法，此方法的優點是直接利用b zier曲線的降階逼近方法解決張量積b zier曲面的降階逼近問題。
分享友人
分享到 Line

分享到臉書