Pages that link to "Item:Q1100843"
From MaRDI portal
The following pages link to A stable Richardson iteration method for complex linear systems (Q1100843):
Displaying 18 items.
- Estimation of spectral bounds in gradient algorithms (Q385581) (← links)
- On the generation of Krylov subspace bases (Q436007) (← links)
- Richardson method and totally nonnegative linear systems (Q603132) (← links)
- Efficient implementation of stable Richardson extrapolation algorithms (Q623172) (← links)
- Pseudo Leja sequences (Q666279) (← links)
- Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration (Q780410) (← links)
- The application of Leja points to Richardson iteration and polynomial preconditioning (Q808157) (← links)
- Implementation of an adaptive algorithm for Richardson's method (Q808615) (← links)
- Richardson's iteration for nonsymmetric matrices (Q1058810) (← links)
- An optimum iterative method for solving any linear system with a square matrix (Q1098228) (← links)
- Numerical stability of the cyclic Richardson iteration (Q1183037) (← links)
- The ordering of tridiagonal matrices in the cyclic reduction method for Poisson's equation (Q1262719) (← links)
- Iterative solution of linear systems in the 20th century (Q1591173) (← links)
- Accelerating the HS-type Richardson iteration method with Anderson mixing (Q2106864) (← links)
- Polynomial Preconditioned GMRES and GMRES-DR (Q3447459) (← links)
- Chebyshev-Vandermonde Systems (Q3980475) (← links)
- Algorithm of Competing Processes for the Richardson Iteration Method with the Chebyshev Parameters (Q5275002) (← links)
- Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides (Q5502423) (← links)
