Linear traveltime perturbation interpolation: a novel method to compute 3-D traveltimes
Bibliographic record
Abstract
Abstract The linear traveltime interpolation has been a routine method to compute first arrivals of seismic waves and trace rays in complex media. The method assumes that traveltimes follow a linear distribution on each boundary of cells. The linearity assumption of traveltimes facilitates the numerical implementation but its violation may result in large computational errors. In this paper, we propose a new way to mitigate the potential shortcoming hidden in the linear traveltime interpolation. We use the vertex traveltimes in a calculated cell to introduce an equivalent homogeneous medium that is specific to the cell boundary from a source. Therefore, we can decompose the traveltime at a point on the cell boundary into two parts: (1) a reference traveltime propagating in the equivalent homogeneous medium and (2) a perturbation traveltime that is defined as the difference between the original and reference traveltimes. We now treat that the traveltime perturbation is linear along each boundary of cells instead of the traveltime. With the new assumption, we carry out the bilinear interpolation over traveltime perturbation to complete traveltime computation in a 3-D heterogeneous model. The numerical experiments show that the new method, the linear traveltime perturbation interpolation, is able to achieve much higher accuracy than that based on the linear traveltime interpolation.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".