On sparse and compact preconditioned conjugate gradient methods for partial differential equations

DOI10.1080/00207168108803228MaRDI QIDQ3902396zbMATH OpenOpenAlexFDO

Authors D. 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

zbMATH Keywords

conditioning matrixconjugate gradient methodconsistent orderingdiagonal dominancefactorizationirreducibilitypositive definitenesspreconditioning techniquessplitting

Mathematics Subject Classification ID

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)

Cites work

• A class of first order factorization methods
• 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
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• scientific article; zbMATH DE number 3161527 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3366440 (Why is no real title available?)
• Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
• On the accelerated SSOR method for solving large linear systems
• Relaxation bei komplexen Matrizen
• The Extrapolated Modified Aitken Iteration Method for Solving Elliptic Difference Equations
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations

Cited in

(2)

• Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
• A unified derivation for fast estimation algorithms by the conjugate direction method

This page was built for publication: On sparse and compact preconditioned conjugate gradient methods for partial differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902396)