SEARCH · Search NASA

Results for “inverse solver”

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.

SourceResearch connectionFrom yearThrough year

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

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Inverse design for waveguide dispersion with a differentiable mode solver

Inverse design of optical components based on adjoint sensitivity analysis has the potential to address the most challenging photonic engineering problems. However, existing inverse design tools based on finite-difference-time-domain (FDTD) models are poorly suited for optimizing waveguide modes for adiabatic transformation or perturbative coupling, which lies at the heart of many important photonic devices. Among these, dispersion engineering of optical waveguides is especially challenging in ultrafast and nonlinear optical applications involving broad optical bandwidths and frequency-dependent anisotropic dielectric material response. In this work, we develop gradient back-propagation through a general-purpose electromagnetic eigenmode solver and use it to demonstrate waveguide dispersion optimization for second harmonic generation with maximized phase-matching bandwidth. This optimization of three design parameters converges in eight steps, reducing the computational cost of optimization by ∼100x compared to exhaustive search and identifying new designs for broadband optical frequency doubling of laser sources in the 1.3–1.4 µm wavelength range. Furthermore, we demonstrate that the computational cost of gradient back-propagation is independent of the number of parameters, as required for optimization of complex geometries. This technique enables practical inverse design for a broad range of previously intractable photonic devices.

Gray, Dodd (ORCID:000000030469599X)↗

DOE OSTI2025

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Quantification of LEU Holdup using gamma ray imaging and inverse transport solver

Holdup is the residual amount of special nuclear material (SNM) remaining in a processing facility after the bulk materials have been cleaned out. In commercial uranium processing facilities, quantification of holdup is a major challenge because of the highly variable shapes and sizes of the deposits. Any method that attempts to generalize and calibrate deposit shapes in order to quantify holdup will be prone to high uncertainties. Uncertainties on the order of ±50% are typical in holdup results. In international safeguards applications, a ±50% uncertainty can result in a large amount of material unaccounted for (MUF) thereby increasing the difficulty of detecting material diversion and facility misuse. An imaging-based methodology has been developed with the objective of significantly reducing this uncertainty by using the true deposit shape, instead of relying on oversimplified geometric assumptions. The project is a collaboration between ORNL, Y-12, and the University of Tennessee, Knoxville, TN. Uranium sources of known masses were measured using the Germanium Gamma-ray Imager (GeGI), a high-resolution imaging spectrometer, creating a pixelated map for each spectral bin. Two different gamma imaging methods are employed in this work: coded aperture imaging and Compton imaging. A validated MonteCarlo model of the detector has been developed using the GEANT4 code for determining the intrinsic response of the detector, its enclosure, and the coded aperture mask. An inverse transport solver based on the Markov Chain Monte-Carlo approach known as Differential Evolution Adaptive Metropolis (DREAM) is employed to use the measurement data from the image pixels (coded aperture or Compton) to solve for the mass of 235 U in the deposit. A reliable method based on the DREAM solver has been developed to flag the infinite thickness condition of a uranium deposit. The project team is working towards improving the image reconstruction for Compton imaging so that a better localization of the source can be achieved. Besides treating the coded aperture and Compton imaging methods independently, the project is also evaluating a combined method that uses the Compton scatter data from a coded aperture measurement. GEANT4 simulations are being performed to evaluate the combined approach. The impact on the DREAM optimization as the source thickness progressively approaches infinite thickness is being evaluated. A number of uranium sources available at ORNL have been measured, and the DREAM results have been tested and validated for the coded aperture imaging. A similar effort will be carried out to validate the Compton based method once the development of algorithms for better localization are complete. The imaging based quantification is very amenable to unattended monitoring of holdup accumulation at key measurement points. A proof of concept measurement has been completed to demonstrate this capability The current work used the high energy resolution imager GeGI. However, the approach and methodologies are applicable to other imagers such as the cadmium zin telluride (CZT) based imager manufactured by H3D, Inc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2025

Digital Twin for Chemical Science: a case study on water interactions on the Ag(111) surface

