On sparse and compact preconditioned conjugate gradient methods for partial differential equations
DOI10.1080/00207168108803228zbMath0454.65023OpenAlexW2157752572MaRDI QIDQ3902396
David J. Evans, Elias A. Lipitakis, Nikolaos M. Missirlis
Publication date: 1981
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168108803228
conjugate gradient methodpositive definitenesssplittingfactorizationirreducibilitydiagonal dominancepreconditioning techniquesconditioning matrixconsistent ordering
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A normalised algorithm for the solution of symmetric general five-term linear systems of semi-bandwidth M
- A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations
- On the accelerated SSOR method for solving large linear systems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Relaxation bei komplexen Matrizen
- A class of first order factorization methods
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
- The Extrapolated Modified Aitken Iteration Method for Solving Elliptic Difference Equations
This page was built for publication: On sparse and compact preconditioned conjugate gradient methods for partial differential equations