We consider the inverse problem of finding matrix valued edge or node quantities in a graph from measurements made at a few boundary nodes. This is a generalization of the problem of finding resistors in a resistor network from voltage and current measurements at a few nodes, but where the voltages and currents are vector valued. The measurements come from solving a series of Dirichlet problems, i.e. finding vector valued voltages at some interior nodes from voltages prescribed at the boundary nodes. We give conditions under which the Dirichlet problem admits a unique solution and study the degenerate case where the edge weights are rank deficient. Under mild conditions, the map that associates the matrix valued parameters to boundary data is analytic. This has practical consequences to iterative methods for solving the inverse problem numerically and to local uniqueness of the inverse problem. Our results allow for complex valued weights and give also explicit formulas for the Jacobian of the parameter to data map in terms of certain products of Dirichlet problem solutions. An application to inverse problems arising in networks of springs, masses and dampers is presented.
Citation: Travis G. Draper, Fernando Guevara Vasquez, Justin Cheuk-Lum Tse, Toren E. Wallengren, Kenneth Zheng. Matrix valued inverse problems on graphs with application to mass-spring-damper systems[J]. Networks and Heterogeneous Media, 2020, 15(1): 1-28. doi: 10.3934/nhm.2020001
We consider the inverse problem of finding matrix valued edge or node quantities in a graph from measurements made at a few boundary nodes. This is a generalization of the problem of finding resistors in a resistor network from voltage and current measurements at a few nodes, but where the voltages and currents are vector valued. The measurements come from solving a series of Dirichlet problems, i.e. finding vector valued voltages at some interior nodes from voltages prescribed at the boundary nodes. We give conditions under which the Dirichlet problem admits a unique solution and study the degenerate case where the edge weights are rank deficient. Under mild conditions, the map that associates the matrix valued parameters to boundary data is analytic. This has practical consequences to iterative methods for solving the inverse problem numerically and to local uniqueness of the inverse problem. Our results allow for complex valued weights and give also explicit formulas for the Jacobian of the parameter to data map in terms of certain products of Dirichlet problem solutions. An application to inverse problems arising in networks of springs, masses and dampers is presented.
| [1] | G. Alessandrini, Remark on a paper by H. Bellout and A. Friedman: "Identification problems in potential theory" [Arch. Rational Mech. Anal., 101 (1988), 143–160; MR0921936 (89c: 31003)], Boll. Un. Mat. Ital. A (7), 3 (1989), 243–249. |
| [2] |
Dirichlet-to-Robin matrix on networks. Electronic Notes in Discrete Mathematics (2014) 46: 65-72. 
|
| [3] |
Dirichlet-to-Robin maps on finite networks. Applicable Analysis and Discrete Mathematics (2015) 9: 85-102.
|
| [4] |
Overdetermined partial boundary value problems on finite networks. Journal of Mathematical Analysis and Applications (2015) 423: 191-207.
|
| [5] |
A discrete Liouville identity for numerical reconstruction of Schrödinger potentials. Inverse Probl. Imaging (2017) 11: 623-641.
|
| [6] |
On the solvability of the discrete conductivity and Schrödinger inverse problems. SIAM J. Applied Math. (2016) 76: 1053-1075.
|
| [7] |
Determination of the closure of the set of elasticity functionals. Arch. Ration. Mech. Anal. (2003) 170: 211-245.
|
| [8] | F. R. K. Chung, Spectral Graph Theory, vol. 92 of CBMS Regional Conference Series in Mathematics, Published for the Conference Board of the Mathematical Sciences, Washington, DC, 1997. |
| [9] | Identification of resistors in electrical networks. J. Korean Math. Soc. (2010) 47: 1223-1238. |
| [10] | Réseaux électriques planaires. Ⅰ. Comment. Math. Helv. (1994) 69: 351-374. |
| [11] | Y. Colin de Verdière, Spectres de Graphes, vol. 4 of Cours Spécialisés [Specialized Courses], Société Mathématique de France, Paris, 1998. |
| [12] |
Réseaux électriques planaires. Ⅱ. Comment. Math. Helv. (1996) 71: 144-167.
|
| [13] |
Finding the conductors in circular networks from boundary measurements. RAIRO Modél. Math. Anal. Numér. (1994) 28: 781-814.
|
| [14] | Circular planar graphs and resistor networks. Linear Algebra Appl. (1998) 283: 115-150. |
| [15] | V. Druskin, personal communication, 2015. |
| [16] | On random graphs. I. Publ. Math. Debrecen (1959) 6: 290-297. |
| [17] |
Characterization and synthesis of Rayleigh damped elastodynamic networks. Networks and Heterogeneous Media (2014) 9: 299-314.
|
| [18] |
Complete characterization and synthesis of the response function of elastodynamic networks. J. Elasticity (2011) 102: 31-54.
|
| [19] | R. C. Gunning and H. Rossi, Analytic Functions of Several Complex Variables, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1965. |
| [20] | (2013) Matrix Analysis. Cambridge: Cambridge University Press. |
| [21] |
Inverse problem in cylindrical electrical networks. SIAM J. Appl. Math. (2012) 72: 767-788.
|
| [22] | J. E. Marsden and T. J. R. Hughes, Mathematical Foundations of Elasticity, Dover Publications, Inc., New York, 1994, Corrected reprint of the 1983 original. |
| [23] | J. Nocedal and S. J. Wright, Numerical Optimization, 2nd edition, Springer Series in Operations Research and Financial Engineering, Springer, New York, 2006. |
| [24] | W. Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill Book Co., New York-Auckland-Düsseldorf, 1976, International Series in Pure and Applied Mathematics. |
| [25] |
J. Sylvester and G. Uhlmann, A global uniqueness theorem for an inverse boundary value problem, Ann. of Math. (2), 125 (1987), 153–169. doi: 10.2307/1971291
|
Figures(2)
Travis G. Draper, Fernando Guevara Vasquez, Justin Cheuk-Lum Tse, Toren E. Wallengren, Kenneth Zheng. Matrix valued inverse problems on graphs with application to mass-spring-damper systems[J]. Networks and Heterogeneous Media, 2020, 15(1): 1-28. doi: 10.3934/nhm.2020001
DownLoad: