|Publisher DOI:||10.1007/978-3-319-18827-0_57||Title:||Hierarchical preconditioners for high-order FEM||Language:||English||Authors:||Le Borne, Sabine||Issue Date:||1-Jan-2016||Publisher:||Springer||Source:||Lecture Notes in Computational Science and Engineering (104): 559-566 (2016-01-01)||Abstract (english):||
The finite element discretization of partial differential equations (PDEs) requires the selection of suitable finite element spaces. While high-order finite elements often lead to solutions of higher accuracy, their associated discrete linear systems of equations are often more difficult to solve (and to set up) compared to those of lower order elements. We will present and compare preconditioners for these types of linear systems of equations. More specifically, we will use hierarchical (H-) matrices to build block H-LU preconditioners. H-matrices provide a powerful technique to compute and store approximations to dense matrices in a data-sparse format. We distinguish between blackbox H-LU preconditioners which factor the entire stiffness matrix and hybrid methods in which only certain subblocks of the matrix are factored after some problem-specific information has been exploited.We conclude with numerical results.
|ISSN:||2197-7100||Institute:||Mathematik E-10||Document Type:||Chapter/Article (Proceedings)||Part of Series:||Lecture notes in computational science and engineering||Volume number:||104 LNCSE|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Sep 28, 2022
Add Files to Item
Note about this record
Cite this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.