Directly visualizing chemical trajectories offers insights into catalysis, gas-phase reactions and photoinduced dynamics. Tracking the transformation of chemical species is best achieved by coupling theory and experiment. Here we developed Digital Twin for Chemical Science (DTCS) v.01, which integrates theory, experiment and their bidirectional feedback loops into a unified platform for chemical characterization. DTCS addresses a core question: given a set of experimental conditions, what is the expected outcome and why? It consists of a forward solver that takes a chemical reaction network and predicts spectra under experimental conditions, and an inverse solver that infers kinetics from measured spectra. We applied DTCS to ambient-pressure X-ray photoelectron spectroscopy measurements of the Ag–H2O interface as an example. This approach enables real-time knowledge extraction and guides experiments until a stopping condition is met based on accuracy and degeneracy. As a step toward autonomous chemical characterization, DTCS provides mechanistic knowledge in a verified, standardized manner.

Chemistry↗

DOE OSTI2020

Inversion of downhole electrical measurements for proppant mapping using very fast simulated annealing

Proppant mapping is critical for optimizing fracture treatment design and improving wells’ productivity. An electrode-based resistivity tool concept was developed earlier for proppant mapping in cased-hole wells. An array of insulating gaps is installed and cemented in place as a permanent part of the casing string. The electrical measurements are performed by imposing a voltage across each insulating gap, one at a time, before and after hydraulic fracture operations. The voltages across other insulating gaps near the transmitter gap are recorded. The method relies on direct excitation of the casing, which is expected to overcome the severe limitations of induction tools in cased-hole wells. A forward model based on a finite volume method has been developed to simulate the tool’s response to one or multiple fractures. To enable the implementation of such a practical system in multistage fractured horizontal wells, a fast and robust inversion approach is required. To that end, we have developed a divide-and-conquer approach based on a global optimization algorithm very fast simulated annealing (VFSA). Specifically, the original inverse problem is divided into subproblems and each subproblem can be solved separately using VFSA. The results indicate that our approach can invert the data and output widths and radii of multiple fractures without requiring a large number of forward simulations. The robustness of the inverse solver is also tested by adding Gaussian noise to the synthetic data. We tested example cases that demonstrate that when up to 5% noise is introduced, VFSA still provides very accurate inversion results with moderate uncertainties. Inversion results with some more realistic conditions, e.g., tilted fractures, complex fractures, and so on, are also presented.

Geochemistry & Geophysics↗

DOE OSTI2023

Performance-Portable GPU Acceleration of the EFIT Tokamak Plasma Equilibrium Reconstruction Code

This paper presents the steps followed to GPU-offload parts of the core solver of EFIT-AI, an equilibrium reconstruction code suitable for tokamak experiments and burning plasmas. For this work, we will focus on the fitting procedure that consists of a Grad–Shafranov (GS) equation inverse solver that calculates equilibrium reconstructions on a grid. We will show profiling results of the original code (CPU-baseline), as well as the directives used to GPU-offload the most time-consuming function, initially to compare OpenACC and OpenMP on NVIDIA and AMD GPUs and later on to assess OpenMP performance portability on NVIDIA, AMD and Intel GPUs. We will make a performance comparison for different spatial grid sizes and show the speedup achieved on NVIDIA A100 (Perlmutter-NERSC), AMD MI250X (Frontier-OLCF) and Intel PVC GPUs (Sunspot-ALCF). Finally, we will draw some conclusions and recommendations to achieve high-performance portability for an equilibrium reconstruction code on the new HPC architectures

GPU↗

DOE OSTI2026

Conditional diffusion machine-learning framework for mapping valence electron distribution from convergent beam electron diffraction

