Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
From MaRDI portal
Publication:843497
DOI10.1016/j.jcp.2009.05.022zbMath1173.65316OpenAlexW2145097673MaRDI QIDQ843497
Zhi-Gang Ren, Yong Zhang, Bruno Carpentieri, Guang-Hui Cheng, Yong Duan, Yan-Fei Jing, Liang Li, Ting-Zhu Huang, Tomohiro Sogabe
Publication date: 12 October 2009
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2009.05.022
Related Items (21)
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 ⋮ The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems ⋮ 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 ⋮ 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 ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ A new family of global methods for linear systems with multiple right-hand sides ⋮ A new iterative method for solving complex symmetric linear systems ⋮ A hybrid-mesh hybridizable discontinuous Galerkin method for solving the time-harmonic Maxwell's equations ⋮ A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems ⋮ Flexible and deflated variants of the block shifted GMRES method ⋮ Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations ⋮ Restarted simpler GMRES augmented with harmonic Ritz vectors and approximate errors ⋮ A novel class of block methods based on the blockAAT-Lanczos bi-orthogonalization process for matrix equations ⋮ A simpler GMRES and its adaptive variant for shifted linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
- Padé-type approximation and general orthogonal polynomials
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- A COCR method for solving complex symmetric linear systems
- An extension of the conjugate residual method to nonsymmetric linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Hybrid procedures for solving linear systems
- A generalized nonsymmetric Lanczos procedure
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- Iterative solution of linear systems in the 20th century
- Complex conjugate gradient methods
- Preconditioning techniques for large linear systems: A survey
- A theoretical overview of Krylov subspace methods
- An overview of approaches for the stable computation of hybrid BiCG methods
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Residual smoothing and peak/plateau behavior in Krylov subspace methods
- Recent computational developments in Krylov subspace methods for linear systems
- Geometric aspects of the theory of Krylov subspace methods
- Conjugate Gradient Type Methods for Indefinite, Asymmetric, and Complex Systems
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Reduction to Tridiagonal Form and Minimal Realizations
- Solution of Sparse Indefinite Systems of Linear Equations
- Variants of BICGSTAB for Matrices with Complex Spectrum
- Residual Smoothing Techniques for Iterative Methods
- Properties of generalized conjugate gradient methods
- An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
- A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Iterative Krylov Methods for Large Linear Systems
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Methods of conjugate gradients for solving linear systems
- Residual smoothing techniques: Do they improve the limiting accuracy of iterative solvers?
- By how much can residual minimization accelerate the convergence of orthogonal residual methods?
This page was built for publication: Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
