Skip to content
DraconiticResearch
Search Sources API
206,690 studies31 sourcesUpdated 36 min ago
PreprintarXiv licencearXiv

An approximation for solutions to Helmholtz equation in polygons and its application in learning based numerical method

Abstract

A learning based method for Helmholtz equations was proposed in [J. Comput. Phys. 520:113478,2025]. Based on Runge's approximation, it can be proved that when the solution can be continued outside the computational domain, using fundamental solutions as learning samples is sufficient to obtain the solution mapping with spectral accuracy. However, for complex geometries, such as domains with corners, approximation by fundamental solutions may only have logarithmic convergence due to the regularity issue, which is computationally impracticable. Moreover, approximation of a solution to the elliptic equation with those on larger domains is an ill-posed problem. In this work, we investigate how to feed additional learning samples to essentially get a practicable convergence rate and a stable algorithm, so as to ensure the generalizability of the learning based method. Error analysis and numerical examples illustrate flexibility and high-accuracy features.

Related

  1. On solutions of the modified Helmholtz equation in a planar domain
    Alexander I. Nazarov
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. Numerical approximation of probabilistically strong solutions to the stochastic harmonic map heat flow
    Robert Lasarzik, Stefan Metzger, Maximilian E. V. Reiter
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. Mesh-Free Numerical Approximation of the Biharmonic Equation via Optimized Kolmogorov--Arnold Neural Networks
    B. Veena S. N. Rao
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  4. On the Existence, Uniqueness, and Numerical Solutions of a Time-Fractional Pseudo-Parabolic Equation Under Periodic Boundary Conditions
    İrem Çay, İrem Bağlan, Ḣüseyin Budak +1
    Fractal and FractionalPeer-reviewedCC BY 4.0Analysis & PDEsCrossref
  5. 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
BibTeX
@misc{chen2026approximation,
  title = {{An approximation for solutions to Helmholtz equation in polygons and its application in learning based numerical method}},
  author = {Yu Chen and Jin Cheng},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.12506},
  eprint = {2611.12506},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.12506},
}
RIS
TY  - UNPB
TI  - An approximation for solutions to Helmholtz equation in polygons and its application in learning based numerical method
AU  - Yu Chen
AU  - Jin Cheng
PY  - 2026
DA  - 2026/11/09
PB  - arXiv
DO  - 10.48550/arxiv.2611.12506
UR  - https://arxiv.org/abs/2611.12506
AB  - A learning based method for Helmholtz equations was proposed in [J. Comput. Phys. 520:113478,2025]. Based on Runge's approximation, it can be proved that when the solution can be continued outside the computational domain, using fundamental solutions as learning samples is sufficient to obtain the solution mapping with spectral accuracy. However, for complex geometries, such as domains with corners, approximation by fundamental solutions may only have logarithmic convergence due to the regularity issue, which is computationally impracticable. Moreover, approximation of a solution to the elliptic equation with those on larger domains is an ill-posed problem. In this work, we investigate how to feed additional learning samples to essentially get a practicable convergence rate and a stable algorithm, so as to ensure the generalizability of the learning based method. Error analysis and numerical examples illustrate flexibility and high-accuracy features.
ER  -