Fast approximate solution of large scale sparse linear systems

DOI10.1016/0377-0427(84)90068-2zbMath0529.65064OpenAlexW1983893058MaRDI QIDQ787657

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 resultsfinite elementbest approximationlocal operatorapproximate inverse

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• 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
• A gradient computational procedure for the solution of large problems arising from the finite element discretization method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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