On the use of rational iterative methods for solving large sparse linear systems
DOI10.1016/0168-9274(92)90044-EzbMath0756.65051MaRDI QIDQ1195363
David M. Young, Bi Roubolo Vona
Publication date: 25 October 1992
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
numerical experimentsconvergence ratefinite difference methodslarge sparse linear systemsChebyshev accelerationpolynomial accelerationrational iterationconjugate gradient accelerationmultilevel implementationnonsingular preconditioning matrixvector and parallel supercomputers
Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On Higher Order Stable Implicit Methods for Solving Parabolic Partial Differential Equations
- Alternating Direction Implicit Methods
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- An Alternating-Direction-Implicit Iteration Technique