A hybrid iterative method for symmetric indefinite linear systems
From MaRDI portal
Publication:1298504
DOI10.1016/S0377-0427(98)00048-XzbMath0927.65048MaRDI QIDQ1298504
Daniela Calvetti, Lothar Reichel
Publication date: 22 August 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
numerical examples; iterative method; symmetric indefinite matrix; conjugate residual method; Richardson iteration
65F10: Iterative numerical methods for linear systems
Related Items
Approximation on disjoint intervals and its applicability to matrix preconditioning, Matrices, moments, and rational quadrature
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orthogonal polynomials: Variable-signed weight functions
- The application of Leja points to Richardson iteration and polynomial preconditioning
- Computing interior eigenvalues of large matrices
- 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
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Hybrid procedures for solving linear systems
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- A hybrid iterative method for symmetric positive definite linear systems
- An adaptive Richardson iteration method for indefinite linear systems
- A Taxonomy for Conjugate Gradient Methods
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals
- Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
- Calculation of Gauss Quadrature Rules
