Multilevel preconditioning of graph-Laplacians: Polynomial approximation of the pivot blocks inverses

P. Boyanova, I. Georgiev, S. Margenov and L. Zikatanov

Mathematics and Computers in Simulation (MATCOM), 2012, vol. 82, issue 10, 1964-1971

Abstract: We consider the discrete system resulting from mixed finite element approximation of a second-order elliptic boundary value problem with Crouzeix–Raviart non-conforming elements for the vector valued unknown function and piece-wise constants for the scalar valued unknown function. Since the mass matrix corresponding to the vector valued variables is diagonal, these unknowns can be eliminated exactly. Thus, the problem of designing an efficient algorithm for the solution of the resulting algebraic system is reduced to one of constructing an efficient algorithm for a system whose matrix is a graph-Laplacian (or weighted graph-Laplacian).

Keywords: Preconditioning; AMLI; polynomial matrix approximation (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475412001449
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:82:y:2012:i:10:p:1964-1971

DOI: 10.1016/j.matcom.2012.06.009

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 ().