Search NASA⌕ Search

SEARCH · Search NASA

Results for “Inverse problem”

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 1,567 records · Page 87

Dark matter in the minimal inverse seesaw mechanism

We consider the possibility of simultaneously addressing the dark matter problem and neutrino mass generation in the minimal inverse seesaw realisation. The Standard Model is extended by two right-handed neutrinos and three sterile fermionic states, leading to three light active neutrino mass eigenstates, two pairs of (heavy) pseudo-Dirac mass eigenstates and one (mostly) sterile state with mass around the keV, possibly providing a dark matter candidate, and accounting for the recently observed and still unidentified monochromatic 3.5 keV line in galaxy cluster spectra. The conventional production mechanism through oscillation from active neutrinos can account only for ∼ 43% of the observed relic density. This can be slightly increased to ∼ 48% when including effects of entropy injection from the decay of light (with mass below 20 GeV) pseudo-Dirac neutrinos. The correct relic density can be achieved through freeze-in from the decay of heavy (above the Higgs mass) pseudo-Dirac neutrinos. This production is only effective for a limited range of masses, such that the decay occurs not too far from the electroweak phase transition. We thus propose a simple extension of the inverse seesaw framework, with an extra scalar singlet coupling to both the Higgs and the sterile neutrinos, which allows to achieve the correct dark matter abundance in a broader region of the parameter space, in particular in the low mass region for the pseudo-Dirac neutrinos.

79 ASTRONOMY AND ASTROPHYSICS↗

Georgia Tech Accelerated, Compressed, and Regularized Compute of Kinetic-based PDEs (Final Report)

This report summarizes the collaborative effort between Lawrence Livermore National Laboratory and Georgia Tech to enhance the BoBa library for tensor train computation in PDE solvers, with a target on kinetic equations and their continuum limits. We aimed to reduce computational cost and memory usage by replacing traditional array-based computations with tensor trains. We examined the compressibility of time-evolving solutions to the Euler equations with discontinuities. We also explored using the first invsicid and linear regularization of the compressible flow equations via the information geometric regularization (IGR). We explored this in a tensor train formulation. To identify that inverse terms in the IGR equations pose problems for tensor train formulations and investigate efficient methods for batched inversion of tensor trains.

97 MATHEMATICS AND COMPUTING↗

Inversion of Gravity Fields From the Spacecraft Orbital Data Using an Adjoint Operator Approach

In perturbation approximation, the forward problem of orbital dynamics (equations with initial conditions) is linear with respect to variations of coordinates and/or velocities of the spacecraft and to corresponding variations of the gravity field in the models used. The linear operator adjoint to the linear operator of such forward problem turns out to be instrumental in inversion of differences between observed and predicted coordinates/velocities in terms of the updates of harmonics in the initial gravity field model. Based on this approach, the solution of resulting adjoint problem of orbital dynamics can be used to directly evaluate the matrix of partial derivatives of observable differences with respect to the gravity field harmonics. General discussion of the adjoint problem of orbital dynamics is given and an example of a mathematical formalism for the practical retrieval algorithm is presented.

Ustinov, E. A.↗

Lambert’s Problem – A Geometric Approach

A fundamental problem in spacecraft mission design is to find a free flight path from one place to another in a chosen travel time. Lambert studied this problem for free flight in an inverse square central force field, and Lagrange produced a solution in 1778. Although this is an old problem, a new approach may be of some value. There are two steps to the new solution. First, find every ellipse with focus at the origin that intersects two circles both centered at the origin. Then select only those ellipses that have a specified angle between the intersection points of the ellipse with the inner and outer circles. Second, find the travel times between intersections for each ellipse. These are all the possible travel times from which one may choose. Standard solutions to Lambert’s problem can be found in references [1-4].

Easton, Robert↗

Towards robust autonomous impedance spectroscopy analysis: A calibrated hierarchical Bayesian approach for electrochemical impedance spectroscopy (EIS) inversion

