arXiv subjects

Bangti Jin

Publications and source records attributed to Bangti Jin.

At least 37 records · Page 2Linked to original sources

arXiv2025

A Stable Iterative Direct Sampling Method for Elliptic Inverse Problems with Partial Cauchy Data

We develop a novel iterative direct sampling method (IDSM) for solving linear or nonlinear elliptic inverse problems with partial Cauchy data. It integrates three innovations: a data completion scheme to reconstruct missing boundary information, a heterogeneously regularized Dirichlet-to-Neumann map to enhance the near-orthogonality of probing functions, and a stabilization-correction strategy to ensure the numerical stability. The resulting method is remarkably robust with respect to measurement noise, is flexible with the measurement configuration, enjoys provable stability guarantee, and achieves enhanced resolution for recovering inhomogeneities. Numerical experiments in electrical impedance tomography, diffuse optical tomography, and cardiac electrophysiology show its effectiveness in accurately reconstructing the locations and geometries of inhomogeneities.

math.NA↗

arXiv2025

An Iterative Direct Sampling Method for Reconstructing Moving Inhomogeneities in Parabolic Problems

We propose in this work a novel iterative direct sampling method for imaging moving inhomogeneities in parabolic problems using boundary measurements. It can efficiently identify the locations and shapes of moving inhomogeneities when very limited data are available, even with only one pair of lateral Cauchy data, and enjoys remarkable numerical stability for noisy data and over an extended time horizon. The method is formulated in an abstract framework, and is applicable to linear and nonlinear parabolic problems, including linear, nonlinear, and mixed-type inhomogeneities. Numerical experiments across diverse scenarios show its effectiveness and robustness against the data noise.

math.NA↗

arXiv2025

A Warm-basis Method for Bridging Learning and Iteration: a Case Study in Fluorescence Molecular Tomography

Fluorescence Molecular Tomography (FMT) is a widely used non-invasive optical imaging technology in biomedical research. It usually faces significant accuracy challenges in depth reconstruction, and conventional iterative methods struggle with poor $z$-resolution even with advanced regularization. Supervised learning approaches can improve recovery accuracy but rely on large, high-quality paired training dataset that is often impractical to acquire in practice. This naturally raises the question of how learning-based approaches can be effectively combined with iterative schemes to yield more accurate and stable algorithms. In this work, we present a novel warm-basis iterative projection method (WB-IPM) and establish its theoretical underpinnings. The method is able to achieve significantly more accurate reconstructions than the learning-based and iterative-based methods. In addition, it allows a weaker loss function depending solely on the directional component of the difference between ground truth and neural network output, thereby substantially reducing the training effort. These features are justified by our error analysis as well as simulated and real-data experiments.

math.NA↗

arXiv2025

Deep asymptotic expansion method for solving singularly perturbed time-dependent reaction-advection-diffusion equations

Physics-informed neural network (PINN) has shown great potential in solving partial differential equations. However, it faces challenges when dealing with problems involving steep gradients. The solutions to singularly perturbed time-dependent reaction-advection-diffusion equations exhibit internal moving transition layers with sharp gradients, and thus the standard PINN becomes ineffective. In this work, we propose a deep asymptotic expansion (DAE) method, which is inspired by asymptotic analysis and leverages deep learning to approximate the smooth part of the expansion. We first derive the governing equations for transition layers, which are then solved using PINN. Numerical experiments show that the DAE outperforms the standard PINN, gPINN, and PINN with adaptive sampling. We also show its robustness with respect to training point distributions, network architectures, and random seeds.

math.NA↗

arXiv2025

Solving Inverse Acoustic Obstacle Scattering Problem with Phaseless Far-Field Measurement Using Deep Neural Network Surrogates

