The application of Leja points to Richardson iteration and polynomial preconditioning
From MaRDI portal
Publication:808157
DOI10.1016/0024-3795(91)90386-BzbMath0731.65017MaRDI QIDQ808157
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
stabilitynumerical resultsLeja pointspolynomial preconditioningRichardson iterationasymptotic optimal convergencechoice of parameters
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport, Time-step sequences for parabolic differential equations, Incomplete partial fractions for parallel evaluation of rational matrix functions, A hybrid iterative method for symmetric positive definite linear systems, Adaptive Richardson iteration based on Leja points, An adaptive Richardson iteration method for indefinite linear systems, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, POLYNOMIALS WITH ZEROS ON THE UNIT CIRCLE: REGULARITY OF LEJA SEQUENCES, The Lebesgue constants for Leja points are subexponential, On finite dimension exchange algorithms., The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm, Parameter-invariant models for load balancing on heterogeneous networks, Approximation on disjoint intervals and its applicability to matrix preconditioning, Solving the Three-Dimensional High-frequency Helmholtz Equation Using Contour Integration and Polynomial Preconditioning, Ordering monomial factors of polynomials in the product representation, Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration, A hybrid iterative method for symmetric indefinite linear systems, Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, Implementation of an adaptive algorithm for Richardson's method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton interpolation at Leja points
- Richardson's iteration for nonsymmetric 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
- An optimum iterative method for solving any linear system with a square matrix
- A stable Richardson iteration method for complex linear systems
- The analysis of k-step iterative methods for linear systems from summability theory
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Polynomial approximation of functions of matrices and applications
- Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- On the Construction of Semi-Iterative Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On Hybrid Semi-Iterative Methods
- Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Utilization of ordered chebyshev parameters in iterative methods
- Selection of the iterative parameters in Richardson's method
- Solution of the parameter ordering problem in Chebyshev iterative methods
- Konstruktive Methoden der konformen Abbildung
- Iterative methods for solving operator equations with a spectrum contained in several intervals
- Ordering of the iterative parameters in the cyclical Chebyshev iterative method
- On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
- On the derivative of a polynomial
