Metraipolis › archive › dc_68577dd08448
efficient matrix-free gauss-newton traveltime tomography on full-metric deformed grids — arXiv:2609.14982
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14982
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:22:32.352Z
- SHA-256 of the archived text
15ef21981cb8435f23741107b6179733d95c2310d0b66397b0dc37f52647300e- Stable URL of this page
https://metraipolis.com/documento/dc_68577dd08448
How to cite
efficient matrix-free gauss-newton traveltime tomography on full-metric deformed grids — arXiv:2609.14982 — arXiv (en), https://arxiv.org/abs/2609.14982 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_68577dd08448 (Metraipolis archive dc_68577dd08448, sha256 15ef21981cb8435f23741107b6179733d95c2310d0b66397b0dc37f52647300e)
BibTeX
@misc{dc68577dd08448,
title = {efficient matrix-free gauss-newton traveltime tomography on full-metric deformed grids — arXiv:2609.14982},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14982},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_68577dd08448; sha256 15ef21981cb8435f23741107b6179733d95c2310d0b66397b0dc37f52647300e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14982. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
First-arrival traveltime tomography provides a computationally efficient means of imaging subsurface velocity structure, while boundary-conforming deformed grids allow rugged topography to be represented without abandoning a logically structured mesh. In matrix-free Gauss-Newton inversion, however, the linearized full-metric Eikonal transport and its transpose must be applied repeatedly at a fixed background model. Directional sweeping consequently revisits the same state-dependent dependency structure for every Krylov right-hand side. We recast the frozen tangent transport as a directed graph and distinguish loss of the background-traveltime ordering from genuine algebraic cyclicity. Strongly connected components identify the irreducible part of the transport, whereas the remaining dependencies admit exact scalar substitution after reordering. The condensation graph and local block factorizations are constructed once for each frozen source state and then reused for both primal and transpose applications. Numerical experiments on deformed grids and a three-dimensional tomography problem show that the resulting block-triangular formulation preserves the frozen sensitivity action while substantially reducing the repeated transport cost. By eliminating this dominant inner-iteration cost, the proposed method markedly accelerates Gauss-Newton computation and makes full-metric matrix-free inversion on deformed grids practical at much lower cost. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.14982 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T00:39:06.324Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).