Distribution-based analyses, such as the distribution of relaxation times (DRT) and the distribution of diffusion times (DDT), present model-free alternatives to equivalent circuit modeling for analysis of electrochemical impedance spectroscopy (EIS) data. However, reconstructing such distributions from noisy impedance data is an ill-posed problem that must be solved with specialized inversion algorithms, requiring careful control and tuning. Furthermore, most inversion algorithms developed to date can only solve problems of limited complexity. Herein, we present a new hierarchical Bayesian method for EIS inversion, leveraging efficient algorithms for optimization and Hamiltonian Monte Carlo (HMC) sampling to solve models of arbitrary complexity. We overcome the challenge of ad-hoc parameter tuning by encoding intrinsic characteristics of the DRT and DDT into flexible prior distributions and “pre-calibrating” the model to simulated data. This approach is versatile, highly robust to noise, and provides quantitative estimates of both the error structure of the data and the uncertainty in the recovered distributions. The model is validated with simulated data to demonstrate accurate recovery of the DRT and the DDT. The method also shows promise for simultaneous recovery of multiple distributions, raising the intriguing possibility of semi-autonomous EIS analysis and ad-hoc model construction. Finally, the practical utility of the method is illustrated with experimental data. Throughout, we draw comparisons to several recently published EIS inversion methodologies.

36 MATERIALS SCIENCE↗

Algorithm Solves Constrained and Unconstrained Optimization Problems

Is quasi-Newton iteration utilizing Broyden/Fletcher/Goldfarb/Shanno update on inverse Hessian matrix. Capable of solving constrained optimization unconstrained optimization and constraints only problems with one to five independent variables from one to five constraint functions and one dependent function optimized.

Denson, M. A.↗

Optimization-Based Approach for Joint X-Ray Fluorescence and Transmission Tomographic Inversion

Fluorescence tomographic reconstruction, based on the detection of photons coming from fluorescent emission, can be used for revealing the internal elemental composition of a sample. On the other hand, conventional X-ray transmission tomography can be used for reconstructing the spatial distribution of the absorption coefficient inside a sample. In this work, we integrate both X-ray fluorescence and X-ray transmission data modalities and formulate a nonlinear optimization-based approach for reconstruction of the elemental composition of a given object. This model provides a simultaneous reconstruction of both the quantitative spatial distribution of all elements and the absorption effect in the sample. Mathematically speaking, we show that compared with the single-modality inversion (i.e., the X-ray transmission or fluorescence alone), the joint inversion provides a better-posed problem, which implies a better recovery. Therefore, the challenges in X-ray fluorescence tomography arising mainly from the effects of self-absorption in the sample are partially mitigated. The use of this technique is demonstrated on the reconstruction of several synthetic samples.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Comparison of unfolding methods using RooFitUnfold

In this study we describe RooFitUnfold, an extension of the RooFit statistical software package to treat unfolding problems, and which includes most of the unfolding methods that commonly used in particle physics. The package provides a common interface to these algorithms as well as common uniform methods to evaluate their performance in terms of bias, variance and coverage. In this paper we exploit this common interface of RooFitUnfold to compare the performance of unfolding with the Richardson–Lucy, Iterative Dynamically Stabilized, Tikhonov, Gaussian Process, bin-by-bin and inversion methods on several example problems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient control with an order (n) recursive inversion of the Jacobian for an n-link serial manipulator

A method is presented to order (n) recursively invert the Jacobian matrix for a serial n-link manipulator. By realizing that the Jacobian relationship involving accelerations is a special case for the forward dynamics problem, it is possible to obtain the Jacobian inverse by directly applying Rodriguez's (1987) recursive forward dynamics algorithm. In this technique, the n-link robot equation is formulated as a spatially recursive algorithm in the form of a filtering and smoothing problem. To compute the Jacobian inverse via this algorithm, the n-link manipulator is modeled with only a unit end-point mass and zero applied torques.

Meldrum, D. R.↗

Forward and inverse kinematics of double universal joint robot wrists

