Enriched Holomorphic Neural Networks for 2D and 3D Laplace Problems
Organizations: University of Amsterdam · Technical University of Denmark
Abstract
Boundary-value problems for the Laplace equation develop singular behaviour near corners, edges and junctions that smooth approximators resolve poorly. We combine holomorphic neural networks with singular functions derived from the local geometry and boundary conditions. The representation is harmonic by construction, so no interior residual is needed: the network fits the smooth remainder from boundary data alone, and the enrichment terms capture the singular behaviour. Singular exponents are trainable, so the construction also applies when the local expansion is not known in advance. We extend the approach to three dimensions using independent networks evaluated along complex null directions. The enriched model is the most accurate tested method on every problem. Its margin is several orders of magnitude where the enrichment captures the singularity exactly, and a factor of about 1.7-2.1 over the next-best method on a CdZnTe radiation detector with many singular sites, in both two and three dimensions.
Figures & tables
| Junction | Local solution | Term | |
| Dirichlet to Neumann | , | ||
| Both Dirichlet, value jump | |||
| Both Neumann, flux jump, | |||
| Both Neumann, equal flux, | , | ||
| Both Dirichlet, equal values, | , | ||
| Otherwise | away from vertex | bounded | none |
| Problem | MLP PINN | Plain | Enriched |
|---|---|---|---|
| Closed-form solution | |||
| Sector | |||
| Sector | |||
| L-shape | |||
| Slit disk | |||
| Series reference | |||
| Problem | PINN | Deep Ritz | WAN | Ballini et al. | Enriched |
|---|---|---|---|---|---|
| Closed-form solution | |||||
| L-prism | |||||
| Smooth cube | |||||
| Series reference | |||||
Appendix figures & tables12 assets
Supplementary material from the paper’s appendix.
Appendix
| Problem | Domain | Reference | |
|---|---|---|---|
| Sector | , | exact | |
| Sector | , | exact | |
| L-shape | exact | ||
| Slit disk | cut along , | exact | |
| Motz | |||
| Cracked beam |
| Motz | Cracked beam | |||
|---|---|---|---|---|
| error | error | |||
| 1 | ||||
| 4 | ||||
| 8 | ||||
| 12 | ||||
| Model | MSE | RMSE |
|---|---|---|
| MLP PINN | ||
| Plain | ||
| Enriched |
| Configuration | Boundary loss | Ratio | Converged | Time (s) |
|---|---|---|---|---|
| starting configuration | 1.00 | 3/18 | 402 | |
| depth 2 | 0.03 | 7/18 | 280 | |
| learning rate 0.01 | 0.14 | 7/18 | 381 | |
| Adam steps 40 000 | 0.41 | 5/18 | 644 | |
| width 16 | 0.42 | 7/18 | 275 | |
| points per segment 1 024 | 0.43 | 6/18 | 645 |
| Terms | Smallest gap | Spurious | ||
|---|---|---|---|---|
| 1 | – | 0 | ||
| 2 | ||||
| 3 | ||||
| 4 | ||||
| 6 | ||||
| 8 |
| Setting | Value |
|---|---|
| Branches / hidden layers / width | |
| Adam steps | 120,000, learning rate , cosine decay |
| Maximum L-BFGS iterations | 4,000 |
| Uniform boundary samples | 1,536 per face (1,024 on the detector) |
| Near-site samples | 128 per site, to of the local length |
| Restarts | 3 per seed, selected on a fresh boundary sample |
| Problem | Seed 0 | Seed 1 | Seed 2 |
|---|---|---|---|
| L-prism | |||
| Smooth cube | |||
| Conical notch | |||
| Extruded Motz |
Neural PDE Solvers
Neural PDE solvers use trainable models to approximate solutions or solution operators for partial differential equations, often with physical constraints.
See all 271 papers