THE BICOR AND CORS ITERATIVE ALGORITHMS FOR SOLVING NONSYMMETRIC LINEAR SYSTEMS

被引：24

作者：

Carpentieri, B. ^{[1
]}

Jing, Y. -F. ^{[2
]}

Huang, T. -Z. ^{[2
]}

机构：

[1] Univ Groningen, Inst Math & Comp Sci, NL-9700 AK Groningen, Netherlands

[2] Univ Elect Sci & Technol China, Sch Math Sci, Inst Computat Sci, Chengdu 611731, Sichuan, Peoples R China

来源：

SIAM JOURNAL ON SCIENTIFIC COMPUTING | 2011年 / 33卷 / 05期

基金：

美国国家科学基金会;

关键词：

Krylov subspace methods; linear systems; nonsymmetric Lanczos method; sparse and dense matrix computation; MINIMAL RESIDUAL ALGORITHM; AHEAD LANCZOS-ALGORITHM; COCR METHOD; PRECONDITIONER; PERFORMANCE; GMRES;

D O I：

10.1137/100794031

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：3020 / 3036

页数：17

共 35 条

[1]

[Anonymous], 2003, ITERATIVE METHODS SP, DOI DOI 10.1137/1.9780898718003

[2]

Baertschy M, 2001, P 2001 ACM IEEE C SU, P47

[3] Combining fast multipole techniques and an approximate inverse preconditioner for large electromagnetism calculations [J].