A robot wrist consisting of two universal joints can eliminate the wrist singularity problem found on many individual robots. Forward and inverse position and velocity kinematics are presented for such a wrist having three degrees of freedom. Denavit-Hartenberg parameters are derived to find the transforms required for the kinematic equations. The Omni-Wrist, a commercial double universal joint robot wrist, is studied in detail. There are four levels of kinematic parameters identified for this wrist; three forward and three inverse maps are presented for both position and velocity. These equations relate the hand coordinate frame to the wrist base frame. They are sufficient for control of the wrist standing alone. When the wrist is attached to a manipulator arm; the offset between the two universal joints complicates the solution of the overall kinematics problem. All wrist coordinate frame origins are not coincident, which prevents decoupling of position and orientation for manipulator inverse kinematics.

Williams, Robert L., II↗

Rayleigh Quotient Iteration in 3D, Deterministic Neutron Transport

Today's "grand challenge" neutron transport problems require 3-D meshes with billions of cells, hundreds of energy groups, and accurate quadratures and scattering expansions. Leadership-class computers provide platforms on which high-fidelity fluxes can be calculated. However, appropriate methods are needed that can use these machines effectively. Such methods must be able to use hundreds of thousands of cores and have good convergence properties. Rayleigh quotient iteration (RQI) is an eigenvalue solver that has been added to the Sn code Denovo to address convergence. Rayleigh quotient iteration is an optimal shifted inverse iteration method that should converge in fewer iterations than the more common power method and other shifted inverse iteration methods for many problems of interest. Denovo's RQI uses a new multigroup Krylov solver for the fixed source solutions inside every iteration that allows parallelization in energy in addition to space and angle. This Krylov solver has been shown to scale successfully to 200,000 cores: for example one test problem scaled from 69,120 cores to 190,080 cores with 98% efficiency. This paper shows that RQI works for some small problems. However, the Krylov method upon which it relies does not always converge because RQI creates ill-conditioned systems. This result leads to the conclusion that preconditioning is needed to allow this method to be applicable to a wider variety of problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Vibrations of Elastic Shells of Revolution Partially Filled with Ideal Liquid

We propose an algorithm for the numerical analyses of vibrations of elastic shells of revolution partially filled with ideal incompressible liquids. In the solution of this problem, the wave motions of liquid on its free surface are taken into account. The solution of the problem of hydroelasticity is based on the application of the method of decomposition of the domain of integration of equations of the theory of shells with the use of the variational statement of the problem and on the approximate construction of the operator inverse to the operator of the hydrodynamic part of the problem. We construct a generalized functional of displacements of the shell for which the role of conditions of matching for the solutions in different subdomains is played by the natural boundary conditions. The obtained numerical results are compared with the existing exact solutions of the analyzed problem for a shell in the form of a straight circular cylinder.

42 ENGINEERING↗

RAYLEIGH QUOTIENT ITERATION IN 3D, DETERMINISTIC NEUTRON TRANSPORT

Today’s “grand challenge” neutron transport problems require 3-D meshes with billions of cells, hundreds of energy groups, and accurate quadratures and scattering expansions. Leadership-class computers provide platforms on which high-fidelity fluxes can be calculated. However, appropriate methods are needed that can use these machines effectively. Such methods must be able to to use hundreds of thousands of cores and have good convergence properties. Rayleigh quotient iteration (RQI) is an eigenvalue solver that has been added to the SN code Denovo to address convergence. Rayleigh quotient iteration is an optimal shifted inverse iteration method that should converge in fewer iterations than the more common power method and other shifted inverse iteration methods for many problems of interest. Denovo’s RQI uses a new multigroup Krylov solver for the fixed source solutions inside every iteration that allows parallelization in energy in addition to space and angle. This Krylov solver has been shown to scale successfully to 200,000 cores: for example one test problem scaled from 69,120 cores to 190,080 cores with 98% efficiency. This paper shows that RQI works for some small problems. However, the Krylov method upon which it relies does not always converge because RQI creates ill-conditioned systems. This result leads to the conclusion that preconditioning is needed to allow this method to be applicable to a wider variety of problems.

