Metraipolis › archive › dc_a26917080949

A fully globalized solver for discretized inverse elliptic coefficient problems with exact data — arXiv:2609.03631

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03631
License (as archived)
CC0-1.0
Archived
2026-10-17T02:26:54.953Z
SHA-256 of the archived text
7a0ace28302f80fab6ea7c2acc19027b975e9c28d94db975e1502756ceff42ee
Stable URL of this page
https://metraipolis.com/documento/dc_a26917080949

How to cite

A fully globalized solver for discretized inverse elliptic coefficient problems with exact data — arXiv:2609.03631 — arXiv (en), https://arxiv.org/abs/2609.03631 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a26917080949 (Metraipolis archive dc_a26917080949, sha256 7a0ace28302f80fab6ea7c2acc19027b975e9c28d94db975e1502756ceff42ee)
BibTeX
@misc{dca26917080949,
  title = {A fully globalized solver for discretized inverse elliptic coefficient problems with exact data — arXiv:2609.03631},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03631},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a26917080949; sha256 7a0ace28302f80fab6ea7c2acc19027b975e9c28d94db975e1502756ceff42ee},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03631. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider finite-dimensional nonlinear inverse problems arising from finite element discretizations of elliptic inverse coefficient problems such as the Calderón problem with finitely many measurements and unknowns. Such inverse coefficient problems are notorious for their nonlinearity and ill-posedness, and numerical solvers tend to depend strongly on good initial values. In this work, we develop a new locally convergent algorithm with an explicit residual criterion that ensures convergence to the inverse problem solution, and a globalized variant that is guaranteed to automatically switch to the faster locally convergent algorithm after finitely many global search steps.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.OC).
Categorie arXiv: Numerical Analysis (math.NA) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.03631 — 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-17T02:07:43.360Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).