Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Efficient C1 Bernstein Quasi-Trefftz Discretization for Heterogeneous High-Frequency Helmholtz Problems

Abstract

We develop an efficient C1 Bernstein quasi-Trefftz discretization for heterogeneous high-frequency Helmholtz problems on unstructured triangular meshes. The method first imposes strong C1 continuity through Bernstein--Bézier smoothness relations on local macro-patches and then reduces the resulting conforming polynomial space by enforcing projected Helmholtz residual constraints. On two-triangle patches, this compresses the local dimension from quadratic growth in the polynomial degree to a trace-sized space of dimension 2p+1 under the natural rank condition. Variable matrix-valued coefficients are handled through local polynomial projection, allowing coefficient-approximation effects to be separated from discretization error. A graph-residual formulation couples the reduced patch spaces and produces a sparse global system in compressed coordinates. The implementation combines explicit C1 continuation, batched coefficient projection, batched residual construction, and stable local kernel extraction by QR factorization. Numerical experiments on heterogeneous unstructured meshes demonstrate high-order accuracy, roundoff-level C1 conformity, robust high-frequency resolution, and substantial reductions in local and global computational cost. Turning-point and penetrable-scattering examples further illustrate the flexibility of the approach.

Related

  1. Cartesian PML truncation for the Helmholtz equation is exponentially accurate at high frequency
    Martin Averseng, Jeffrey Galkowski, Euan A. Spence
    arXivPreprintarXiv licenceFull textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  2. An unstructured finite-volume Helmholtz method with perfectly matched layers for heterogeneous two-phase acoustics
    Chuanchao Xu, Jun Liu, Jan Helge Dörsam +3
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingComputational physicsarXiv
  3. A time explicit multiscale framework for heterogeneous elastic wave propagation based on multipoint stress discretization
    Xiang Zhong, Eric T. Chung, Shubin Fu
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  4. Robust edge multiscale space based hybrid Schwarz preconditioner for high-frequency Helmholtz problems
    Shubin Fu, Shihua Gong, Guanglian Li +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Two-level hybrid Schwarz preconditioners with preasymptotic piecewise-polynomial coarse spaces for the high-frequency Helmholtz equation
    Jeffrey Galkowski, Euan A. Spence, Pierre-Henri Tournier
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{kapita2026efficient,
  title = {{Efficient $C^1$ Bernstein Quasi-Trefftz Discretization for Heterogeneous High-Frequency Helmholtz Problems}},
  author = {Shelvean Kapita},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.05849},
  eprint = {2609.05849},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.05849},
}
RIS
TY  - UNPB
TI  - Efficient C^1 Bernstein Quasi-Trefftz Discretization for Heterogeneous High-Frequency Helmholtz Problems
AU  - Shelvean Kapita
PY  - 2026
DA  - 2026/09/05
PB  - arXiv
DO  - 10.48550/arxiv.2609.05849
UR  - https://arxiv.org/abs/2609.05849
AB  - We develop an efficient C^1 Bernstein quasi-Trefftz discretization for heterogeneous high-frequency Helmholtz problems on unstructured triangular meshes. The method first imposes strong C^1 continuity through Bernstein--Bézier smoothness relations on local macro-patches and then reduces the resulting conforming polynomial space by enforcing projected Helmholtz residual constraints. On two-triangle patches, this compresses the local dimension from quadratic growth in the polynomial degree to a trace-sized space of dimension 2p+1 under the natural rank condition. Variable matrix-valued coefficients are handled through local polynomial projection, allowing coefficient-approximation effects to be separated from discretization error. A graph-residual formulation couples the reduced patch spaces and produces a sparse global system in compressed coordinates. The implementation combines explicit C^1 continuation, batched coefficient projection, batched residual construction, and stable local kernel extraction by QR factorization. Numerical experiments on heterogeneous unstructured meshes demonstrate high-order accuracy, roundoff-level C^1 conformity, robust high-frequency resolution, and substantial reductions in local and global computational cost. Turning-point and penetrable-scattering examples further illustrate the flexibility of the approach.
ER  -