Quantitative convergent beam electron diffraction (CBED) enables determination of aspherical valence electron distributions through refinement of low-order structure factors, which are highly sensitive to chemical bonding and charge density variations. However, conventional quantitative CBED (QCBED) requires solving a highly nonlinear inverse problem with many coupled parameters, and computationally intensive dynamical diffraction calculations, making it time-consuming and difficult to apply to complex systems. More broadly, reconstructing charge density and orbital electron distribution from diffraction data has long been a central challenge in both x-ray and electron crystallography. Here, in this study, we introduce an artificial-intelligence (AI)-based framework that replaces traditional refinement with a data-driven inverse solver. Using a large synthetic CBED dataset generated by Bloch-wave simulations, we train a conditional diffusion model to directly infer crystal structural parameters and multipole density formalism parameters, and hence valence electron distributions, from CBED patterns alone. By learning from forward simulations across realistic parameter space, the model effectively solves the inverse problem. Compared with direct regression approaches, the diffusion-based framework provides posterior parameter distributions for rigorous uncertainty quantification while preserving quantitative fidelity and reducing analysis time by orders of magnitude. By eliminating the need for external single-crystal x-ray diffraction data and complex nonlinear refinement, this approach enables practical, high-throughput, and in situ quantitative CBED, enabling real-time mapping of valence electron distributions and their correlation with functional responses in quantum and energy materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2021

Drift reduced Landau fluid model for magnetized plasma turbulence simulations in BOUT++ framework

Recently the drift-reduced Landau fluid six-field turbulence model within the BOUT++ framework has been upgraded. In particular, this new model employs a new normalization, adds a volumetric flux-driven source option, the Landau fluid closure for parallel heat flux and a Laplacian inversion solver which is able to capture $n$ = 0 axisymmetric mode evolution in realistic tokamak configurations. As we report here, these improvements substantially extended model's capability to study a wider range of tokamak edge phenomena, and are essential to build a fully self-consistent edge turbulence model capable of both transient (e.g., ELM, disruption) and transport time-scale simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

VAIM-CFF: a variational autoencoder inverse mapper solution to Compton form factor extraction from deeply virtual exclusive reactions

We develop a new methodology for extracting Compton form factors (CFFs) from deeply virtual exclusive reactions such as the unpolarized DVCS cross section using a specialized inverse problem solver, a variational autoencoder inverse mapper (VAIM). The VAIM-CFF framework not only allows us access to a fitted solution set possibly containing multiple solutions in the extraction of all 8 CFFs from a single cross section measurement, but also accesses the lost information contained in the forward mapping from CFFs to cross section. We investigate various assumptions and their effects on the predicted CFFs such as cross section organization, number of extracted CFFs, use of uncertainty quantification technique, and inclusion of prior physics information. We then use dimensionality reduction techniques such as principal component analysis to visualize the missing physics information tracked in the latent space of the VAIM framework. Through re-framing the extraction of CFFs as an inverse problem, we gain access to fundamental properties of the problem not comprehensible in standard fitting methodologies: exploring the limits of the information encoded in deeply virtual exclusive experiments.

Accelerator Physics↗

DOE OSTI2026

Regularizing INR with Diffusion Prior for Self-Supervised 3D Reconstruction OF Neutron Computed Tomography Data

Recently, generative diffusion priors have made huge strides as inverse problem solvers, including the ability to be adapted for inference on out-of-distribution data. Concurrently, implicit neural representations (INRs) have emerged as fast and lightweight inverse imaging solvers that are amenable to hybrid approaches that combine learned priors with traditional inverse problem formulations. In this paper, we present a diffusive computed tomography (CT) inversion framework for regularizing INRs called Diffusive INR (DINR), designed to enable high-quality reconstruction from sparse-view neutron CT. Pretrained purely on synthetic data, DINR is evaluated on simulated and experimentally obtained observations of concrete microstructures, where traditional reconstruction methods suffer substantial degradation when the number of views is reduced. Our approach delivers superior performance, reduces reconstruction artifacts, and achieves gains in PSNR and SSIM, enabling accurate micro-structural characterization even under extreme data limitations compared to state-of-the-art sparse-view reconstruction techniques.

Hossain, Maliha [ORNL]↗

DOE OSTI2024

Ensemble Kalman inversion of induced polarization data

