The sparse product form of the inverse (spfi) and its use in iterative methods for solving linear systems

DOI10.1080/00207169008803878MaRDI QIDQ3486734zbMATH OpenOpenAlexFDO

Authors D. J. Evans

Publication date 1990

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803878

zbMATH Keywords

preconditioneriterative methodGauss-Jordan eliminationPoisson's equationblock tridiagonal matrixNumerical experimentssparse product form of the inverse

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Recommendations

• A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
• scientific article; zbMATH DE number 7616072
• scientific article; zbMATH DE number 1953446
• scientific article; zbMATH DE number 3874482
• An iterative solution method for solving sparse nonsymmetric linear systems
• scientific article; zbMATH DE number 991428
• scientific article; zbMATH DE number 4001313
• scientific article; zbMATH DE number 1153374
• Approximate inverse preconditionings for sparse linear systems

Cited in

(1)

• Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems.

This page was built for publication: The sparse product form of the inverse (spfi) and its use in iterative methods for solving linear systems

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