Implementation strategies for block recursive factorizations

Robert Beauwens

Mathematics and Computers in Simulation (MATCOM), 1999, vol. 50, issue 1, 31-41

Abstract: Recent advances have shown that block recursive approximate factorizations provide among the best preconditioners for solving elasticity equations on large 3D meshes such as arising in geomechanical applications. However, to get full efficiency of these methods, a wide range of implementation strategies need be put into work. In this contribution, we attempt to survey these strategies and explain their purpose. This includes level orderings and fill-in strategies, diagonal and offdiagonal relaxation, graph perturbations, reduction techniques, W-cycles and smoothing steps.

Keywords: Iterative methods; Preconditioning; Incomplete factorizations; Stieltjes matrices; Conjugate gradients (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475499000592
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:50:y:1999:i:1:p:31-41

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().