Preconditioning complex symmetric linear systems
From MaRDI portal
Publication:1665980
DOI10.1155/2015/548609zbMath1394.65022arXiv1405.6297WikidataQ59119274 ScholiaQ59119274MaRDI QIDQ1665980
Marco Frego, Enrico Bertolazzi
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6297
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial preconditioner for the CMRH algorithm
- On preconditioned MHSS iteration methods for complex symmetric linear systems
- Base functions and discrete constitutive relations for staggered polyhedral grids
- On accuracy of approximation of the spectral radius by the Gelfand formula
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- A COCR method for solving complex symmetric linear systems
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
- Modified HSS iteration methods for a class of complex symmetric linear systems
- An extension of the conjugate residual method to nonsymmetric linear systems
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On a conjugate gradient-type method for solving complex symmetric linear systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Numerical methods in computational electrodynamics. Linear systems in practical applications
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Iteration number for the conjugate gradient method
- Preconditioning techniques for large linear systems: A survey
- Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
- Left-looking version of AINV preconditioner with complete pivoting strategy
- On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
- An Algebraic Multigrid Method with Guaranteed Convergence Rate
- The university of Florida sparse matrix collection
- Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning
- Polynomial Based Iteration Methods for Symmetric Linear Systems
- Adaptive Pattern Research for Block FSAI Preconditioning
- Direct Methods for Sparse Linear Systems
- Multi-frequency identification of defects in conducting media
- Polynomial Preconditioners for Conjugate Gradient Calculations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Minimax Polynomial Preconditioning for Hermitian Linear Systems
- A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Incomplete Cholesky Factorizations with Limited Memory
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- HSL_MI20 : An efficient AMG preconditioner for finite element problems in 3D
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
