systems of equations 中文意思是什麼
-
For a class of quadratic finite element diseretization systems of an elliptic boundary problem with jump coefficients under the unstructured quadrilateral grids, we are concerned with two kinds of quadratic lagrangian finite element equations, by analyzing the relationship between the linear finite element and quadratic finite element basis functions, a hew amg method is designed
摘要針對一類帶間斷系數的橢圓邊值問題，在非結構四邊形剖分下，討論了兩種二次拉格朗日有限元方程的代數多重網格法，通過利用雙線性元和二次元基函數之間的表示關系，給出了一種新的網格粗化演算法和構造提升運算元的代數途徑。 -
On admissible solutions of two types of systems of differential equations in the complex plane
關于兩類復微分方程組的允許解 -
Previous chapters have dealt with the derivation of systems of difference equations.
前面幾章已經論述了差分方程組的推導。 -
Very general systems of differential equations can be reduced to the normal form.
形式很普通的微分方程組可以化為正規的形式。 -
Forced oscillation for solutions of systems of partial functional differential equations
偏泛函微分方程系統解的強迫振動性 -
First, we reformulate the kkt systems of the constrained optimization problem and the symmetric variational inequality prpoblem into equivalent nonsrnooth equations by using the so called ncp functions
本文研究求解約束最優化問題和對稱變分不等式kkt系統的bfgs演算法。首先利用ncp函數將問題的kkt系統轉化為等價的非光滑方程組。 -
Systems of linear differential equations can be handled by using the methods of linear algebra.
線性微分方程組可以應用線性代數中的方法求解。 -
An asynchronous parallel algorithm about the secant method for solving nonlinear systems of equations
一個用割線法求解非線性方程組的異步并行演算法 -
Both methods result in tridiagonal systems of linear equations that can be solved efficiently.
兩種方法都形成了有效求解的三對角線的線性方程組。 -
New algorithm on finding roots of systems of nonlinear algebraic equations
非線性代數方程組求根新演算法 -
Economic models often lead to the study of systems of equations.
經濟模型經常導致對方程組的研究。 -
We use rac ( radial alignment constraint ) of imaging process to decompose camera parameters. by organizing the solving sequence of the parameters rationally, we can obtain all parameters through solving systems of linear - 3 - abstract equations. accordingly we have changed the situation that ? he former camera calibration rac methods should depend on the non - linear optimization and has strict requirement to illumination, the situation that the calibrating distance is too short
演算法考慮到攝像機模型中的一階徑向畸變，巧妙地利用成像過程中的徑向約束（ rac ）分解攝像機參數，同時通過合理地組織參數的求解次序，使得經由求解線性方程組就可以得到全部的攝像機參數，從而改變了以往攝像機rac標定方法依賴于非線性優化，以及對光照條件要求嚴格和標定測定距離短的情況，使得rac方法較以往的演算法更為精確、快速、簡便，並且更加具有推廣價值。 -
A complex particle swarm optimization ( cpso ) algorithm, which combines the advantages of method of complex ( mc ) and particle swarm optimization ( pso ), is put forward to solve systems of nonlinear equations, and it can be used to overcome the difficulty in selecting good initial guess for newton ' s method and the inaccuracy of mc and pso due to being easily trapped into local minima for solving systems of nonlinear equations
摘要結合復形法與粒子群演算法的優點，提出粒子群復形法，用於求解非線性方程組，以克服牛頓法初始點不易選擇的問題，同時克服復形法與粒子群演算法由於易陷入局部極值而導致方程組的解的精度不夠的不足。 -
The results of simulated and xperimental fringe patterns are presented to illustrate the processing of the new method. secondly, considering the phase of fringe pattern can be recovered by solution of a equence of linear systems of equations, and the corresponding matrices are quite large and parse, the optimum numerical methods are available to solve this kind of systems
結果表明，用本文的方法，能夠有效濾除掉條紋圖中的高斯型、均勻分佈的隨機型噪聲，從而由單幅條紋圖獲得對應于該條紋圖的全場相位分佈，文中給出了模擬和實驗的處理結果。 -
Emphasis is given to topics that will be useful in other disciplines, including systems of equations, vector spaces, determinants, eigenvalues, similarity, and positive definite matrices
主要內容有：行列式，矩陣的代數運算，維向量空間的概念，線性方程組理論，矩陣相似的標準形理論，二次型等。 -
The systems of equations obtained in most practical problems are not only symmetric but also banded.
我們在大部分實際問題中得到的方程組不僅是對稱的而且還是帶狀的。 -
Finding all isolated solutions of polynomial systems of equations has very wide applications in many fields of science and engineering
多項式系統所有孤立解的計算在工程和科學上有著廣泛的應用。 -
For both methods, at most two reduced linear systems of equations with the same coefficient matrix need to be solved in order to get iterative directions at each iteration and the iterative matrix involves only constraints in the working set, whose cardinality are much less than the number of original constraints
在其每次迭論文摘要代中，只有有效工作集中的約束參與計算。在本文中，我們在facchinei一fischer一kanzowkkt點有效約束集識別技術的基礎上提出了三個具有強收斂性的qp一free演算法。 -
For example, at each iteration at most four reduced linear systems of equations with the same iterative coefficient matrix need to be solved to get iterative directions and the iterative matrix involves only constraints in the working set, the number of which are much less than that of the original problem
此外它還有其它一些良好性質，例如其子問題通常只包含同系數的線性方程組，並且這些方程組在一定的假設條件下都是可解的。然而，從理論和實用的角度來看，現有的qp一free演算法仍存在兩個主要問題有待解決。 -
Because three systems of equations solved at each iteration have the same coefficients, so the ammount of computation are less than that of the existing sqp algorithms. under some common conditions ( such as the second order sufficient condition ) which are used in some references, we prove that the algorithm possesses not only global convergence, but also strong convergence and superlinear convergence
該演算法在每次迭代時所需解的三個線性方程組具有相同的系數，因此計算量要比現有的sqp方法有所減少；在與一些文獻平行的假設條件（如二階充分條件）下，論文證明了演算法不僅具有全局收斂性，而且還具有強收斂性和超線性收斂性
分享友人