Fast Evaluation of Helmholtz Equation using Proper Orthogonal Decomposition and Neural Networks
Bibliographic record
Abstract
Summary Partial differential equations (PDEs) are fundamental in engineering and science, describing a wide range of physical phenomena. While analytical solutions exist for idealized conditions, most real-world cases require numerical methods like finite differences, finite elements, or finite volumes. These approaches, however, can be computationally intensive \citep{dai2019review}. Proper Orthogonal Decomposition (POD) offers a solution to reduce computational demands \citep{smith20051ow}. In POD, an offline stage computes high-fidelity solutions to derive a low-rank representation of the data (Reduced Basis). This transforms solving the PDE into a matrix-vector multiplication, significantly reducing computational costs. In this work, we assume we have an incomplete evaluation of the forward response, and we pose an inverse problem where the forward operator is the Reduced Basis, and the model parameters are reduced coefficients. To regularise the problem, we assume smoothness in the data space and train a neural network during the offline stage to approximate the PDE solution. The workflow is applied to 2D Magnetotellurics. Results demonstrate that with only 14% of the high-fidelity data, PDEs can be solved with errors as low as 1–3%, achieving a speedup of seven times compared to full-resolution solutions, highlighting the efficiency of this approach for geophysical applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".