An adaptive Richardson iteration method for indefinite linear systems
From MaRDI portal
Recommendations
Cites work
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A study of semiiterative methods for nonsymmetric systems of linear equations
- A Taxonomy for Conjugate Gradient Methods
- Adaptive Richardson iteration based on Leja points
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Bounds for the error of linear systems of equations using the theory of moments
- Calculation of Gauss Quadrature Rules
- Chebyshev polynomials for disjoint compact sets
- Computing interior eigenvalues of large matrices
- Estimates of Eigenvalues for Iterative Methods
- Extremal polynomials associated with a system of curves in the complex plane
- Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
- scientific article; zbMATH DE number 3649907 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 592764 (Why is no real title available?)
- scientific article; zbMATH DE number 3034777 (Why is no real title available?)
- Iterative methods for solving operator equations with a spectrum contained in several intervals
- Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals
- Leapfrog variants of iterative methods for linear algebraic equations
- On Generating Orthogonal Polynomials
- On Hybrid Semi-Iterative Methods
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
- On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Some Modified Matrix Eigenvalue Problems
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- The application of Leja points to Richardson iteration and polynomial preconditioning
Cited in
(18)- A stable Richardson iteration method for complex linear systems
- A hybrid iterative method for symmetric indefinite linear systems
- Solution of infinite linear systems by automatic adaptive iterations
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- A hybrid iterative method for symmetric positive definite linear systems
- Adaptive Richardson iteration based on Leja points
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Synthesis of fast and superfast solvers of large systems of linear algebraic equations using control theory methods
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- scientific article; zbMATH DE number 1941950 (Why is no real title available?)
- Adaptive Preconditioned Variational Methods For Solving Self-Adjoint Partial Differential Equations
- scientific article; zbMATH DE number 749845 (Why is no real title available?)
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Application of the Richardson method in case of the unknown lower bound of a problem spectrum
- Generalisation of a quadrilateral duality theorem
- An iterative method with error estimators
- Implementation of an adaptive algorithm for Richardson's method
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
This page was built for publication: An adaptive Richardson iteration method for indefinite linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921324)
