iterative programming 中文意思是什麼
-
Iterative method of two enter basis in linear programming
線性規劃的雙進基迭代法 -
In chapter two, under non - lipschitz condition, the existence and uniqueness of the solution of the second kind of bsde is researched, based on it, the stability of the solution is proved ; in chapter three, under non - lipschitz condition, the comparison theorem of the solution of the second kind of bsde is proved and using the monotone iterative technique, the existence of minimal and maximal solution is constructively proved ; in chapter four, on the base of above results, we get some results of the second kind of bsde which partly decouple with sde ( fbsde ), which include that the solution of the bsde is continuous in the initial value of sde and the application to optimal control and dynamic programming. at the end of this section, the character of the corresponding utility function has been discussed, e. g monotonicity, concavity and risk aversion ; in chapter 5, for the first land of bsde, using the monotone iterative technique, the existence of minimal and maximal solution is proved and other characters and applications to utility function are studied
首先，第二章在非lipschitz條件下，研究了第二類方程的解的存在唯一性問題，在此基礎上，又證明了解的穩定性；第三章在非lipschitz條件下，證明了第二類bsde解的比較定理，並在此基礎上，利用單調迭代的方法，構造性證明了最大、最小解的存在性；第四章在以上的一些理論基礎之上，得到了相應的與第二類倒向隨機微分方程耦合的正倒向隨機微分方程系統的一些結果，主要包括倒向隨機微分方程的解關于正向隨機微分方程的初值是具有連續性的，得到了最優控制和動態規劃的一些結果，在這一章的最後還討論了相應的效用函數的性質，如，效用函數的單調性、凹性以及風險規避性等;第五章，針對第一類倒向隨機微分方程，運用單調迭代方法，證明了最大和最小解的存在性，並研究了解的其它性質及在效用函數上的應用。 -
The status of the research for non - entirety analysis of arch dam and joint models commonly used were reviewed. the fem analysis for contact problem, i. e., iterative method, contact constraints method and mathematical programming method, were summarized. 2
評述了拱壩結構非整體性分析研究的現狀以及拱壩結構分析中常用的接縫模型；進一步從直接迭代法、接觸約束法和數學規劃法三個方面綜述了基於有限單元法的接觸問題分析方法。 -
The first algorithm uses an iterative self - organizing data analysis technique and fuzzy clustering analysis theory. it is fast, simple and easy for programming, but more suitable for small system. the second one is a recursive algorithm
首先採用模糊聚類分析中的迭代自組織數據分析技術（ iterativeself - organizingdataanalysistechniquea ） ，提出了改進isodata不良數據辨識法；其次，提出了遞推不良數據辨識法。 -
In an incremental, iterative process like extreme programming, good design is essential
在類似於極端編程這樣的遞增和迭代過程中，良好的設計是本質。 -
Recently, clusters with distributed memory are popular for parallel computing systems, and mpi is the actual standard of message passing programming. therefore, the application of clusters based on mpi to computational electromagnetics is studied in this dissertation. the methods are mom based on the integral equation method in conjunction with the preconditioning technique to speed up the iterative solution and a matrix order reducing method, namely the characteristic basis function method ( cbfm )
目前，分散式內存的集群系統是并行計算系統的主流系統， mpi是消息傳遞編程實際上的標準，本文即研究了基於mpi的集群技術在計算電磁學中的應用，採用的方法主要是基於積分方程的矩量法，並結合了加速迭代的預條件技術以及一種矩陣降階方法? ? cbf方法。 -
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
另一類叫做子問題演算法，這種演算法是通過一系列簡單子問題的解來逼近原問題的最優解，如罰函數法、信賴域演算法、逐步二次規劃演算法等。這兩類演算法的一個共同特點是，通過比較當前點和下一個迭代點的目標函數值或評價函數值來確定迭代點的「優」或「劣」 ，若迭代點比當前點「優」則該迭代點可以被接受，否則須繼續搜索或調整子問題。 -
In the computational methods of tpbvp, in order to reduce some difficulties involved in solving a tpbvp via adjoint variables, we discuss a direct method in which state and control variables are indirectly parameterized, the method employs a recently developed direct optimization technique that uses a piecewise polynomial representation for the state and control variables, thus converting the optimal control problem into a nonlinear programming problem, which can be solved numerically. it makes the initial iterative variable more easy to be determined
在數值解法中，為了減少解決兩點邊值問題共軛變量帶來的困難，主要討論了將狀態變量和控制變量進行參數化的一種直接方法，這種方法採用了近段發展起來的使用分段的多項式來代替狀態和控制變量的直接優化方法，然後最優控制問題就轉化成可以用數值方法解決的非線性規劃問題，使得迭代初值更加容易選取。 -
The solution methods of support vector machine, including quadratic programming method, chunking method, decomposing method, sequential minimization optimization method, iterative solution method named lagrange support vector machine based on lagrange function and newton method based on the smoothing technique, are studied systematically
主要有支持向量機的二次規劃求解法、選塊法、分解法、序列最小優化方法、基於lagrange函數的迭代求解方法即lagrange支持向量機、基於smoothing處理的牛頓求解方法。 -
Three duplication based task scheduling algorithms are presented. these algorithms have good performance, and its application on a real multi - core and multi - thread processor ( network processor ixp ) are demonstrated. it also show that how a uniform network programming environment could be built through address translation and iterative compilation techniques
然後結合一種實際的多核多線程處理器（網路處理器ixp ）展開了對任務調度實例化研究，並且運用地址轉換和迭代編譯等技術構建了新型統一網路編程環境，又結合實際網路應用提出了吞吐量與延遲相結合的網路任務調度演算法。 -
Fixed iterative method for solving the inequality constrained quadratic programming problem
不等式約束二次規劃的不動點迭代
分享友人