Name
Abstract | ||
|---|---|---|
We propose a variant of Orthomin(m) for solving linear systems Ax=b. It is mathematically equivalent to the original Orthomin(m) method, but uses recurrence formulas that are different from those of Orthomin(m); they contain alternative expressions for the auxiliary vectors and the recurrence coefficients. Our implementation has the same computational costs as Orthomin(m). As a result of numerical experiments on nonsingular linear systems, we have confirmed the equivalence of our proposed variant of Orthomin(m) with the original Orthomin(m) using finite precision arithmetic; numerical experiments on singular linear systems show that our proposed algorithm is more accurate and less affected by rounding errors than the original Orthomin(m). |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.amc.2008.08.035 | Applied Mathematics and Computation |
Keywords | DocType | Volume |
Linear systems,Krylov subspace method,Orthomin(m) method,Singular matrices | Journal | 206 |
Issue | ISSN | Citations |
1 | 0096-3003 | 1 |
PageRank | References | Authors |
0.36 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuniyoshi Abe | 1 | 17 | 5.45 |
| Shao-Liang Zhang | 2 | 92 | 19.06 |