The improvement of sparsity gravity inversion using an adaptive lanczos bidiagonalization method
Bibliographic record
Abstract
Inversion of gravity data is one the important steps in the interpretation of practical data. The detection of sharp boundaries between anomalous bodies and host rocks is an interesting point in the geological frameworks. The gravity inversion with sparsity constraint is a useful method to recover block subsurface density distribution, which is efficiently used for the quantitative interpretation of gravity data. The reweighted regularized method is a useful method to solve the inverse problem. However, in this type, we must face the updating gravity forward matrix and large matrix operation. The application of Lanczos bidiagonalization method can reduce the size of data and matrix in the inversion to resolve the large scale inversion problem. However, a very important problem is not resolved, which is update of reweighted forward matrix and new Lanczos bidiagonalization matrix. Here, an adaptive Lanczos bidiagonalization method is studied to select the Lanczos bidiagonalization factor. And a new projected method with adaptive Lanczos bidiagonalization method is study to avoid the updating sparsity reweighted function. We calculate the reweighted forward matrix and Lanczos bidiagonalization matrix only one time, which can essentially reduce the computational complexity. The inversion results of synthetic data show that the new improved method is faster and better than common reweight regularized Lanczos bidiagonalization method to produce an acceptable solution for focusing inverse problem. The improvement of adaptive Lanczos bidiagonalization in sparsity gravity inversion is also tested on gravity data collected over the Mobrun massive sulfide ore body in Noranda, Quebec, Canada. The inversion results indicate a remarkable correlation with true structure of the ore body that is achieved from drilling data.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".