Name
Abstract | ||
|---|---|---|
We present two iterative algorithms for solving real nonsymmetric and complex non-Hermitian linear systems of equations and that were developed from variants of the nonsymmetric Lanczos method. In this paper, we give the theoretical background of the two iterative methods and discuss their main computational aspects. Using a large number of numerical experiments, we analyze their convergence properties, and we also compare them with other popular nonsymmetric iterative solvers in use today. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1137/100794031 | SIAM J. Scientific Computing |
Keywords | Field | DocType |
convergence property,nonsymmetric lanczos method,numerical experiment,nonsymmetric linear systems,main computational aspect,large number,complex non-hermitian linear system,iterative algorithm,cors iterative algorithms,popular nonsymmetric iterative solvers,real nonsymmetric,iterative method,linear systems | Convergence (routing),Mathematical optimization,Lanczos resampling,Generalized minimal residual method,Preconditioner,Linear system,Matrix (mathematics),Iterative method,Algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 5 | 1064-8275 |
Citations | PageRank | References |
9 | 0.62 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Carpentieri | 1 | 136 | 12.01 |
| Y.-F. Jing | 2 | 9 | 0.62 |
| T.-Z. Huang | 3 | 12 | 1.14 |