An adaptive Richardson iteration method for indefinite linear systems

DOI10.1007/BF02141745zbMath0858.65035OpenAlexW1997009346MaRDI QIDQ1921324

Daniela Calvetti, Lothar Reichel

Publication date: 11 August 1996

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02141745

zbMATH Keywords

comparison of methodsLanczos methodrelaxationlarge linear systemsconjugate residual methodsadaptive Richardson iteration methodsparse, symmetric, nonsingular indefinite matrixSYMMLQ

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items

A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems, Harmonic projection methods for large non-symmetric eigenvalue problems, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, An iterative method with error estimators, A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems, Synthesis of fast and superfast solvers of large systems of linear algebraic equations using control theory methods, A hybrid iterative method for symmetric indefinite linear systems, Generalisation of a quadrilateral duality theorem, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The application of Leja points to Richardson iteration and polynomial preconditioning
• On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
• Computing interior eigenvalues of large matrices
• A study of semiiterative methods for nonsymmetric systems of linear equations
• On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices
• Leapfrog variants of iterative methods for linear algebraic equations
• Chebyshev polynomials for disjoint compact sets
• Adaptive Richardson iteration based on Leja points
• Extremal polynomials associated with a system of curves in the complex plane
• Bounds for the error of linear systems of equations using the theory of moments
• A Taxonomy for Conjugate Gradient Methods
• Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
• Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
• Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals
• On Hybrid Semi-Iterative Methods
• Estimates of Eigenvalues for Iterative Methods
• Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
• On Generating Orthogonal Polynomials
• Solution of Sparse Indefinite Systems of Linear Equations
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Calculation of Gauss Quadrature Rules
• Iterative methods for solving operator equations with a spectrum contained in several intervals
• Some Modified Matrix Eigenvalue Problems