The Dirichlet to Neumann Map for a Resistor Network
Let a square network of resistors \(\Omega=(\Omega_ 0,\Omega_ 1)\) be given \((\Omega_ 0=\) set of \(n^ 2\) (interior) \(+4n\) (boundary) nodes, \(\Omega_ 1=\) set of connecting segments) which obeys the Ohm's law, that is \[ I=\gamma(pq)(u(p)-u(q)), \] where \(pq\) is a segment of the network connecting the nodes \(p\) and \(q\), \(\gamma\) is the conductivity function and \(u\) is a current across \(pq\). If \(u\) is \(\gamma\)-harmonic (i.e. it satisfies the Kirchhoff's law) then it is uniquely determined in \(\Omega\) by its value \(\varphi\) at each boundary node. The potential drop across each conductor \(pq\) is \(\Delta u(pq)=u(p)- u(q)\). The function \(u\) determines a current \(I_ \varphi(p)\) through each boundary node \(p\), by \(I_ \varphi(p)=\gamma(pq)(u(p)-u(q))\), where \(q\) is the interior neighbor of \(p\). For each conductivity \(\gamma\) on \(\Omega_ 1\), the linear map \(\Lambda_ \gamma\) from boundary functions to boundary functions is defined by \(\Lambda_ \gamma\varphi=I_ \varphi\). The boundary function \(\varphi\) is called Dirichlet data, the boundary current \(I_ \varphi\) is called Neumann data, and the map \(\Lambda_ \gamma\) is called the Dirichlet-to-Neumann map. The inverse problem is to recover the conductivity \(\gamma\) from \(\Lambda_ \gamma\). This leads to four problems (1) Uniqueness: If \(\Lambda_ \gamma=\Lambda_ \mu\), does it necessarily follow that \(\gamma=\mu\)? (2) Continuity: If \(\Lambda_ \gamma\) is near to \(\Lambda_ \mu\), does it necessarily follow that \(\gamma\) is near to \(\mu\)? (3) Reconstruction: Give an algorithm for using \(\Lambda_ \gamma\) to compute \(\gamma\). (4) Characterization: For each integer \(n\), which \(4n\) by \(4n\) matrices are of the form \(\Lambda_ \gamma\) for some \(\gamma\)? The authors show that the Dirichlet-to-Neumann map uniquely determines the conductivity and give an algorithm for computing the conductivity \(\gamma\) from the Dirichlet-to-Neumann map \(\Lambda_ \gamma\). The algebraic formulas of the algorithm show the continuity of the inverse. The main result of this paper is Theorem 6.1 which gives a characterization of Dirichlet-to-Neumann maps for square resistor networks. By consideration of duality, there is a similar characterization of Neumann-to-Dirichlet maps.
- Circular planar graphs and resistor networks
- On the determination of conductivities by means of surface measurement
- Inverse scattering for Schrödinger operators on perturbed lattices
- Enforcing exact physics in scientific machine learning: a data-driven exterior calculus on graphs
- A Calderón type inverse problem for tree graphs
- The inverse problem for conducting defective lattices
- A discrete Liouville identity for numerical reconstruction of Schrödinger potentials
- Diffusion and elastic equations on networks
- Recovering the conductances on grids
- Inverse problem in cylindrical electrical networks
- The Dirichlet boundary value problems for p-Schrödinger operators on finite networks
- Inverse problem of resistor network with one measurement
- Identification of resistors in electrical networks
- scientific article; zbMATH DE number 5117835 (Why is no real title available?)
- Determining Resistances from Boundary Measurements in Finite Networks
- Discrete and Continuous Dirichlet-to-Neumann Maps in the Layered Case
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- Finding the conductors in circular networks from boundary measurements
- Potential distribution on random electrical networks
- Blowup behavior of solutions to an -diffusion equation on the graph
- Numerical solution of inverse problems by weak adversarial networks
- Discrete graphs -- a paradigm model for quantum chaos
- Extinction and positivity of the solutions of the heat equations with absorption on networks
- A Borg–Levinson theorem for trees
- Determining the Resistors in a Network
- Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks
- Multiplicity of solutions for the discrete boundary value problem involving the p-Laplacian
- Lattice Green/Neumann function for the 2D Laplacian operator defined on square lattice on cylinders, tori and other geometries with some applications
- Positive solutions for discrete boundary value problems involving the p-Laplacian with potential terms
- Extinction and positivity of the solutions for a \(p\)-Laplacian equation with absorption on graphs
- Quenching phenomenon of solutions for parabolic equations with singular absorption on graphs
- Some quenching problems for -diffusion equations on graphs with a potential and a singular source
- The twist for electrical networks and the inverse problem
- Stable recovery of piecewise constant conductance on spider networks
- An inverse boundary value problem for electrical networks
- Steklov-Neumann spectral problem: asymptotic analysis and applications to diffusion-controlled reactions
- The discrete inverse conductivity problem solved by the weights of an interpretable neural network
- The Steklov problem for exterior domains: asymptotic behavior and applications
- On the uniqueness of the discrete Calderón problem on multidimensional lattices
- Inverse scattering at a fixed energy for discrete Schrödinger operators on the square lattice
- Extinction and asymptotic behavior of solutions for the \(\omega\)-heat equation on graphs with source and interior absorption
- Poisson equations with nonlinear source terms on networks
This page was built for publication: The Dirichlet to Neumann Map for a Resistor Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978119)
