Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization, 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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Transient Storage Model Parameter Optimization Using the Simulated Annealing Method

Hyporheic exchange in streams is critical to ecosystem functions such as nutrient cycling along river corridors, especially for slowly moving or small stream systems. The transient storage model (TSM) has been widely used for modeling of hyporheic exchange. TSM calibration, for hyporheic exchange, is typically used to estimate four parameters, including the mass exchange rate coefficient, the dispersion coefficient, stream cross-sectional area, and hyporheic zone cross-sectional area. Prior studies have raised concerns regarding the non-uniqueness of the inverse problem for the TSM, that is, the occurrence of different parameter vectors resulting in TSM solution that reproduces the observed in-stream tracer break through curve (BTC) with the same error. This leads to practical non-identifiability in determining the unknown parameter vector values even when global-optimal values exist, and the parameter optimization becomes practically non-unique. To address this problem, we applied the simulated annealing method to calibrate the TSM to BTCs, because it is less susceptible to local minima-induced non-identifiability. A hypothetical (or synthetic) tracer test data set with known parameters was developed to demonstrate the capability of the simulated annealing method to find the global minimum parameter vector, and it identified the “hypothetically-true” global minimum parameter vector even with input data that were modified with up to 10% noise without increasing the number of iterations required for convergence. The simulated annealing TSM was then calibrated using two in-stream tracer tests conducted in East Fork Poplar Creek, Tennessee. In conclusion, simulated annealing was determined to be appropriate for quantifying the TSM parameter vector because of its search capability for the global minimum parameter vector.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2017

Approximate solutions of acoustic 3D integral equation and their application to seismic modeling and full-waveform inversion

Over the recent decades, a number of fast approximate solutions of Lippmann–Schwinger equation, which are more accurate than classic Born and Rytov approximations, were proposed in the field of electromagnetic modeling. Those developments could be naturally extended to acoustic and elastic fields; however, until recently, they were almost unknown in seismology. This paper presents several solutions of this kind applied to acoustic modeling for both lossy and lossless media. We evaluated the numerical merits of those methods and provide an estimation of their numerical complexity. In our numerical realization we use the matrix-free implementation of the corresponding integral operator. We study the accuracy of those approximate solutions and demonstrate, that the quasi-analytical approximation is more accurate, than the Born approximation. Further, we apply the quasi-analytical approximation to the solution of the inverse problem. It is demonstrated that, this approach improves the estimation of the data gradient, comparing to the Born approximation. The developed inversion algorithm is based on the conjugate-gradient type optimization. Numerical model study demonstrates that the quasi-analytical solution significantly reduces computation time of the seismic full-waveform inversion. We also show how the quasi-analytical approximation can be extended to the case of elastic wavefield.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A refined assessment of nuclear data target accuracy requirements for ALFRED

The interest in target accuracy assessment has been recently renewed within the OECD/NEA Working Party on International Nuclear Data Evaluation Cooperation with an update exercise, thanks to the invaluable initiative of Massimo Salvatores. This work, moving from evaluations on the main core integral parameters of the Advanced Lead-cooled Fast Reactor European Demonstrator (ALFRED), and the identification of the associated target accuracies needed for improving its design, approaches the retrieval of target accuracy requirements for nuclear data, as the inverse problem of uncertainty quantification. The preliminary results obtained in a previous work are here refined by explicitly taking into account the total contribution due to correlations among variables in the optimization constraint, while its various components are evaluated individually. Moreover, three different sets of cost parameters are considered to introduce a bias in the solution in order to take in due account the relative difficulties in the execution of new differential experiments as needed for achieving the proposed target accuracies. By this, the obtained results are deemed usefully informative, and proposed for the update of a High Priority List which identifies the isotopes-reaction couples of most interest for future refinement experiments, especially when integrated with further analogous information collected on other advanced nuclear systems. Among the cross-sections whose refinement contributes the most to the reduction of the multiplication factor, the fission of Pu{sup 239} was found, which needs to be fixed below 1% in the range of interest for ALFRED (2 keV-4 MeV). Another contribution for the amelioration of the multiplication factor calculation accuracy, is due to the capture channel of Pu{sup 239}, for which the initial high uncertainty (around 15%) can be significantly reduced resorting to easily practicable experiments. The same occurs for the inelastic of Pb{sup 207}, for which the initial uncertainty value of around 50% can be drastically reduced up to target values between 4% and 7%.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2019

Tunable intrinsic strain in two-dimensional transition metal electrocatalysts

Tuning surface strain is a powerful strategy for tailoring the reactivity of metal catalysts. Traditionally, surface strain is imposed by external stress from a heterogeneous substrate, but the effect is often obscured by interfacial reconstructions and nanocatalyst geometries. Here, we report on a strategy to resolve these problems by exploiting intrinsic surface stresses in two-dimensional transition metal nanosheets. Density functional theory calculations indicate that attractive interactions between surface atoms lead to tensile surface stresses that exert a pressure on the order of 10 5 atmospheres on the surface atoms and impart up to 10% compressive strain, with the exact magnitude inversely proportional to the nanosheet thickness. Atomic-level control of thickness thus enables generation and fine-tuning of intrinsic strain to optimize catalytic reactivity, which was confirmed experimentally on Pd(110) nanosheets for the oxygen reduction and hydrogen evolution reactions, with activity enhancements that were more than an order of magnitude greater than those of their nanoparticle counterparts.

Wang, Lei (ORCID:0000000204434231)↗
DOE OSTI2018

A special generalized HSS method for discrete ill-posed problems

In this paper, we use a new special generalized Hermitian and skew-Hermitian splitting (SGHSS) method for solving ill-posed inverse problems. Based on an augmented system formulation, we apply a new splitting for the Hermitian part of the coefficient matrix and discuss on the convergence of this iterative method. Moreover, the optimal parameter minimizing the spectral radius of iteration matrix is derived. Finally, we present some numerical examples to demonstrate the performance of the presented method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An analysis of the spatio-temporal resolution of the immersed boundary method with direct forcing

The immersed boundary method (IBM) with direct forcing is very popular in the simulation of rigid particulate flows. In the IBM, an interaction force is introduced at the interface between fluid and particle in order to approximate the no-slip boundary condition. The interaction force is calculated through dividing the velocity difference (or error) between fluid and particle at the interface by the time step. Here, a dynamic equation for the velocity difference is derived. Additionally, analyses on the dynamic equation provide a few new findings: (i) The interaction force is the solution of a least-squares error problem, with the direct implication that the Lagrangian marker distribution has no effect on the large scale flow structure once the distribution of Lagrangian markers become saturated along the interface (i.e., each marker remains properly correlated with all its neighbors); (ii) The Lagrangian volume-weight is a relaxation factor to control how fast the velocity error decays to the ideal value of zero; (iii) The optimal choice of the Lagrangian volume-weight is the largest value permissible by a stability condition. A comprehensive convergence analysis with regard to the spatial and temporal resolution is presented for the velocity error and also for the shear-stress and surface pressure. In three simple canonical problems, it is analytically and numerically shown that the IBM results converge to the theoretical solutions obtained with precise imposition of no-slip and no-penetration boundary conditions. It is observed that it is not necessary to match the Lagrangian marker volume-weight to that of the local Eulerian cell volume and in fact this matching leads to lower than optimal computational efficiency. However, it is found that extremely high Eulerian grid resolution and small time step have to be used to obtain high precision simulation results. Especially, the time step should be inversely proportional to the particle Reynolds number for low Reynolds number flows. For high frequency oscillation problems, the grid size needs to be reduced by a factor of the square root of the frequency, and the time step to be reduced by a factor of the frequency. The theoretical findings here can be used to alleviate the technical difficulties in simulating non-spherical particles by not requiring the Lagrangian marker distribution to match the Eulerian grids and also in the implementation of IBM on non-uniform Eulerian grids. The present work also provides simple practical guidance on the choice of temporal and spatial resolution so as to control the simulation error a priori.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Improved Bayesian regularization of inverse problems in vibrations and acoustics using noise-only measurements

Here, this paper studies Tikhonov regularization (ridge regression) parameter selection for problems in vibrations and acoustics. The selection method is based on a popular Bayesian method, but it incorporates measurements of sensor noise. The regularization parameter is closely related to the ratio of system input energy to noise energy, so noise measurements inform the inference procedure and improve parameter identification. In cases where standard Bayesian regularization identifies zero as the optimal regularization parameter, noise measurements guarantee a unique nonzero optimum. Sufficient theoretical criteria are developed for this guarantee. The method is verified in even-determined and under-determined configurations in an acoustic source localization simulation and a vibration load identification experiment. It is shown to yield significant improvements over existing empirical Bayesian regularization. Improvements are larger in the even-determined case and smaller in the under-determined case, wherein the inverse solution is less sensitive to the regularization parameter.

42 ENGINEERING↗
DOE OSTI2020

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Stochastic inverse problems: Models and metrics

