WEKO3
アイテム
NII Technical Report (NII-2004-009E)：On the Convergence of the GCR(k) Method for Singular Systems
https://doi.org/10.20736/0000000397
https://doi.org/10.20736/0000000397d6e1495b-cb54-409c-8688-602555958479
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
NII Technical Report (NII-2004-009E)：On the Convergence of the GCR(k) Method for Singular Systems (238.3 kB)
|
|
| Item type | レポート / Report(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2004-12-02 | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | NII Technical Report (NII-2004-009E)：On the Convergence of the GCR(k) Method for Singular Systems | |||||||||||||
| 言語 | en | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| キーワード | ||||||||||||||
| 言語 | ja | |||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | テクニカルレポート | |||||||||||||
| キーワード | ||||||||||||||
| 言語 | en | |||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | Technical Report | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||
| 資源タイプ | departmental bulletin paper | |||||||||||||
| ID登録 | ||||||||||||||
| ID登録 | 10.20736/0000000397 | |||||||||||||
| ID登録タイプ | JaLC | |||||||||||||
| 著者 |
速水, 謙
× 速水, 謙
× 杉原, 正顯
|
|||||||||||||
| 抄録 | ||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||
| 内容記述 | Consider applying the restarted Generalized Conjugate Residual (GCR(k)) method to systems of linear equations A x = b or least squares problems min_x || b - A x ||_2, where A is a n x n real matrix which may be singular and/or nonsymmetric and x, b are real vectors of size n. Let R(A) and N(A) be the range and null space of A, respectively. First, we prove that the necessary and sufficient condition for the method to converge to a least squares solution without breakdown for arbitrary b and initial approximate solution x_0, is that A is definite in R(A), and that R(A) and N(A) are orthogonal to each other. Next, we show that the necessary and sufficient condition for the method to converge to a solution without breakdown for arbitrary b in R(A) and arbitrary x_0, is that A is definite in R(A). The main idea of the proofs is to decompose the algorithm into the R(A) and its orthogonal complement components. Finally, we will give examples arising in the finite difference discretization of two-point boundary value problems of an ordinary differential equation, corresponding to the above two cases. | |||||||||||||
| 言語 | en | |||||||||||||
| 書誌情報 |
ja : NIIテクニカル・レポート en : NII Technical Report p. 1-24, 発行日 2004-12-02 |
|||||||||||||
| 出版者 | ||||||||||||||
| 出版者 | 国立情報学研究所 | |||||||||||||
| 言語 | ja | |||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||||
| 収録物識別子 | 1346-5597 | |||||||||||||
