regular splitting 中文意思是什麼
regular splitting
解釋
正則分裂-
First, we consider an additive schwarz algorithm for the solution of ax 4 - f ( x ) 0, x when coefficient a is an m - matrix and f ' ( x ) 0. by applying the theory of weak regular splitting of matrices to the above considered algorithm, we obtain the weighted max - norrn bound for iterations. moreover, under the assumption that f ( x ) is concave, we establish monotone convergence of the considered algorithm
本文內容如下：首先，應用加性schwarz演算法求解非線性互補問題，其中a是m陣，應用弱分解理論，我們獲得了在加權范數意義下誤差的幾何收斂速度，在f （ x ）是凹函數的假設下我們還獲得了此演算法的單調收斂性，同時我們給出此演算法的一種修改演算法，無需前面的假設，該演算法具有單調收斂性。 -
In the second part, a decomposition method for solving semidefmite quadratic programming with box constraints is proposed. a regular splitting of the hessian matrix of the problem is used in the algorithm. the convergence of the algorithm is proved under certain assumptions, the numerical results are also given
第二部分把解邊界約束正定二次規劃問題的正則分解演算法推廣到求解邊界約束半正定二次規劃問題，在理論證明的基礎上還進行數值檢驗，結果說明演算法是有效的。 -
By applying the theories of regular splitting and weak regular splitting of matrices to the two considered algorithms, we obtain the weighted max - norm bounds for iterations too
應用正則分解和弱正則分解理論，我們同樣獲得了該演算法在加權范數意義下的幾何收斂性。
分享友人