In past work, we introduced model-based inverse methods, and applied them to problems in which the anomaly could be reasonably modeled by simple canonical shapes, such as rectangular solids. In these cases the parameters to be inverted would be length, width and height, as well as the occasional probe lift-off or rotation. We are now developing a formulation that allows more flexibility in modeling complex flaws. The idea consists of expanding the flaw in a sequence of basis functions, and then solving for the expansion coefficients of this sequence, which are modeled as independent random variables, uniformly distributed over their range of values. There are a number of applications of such modeling: 1. Connected cracks and multiple half-moons, which we have noted in a POD set. Ideally we would like to distinguish connected cracks from one long shallow crack. 2. Cracks of irregular profile and shape which have appeared in cold work holes during bolt-hole eddy-current inspection. One side of such cracks is much deeper than other. 3. L or C shaped crack profiles at the surface, examples of which have been seen in bolt-hole cracks. By formulating problems in a stochastic sense, we are able to leverage the stochastic global optimization algorithms in NLSE, which is resident in VIC-3D®, to answer questions of global minimization and to compute confidence bounds using the sensitivity coefficient that we get from NLSE. We will also address the issue of surrogate functions which are used during the inversion process, and how they contribute to the quality of the estimation of the bounds.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Progressive transfer learning for low-frequency data prediction in full waveform inversion

To effectively overcome the cycle-skipping issue in full waveform inversion (FWI), we developed a deep neural network (DNN) approach to predict the absent low-frequency components by exploiting the hidden physical relation connecting the low- and the high-frequency data. To efficiently solve this challenging nonlinear regression problem, two novel strategies were proposed to design the DNN architecture and to optimize the learning process: (1) dual data feed structure; (2) progressive transfer learning. With the dual data feed structure, not only the high-frequency data, but also the corresponding beat tone data are fed into the DNN to relieve the burden of feature extraction. The second strategy, progressive transfer learning, enables us to train the DNN using a single evolving training dataset. Within the framework of the progressive transfer learning, the training dataset continuously evolves in an iterative manner by gradually retrieving the subsurface information through the physics-based inversion module, progressively enhancing the prediction accuracy of the DNN and propelling the inversion process out of the local minima. Here, the synthetic numerical experiments suggest that, without any a priori geological information, the low-frequency data predicted by the progressive transfer learning are sufficiently accurate for an FWI engine to produce reliable subsurface velocity models free of cycle-skipping artifacts.

02 PETROLEUM↗
DOE OSTI2018

On the Spatial Localization of Free Electrons in 4H-SiC MOSFETS with an n Channel

The problem of the spatial localization of free electrons in 4H-SiC metal—oxide—semiconductor field effect transistors (MOSFETS) with an accumulation- and inversion-type n channel is theoretically analyzed. The analysis demonstrates that, in optimally designed accumulation transistors (ACCUFETs), the average distance from the surface, at which free electrons are localized, may be an order of magnitude larger than that in inversion MOSFETs. This can make 4H-SiC ACCUFETs advantageous as regards the effective carrier mobility in a conducting channel.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

Community Project for Accelerator Science and Simulation (ComPASS)

After concluding our initial exercise (solving a simplified statistical inverse problem with unknown parameter laser intensity) of coupling Vorpal and our parallel statistical library QUESO, we shifted the application focus to DLA. Our efforts focused on developing a Gaussian process (GP) emulator within QUESO for efficient optimization of power couplers within woodpiles. The smaller simulation size (compared with LPA) allows for sufficient “training runs” to develop a reasonable GP statistical emulator for a parameter space of moderate dimension.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗
DOE OSTI2022

Iterative subspace algorithms for finite-temperature solution of Dyson equation

One-particle Green’s functions obtained from the self-consistent solution of the Dyson equation can be employed in the evaluation of spectroscopic and thermodynamic properties for both molecules and solids. However, typical acceleration techniques used in the traditional quantum chemistry self-consistent algorithms cannot be easily deployed for the Green’s function methods because of a non-convex grand potential functional and a non-idempotent density matrix. Moreover, the optimization problem can become more challenging due to the inclusion of correlation effects, changing chemical potential, and fluctuations of the number of particles. In this paper, we study acceleration techniques to target the self-consistent solution of the Dyson equation directly. We use the direct inversion in the iterative subspace (DIIS), the least-squared commutator in the iterative subspace (LCIIS), and the Krylov space accelerated inexact Newton method (KAIN). We observe that the definition of the residual has a significant impact on the convergence of the iterative procedure. Based on the Dyson equation, we generalize the concept of the commutator residual used in DIIS and LCIIS and compare it with the difference residual used in DIIS and KAIN. The commutator residuals outperform the difference residuals for all considered molecular and solid systems within both GW and GF2. For a number of bond-breaking problems, we found that an easily obtained high-temperature solution with effectively suppressed correlations is a very effective starting point for reaching convergence of the problematic low-temperature solutions through a sequential reduction of temperature during calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