In this work, we investigate the use of deep neural networks (DNNs) as surrogates for solving the inverse acoustic scattering problem of recovering a sound-soft obstacle from phaseless far-field measurements. We approximate the forward maps from the obstacle to the far-field data using DNNs, and for star-shaped domains in two and three dimensions, we establish the expression rates for fully connected feedforward neural networks with the ReLU activation for approximating the forward maps. The analysis is based on the weak formulation of the direct problem, and can handle variable coefficients. Numerically we validate the accuracy of the DNN surrogates of the forward maps, and demonstrate the use of DNN surrogates in the Bayesian treatment of the inverse obstacle scattering problem. Numerical experiments indicate that the surrogates are effective in both two- and three-dimensional cases, and can significantly speed up the exploration of the posterior distribution of the shape parameters using Markov chain Monte Carlo.

math.NA↗

arXiv2025

Numerical Analysis of Unsupervised Learning Approaches for Parameter Identification in PDEs

Identifying parameters in partial differential equations (PDEs) represents a very broad class of applied inverse problems. In recent years, several unsupervised learning approaches using (deep) neural networks have been developed to solve PDE parameter identifications. These approaches employ neural networks as ansatz functions to approximate the parameters and / or the states, and have demonstrated impressive empirical performance. In this paper, we provide a comprehensive survey on these unsupervised learning techniques on one model problem, diffusion coefficient identification, from the classical numerical analysis perspective, and outline a general framework for deriving rigorous error bounds on the discrete approximations obtained using the Galerkin finite element method, hybrid method and deep neural networks. Throughout we highlight the crucial role of conditional stability estimates in the error analysis.

math.NA↗

arXiv2025

Conditional Stability and Numerical Reconstruction of a Parabolic Inverse Source Problem Using Carleman Estimates

In this work we develop a new numerical approach for recovering a spatially dependent source component in a standard parabolic equation from partial interior measurements. We establish novel conditional Lipschitz stability and Hölder stability for the inverse problem with and without boundary conditions, respectively, using suitable Carleman estimates. Then we propose a numerical approach for solving the inverse problem using conforming finite element approximations in both time and space. Moreover, by utilizing the conditional stability estimates, we prove rigorous error bounds on the discrete approximation. We present several numerical experiments to illustrate the effectiveness of the approach.

math.NA↗

arXiv2025

Deep Learning Based Reconstruction Methods for Electrical Impedance Tomography

Electrical Impedance Tomography (EIT) is a powerful imaging modality widely used in medical diagnostics, industrial monitoring, and environmental studies. The EIT inverse problem is about inferring the internal conductivity distribution of the concerned object from the voltage measurements taken on its boundary. This problem is severely ill-posed, and requires advanced computational approaches for accurate and reliable image reconstruction. Recent innovations in both model-based reconstruction and deep learning have driven significant progress in the field. In this review, we explore learned reconstruction methods that employ deep neural networks for solving the EIT inverse problem. The discussion focuses on the complete electrode model, one popular mathematical model for real-world applications of EIT. We compare a wide variety of learned approaches, including fully-learned, post-processing and learned iterative methods, with several conventional model-based reconstruction techniques, e.g., sparsity regularization, regularized Gauss-Newton iteration and level set method. The evaluation is based on three datasets: a simulated dataset of ellipses, an out-of-distribution simulated dataset, and the KIT4 dataset, including real-world measurements. Our results demonstrate that learned methods outperform model-based methods for in-distribution data but face challenges in generalization, where hybrid methods exhibit a good balance of accuracy and adaptability.

eess.IV↗

arXiv2025

Simultaneous Identification of Coefficients and Source in a Subdiffusion Equation from One Passive Measurement

This article is devoted to the detection of parameters in anomalous diffusion from a single passive measurement. More precisely, we consider the simultaneous identification of coefficients as well as a time-dependent source term appearing in a time-fractional diffusion equation from a single boundary or internal passive measurement. We obtain several uniqueness results in dimension one as well as a multidimensional extension under some symmetry assumptions. Our analysis relies on spectral representation of solutions, complex and harmonic analysis combined with some known inverse spectral results for Sturm-Liouville operators. The theoretical results are complemented by a corresponding reconstruction algorithm and numerical simulations.

