Search NASASearch

SEARCH · Search NASA

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

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

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

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error

Solving high-dimensional inverse problems using amortized likelihood-free inference with noisy and incomplete data

Here, we present a likelihood-free probabilistic inversion method based on normalizing flows for high-dimensional inverse problems. The proposed method is composed of two complementary networks: a summary network for data compression and an inference network for parameter estimation. The summary network encodes raw observations into a fixed-size vector of summary features, while the inference network generates samples of the approximate posterior distribution of the model parameters based on these summary features. The posterior samples are produced in a deep generative fashion by sampling from a latent Gaussian distribution and passing these samples through an invertible transformation. We construct this invertible transformation by sequentially alternating conditional invertible neural network and conditional neural spline flow layers. The summary and inference networks are trained simultaneously. We apply the proposed method to an inversion problem in groundwater hydrology to estimate the posterior distribution of the log-conductivity field conditioned on spatially sparse time-series observations of the system’s hydraulic head responses. The conductivity field is represented with 706 degrees of freedom in the considered problem. Comparison with the likelihood-based iterative ensemble smoother PEST-IES method demonstrates that the proposed method accurately estimates the parameter posterior distribution and the observations’ predictive posterior distribution at a fraction of the inference time of PEST-IES.

conditional invertible neural network

Stability and Convergence of Solutions to Stochastic Inverse Problems Using Approximate Probability Densities

Data-consistent inversion is designed to solve a class of stochastic inverse problems where the solution is a pullback of a probability measure specified on the outputs of a quantities of interest (QoI) map. Here, this work presents stability and convergence results for the case where finite QoI data result in an approximation of the solution as a density. Given their popularity in the literature, separate results are proven for three different approaches to measuring discrepancies between probability measures: f-divergences, integral probability metrics, and L p metrics. In the context of integral probability metrics, we also introduce a pullback probability metric that is well-suited for data-consistent inversion. This fills a theoretical gap in the convergence and stability results for data-consistent inversion that have mostly focused on convergence of solutions associated with approximate maps. Numerical results are included to illustrate key theoretical results with intuitive and reproducible test problems that include a demonstration of convergence in the measure-theoretic "almost" sense.

97 MATHEMATICS AND COMPUTING

Inverse problems in the modeling of vibrations of flexible beams

The formulation and solution of inverse problems for the estimation of parameters which describe damping and other dynamic properties in distributed models for the vibration of flexible structures is considered. Motivated by a slewing beam experiment, the identification of a nonlinear velocity dependent term which models air drag damping in the Euler-Bernoulli equation is investigated. Galerkin techniques are used to generate finite dimensional approximations. Convergence estimates and numerical results are given. The modeling of, and related inverse problems for the dynamics of a high pressure hose line feeding a gas thruster actuator at the tip of a cantilevered beam are then considered. Approximation and convergence are discussed and numerical results involving experimental data are presented.

Banks, H. T.

Large-momentum effective theory’s asymptotic extrapolation vs the inverse problem

Large-momentum effective theory is a physics-guided systematic expansion to calculate light-cone parton distributions, including collinear (PDFs) and transverse-momentum-dependent ones, at any fixed momentum fraction 𝑥 within a range of [𝑥 min , 𝑥 max ]. It theoretically solves the ill-posed inverse problem that afflicts other theoretical approaches to collinear PDFs, such as short-distance factorizations. Recently, Dutrieux et al. raised practical concerns about whether current or even future lattice data will have sufficient precision in the subasymptotic correlation region to support an error-controlled extrapolation—and if not, whether it becomes an inverse problem where the relevant uncertainties cannot be properly quantified. While we agree that not all current lattice data have the desired precision to qualify for an asymptotic extrapolation, some calculations do, and more are expected in the future. We comment on the analysis and results in Dutrieux et al. and argue that a physics-based systematic extrapolation still provides the most reliable error estimates, even when the data quality is not ideal. In contrast, reframing the long-distance asymptotic extrapolation as a data-driven-only inverse problem with ad hoc mathematical conditioning could lead to unnecessarily conservative errors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING