Multilevel Algorithm for Large-Scale Gravity Inversion
Bibliographic record
Abstract
Surface gravity inversion attempts to recover the density contrast distribution in the 3D Earth model for geological interpretation. Since airborne gravity is characterized by large data volumes, large-scale 3D inversion exceeds the capacity of desktop computing resources, making it difficult to achieve the appropriate depth/lateral resolution for geological interpretation. In addition, gravity data are finite and noisy, and their inversion is ill posed. Especially in the absence of a priori geological information, regularization must be introduced to overcome the difficulty of the non-uniqueness of the solutions to recover the most geologically plausible ones. Because the use of Haar wavelet operators has an edge-preserving property and can preserve the sensitivity matrix structure at each level of the multilevel method to obtain faster solvers, we present a multilevel algorithm for large-scale gravity inversion solved by the re-weighted regularized conjugate gradient (RRCG) algorithm to reduce the inversion computational resources and improve the depth/lateral resolution of the inversion results. The RRCG-based multilevel inversion was then applied to synthetic cases and airborne gravity data from the Quest-South project in British Columbia, Canada. Results from synthetic models and field data show that the RRCG-based multilevel inversion is suitable for obtaining density contrast distributions with appropriate horizontal and vertical resolution, especially for large-scale gravity inversions compared to Occam’s inversion.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.005 | 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".