Preconditioning complex symmetric linear systems (Q1665980): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104204395 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.6297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods in computational electrodynamics. Linear systems in practical applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base functions and discrete constitutive relations for staggered polyhedral grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-frequency identification of defects in conducting media / rank
 
Normal rank
Property / cites work
 
Property / cites work: A COCR method for solving complex symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjugate gradient-type method for solving complex symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining convergence properties of BiCGStab methods in finite precision arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos-type variants of the COCR method for complex nonsymmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified HSS iteration methods for a class of complex symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preconditioned MHSS iteration methods for complex symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of preconditioned iterative methods for linear systems of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning techniques for large linear systems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Polynomial Preconditioning for Hermitian Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Preconditioners for Conjugate Gradient Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Based Iteration Methods for Symmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial preconditioner for the CMRH algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On accuracy of approximation of the spectral radius by the Gelfand formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration number for the conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the conjugate residual method to nonsymmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate inverse preconditioning in the parallel solution of sparse eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the inverse of a matrix for use in iterative algorithms on vector processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Cholesky Factorizations with Limited Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Pattern Research for Block FSAI Preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Left-looking version of AINV preconditioner with complete pivoting strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tt>HSL_MI20</tt> : An efficient AMG preconditioner for finite element problems in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Multigrid Method with Guaranteed Convergence Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank

Latest revision as of 10:54, 16 July 2024

scientific article
Language Label Description Also known as
English
Preconditioning complex symmetric linear systems
scientific article

    Statements

    Preconditioning complex symmetric linear systems (English)
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: A new preconditioner for symmetric complex linear systems based on Hermitian and skew-Hermitian splitting (HSS) for complex symmetric linear systems is herein presented. It applies to conjugate orthogonal conjugate gradient (COCG) or conjugate orthogonal conjugate residual (COCR) iterative solvers and does not require any estimation of the spectrum of the coefficient matrix. An upper bound of the condition number of the preconditioned linear system is provided. To reduce the computational cost the preconditioner is approximated with an inexact variant based on incomplete Cholesky decomposition or on orthogonal polynomials. Numerical results show that the present preconditioner and its inexact variant are efficient and robust solvers for this class of linear systems. A stability analysis of the inexact polynomial version completes the description of the preconditioner.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers