Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “inverse problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Paired autoencoders for likelihood-free estimation in inverse problems

Abstract We consider the solution of nonlinear inverse problems where the forward problem is a discretization of a partial differential equation. Such problems are notoriously difficult to solve in practice and require minimizing a combination of a data-fit term and a regularization term. The main computational bottleneck of typical algorithms is the direct estimation of the data misfit. Therefore, likelihood-free approaches have become appealing alternatives. Nonetheless, difficulties in generalization and limitations in accuracy have hindered their broader utility and applicability. In this work, we use a paired autoencoder framework as a likelihood-free estimator (LFE) for inverse problems. We show that the use of such an architecture allows us to construct a solution efficiently and to overcome some known open problems when using LFEs. In particular, our framework can assess the quality of the solution and improve on it if needed. We demonstrate the viability of our approach using examples from full waveform inversion and inverse electromagnetic imaging.

Chung, Matthias (ORCID:0000000178224539)↗

A unified approach to the helioseismic forward and inverse problems of differential rotation

A general, degenerate perturbation theoretic treatment of the helioseismic forward and inverse problem for solar differential rotation is presented. For the forward problem, differential rotation is represented as the axisymmetric component of a general toroidal flow field using velocity spherical harmonics. This approach allows each degree of differential rotation to be estimated independently from all other degrees. In the inverse problem, the splitting caused by differential rotation is expressed as an expansion in a set of orthonormal polynomials that are intimately related to the solution of the forward problem. The combined use of vector spherical harmonics as basis functions for differential ratio and the Clebsch-Gordon coefficients to represent splitting provides a unified approach to the forward and inverse problems of differential rotation which greatly simplify inversion.

Ritzwoller, Michael H.↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗

Adaptive Interface-PINNs (AdaI-PINNs) for transient diffusion: Applications to forward and inverse problems in heterogeneous media

We model transient diffusion in heterogeneous materials using a novel physics-informed neural networks framework (PINNs) termed Adaptive interface physics-informed neural networks or AdaI-PINNs (Roy et al. arXiv preprint arXiv:2406.04626, 2024). AdaI-PINNs utilize different activation functions with trainable slopes tailored to each material region within the computational domain, allowing for a fully automated and adaptive PINNs approach to model interface problems with strongly and weakly discontinuous solutions. To enhance its performance in highly heterogeneous transient diffusion systems, we prescribe a suite of robust practices, including appropriate non-dimensionalization of equations, a biased sampling method, Glorot initialization, and the hard enforcement of boundary and initial conditions. Here we evaluate the efficacy of the proposed method on several benchmark forward and inverse problems. Comparative studies on one-dimensional and two-dimensional benchmark problems reveal that the modified AdaI-PINNs outperform its unmodified counterpart, achieving root-mean-square errors that are at least two orders of magnitude better in forward problems. For inverse problems, the maximum errors in the approximated diffusion coefficients by modified AdaI-PINNs are four orders of magnitude better than those of the unmodified version. Additionally, modified AdaI-PINNs demonstrate improved stability in problems with large material mismatches.

42 ENGINEERING↗

Geophysical approaches to inverse problems: A methodological comparison. Part 1: A Posteriori approach

The relationships of a variety of general computational methods (and variances) for treating illposed problems such as geophysical inverse problems are considered. Differences in approach and interpretation based on varying assumptions as to, e.g., the nature of measurement uncertainties are discussed along with the factors to be considered in selecting an approach. The reliability of the results of such computation is addressed.

Seidman, T. I.↗

Determining the general circulation of the ocean - A nonlinear inverse problem

The usual inversion procedures for determining the oceanic circulation take the density field as given. This does not explicitly account for the mismatch between the data (which are typically a single realization of the density field) and the circulation being estimated (which may be a time mean or some other smoothed quantity), but explicit consideration of the uncertainty of the density data renders the problem nonlinear, and new estimation methods have to be used. As an example, a nonlinear inversion is successfully applied here to the simple analytical model of Stommel and Veronis (1981). It is also shown that their linear procedure, if properly used, yields a much better result than they obtained.

Mercier, H.↗

Uncertainty quantification for inverse problems with application to ptychographic reconstruction

Inverse problems in imaging are commonly solved by optimization or learned surrogates that return a single reconstruction, while uncertainty information is often unavailable. In many experimental settings, however, uncertainty is required to assess reliability, guide downstream analysis, and prioritize additional measurements. In this note, we present a compact uncertainty-quantification framework based on local objective curvature, and then specialize it to ptychographic reconstruction. We further show how repeated reconstructions can be aggregated in a statistically principled way, including a practical implementation path for PtychoNN.

97 MATHEMATICS AND COMPUTING↗

The inverse problem of the optimal regulator.

The inverse problem of the optimal regulator is considered for a general class of multi-input systems with integral-type performance indices. A new phase variable canonical form is shown to be convenient for this analysis. The advantage of the canonical form is to separate the state variables into subvectors of directly controlled, indirectly controlled, and uncontrollable components. Necessary and sufficient conditions for optimized performance indices are given. With the nonlinearities of the system restricted to functions of the directly controlled state variables, additional results are developed about the nonnegative property of optimized loss functions.

Yokoyama, R.↗

An inverse problem in thermal imaging

This paper examines uniqueness and stability results for an inverse problem in thermal imaging. The goal is to identify an unknown boundary of an object by applying a heat flux and measuring the induced temperature on the boundary of the sample. The problem is studied both in the case in which one has data at every point on the boundary of the region and the case in which only finitely many measurements are available. An inversion procedure is developed and used to study the stability of the inverse problem for various experimental configurations.

Bryan, Kurt↗

Towards optimal sensor placement for inverse problems in spaces of measures

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in the sensor configuration and robust with respect to the source, yet relatively easy to compute in practice, compared to a direct evaluation of the error by a large number of samples. In particular, we consider the identification of a measure consisting of an unknown linear combination of point sources from a finite number of measurements contaminated by Gaussian noise. The statistical framework for recovery relies on two main ingredients: first, a convex but non-smooth variational Tikhonov point estimator over the space of Radon measures and, second, a suitable mean-squared error based on its Hellinger–Kantorovich distance to the ground truth. To quantify the error, we employ a non-degenerate source condition as well as careful linearization arguments to derive a computable upper bound. This leads to asymptotically sharp error estimates in expectation that are explicit in the sensor configuration. Thus they can be used to estimate the expected reconstruction error for a given sensor configuration and guide the placement of sensors in sparse inverse problems.

97 MATHEMATICS AND COMPUTING↗

Clouds and the inversion problem.

Limb darkening inversion analyzed by earth atmosphere model with imbedded cloud, discussing radiances inversion for various cloud covers and heights

House, F. B.↗

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describeds the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describes the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗

Retrieving the Balanced Winds on the Globe as a Generalized Inverse Problem

A generalized inverse technique is applied to retrieve two types of balanced winds that characterize the large-scale dynamics of the atmosphere: rotational winds based upon the linear balance equation, and divergent winds based upon the vorticity budget equation. Both balance equations are singular at or near the equator. The balance equations are transformed in spherical harmonic function space to an under-determined system, for which the scale-weighed least-squares solution consists of a sum of principal and singular components. The principal components represent the response to the source function for the regular eigenmodes, while the singular components are determined by the projection of an independent measurement on the singular eigenmodes. The method was tested with the NCEP/NCAR reanalysis data in which a quasi-balance condition exists. A realistic balanced wind field is retrievable when the singular components are computed based upon the reanalyzed wind data.

Lu, Huei-Iin↗