A new iterative method for solving complex symmetric linear systems
From MaRDI portal
Publication:1735271
DOI10.1016/j.amc.2017.01.002zbMath1411.65056OpenAlexW2574821305MaRDI QIDQ1735271
Publication date: 28 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.01.002
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized product-type BiCOR method and its application in signal deconvolution
- On preconditioned MHSS iteration methods for complex symmetric linear systems
- Positive stable preconditioners for symmetric indefinite linear systems arising from Helmholtz equations
- 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
- Modified HSS iteration methods for a class of 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
- On a conjugate gradient-type method for solving complex symmetric linear systems
- An analysis of the composite step biconjugate gradient method
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- Complex conjugate gradient methods
- New look-ahead Lanczos-type algorithms for linear systems
- Iterative system solvers for the frequency analysis of linear mechanical systems
- On a class of preconditioners for solving the Helmholtz equation
- 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
- Comparison of multigrid and incomplete LU shifted-Laplace preconditioners for the inhomogeneous Helmholtz equation
- The university of Florida sparse matrix collection
- The BiCOR and CORS Iterative Algorithms for Solving Nonsymmetric Linear Systems
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Solution of Sparse Indefinite Systems of Linear Equations
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Composite Step Product Methods for Solving Nonsymmetric 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 Fast Algorithm for the Electromagnetic Scattering from a Large Cavity
- Generalized Conjugate A-Orthogonal Residual Squared Method for Complex Non-Hermitian Linear Systems
This page was built for publication: A new iterative method for solving complex symmetric linear systems