Preconditioned steepest descent-like methods for symmetric indefinite systems
From MaRDI portal
(Redirected from Publication:331173)
Abstract: This paper addresses the question of what exactly is an analogue of the preconditioned steepest descent (PSD) algorithm in the case of a symmetric indefinite system with an SPD preconditioner. We show that a basic PSD-like scheme for an SPD-preconditioned symmetric indefinite system is mathematically equivalent to the restarted PMINRES, where restarts occur after every two steps. A convergence bound is derived. If certain information on the spectrum of the preconditioned system is available, we present a simpler PSD-like algorithm that performs only one-dimensional residual minimization. Our primary goal is to bridge the theoretical gap between optimal (PMINRES) and PSD-like methods for solving symmetric indefinite systems, as well as point out situations where the PSD-like schemes can be used in practice.
Recommendations
- scientific article; zbMATH DE number 176174
- Conjugate gradient and minimal residual method for solving symmetric indefinite systems
- Absolute value preconditioning for symmetric indefinite linear systems
- Pre-symmetric approach and applications to indefinite non-symmetric problems
- A Preconditioned Iterative Method for Saddlepoint Problems
Cites work
- scientific article; zbMATH DE number 437444 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1561761 (Why is no real title available?)
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- A Multigrid Tutorial, Second Edition
- A generalized conjugate gradient, least square method
- Absolute value preconditioning for symmetric indefinite linear systems
- An iterative method for the Helmholtz equation
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- Computing interior eigenvalues of large matrices
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- Fast Iterative Solution of Stabilised Stokes Systems. Part I: Using Simple Diagonal Preconditioners
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
- Iterative Solution Methods
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- Optimal solvers for PDE-constrained optimization
- Parallel iterative methods for sparse linear systems
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. II. Interior eigenvalues
- Solution of Sparse Indefinite Systems of Linear Equations
- Steepest Descent and Conjugate Gradient Methods with Variable Preconditioning
- Steepest descent, CG, and iterative regularization of ill-posed problems
- The rate of convergence of the method of steepest descent in a Euclidean norm
Cited in
(7)- Minimum residual Hermitian and skew-Hermitian splitting iteration method for non-Hermitian positive definite linear systems
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- Pre-symmetric approach and applications to indefinite non-symmetric problems
- Absolute value preconditioning for symmetric indefinite linear systems
- Minimum residual modified HSS iteration method for a class of complex symmetric linear systems
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- Improved CRI iteration methods for a class of complex symmetric linear systems
This page was built for publication: Preconditioned steepest descent-like methods for symmetric indefinite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331173)
