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 12 items.
- Estimation of spectral bounds in gradient algorithms (Q385581) (← links)
- On the generation of Krylov subspace bases (Q436007) (← 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)
- 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)
- Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides (Q5502423) (← links)