math.AP↗

arXiv2025

Numerical Approximation and Analysis of the Inverse Robin Problem Using the Kohn-Vogelius Method

In this work, we numerically investigate the inverse Robin problem of recovering a piecewise constant Robin coefficient in an elliptic or parabolic problem from the Cauchy data on a part of the boundary, a problem that commonly arises in applications such as non-destructive corrosion detection. We employ a Kohn-Vogelius type variational functional for the regularized reconstruction, and discretize the resulting optimization problem using the Galerkin finite element method on a graded mesh. We establish rigorous error estimates on the recovered Robin coefficient in terms of the mesh size, temporal step size and noise level. This is achieved by combining the approximation error of the direct problem, a priori estimates on the functional, and suitable conditional stability estimates of the continuous inverse problem. We present several numerical experiments to illustrate the approach and to complement the theoretical findings.

math.NA↗

arXiv2025

Stochastic Convergence Analysis of Inverse Potential Problem

In this work, we investigate the inverse problem of recovering a potential coefficient in an elliptic partial differential equation from the observations at deterministic sampling points in the domain subject to random noise. We employ a least squares formulation with an $H^1(Ω)$ penalty on the potential in order to obtain a numerical reconstruction, and the Galerkin finite element method for the spatial discretization. Under mild regularity assumptions on the problem data, we provide a stochastic $L^2(Ω)$ convergence analysis on the regularized solution and the finite element approximation in a high probability sense. The obtained error bounds depend explicitly on the regularization parameter $γ$, the number $n$ of observation points and the mesh size $h$. These estimates provide a useful guideline for choosing relevant algorithmic parameters. Furthermore, we develop a monotonically convergent adaptive algorithm for determining a suitable regularization parameter in the absence of \textit{a priori} knowledge. Numerical experiments are also provided to complement the theoretical results.

math.NA↗

arXiv2025

Direct Algorithms for Reconstructing Small Conductivity Inclusions in Subdiffusion

The subdiffusion model that involves a Caputo fractional derivative in time is widely used to describe anomalously slow diffusion processes. In this work we aim at recovering the locations of small conductivity inclusions in the model from boundary measurement, and develop novel direct algorithms based on the asymptotic expansion of the boundary measurement with respect to the size of the inclusions and approximate fundamental solutions. These algorithms involve only algebraic manipulations and are computationally cheap. To the best of our knowledge, they are first direct algorithms for the inverse conductivity problem in the context of the subdiffusion model. Moreover, we provide relevant theoretical underpinnings for the algorithms. Also we present numerical results to illustrate their performance under various scenarios, e.g., the size of inclusions, noise level of the data, and the number of inclusions, showing that the algorithms are efficient and robust.

math.NA↗

arXiv2025

Convergence Analysis of an Adaptive Nonconforming FEM for Phase-Field Dependent Topology Optimization in Stokes Flow

In this work, we develop an adaptive nonconforming finite element algorithm for the numerical approximation of phase-field parameterized topology optimization governed by the Stokes system. We employ the conforming linear finite element space to approximate the phase field, and the nonconforming linear finite elements (Crouzeix-Raviart elements) and piecewise constants to approximate the velocity field and the pressure field, respectively. We establish the convergence of the adaptive method, i.e., the sequence of minimizers contains a subsequence that converges to a solution of the first-order optimality system, and the associated subsequence of discrete pressure fields also converges. The analysis relies crucially on a new discrete compactness result of nonconforming linear finite elements over a sequence of adaptively generated meshes. We present numerical results for several examples to illustrate the performance of the algorithm, including a comparison with the uniform refinement strategy.

math.NA↗

arXiv2025

On the Crouzeix-Raviart Finite Element Approximation of Phase-Field Dependent Topology Optimization in Stokes Flow

