Stable recovery of piecewise constant conductance on spider networks
Preprint
Abstract
We address the discrete inverse conductance problem for well-connected spider networks; that is, to recover the conductance function on a well-connected spider network from the Dirichlet-to-Neumann map. It is well-known that this inverse problem is exponentially ill-posed, requiring the implementation of a regularization strategy for numerical solutions. Our focus lies in exploring whether prior knowledge of the conductance being piecewise constant within a partition of the edge set comprising few subsets enables stable conductance recovery. To achieve this, we propose formulating the problem as a polynomial optimization one, incorporating a regularization term that accounts for the piecewise constant hypothesis. We show several experimental examples in which the stable conductance recovery under the aforementioned hypothesis is feasible.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Recovering the conductances on grids: A theoretical justification2016
- Overdetermined partial boundary value problems on finite networksJournal of Mathematical Analysis and Applications, 2015
- Circular resistor networks for electrical impedance tomography with partial boundary measurementsInverse Problems, 2010
- Electrical impedance tomography with resistor networksInverse Problems, 2008
- A remark on a paper by Alessandrini and VessellaAdvances in Applied Mathematics, 2006
- Lipschitz stability for the inverse conductivity problemAdvances in Applied Mathematics, 2005
- Tikhonov regularization for electrical impedance tomography on unbounded domainsInverse Problems, 2003
- Circular planar graphs and resistor networksLinear Algebra and its Applications, 1998
- Uniqueness in the inverse conductivity problem for nonsmooth conductivities in two dimensionsCommunications in Partial Differential Equations, 1997
- Stable determination of conductivity by boundary measurementsApplicable Analysis, 1988