Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners

DOI10.1137/040611781zbMath1180.65145OpenAlexW2073772681MaRDI QIDQ3654409

Erik G. Boman, Stephen A. Vavasis, Bruce A. Hendrickson

Publication date: 6 January 2010

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040611781

zbMATH Keywords

finite elementsnumerical examplespreconditioningdiagonal dominancematrix algorithmlinear elliptic problemssupport graph

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) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items

Nonobtuse triangulations of PSLGs ⋮ Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices ⋮ Advances in metric embedding theory ⋮ Engineering a combinatorial Laplacian solver: lessons learned ⋮ On three classes of matrices with variants of the diagonal dominance property ⋮ Randomized linear algebra for model reduction. I. Galerkin methods and error estimation ⋮ RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems

Uses Software

• TAUCS
• Triangle