Learning to solve the elastic wave equation with Fourier neural operators
Bibliographic record
Abstract
ABSTRACT Neural operators are extensions of neural networks, which, through supervised training, learn how to map the complex relationships that exist within the classes of the partial differential equation (PDE). One of these networks, the Fourier neural operator (FNO), has been particularly successful in producing general solutions to PDEs, such as the Navier-Stokes equation. We have formulated an FNO to reproduce solutions of the 2D isotropic elastic wave equation training on synthetic data sets. This requires two significant alterations to the existing FNO structures. By (1) adding the Fourier kernel multiplication with respect to multiple spatial directions and (2) building connections between the Fourier layers, we produce what we refer to as the “one-connection FNO,” which is suitable for use in producing solutions of the elastic wave equation. Post training, the new FNO is examined for accuracy. Compared with the unmodified original FNO, we observe, in particular, an improved prediction of the fields generated with low source frequency, which is suggestive of immediate applicability in inversion. Once trained, the modified FNO operates at approximately 100 times the speed of traditional finite-difference methods on a CPU; this increase in the computational speed, when used within forward modeling, may have important consequences in simulation-intensive inverse problems, such as those based on the Monte Carlo methods.
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.000 | 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.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".