| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
| 概要 |
Convergence property of the successive over-relaxation (SOR) method depends on a relaxation parameter whose optimal value can be hardly computed. This paper determines the optimal value under a minima...l condition for an intermediate residual in the successive computation of the SOR method. Through the organizations of formulas, the authors eliminate the relaxation parameter and propose a new iterative solver: successive minimal residual (SMR) method. Numerical tests for over 700 practical and real nonsymmetric matrix problems comparably check the performances of convergence, computation time and accuracy for the SMR method and other classical iterative methods.続きを見る
|
Mendeley出力
