逐次接近法 的英文怎麼說

中文拼音 [zhúcìjiējìnfǎ]
逐次接近法 英文
cut and try process
  • 逐 : 動詞1. （追趕） pursue; chase; run after 2. （驅逐） drive out; expel; banish 3. （挨著次序） one by one
  • 次 : Ⅰ名詞1 （次序; 等第） order; sequence 2 [書面語] （出外遠行時停留的處所） stopping place on a jou...
  • 接 : Ⅰ動詞1 （靠近;接觸） come into contact with; come close to 2 （連接; 使連接） connect; join; put ...
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 逐次 : each time; gradually; successive逐次分析 sequential analysis; 逐次簡化 successive reduction; 逐次...
  • 接近 : 1 （靠近; 相距不遠） be close to; near; approach 2 [天文學] approach; approximation; application;...
  1. Lewis relationship has been suggested to evaluate the surface mass transfer coefficient using the average surface convective transfer coefficient. in addition, a practical analytic technique for testing the surface mass transfer coefficient is proposed and the values of he surface mass transfer coefficient have been given for the particular desorption and absorption test and validated against lewis relationship results. indoor temperature and humidity evaluation equations of adobe buildings considering the moisture absorption and desorption by interior materials have been proposed based on the analysis of the indoor dynamic thermal and moisture process

    通過理論解析和實驗測試定量地研究了生土建築圍護結構表面吸放濕效應，首次提出了以空氣濕度（ kg / kg ）為驅動勢差的圍護結構表面吸放濕量計算公式，該公式較適用於工程計算，從而為使建築濕環境研究成果逐步應用到建築工程實踐中奠定了理論基礎和提供了簡便演算法；通過對國內外關于表面質交換系數確定方法的研究成果的分析，提出用lewis關系計算生土建築圍護結構表面質交換系數；在實驗室環境下，對生土建築圍護結構表面質交換系數進行了測試方法研究，測試結果和利用lewis關系得到的數值較接近。
  2. 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

    另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。
分享友人
分享到 Line

分享到臉書