Metraipolis › archive › dc_b7983d931107
Carleman--Picard and time-dimensional reduction for inverse initial-data problems in nonlinear transport with memory — arXiv:2608.09665
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09665
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:08:07.555Z
- SHA-256 of the archived text
000c19d9aaf0856785cc02e01ae63a01375e51ac1cfb06c3ac26c20466686249- Stable URL of this page
https://metraipolis.com/documento/dc_b7983d931107
How to cite
Carleman--Picard and time-dimensional reduction for inverse initial-data problems in nonlinear transport with memory — arXiv:2608.09665 — arXiv (en), https://arxiv.org/abs/2608.09665 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b7983d931107 (Metraipolis archive dc_b7983d931107, sha256 000c19d9aaf0856785cc02e01ae63a01375e51ac1cfb06c3ac26c20466686249)
BibTeX
@misc{dcb7983d931107,
title = {Carleman--Picard and time-dimensional reduction for inverse initial-data problems in nonlinear transport with memory — arXiv:2608.09665},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09665},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b7983d931107; sha256 000c19d9aaf0856785cc02e01ae63a01375e51ac1cfb06c3ac26c20466686249},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09665. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study an inverse initial-data problem for a quasilinear transport equation with nonlinear and memory effects. The unknown initial state is reconstructed from time-dependent measurements on the outflow boundary, with prescribed inflow data. We first apply a Legendre--exponential time-dimensional reduction to transform the governing equation into a finite nonlinear system in space. We then develop a Carleman-weighted and Tikhonov-regularized Picard method. At each iteration, the nonlinear terms are evaluated using the previous iterate, leading to a linear minimization problem with a unique solution. A Carleman estimate for the principal transport operator is used to prove that, for a sufficiently large Carleman parameter, the resulting Picard map is contractive on a prescribed admissible set. Consequently, the method converges from an arbitrary initial guess in that set. We also establish stability with respect to noisy outflow data. These analytical results concern the truncated and regularized reduced problem. Two-dimensional numerical experiments demonstrate accurate reconstruction of single and multiple inclusions, robustness with respect to noise, and rapid convergence of the Picard iteration. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.09665 — 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-19T09:05:02.986Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).