遞次求近法 的英文怎麼說

中文拼音 [dìcìqiújìnfǎ]
遞次求近法 英文
iterative procedure
  • 遞 : Ⅰ動詞（傳送;傳遞） hand over; pass; give Ⅱ副詞（順著次序） in the proper order; successively
  • 次 : Ⅰ名詞1 （次序; 等第） order; sequence 2 [書面語] （出外遠行時停留的處所） stopping place on a jou...
  • 求 : Ⅰ動詞1 （請求; 要求） ask; beg; request; entreat; beseech : 求人幫忙 ask sb a favour; ask a favou...
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. The transient mathematical equations are addressed for the coupled heat and moisture transfer by taking account of moisture accumulation procedure. an analytical method by means of the transfer function is proposed to predict the transient distributions of temperature and moisture content at different interfaces in walls. a numerical analysis approach based on an efficient finite - difference method is developed to deal with the procedure of coupled heat and moisture transfer in a multilayer wall with nonlinear boundary conditions considered

    建立了考慮濕積累過程的瞬態熱濕耦合模型，在方程中引入了濕積累項；發展了一種傳遞函數解析方法進行墻體內不同剖面處溫度和含濕量的動態預測；首次提出了一種基於有效有限差分法預測非線性邊界條件下多層多孔結構內的傳熱傳濕過程的數值分析方法，求解過程中考慮了瞬態邊界條件，從而避免了通常處理中由於邊界條件設定為常數而給計算帶來的誤差，對于多層結構每一層物性參數的非連續性，則採用了有效的有限差分逼近處理。
  2. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  3. In the research of the algorithms and theory of temporal difference learning, a new class of multi - step learning prediction algorithms based on linear function approximators and recursive least squares methods is proposed, which are called the rls - td ( t ) learning algorithm. the convergence with probability one of the rls - td ( t ) algorithm is proved for ergodic markov chains, and the conditions for convergence are analyzed

    在時域差值學習（ temporaldifferencelearning ）學習演算法和理論方面，首次提出了一種基於線性值函數逼近的多步遞推最小二乘td （ ） （ rls - td （ ） ）學習演算法，並分析和證明了該演算法在求解遍歷markov鏈學習預測問題中的收斂條件和一致收斂性。
分享友人
分享到 Line

分享到臉書