Question. If and are close, are and close?
We look for an estimate of the form
with a modulus of continuity as .
Logarithmic stability. Alessandrini (1988) proved, for and conductivities satisfying a priori bounds (for example in , ), that
for some . Mandache (2001) showed that this rate cannot be improved in general. Halving the reconstruction error requires the data error to shrink to about its -th power. This is why EIT is called severely ill-posed (see Well-Posedness).
Better stability under stronger priors. If is known to lie in a finite-dimensional set, for example piecewise constant on a known partition into finitely many cells, then the estimate is Lipschitz: (Alessandrini–Vessella 2005). The constant , however, grows exponentially with the number of unknowns. This is the theoretical case for strong prior information, both hand-crafted and learned (see Variational Regularization and Learned Regularization).
Practical meaning. Features deep inside the domain, or small ones, produce boundary signals that are exponentially small. With finite measurement precision, no algorithm can resolve them without prior assumptions.
References
- G. Alessandrini (1988). Stable determination of conductivity by boundary measurements. Applicable Analysis 27(1–3), 153–172. doi:10.1080/00036818808839730
- N. Mandache (2001). Exponential instability in an inverse problem for the Schrödinger equation. Inverse Problems 17(5), 1435–1444. doi:10.1088/0266-5611/17/5/313
- G. Alessandrini, S. Vessella (2005). Lipschitz stability for the inverse conductivity problem. Adv. Appl. Math. 35(2), 207–241. doi:10.1016/j.aam.2004.12.002
- J. L. Mueller, S. Siltanen (2012). Linear and Nonlinear Inverse Problems with Practical Applications. SIAM. doi:10.1137/1.9781611972344