Metraipolis › archive › dc_787fdbbe740f

Mapped Multi-Patch Spectral Extreme Learning Machine for Partial Differential Equations — arXiv:2609.31909

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31909
License (as archived)
CC0-1.0
Archived
2026-10-07T23:25:04.616Z
SHA-256 of the archived text
8d9a9df94bd234f8a9f5aced672c5476415b0404578e8bacd76bc450edcaa74b
Stable URL of this page
https://metraipolis.com/documento/dc_787fdbbe740f

How to cite

Mapped Multi-Patch Spectral Extreme Learning Machine for Partial Differential Equations — arXiv:2609.31909 — arXiv (en), https://arxiv.org/abs/2609.31909 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_787fdbbe740f (Metraipolis archive dc_787fdbbe740f, sha256 8d9a9df94bd234f8a9f5aced672c5476415b0404578e8bacd76bc450edcaa74b)
BibTeX
@misc{dc787fdbbe740f,
  title = {Mapped Multi-Patch Spectral Extreme Learning Machine for Partial Differential Equations — arXiv:2609.31909},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31909},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_787fdbbe740f; sha256 8d9a9df94bd234f8a9f5aced672c5476415b0404578e8bacd76bc450edcaa74b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31909. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study a fixed-feature solver, referred to as Spectral-ELM, in which Chebyshev--Gauss--Lobatto (CGL) differentiation matrices are applied to the nodal values of an extreme learning machine (ELM) trial function. Curved domains are treated using a mapped multi-patch formulation. Each curved quadrilateral patch is represented as the image of a reference square, physical derivatives are computed from the associated metric terms, and adjacent patches are coupled by enforcing continuity of the solution and its normal flux. Local QR orthogonalization is used to reduce near-linear dependence among the discrete features. The numerical study includes comparisons with direct CGL collocation, an analytically differentiated ELM, a global Random Feature Method, and a TransNet sampling strategy. It also includes a matched KdV test, a small three-dimensional example, and a Poisson problem on a curved domain containing a hole. For a smooth elliptic problem on a square, direct CGL collocation gives the smallest error. When applied to the same fixed-feature trial space, spectral and analytic differentiation produce comparable errors. For the curved-domain problem, mapped direct CGL collocation and mapped Spectral-ELM achieve similar accuracy with comparable numbers of unknowns. The present formulation is particularly well suited to smooth PDEs in one to three dimensions, where tensor-product grids enable accurate high-order discretizations, while sparse-grid and dimension-adaptive strategies offer promising directions for extension to higher-dimensional problems.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.31909 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:04:09.424Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).