iTOUGH2 v7.1

iTOUGH2 (inverse TOUGH2) provides inverse modeling capabilities for TOUGH2, a simulator for multi-dimensional, multi-phase, multi-component, non-isothermal flow and transport in fractured porous media. iTOUGH2 performs sensitivity analyses, data-worth analyses, parameter estimation, and uncertainty propagation analyses in geosciences and reservoir engineering and other application areas. iTOUGH2 supports a number of different combinations of fluids and components (equation-of-state (EOS) modules). In addition, the optimization routines implemented in iTOUGH2 can also be used for sensitivity analysis, automatic model calibration, and uncertainty quantification of any external code that uses text-based input and output files using the PEST protocol. iTOUGH2 solves the inverse problem by minimizing a non-linear objective function of the weighted differences between model output and the corresponding observations. Multiple minimization algorithms (derivative-free, gradient-based, and second-order; local and global) are available. iTOUGH2 also performs Latin Hypercube Monte Carlo simulations for uncertainty propagation analyses. A detailed residual and error analysis is provided. This upgrade includes (a) global sensitivity analysis methods, (b) dynamic memory allocation (c) additional input features and output analyses, (d) increased forward simulation capabilities, (e) parallel execution on multicore PCs and Linux clusters, and (f) bug fixes.

Finsterle, Stefan↗
DOE OSTI2015

TU-EF-304-07: Monte Carlo-Based Inverse Treatment Plan Optimization for Intensity Modulated Proton Therapy

Purpose: Intensity-modulated proton therapy (IMPT) is increasingly used in proton therapy. For IMPT optimization, Monte Carlo (MC) is desired for spots dose calculations because of its high accuracy, especially in cases with a high level of heterogeneity. It is also preferred in biological optimization problems due to the capability of computing quantities related to biological effects. However, MC simulation is typically too slow to be used for this purpose. Although GPU-based MC engines have become available, the achieved efficiency is still not ideal. The purpose of this work is to develop a new optimization scheme to include GPU-based MC into IMPT. Methods: A conventional approach using MC in IMPT simply calls the MC dose engine repeatedly for each spot dose calculations. However, this is not the optimal approach, because of the unnecessary computations on some spots that turned out to have very small weights after solving the optimization problem. GPU-memory writing conflict occurring at a small beam size also reduces computational efficiency. To solve these problems, we developed a new framework that iteratively performs MC dose calculations and plan optimizations. At each dose calculation step, the particles were sampled from different spots altogether with Metropolis algorithm, such that the particle number is proportional to the latest optimized spot intensity. Simultaneously transporting particles from multiple spots also mitigated the memory writing conflict problem. Results: We have validated the proposed MC-based optimization schemes in one prostate case. The total computation time of our method was ∼5–6 min on one NVIDIA GPU card, including both spot dose calculation and plan optimization, whereas a conventional method naively using the same GPU-based MC engine were ∼3 times slower. Conclusion: A fast GPU-based MC dose calculation method along with a novel optimization workflow is developed. The high efficiency makes it attractive for clinical usages.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Inverse Analysis with Variational Autoencoders: A Comparison of Shallow and Deep Networks

Inverse problems are applied to determine unknown properties by matching observational data with a physical model that often takes many parameters as input. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented involving regularization with a technique known as a variational autoencoder (VAE), which is trained to map a high-dimensional parameter space with a complex structure to a low-dimensional latent space with a simple structure. We apply this approach to unconditioned realizations of the parameters (heterogeneous hydraulic fields) for a hydrogeological inverse problem. Two types of hydraulic conductivity fields are used to evaluate the characterization for the different levels of heterogeneity complexity of the physical inputs. This approach keeps the computational cost of generating the training data low. The reason is unconditioned realizations neither rely on the observational data used to perform the inverse analysis nor require any groundwater flow model forward runs. In addition, this approach applies regularization on a low-dimensional latent space from the VAE and increases optimization efficiency through automatic differentiation. Furthermore, two different neural network (NN) structures are tested for their utility in using the VAE for inverse analysis. The performance of a deep, convolutional neural network strongly depends on the dimensionality of the latent space, which requires tuning. In contrast, a shallow, dense neural network provides consistently accurate characterization without tuning. Furthermore, our approach evaluates the advantages of the shallow, dense neural network over the deep, convolutional one and enables future application to a wide range of inverse problems.

97 MATHEMATICS AND COMPUTING↗