In this work, we investigate a nonconforming finite element approximation of phase-field parameterized topology optimization governed by the Stokes flow. The phase field, the velocity field and the pressure field are approximated by conforming linear finite elements, nonconforming linear finite elements (Crouzeix-Raviart elements) and piecewise constants, respectively. When compared with the standard conforming counterpart, the nonconforming FEM can provide an approximation with fewer degrees of freedom, leading to improved computational efficiency. We establish the convergence of the resulting numerical scheme in the sense that the sequences of phase-field functions and discrete velocity fields contain subsequences that converge to a minimizing pair of the continuous problem in the $H^1$-norm and a mesh-dependent norm, respectively. We present extensive numerical results to illustrate the performance of the approach, including a comparison with the popular Taylor-Hood elements.

math.NA↗

arXiv2025

Stable Determination and Reconstruction of a Quasilinear Term in an Elliptic Equation

In this work, we investigate the inverse problem of determining a quasilinear term appearing in a nonlinear elliptic equation from the measurement of the conormal derivative on the boundary. This problem arises in several practical applications, e.g., heat conduction. We derive novel Hölder stability estimates for both multi- and one-dimensional cases: in the multi-dimensional case, the stability estimates are stated with one single boundary measurement, whereas in the one-dimensional case, due to dimensionality limitation, the stability results are stated for the Dirichlet boundary condition varying in a space of dimension one. We derive these estimates using different properties of solution representations. We complement the theoretical results with numerical reconstructions of the quasilinear term, which illustrate the stable recovery of the quasilinear term in the presence of data noise.

math.AP↗

arXiv2025

Adaptive Approximations of Inclusions in a Semilinear Elliptic Problem Related to Cardiac Electrophysiology

In this work, we investigate the numerical reconstruction of inclusions in a semilinear elliptic equation arising in the mathematical modeling of cardiac ischemia. We propose an adaptive finite element method for the resulting constrained minimization problem that is relaxed by a phase-field approach. The \textit{a posteriori} error estimators of the adaptive algorithm consist of three components, i.e., the state variable, the adjoint variable and the complementary relation. Moreover, using tools from adaptive finite element analysis and nonlinear optimization, we establish the strong convergence for a subsequence of adaptively generated discrete solutions to a solution of the continuous optimality system. Several numerical examples are presented to illustrate the convergence and efficiency of the adaptive algorithm

math.NA↗

arXiv2025

Iterative Direct Sampling Method for Elliptic Inverse Problems with Limited Cauchy Data

In this work, we propose an innovative iterative direct sampling method to solve nonlinear elliptic inverse problems from a limited number of pairs of Cauchy data. It extends the original direct sampling method (DSM) by incorporating an iterative mechanism, enhancing its performance with a modest increase in computational effort but a clear improvement in its stability against data noise. The method is formulated in an abstract framework of operator equations and is applicable to a broad range of elliptic inverse problems. Numerical results on electrical impedance tomography, optical tomography and cardiac electrophysiology etc. demonstrate its effectiveness and robustness, especially with an improved accuracy for identifying the locations and geometric shapes of inhomogeneities in the presence of large noise, when compared with the standard DSM.

math.NA↗

arXiv2025

Steerable Conditional Diffusion for Out-of-Distribution Adaptation in Medical Image Reconstruction

Denoising diffusion models have emerged as the go-to generative framework for solving inverse problems in imaging. A critical concern regarding these models is their performance on out-of-distribution tasks, which remains an under-explored challenge. Using a diffusion model on an out-of-distribution dataset, realistic reconstructions can be generated, but with hallucinating image features that are uniquely present in the training dataset. To address this discrepancy during train-test time and improve reconstruction accuracy, we introduce a novel sampling framework called Steerable Conditional Diffusion. Specifically, this framework adapts the diffusion model, concurrently with image reconstruction, based solely on the information provided by the available measurement. Utilising our proposed method, we achieve substantial enhancements in out-of-distribution performance across diverse imaging modalities, advancing the robust deployment of denoising diffusion models in real-world applications.

cs.CV↗