An extension of the conjugate residual method to nonsymmetric linear systems

DOI10.1016/j.cam.2008.05.018zbMath1170.65026OpenAlexW2009461808MaRDI QIDQ1008670

Masaaki Sugihara, Shao-Liang Zhang, Tomohiro Sogabe

Publication date: 30 March 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.05.018

zbMATH Keywords

convergencenumerical examplesconjugate gradient methodKrylov subspace methodLanczos algorithmbi-conjugate gradient methodsparse linear systemcoupled two-term recurrencesnonsymmetric linear systemsconjugate residual method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (30)

Variants of the groupwise update strategy for short-recurrence Krylov subspace methods ⋮ BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems ⋮ A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems ⋮ Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides ⋮ Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ Lanczos-type variants of the COCR method for complex nonsymmetric linear systems ⋮ A generalized product-type BiCOR method and its application in signal deconvolution ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ BiCR-type methods for families of shifted linear systems ⋮ A matrix CRS iterative method for solving a class of coupled Sylvester-transpose matrix equations ⋮ Matrix iteration algorithms for solving the generalized Lyapunov matrix equation ⋮ Preconditioning complex symmetric linear systems ⋮ A comparative study of iterative solutions to linear systems arising in quantum mechanics ⋮ Solution of generalized shifted linear systems with complex symmetric matrices ⋮ Tensor product-type methods for solving Sylvester tensor equations ⋮ Structure preserving subspace methods for the general coupled discrete-time periodic matrix equation and its application in antilinear periodic system ⋮ Converting BiCR method for linear equations with complex symmetric matrices ⋮ Structure Preserving Quaternion Biconjugate Gradient Method ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ Extending BiCG and BiCR methods to solve the Stein tensor equation ⋮ A new family of global methods for linear systems with multiple right-hand sides ⋮ Developing CRS iterative methods for periodic Sylvester matrix equation ⋮ A new iterative method for solving complex symmetric linear systems ⋮ Developing iterative algorithms to solve Sylvester tensor equations ⋮ An improved GBPi-CG algorithm suitable for distributed parallel computing ⋮ A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems ⋮ BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices ⋮ Improvement of the accuracy of the approximate solution of the Block BiCR method ⋮ Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product ⋮ A novel class of block methods based on the blockAA^T-Lanczos bi-orthogonalization process for matrix equations

Uses Software

• Bi-CG
• ITSOL
• GpBiCg
• SPARSKIT
• CGS
• Harwell-Boeing sparse matrix collection
• ILUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A COCR method for solving complex symmetric linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
• Splitting iteration methods for non-Hermitian positive definite systems of linear equations
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• Structured preconditioners for nonsingular matrices of block two-by-two structures
• On successive-overrelaxation acceleration of the Hermitian and skew-Hermitian splitting iterations
• A numerical study of various algorithms related to the preconditioned conjugate gradient method
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Solution of Sparse Indefinite Systems of Linear Equations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A Comparison of Three Basic Conjugate Direction Methods
• Variants of BICGSTAB for Matrices with Complex Spectrum
• A Family of Quasi-Minimal Residual Methods for Nonsymmetric Linear Systems
• A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
• GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
• Parallel Preconditioning with Sparse Approximate Inverses
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
• Iterative Krylov Methods for Large Linear Systems
• ILUT: A dual threshold incomplete LU factorization
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Methods of conjugate gradients for solving linear systems

This page was built for publication: An extension of the conjugate residual method to nonsymmetric linear systems