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
A theoretical comparison of the Arnoldi and GMRES algorithms
SIAM Journal on Scientific and Statistical Computing
The convergence behaviour of preconditioned CG and CG-S in the presence of rounding errors
Proceedings of a conference on Preconditioned conjugate gradient methods
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
Variants of BICGSTAB for matrices with complex spectrum
SIAM Journal on Scientific Computing
A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems
SIAM Journal on Scientific Computing
Residual smoothing techniques for iterative methods
SIAM Journal on Scientific Computing
Hybrid procedures for solving linear equations
Numerische Mathematik
An overview of approaches for the stable computation of hybrid BiCG methods
Applied Numerical Mathematics - Special issue on iterative methods for linear equations
Applied Numerical Mathematics - Special issue on iterative methods for linear equations
Residual smoothing and peak/plateau behavior in Krylov subspace methods
Applied Numerical Mathematics - Special issue on iterative methods for linear equations
Relations Between Galerkin and Norm-Minimizing Iterative Methodsfor Solving Linear Systems
SIAM Journal on Matrix Analysis and Applications
An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
SIAM Journal on Matrix Analysis and Applications
Iterative solution of linear systems in the 20th century
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
Guest Editors' Introduction: The Top 10 Algorithms
Computing in Science and Engineering
Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
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
A comparative study of iterative solutions to linear systems arising in quantum mechanics
Journal of Computational Physics
A new family of global methods for linear systems with multiple right-hand sides
Journal of Computational and Applied Mathematics
The BiCOR and CORS Iterative Algorithms for Solving Nonsymmetric Linear Systems
SIAM Journal on Scientific Computing
Solution of generalized shifted linear systems with complex symmetric matrices
Journal of Computational Physics
A generalized product-type BiCOR method and its application in signal deconvolution
Computers & Mathematics with Applications
Hi-index | 31.46 |
Motivated by the celebrated extending applications of the well-established complex Biconjugate Gradient (CBiCG) method to deal with large three-dimensional electromagnetic scattering problems by Pocock and Walker [M.D. Pocock, S.P. Walker, The complex Bi-conjugate Gradient solver applied to large electromagnetic scattering problems, computational costs, and cost scalings, IEEE Trans. Antennas Propagat. 45 (1997) 140-146], three Lanczos-type variants of the recent Conjugate A-Orthogonal Conjugate Residual (COCR) method of Sogabe and Zhang [T. Sogabe, S.-L. Zhang, A COCR method for solving complex symmetric linear systems, J. Comput. Appl. Math. 199 (2007) 297-303] are explored for the solution of complex nonsymmetric linear systems. The first two can be respectively considered as mathematically equivalent but numerically improved popularizing versions of the BiCR and CRS methods for complex systems presented in Sogabe's Ph.D. Dissertation. And the last one is somewhat new and is a stabilized and more smoothly converging variant of the first two in some circumstances. The presented algorithms are with the hope of obtaining smoother and, hopefully, faster convergence behavior in comparison with the CBiCG method as well as its two corresponding variants. This motivation is demonstrated by numerical experiments performed on some selective matrices borrowed from The University of Florida Sparse Matrix Collection by Davis.