A hierarchical preconditioner for wave problems in quasilinear complexity release_f3jbal7wazhupfqoajm3lsns6y

by Boris Bonev, Jan S. Hesthaven

Released as a article .

2021  

Abstract

The paper introduces a novel, hierarchical preconditioner based on nested dissection and hierarchical matrix compression. The preconditioner is intended for continuous and discontinuous Galerkin formulations of elliptic problems. We exploit the property that Schur complements arising in such problems can be well approximated by hierarchical matrices. An approximate factorization can be computed matrix-free and in a (quasi-)linear number of operations. The nested dissection is specifically designed to aid the factorization process using hierarchical matrices. We demonstrate the viability of the preconditioner on a range of 2D problems, including the Helmholtz equation and the elastic wave equation. Throughout all tests, including wave phenomena with high wavenumbers, the generalized minimal residual method (GMRES) with the proposed preconditioner converges in a very low number of iterations. We demonstrate that this is due to the hierarchical nature of our approach which makes the high wavenumber limit manageable.
In text/plain format

Archived Files and Locations

application/pdf  6.0 MB
file_gdxz7duihvarfhojsi3l4eqi3a
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-05-17
Version   v1
Language   en ?
arXiv  2105.07791v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e1c47ee5-ef0b-4138-8047-08e39400b3f7
API URL: JSON