Fast approximate solution of large scale sparse linear systems

DOI10.1016/0377-0427(84)90068-2zbMATH Open0529.65064OpenAlexW1983893058MaRDI QIDQ787657FDOQ787657

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The speed of convergence of one iterative process
• Title not available (Why is that?)
• Generalized series solution of an almost periodic differential equation
• 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

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)