迭代題 的英文怎麼說
中文拼音 [diědàití]
迭代題
英文
iterative problem-
This paper is made up of three chapter, which discuss mainly about the astringency of the iterative methods and the application in fact
本文共分三章，主要討論的是迭代法的收斂性及其在實際中的應用問題。Block relaxation algorithms in statistics. information systems and data analysis, bock h h, lenski w, richter m m eds.,
為快速求解這一優化問題，本文給出了一種基於凸性邊界條件判別的塊鬆弛迭代演算法。For obtaining the numeral solutions of round elastic plates in axisymmetrical deformation with varying - thickness in nonlinear deformation in the unsteady electromagnetic field and mechanical field, by establishing the equations of motion, the equations of distortion, the equations of lorentz force, the equations of electronic dynamic mechenical, and adopting iterative method, we gained the nonlinear magneto - elastic calculation method and outcome of current - carrying shell, and gained the influencing degree toward mechanical parameter of varying thickness round ferreous plates in the electromagnetic field and mechanical field
摘要為了獲得內邊界固定的環形導電薄板在均布力與橫向磁場作用下的變形問題的數值解，通過建立運動方程、變形方程、電動力學方程和洛侖茲力方程，運用迭代法得出了載流板殼的非線性磁彈性的計算方法和結果，以及機械場、電磁場對鐵質變厚度圓板各力學參量的影響程度。Abstract : based on the principle of mininmum potential and using rayleigh - ritz method, the geometric non - linear analysis of higher bridge piers was solved in this paper. the new concept of equivalent horizontal force proposed by the author may be casily to calculate the second effect, which was produced due to the vertical forces and resisted by the piers and rubber pad bearings incorporately. the simple formula in this paper are applicable to calculate by hand, understood clearly without computation of successive iteration, higher precision and graspable easily for the disigmer therefore it has the practical significance
文摘:根據最小勢能原理，用瑞雷-里茲法解決了高橋墩的幾何非線性分析問題；其次，提出了等效水平力的新概念，可以方便地解決橋墩和板式橡膠支座聯合抵抗垂直力所產生的二次效應問題.筆者提出適合於手算的簡便計算公式，概念明確，勿須迭代運算，精度較高，易為設計人員掌握，因此具有實用價值Abstract : the mechanical analysis for arch bridge with flat hinge joints is a mechanical problem with non - linear boundary. mechanical analysis of methods at present is not clear, which can not calculate the arch bridge with changeable section and section with complicate shape. in this paper, the new method used to get the section resistance coefficient k is presented, the iterative procedure is established to calculate the internal forces of arch bridge with flat hinge joints, and the computational example is given. the method can apply to the arch bridge with any numbers of flat hinge joints and any shape section
文摘:平鉸拱橋結構的受力分析屬于邊界非線性力學問題，目前的一些方法受力分析不太明確，對變截面、復雜形狀截面等平鉸拱橋無法進行計算.針對這種情況，提出了確定平鉸截面抗力系數k的新方法，建立了計算平鉸拱橋內力的迭代演算法，並進行了實例計算，研究結果表明，這一方法對具有任意個平鉸、任意形狀截面的拱橋結構是適用的By reformulating the kkt system as a constrained equation, the algorithm generates the search direction by solving a linear equation at each iteration
通過將問題的kkt系統轉化成一個約束方程，演算法在每步迭代只需解一個線性方程組即可得到搜索方向。Third, based on the non - linearity feature of the system, the lmf algorithm is given by using the non - linearity least square optimal method. the simulating results show that the accuracy of the algorithm approaches the cramer - rao - bound. finally, the radial based function network localization algorithm is present for bistatic sonar
為了克服lmf演算法在進行迭代時依賴于初始值的缺點，根據人工神經網路在求解非線性問題方面的特點，提出了用徑向基函數網路方法來進行雙基地聲吶定位的優化演算法。In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance
本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。However, in existing global newton ' s methods a linearized variational inequality subproblem has to be solved at each iteration, whose computational cost is equivalent with a qp problem, and the local fast convergence is usually established theoretically incompletely
通過應用fiseher一burmeister非線性互補問題函數， h . qi和l . qi在17 ]中對以前的qp一free演算法做了有效的改進，使得迭代矩陣的一致非奇異性得到保證。Monotone iteration method and upper and lower solutions were used to approach to the solution of the first - order integral boundary value problem on time scales form below and above by monotone convergent sequence
摘要運用單調迭代方法和上下解方法構造了兩個單調序列，從上下兩個方向分別收斂到一階積分邊值問題。The three kinds of construction graph can be applied to optimization problems with different characteristics, and the two kinds of layered construction graph are more suitable for complex multi - stage dynamic decision problems ( cmsddp ) than scg. the clcg defines smaller solution building blocks and is able to perform better in large - scale cmsddps than the blcg. 2. the construction graph of aco algorithms need statically describe the whole solution space ( or discrete solution spa
（ 2 ）蟻群優化演算法的解構造圖一般要靜態地描述整個解空間（或者是離散化了的解空間） ，對于大規劃動態決策問題，不僅存在描述解空間的困難，而且讓蟻群在迭代過程中始終在整個解空間中進行搜索，搜索性能會很低。We analyze the assembly model and propose a mathematics model and tree - representing model of the assembly who not only has a small data size, but also can be manipulated easily. this thesis not only gives the virtual representing concept the instance representing one, but also defines the concept of assembly constraint such as coupling, being alignment, being coaxial and being equidirectional. based on such concepts, a revised newton - raphson iterative algorithm is proposed, which can deal with the singularity and ill - condition of jacobi matrix
首先分析了裝配體的模型問題，提出了裝配體的數學模型及樹形式表示的裝配體表示模型，模型具有數據量小、操作簡單的優點：文章對所涉及的約束諸如耦合、對齊、同軸、同向的裝配體位置描述概念進行了定義，引入了裝配約柬概念，從而提高了裝配設計效率；在此基礎上，文章討論了裝配約束的求解方法，提出了newton rapson迭代法的改進演算法，使得系統能更好地處理jacobi矩陣的奇異和病態的情形。In this paper, we study the stopping sets, stopping distance and stopping redundancy for binary linear codes. stopping redundancy is a new concept proposed by schwartz and vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel. since the exact value of stopping redundancy is difficult to obtain in general, good lower and upper bounds are important
近年來，迭代譯碼的性能分析是低密度校驗ldpc碼研究領域的熱點問題之一， di等人在2001年指出：迭代譯碼在二元刪除通道bec中的性能可以由ldpc碼的停止集stopping set完全刻畫。The result indicates that the nonlinear elastic model is appropriate for better foundation condition, while the viscoelastic model is appropriate for worse foundation condition. according to the uniqueness of back analysis solution, it is put forward a method for the back analysis of layer - wise and section - wise iteratively. which is showed advantage by the calculation result
分析表明，非線性彈性模型一般適合地基較好的情況，而對于地基較差的情況宜採用粘彈性模型；針對反演計算解的唯一性問題，提出了分層分部反演迭代的計算方法，計算表明，該方法具有一定的優越性。Among hese method, one of the simplest is the deepest gradient descent algorithm, but it has one disadvantage that the solutions are oscillatory and slowly convergent. a friction term is ntroduced to avoid oscillatory solutions and raise convergence rate. the third major contribution of this dissertation is study on 3 - d diffuse object surface optical automatic measurement
其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。The harmonic analysis method can save much computer time than the iterative scheme in time domain ; it is very useful for the complex problem that needs a great of iterative
頻域法與常規的時間步進法相比，可以節省大量的計算機時間，對于需要大量迭代過程的復雜問題尤為重要。2. nonlinear source term identification problem about a quasilinear parabolic heat equation is investigated. for the given function determined, the existence and the uniqueness of the solution of the state equation are proved and the dependence of the solution of the state equation on the identification parameter is discussed ; then the identifiability is verified ; through choosing suitable basic functions, the above identification problem can be transformed into a constant coefficients identification problem ; and an practical iterative algorithm for solving the identification problem is presented, the feasibility and validity of the algorithm is verified by the numerical experiments
2 、研究一擬線性拋物型熱傳導方程非線性未知源項的識別問題；對于給定識別函數，論證了狀態方程解的存在惟一性、方程解與識別函數的依賴關系和可識別性；通過選取適當的基函數，把對非線性源項的識別轉化成常系數識別問題；給出了實現非線性源項識別的迭代演算法，通過數值實驗證明了演算法的有效性。Since there exists ill - posedness in reconstructing velocity on the surface and reconstructing pressures in the field, this paper attempts to introduce an iterative regularization method to resolve such inverse problems
由輻射聲壓重構結構表面振動速度和聲場聲壓存在解的離散病態問題，試圖利用一種迭代正則化方法來解決此類逆問題。Fourthly, because of the fluctuation of grouping efficacy during the fcm iteration process, the iteration solution selecting procedure is put forward, with which the infeasible solution of last iteration will not be selected. 5
第四，針對fcm迭代過程中製造單元構建方案成組效率的波動性，提出了迭代方案選擇方法，基本避免了fcm選擇的最終迭代方案不可行的問題。This algorithm easily escapes from local optimal solution, have high searching efficiency, simple structure, convenient use. aiming at iteration, optimization and matlab optimization toolbox having low precision and difficulty to choose initial vector on acquiring nonlinear equations ’ solutions, equations ’ solution problem is translated into genetic algorithm optimization problem. nonlinear equations ’ usual genetic
針對迭代法、最優法、 matlab最優化工具箱求解非線性方程組中存在求解精度不高及初始矢量難選等問題，將方程組求解問題轉化為遺傳演算法函數優化問題，建立了非線性方程組通用的遺傳演算法解法，並將其用於汽車滑行試驗數據處理中。分享友人