Slaybaugh, R. N.↗

Singular inverse square potential in coordinate space with a minimal length

The problem of a particle of mass m in the field of the inverse-square potential α∕r{sup 2} is studied in quantum mechanics with a generalized uncertainty principle, characterized by the existence of a minimal length. Using the coordinate representation, for a specific form of the generalized uncertainty relation, we solve the deformed Schrödinger equation analytically in terms of confluent Heun functions. We explicitly show the regularizing effect of the minimal length on the singularity of the potential. We discuss the problem of bound states in detail and we derive an expression for the energy spectrum in a natural way from the square integrability condition; the results are in complete agreement with the literature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Interparameter trade-off quantification and reduction in isotropic-elastic full-waveform inversion: synthetic experiments and Hussar land data set application

The problem of inverting for multiple physical parameters in the subsurface using seismic full-waveform inversion (FWI) is complicated by interparameter trade-off arising from inherent ambiguities between different physical parameters. Parameter resolution is often characterized using scattering radiation patterns, but these neglect some important aspects of interparameter trade-off. More general analysis and mitigation of interparameter trade-off in isotropic-elastic FWI is possible through judiciously chosen multiparameter Hessian matrix-vector products. We show that products of multiparameter Hessian off-diagonal blocks with model perturbation vectors, referred to as interparameter contamination kernels , are central to the approach. We then apply the multiparameter Hessian to various vectors designed to provide information regarding the strengths and characteristics of interparameter contamination, both locally and within the whole volume. With numerical experiments, we observe that S-wave velocity perturbations introduce strong contaminations into density and phase-reversed contaminations into P-wave velocity, but themselves experience only limited contaminations from other parameters. Based on these findings, we introduce a novel strategy to mitigate the influence of interparameter trade-off with approximate contamination kernels. Furthermore, we recommend that the local spatial and interparameter trade-off of the inverted models be quantified using extended multiparameter point spread functions (EMPSFs) obtained with pre-conditioned conjugate-gradient algorithm. Compared to traditional point spread functions, the EMPSFs appear to provide more accurate measurements for resolution analysis, by de-blurring the estimations, scaling magnitudes and mitigating interparameter contamination. Approximate eigenvalue volumes constructed with stochastic probing approach are proposed to evaluate the resolution of the inverted models within the whole model. With a synthetic Marmousi model example and a land seismic field data set from Hussar, Alberta, Canada, we confirm that the new inversion strategy suppresses the interparameter contamination effectively and provides more reliable density estimations in isotropic-elastic FWI as compared to standard simultaneous inversion approach.

58 GEOSCIENCES↗

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do not require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.

97 MATHEMATICS AND COMPUTING↗

Acoustic inverse scattering via Helmholtz operator factorization and optimization

We present a joint acoustic/seismic inverse scattering and finite-frequency (reflection) tomography program, formulated as a coupled set of optimization problems, in terms of inhomogeneous Helmholtz equations. We use a higher order finite difference scheme for these Helmholtz equations to guarantee sufficient accuracy. We adapt a structured approximate direct solver for the relevant systems of algebraic equations, which addresses storage requirements through compression, to yield a complexity for computing the gradients or images in the optimization problems that consists of two parts, viz., the cost for all the matrix factorizations which is roughly O(rN) (for example O(rNlogN) when d = 2) times the number of frequencies, and the cost for all solutions by substitution which is roughly O(N) (for example O(Nlog(rlogN)) when d = 2) times the number of frequencies times the number of sources (events), where N = n{sup d} if n is the number of grid samples in any direction, and r is a parameter depending on the preset accuracy and the problem at hand. With this complexity, the multi-frequency approach to inverse scattering and finite-frequency tomography becomes computationally feasible with large data sets, in dimensions d = 2 and 3.

97 MATHEMATICS AND COMPUTING↗

Optimal parallel solution of sparse triangular systems

A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.

Alvarado, Fernando L.↗