On the Uniqueness of the Discrete Calderón Problem on Multidimensional Lattices

Abstract. In this work, we investigate the discrete Calderón problem on (hyper)cubic grid graphs in dimension three or higher. The discrete Calderón problem is concerned with determining whether the discrete Dirichlet-to-Neumann matrix, which links boundary potentials to boundary current responses, can uniquely determine the conductivity values on the graph edges. We provide an affirmative answer to the question, thereby extending the classical uniqueness result of Curtis and Morrow for two-dimensional square lattices. The proof employs a slicing technique that decomposes the problem into lower-dimensional components. Additionally, we support the theoretical finding with numerical experiments that illustrate the effectiveness of the approach.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Applied Mathematics
Published
2026-07-24
DOI
https://doi.org/10.1137/25m1801803
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Uniqueness of the Discrete Calderón Problem on Multidimensional Lattices

Bangti Jin, Maolin Deng
SIAM Journal on Applied Mathematics
Numerical methods in inverse problems
article

On the Uniqueness of the Discrete Calderón Problem on Multidimensional Lattices

Bangti Jin, Maolin Deng
article en

Abstract

Abstract. In this work, we investigate the discrete Calderón problem on (hyper)cubic grid graphs in dimension three or higher. The discrete Calderón problem is concerned with determining whether the discrete Dirichlet-to-Neumann matrix, which links boundary potentials to boundary current responses, can uniquely determine the conductivity values on the graph edges. We provide an affirmative answer to the question, thereby extending the classical uniqueness result of Curtis and Morrow for two-dimensional square lattices. The proof employs a slicing technique that decomposes the problem into lower-dimensional components. Additionally, we support the theoretical finding with numerical experiments that illustrate the effectiveness of the approach.

SIAM Journal on Applied MathematicsVol. 86(4)
Shenzhen Institute of Information Technology (CN), Chinese University of Hong Kong (HK)
Agence Nationale de la Recherche, Chinese University of Hong Kong
Openalex Percentile: Top 89%
Numerical methods in inverse problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.