A sparse hierarchical hp-finite element method on disks and annuli
File(s)s10915-025-02964-4.pdf (2.94 MB)
Published version
Author(s)
Papadopoulos, Ioannis
Olver, Sheehan
Type
Journal Article
Abstract
We develop a sparse hierarchical hp-finite element method (hp-FEM) for the Helmholtz equation with variable coefficients posed on a two-dimensional disk or annulus. The mesh is an inner disk cell (omitted if on an annulus domain) and concentric annuli cells. The discretization preserves the Fourier mode decoupling of rotationally invariant operators, such as the Laplacian, which manifests as block diagonal mass and stiffness matrices. Moreover, the matrices have a sparsity pattern
independent of the order of the discretization and admit an optimal complexity factorization. The sparse hp-FEM can handle radial discontinuities in the right-hand side and in rotationally invariant Helmholtz coefficients. Rotationally anisotropic coefficients that are approximated by low-degree polynomials in Cartesian coordinates also result in sparse linear systems. We consider examples
such as a high-frequency Helmholtz equation with radial discontinuities and rotationally anisotropic coefficients, singular source terms, the time-dependent Schr¨odinger equation, and an extension to a three-dimensional cylinder domain, with a quasi-optimal solve, via the Alternating Direction Implicit (ADI) algorithm.
independent of the order of the discretization and admit an optimal complexity factorization. The sparse hp-FEM can handle radial discontinuities in the right-hand side and in rotationally invariant Helmholtz coefficients. Rotationally anisotropic coefficients that are approximated by low-degree polynomials in Cartesian coordinates also result in sparse linear systems. We consider examples
such as a high-frequency Helmholtz equation with radial discontinuities and rotationally anisotropic coefficients, singular source terms, the time-dependent Schr¨odinger equation, and an extension to a three-dimensional cylinder domain, with a quasi-optimal solve, via the Alternating Direction Implicit (ADI) algorithm.
Date Issued
2025-06-23
Date Acceptance
2025-06-05
Citation
Journal of Scientific Computing, 2025, 104
ISSN
0885-7474
Publisher
Springer
Journal / Book Title
Journal of Scientific Computing
Volume
104
Copyright Statement
© The Author(s) 2025 Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
License URL
Identifier
10.1007/s10915-025-02964-4
Publication Status
Published
Article Number
51
Date Publish Online
2025-06-23