The BiCOR and CORS Iterative Algorithms for Solving Nonsymmetric Linear Systems

Authors:
B. Carpentieri;Y.-F. Jing;T.-Z. Huang
Affiliations:
b.carpentieri@rug.nl;yanfeijing@uestc.edu.cn and tzhuang@uestc.edu.cn;-
Venue:
SIAM Journal on Scientific Computing
Year:
2011

Citing 18
Cited 1

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
CGS, a fast Lanczos-type solver for nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
Reduction to tridiagonal form and minimal realizations

SIAM Journal on Matrix Analysis and Applications
An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

SIAM Journal on Scientific Computing
A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems

SIAM Journal on Scientific Computing
An overview of approaches for the stable computation of hybrid BiCG methods

Applied Numerical Mathematics - Special issue on iterative methods for linear equations
Iterative methods for solving linear systems

Iterative methods for solving linear systems
The finite element discretization for stream-function problems on multiply connected domains

Journal of Computational Physics
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
GMRES with Deflated Restarting

SIAM Journal on Scientific Computing
Truncation Strategies for Optimal Krylov Subspace Methods

SIAM Journal on Numerical Analysis
A Preconditioner for the Electric Field Integral Equation Based on Calderon Formulas

SIAM Journal on Numerical Analysis
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Combining Fast Multipole Techniques and an Approximate Inverse Preconditioner for Large Electromagnetism Calculations

SIAM Journal on Scientific Computing
A COCR method for solving complex symmetric linear systems

Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)
An extension of the conjugate residual method to nonsymmetric linear systems

Journal of Computational and Applied Mathematics
Lanczos-type variants of the COCR method for complex nonsymmetric linear systems

Journal of Computational Physics

A generalized product-type BiCOR method and its application in signal deconvolution

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

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.