Metraipolis › archive › dc_edcea070a69b

SDC-GON: Singular Decomposition and Consistency-Regularized Green's Operator Networks for Solving Partial Differential Equations — arXiv:2609.23206

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23206
License (as archived)
CC0-1.0
Archived
2026-10-09T07:08:25.858Z
SHA-256 of the archived text
f9140800e179425c4f981ab33e7300496471768ca82e529b0de895a2b631166d
Stable URL of this page
https://metraipolis.com/documento/dc_edcea070a69b

How to cite

SDC-GON: Singular Decomposition and Consistency-Regularized Green's Operator Networks for Solving Partial Differential Equations — arXiv:2609.23206 — arXiv (en), https://arxiv.org/abs/2609.23206 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_edcea070a69b (Metraipolis archive dc_edcea070a69b, sha256 f9140800e179425c4f981ab33e7300496471768ca82e529b0de895a2b631166d)
BibTeX
@misc{dcedcea070a69b,
  title = {SDC-GON: Singular Decomposition and Consistency-Regularized Green's Operator Networks for Solving Partial Differential Equations — arXiv:2609.23206},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23206},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_edcea070a69b; sha256 f9140800e179425c4f981ab33e7300496471768ca82e529b0de895a2b631166d},
  year = {2026}
}

Archived text

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

Green's function based operator approximation offers an efficient route for solving linear partial differential equations under varying boundary conditions and source terms. Once the Green's function is learned, solutions for new configurations are obtained through integration rather than by solving the differential equation again. Existing Green's function learning methods face two structural challenges. The first is the singular behavior of the Green's function near the source point, which places a difficult approximation burden on neural networks. The second is the absence of explicit consistency between the learned Green's function and its gradient, although both quantities enter the integral solution representation directly. This work proposes SDC-GON, a Singular Decomposition and Consistency-Regularized Green's Operator Network that addresses both challenges within a unified framework. The Green's function is decomposed into an analytically known singular component and a smooth correction learned by the network, so that the neural approximation targets only the regular part of the response kernel. A self-consistency loss enforces agreement between the gradient and the autodifferentiation gradient of the smooth correction. The method is evaluated on two dimensional Poisson, three dimensional heat conduction, heterogeneous reaction diffusion, and Stokes benchmarks, consistently outperforming the compared baselines across all cases. On the heterogeneous pipe benchmark, SDC-GON achieves a testing error of $3.70\times10^{-4}$ with a smaller network architecture, compared with $9.60\times10^{-4}$ for the same-width baseline and $4.63\times10^{-4}$ for a larger configuration, demonstrating that structural improvements are more effective than increasing model size.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG).
Categorie arXiv: Systems and Control (eess.SY) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.23206 — 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-09T06:58:09.563Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).