書誌事項
- タイトル別名
-
- MRTR Method : An Iterative Method Based on the Three-Term Recurrence Formula of CG-Type for Nonsymmetric Matrix
- MRTRホウ CGガタ ノ サンコウ ゼンカシキ ニ モトズク ヒタイショウ
この論文をさがす
抄録
The residual polynomial of GPBi-CG method is represented in the product of the Lanczos polynomial R_k(A), the polynomial H_k(A) similar to the Lanczos but different in parameters, and the starting residual vector. We remove R_k(A) from the residual polynomial, namely, we suggest a new method whose residual vector is the product of the starting one and H_k(A) only. The algorithm, which is called MRTR method, is proven to be mathematically equivalent to the conjugate residual(CR)method. Therefore, we can show its convergence as well as its error bound. However, MRTR method is different from CR method in their implementation. MRTR method has less operation cost than CR method per iteration step. Through numerical experiments of nonsingular and singular linear equations we confirm the equivalence on numerical computations. Moreover, we show that MRTR method is more effective than CR method.
収録刊行物
-
- 日本応用数理学会論文誌
-
日本応用数理学会論文誌 7 (1), 37-50, 1997
一般社団法人 日本応用数理学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001205768007680
-
- NII論文ID
- 110001883640
-
- NII書誌ID
- AN10367166
-
- ISSN
- 09172246
- 24240982
-
- NDL書誌ID
- 4159691
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可