SUMMARY This paper explores the applicability of ensemble Kalman inversion (EKI) with level-set parametrization for solving geophysical inverse problems. In particular, we focus on its extension to induced polarization (IP) data with uncertainty quantification. IP data may provide rich information on characteristics of geological materials due to its sensitivity to characteristics of the pore–grain interface. In many IP studies, different geological units are juxtaposed and the goal is to delineate these units and obtain estimates of unit properties with uncertainty bounds. Conventional inversion of IP data does not resolve well sharp interfaces and tends to reduce and smooth resistivity variations, while not readily providing uncertainty estimates. Recently, it has been shown for DC resistivity that EKI is an efficient solver for inverse problems which provides uncertainty quantification, and its combination with level set parametrization can delineate arbitrary interfaces well. In this contribution, we demonstrate the extension of EKI to IP data using a sequential approach, where the mean field obtained from DC resistivity inversion is used as input for a separate phase angle inversion. We illustrate our workflow using a series of synthetic and field examples. Variations with uncertainty bounds in both DC resistivity and phase angles are recovered by EKI, which provides useful information for hydrogeological site characterization. Although phase angles are less well-resolved than DC resistivity, partly due to their smaller range and higher percentage data errors, it complements DC resistivity for site characterization. Overall, EKI with level set parametrization provides a practical approach forward for efficient hydrogeophysical imaging under uncertainty.

Geochemistry & Geophysics↗

DOE OSTI2023

Nuclear Data Evaluations in the Resolved Resonance Region and Proposed Updates to Rmatrix Modeling in the SAMMY Code [Slides]

This detailed presentation starts off with an evaluation workflow scheme along with observables definition. Provided next are typical cases of explicit experimental effects and the basic quantities for reproducibility. Lastly the presentation mentions the Inverse channel, Complex radius, and the level dependent boundary condition. A visual workflow scheme is provided.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

Uranium Mass Attribute System (UMAS) Study: Evaluation of Options against the Arms Control Evaluation Criteria

In this FY19 study, a range of possible measurement systems for confirming a U-235 mass attribute were identified. The systems were reviewed for their applicability in a potential future arms control agreement, and a subset of the eight most plausible systems were selected for further evaluation against the Arms Control Evaluation Criteria (ACEC). The evaluation results were then used to identify a primary and secondary recommended measurement system for confirming a U-235 mass attribute on warheads, nuclear components of warheads, and/or materials as part of a hypothetical arms control agreement.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

DOE OSTI2020

Gamma ray Imaging Based Methods to Improve the Accuracy of Uranium Holdup Quantification

Deposits in commercial uranium processing facilities of interest to nuclear safeguards are predominantly low enriched uranium (LEU). The shapes and sizes of holdup deposits can vary significantly, thus making it difficult to model the deposits accurately for calibration purposes. This presents a challenge to currently employed methods such as the Generalized Geometry Holdup (GGH) that rely on quantifying 235U mass by simplifying deposit shapes as a point, a line, or an area. In this work, gamma ray imaging using high energy resolution Germanium Gamma Imagers (GeGI™) is employed to determine the distribution of uranium inside the source containment. Two types of imaging methods are employed; coded-aperture imaging and Compton imaging. Gamma-ray emissions seen in different regions of the image are quantified using an inverse gamma-ray transport solver being developed at ORNL. Using measured data, the inverse method will be used to solve for unknown source parameters such as source matrix thickness, density, and attenuation due to container wall and shielding. The intrinsic efficiency of the detector is determined based on a library of built-in response functions and key dimensions of the detector (e.g., thickness and radius of the detector crystal). Measurements are performed in both imaging modalities using uranium sources of well-known masses and enrichments configured inside mocked-up holdup fixtures. Results from the two imaging modalities are intercompared. The paper presents preliminary results of the imaging measurements and the progress made in the computational methods to quantify uranium mass.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DOE OSTI2024

Implementation and (Inverse Modified) Error Analysis for Implicitly Templated ODE-Nets

We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. Here, we also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.

ODE-nets↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