High performance finite element approximate inverse preconditioning

DOI10.1016/j.amc.2007.12.023zbMath1148.65021OpenAlexW2078500815MaRDI QIDQ945249

George A. Gravvanis, Konstantinos M. Giannoutakis

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.12.023

zbMATH Keywords

numerical examplespreconditioningparallel algorithmssparse linear systemsconcurrent programmingiterative solution techniquesalgorithm design and analysisnumerical algorithms and problemsparallelism and concurrency

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) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

High performance inverse preconditioning ⋮ On the GPGPU parallelization issues of finite element approximate inverse preconditioning ⋮ Inversion and pseudoinversion of block arrowhead matrices ⋮ An efficient method for computing the inverse of arrowhead matrices

Cites Work

• Unnamed Item
• Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
• Approximate sparsity patterns for the inverse of a matrix and preconditioning
• Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
• Iterative solution of linear systems in the 20th century
• Preconditioning techniques for large linear systems: A survey
• Parallel Exact and Approximate Arrow-Type Inverses on Symmetric Multiprocessor Systems