Abstract
In §9.2.2 it was shown that the matrices arising from finite element discretisations (in what follows called the finite element matrices) are not only sparse but also belong to the \(\mathcal{H}\)-matrix set \(\mathcal{H}(r, P)\) for all \( r \in {_0} \), where P is the standard partition. This allows us to consider all finite element matrices as hierarchical matrices. In particular, no truncation is needed to use a finite element matrix as an input parameter for the inversion or for the LU algorithm.
In Section 11.1 we discuss the inverse of the mass matrix. Using tools from §9.5, we show that the inverse can be approximated by a hierarchical matrix. This result is required in the later analysis.
Section 11.2 is concerned with the continuous and discrete Green operator.
The analysis of the Green function in Section 11.3 yields the \(\mathcal{H}\)-matrix property of the inverse finite element matrix.
The results of this chapter have been improved by recent contributions mentioned in Section 11.4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hackbusch, W. (2015). Applications to Finite Element Matrices. In: Hierarchical Matrices: Algorithms and Analysis. Springer Series in Computational Mathematics, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47324-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-47324-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47323-8
Online ISBN: 978-3-662-47324-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)