A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
From MaRDI portal
Publication:349806
DOI10.1016/j.jcp.2015.03.013zbMath1349.65125OpenAlexW2064393042MaRDI QIDQ349806
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2015.03.013
Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (2)
A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\) ⋮ A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized product-type BiCOR method and its application in signal deconvolution
- An iterative method for the Helmholtz equation
- A comparative study of iterative solutions to linear systems arising in quantum mechanics
- A breakdown-free Lanczos type algorithm for solving linear systems
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- A COCR method for solving complex symmetric linear systems
- An extension of the conjugate residual method to nonsymmetric linear systems
- An analysis of the composite step biconjugate gradient method
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- New look-ahead Lanczos-type algorithms for linear systems
- A hybrid variant of the BiCOR method for a nonsymmetric linear system with a complex spectrum
- A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- A Framework for Deflated and Augmented Krylov Subspace Methods
- The university of Florida sparse matrix collection
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
- The BiCOR and CORS Iterative Algorithms for Solving Nonsymmetric Linear Systems
- Iterative Solution of Skew-Symmetric Linear 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
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- 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
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Composite Step Product Methods for Solving Nonsymmetric Linear Systems
- ILUT: A dual threshold incomplete LU factorization
- Deflated and Augmented Krylov Subspace Methods: A Framework for Deflated BiCG and Related Solvers
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Algorithm 937
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
