A stable Richardson iteration method for complex linear systems
From MaRDI portal
Publication:1100843
DOI10.1007/BF01396976zbMath0641.65030OpenAlexW2082492903MaRDI QIDQ1100843
Publication date: 1988
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133315
orderingstabilityrelaxation parametersFejér pointsoptimal asymptotic convergenceRichardson iteration method
Related Items (13)
Polynomial Preconditioned GMRES and GMRES-DR ⋮ Estimation of spectral bounds in gradient algorithms ⋮ On the generation of Krylov subspace bases ⋮ Pseudo Leja sequences ⋮ Numerical stability of the cyclic Richardson iteration ⋮ Chebyshev-Vandermonde Systems ⋮ The ordering of tridiagonal matrices in the cyclic reduction method for Poisson's equation ⋮ Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration ⋮ Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides ⋮ Iterative solution of linear systems in the 20th century ⋮ Accelerating the HS-type Richardson iteration method with Anderson mixing ⋮ The application of Leja points to Richardson iteration and polynomial preconditioning ⋮ 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
- Richardson's iteration for nonsymmetric matrices
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Numerical conformal mapping methods based on function conjugation
- A fast method for solving certain integral equations of the first kind with application to conformal mapping
- Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. (Iterative methods for nonsymmetric systems of equations and approximation methods in the complex domain)
- The Tchebychev iteration for nonsymmetric linear systems
- Riemann sums and the fundamental polynomials of Lagrange interpolation
- On the Construction of Semi-Iterative Methods
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
- A direct Method for the Discrete Solution of Separable Elliptic Equations
- Utilization of ordered chebyshev parameters in iterative methods
- On Fourier-Toeplitz Methods for Separable Elliptic Problems
- Conversion of FFT’s to Fast Hartley Transforms
This page was built for publication: A stable Richardson iteration method for complex linear systems
