Search arXivSearch

arXiv · 2408.14616

Generic local identifiability for ODE inverse problems from discrete observations

Abstract

We study local identifiability of parameters in ordinary differential equation models from finitely many observations. The central object is the parameter-to-observation map obtained by sampling the solution at prescribed times. We first prove a quantitative injectivity estimate for general $C^2$ observation maps: a lower bound on the smallest singular value of the parameter Jacobian, together with an upper bound on the second derivative, gives an explicit neighborhood on which the inverse problem has a unique and stable local solution. We then treat analytic ODE models. For analytic vector fields the observation map is analytic in observation times, initial states, and parameters; consequently, the loss of full parameter rank is contained in the zero set of a real analytic function. Under a single non-degeneracy condition this gives generic local identifiability, including for randomly chosen observation times with a density. Finally, for homogeneous linear systems $\dot X=AX$, we separate the recovery of $e^{hA}$ from the recovery of $A$: cyclic initial states identify the discrete propagator from one trajectory, while the remaining ambiguity is precisely the ambiguity of the real matrix logarithm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marian Petrica, Ionel Popescu. 2026-07-27. Generic local identifiability for ODE inverse problems from discrete observations. https://arxiv.org/abs/2408.14616

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA