point iterative method 中文意思是什麼

point iterative method 解釋
點迭代過程
  • point : n 1 尖頭，尖端；尖頭器具；〈美國〉筆尖；接種針，雕刻針，編織針；小岬，小地角；【拳擊】下巴。2 【...
  • iterative : 迭代的
  • method : n 1 方法，方式；順序。2 （思想、言談上的）條理，規律，秩序。3 【生物學】分類法。4 〈M 〉【戲劇】...
  1. The present thesis employs the cone theory, monotone iterative technique, the conical expansion and compression principle, the method of upper and lower solutions, the monch theory of fixed point, and so on, to investigate the existence of solutions of sevral differential equations. the obtained results are either new or intrinsically generalize and improve the previous relevant ones under weaker conditions

    本文利用錐理論、單調迭代技術、錐拉伸壓縮不動點原理、上下解方法、不等式迭代技術、 m （ ? ） nch不動點理論等，研究了幾類微分方程解的情況所得結果或是新的，或是採用新方法在更弱條件下推廣和改進以前的結果
  2. The ship - chamber is elastic and its distortion decides the distribution of water load. however the displacements of the ship - chamber are unknowable and how to determine the water load is the key point. the non - linear problem that load is dependent on displacement is analyzed and an iterative method is investigated to solve it

    承船廂是充水的彈性結構，水是流動的，它的分佈與廂體變形有關，而廂體變形又是未知的，針對這種水荷載與位移有關的非線性問題，提出了用迭代的方法來確定水荷載的具體分佈，從而結構的受載情況得到了完全的描述。
  3. An iterative particle swarm algorithm is proposed for the robust optimization problem of hatch processes without state independent and end - point constraints, which combines the iteration method and the particle swarm optimization algorithm together

    摘要針對無狀態獨立約束和終端約束的間歇過程魯棒優化問題，將迭代方法與粒子群優化演算法相結合，提出了迭代粒子群演算法。
  4. 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

    另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。
  5. At present, constrained optimization methods may be classified to two classes, one is search method which firstly asserts whether the current point is an optimal point, if the point is not, then we must choose search directions, and along the search direction, find the next iterative point which make the objective function or merit function to decrease

    目前的約束優化演算法可以分成兩大類，一類是搜索演算法，這種演算法首先判斷當前點是否為最優點，若非最優點則要確定搜索方向，然後沿此方向確定一個使目標函數或評價函數下降的點。這種演算法一般為下降演算法，如可行方向法、約束變尺度法等。
  6. Chapter two mainly considers the periodic boundary value problems for impul - sive differential equations. some existence results, obtained by the help of schaeffer ' s fixed point theorem and the method of upper and lower solutions coupled with the monotone iterative technique

    第二章討論了兩類周期邊值問題，通過利用schaeffer不動點定理，上下解方法和單調迭代方法，建立了解存在的充分條件。
分享友人
分享到 Line

分享到臉書