Fast approximate solution of large scale sparse linear systems

DOI10.1016/0377-0427(84)90068-2MaRDI QIDQ787657zbMATH OpenOpenAlexFDO

Authors Hoon Liong Ong

Publication date 1984

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(84)90068-2

zbMATH Keywords

rate of convergencenumerical resultsbest approximationfinite elementapproximate inverselocal operator

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites work

• scientific article; zbMATH DE number 3114505 (Why is no real title available?)
• scientific article; zbMATH DE number 3141552 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3325215 (Why is no real title available?)
• scientific article; zbMATH DE number 3410718 (Why is no real title available?)
• A gradient computational procedure for the solution of large problems arising from the finite element discretization method
• Finite element solution to the second order elliptic problems
• Generalized series solution of an almost periodic differential equation
• The speed of convergence of one iterative process

Cited in

(4)

• Preconditioning techniques for large linear systems: A survey
• A generalization of the optimal diagonal approximate inverse preconditioner
• Optimal preconditioners of a given sparsity pattern
• Improving approximate inverses based on Frobenius norm minimization

This page was built for publication: Fast approximate solution of large scale sparse linear systems

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