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,603 records · Page 89

Validating time-distance helioseismology with realistic quiet-sun simulations

Linear time-distance helioseismic inversions are carried out for vector flow velocities using travel times measured from two ∼100{sup 2} Mm{sup 2} × 20 Mm realistic magnetohydrodynamic quiet-Sun simulations of about 20 hr. The goal is to test current seismic methods on these state-of-the-art simulations. Using recent three-dimensional inversion schemes, we find that inverted horizontal flow maps correlate well with the simulations in the upper ∼3 Mm of the domains for several filtering schemes, including phase-speed, ridge, and combined phase-speed and ridge measurements. In several cases, however, the velocity amplitudes from the inversions severely underestimate those of the simulations, possibly indicating nonlinearity of the forward problem. We also find that, while near-surface inversions of the vertical velocities are best using phase-speed filters, in almost all other example cases these flows are irretrievable due to noise, suggesting a need for statistical averaging to obtain better inferences.

79 ASTRONOMY AND ASTROPHYSICS↗

An airfoil design method for viscous flows

An airfoil design procedure is described that has been incorporated into an existing two-dimensional Navier-Stokes airfoil analysis method. The resulting design method, an iterative procedure based on a residual-correction algorithm, permits the automated design of airfoil sections with prescribed surface pressure distributions. This paper describes the inverse design method and the technique used to specify target pressure distributions. An example airfoil design problem is described to demonstrate application of the inverse design procedure. It shows that this inverse design method develops useful airfoil configurations with a reasonable expenditure of computer resources.

Malone, J. B.↗

Neural-Network Inverse Design of SRF Cavities and Transmons for Bosonic Quantum Computation

Three-dimensional superconducting radio-frequency (SRF) cavities provide exceptionally long-lived electromagnetic modes and, when coupled to nonlinear elements such as transmon qubits, become promising architectures for bosonic quantum information processing. The inverse design of such systems, i.e., recovering device geometries that produce specified electromagnetic and coupling targets, is generally a one-to-many problem. The qubit-cavity coupling strength depends sensitively on both the transmon geometry and its position within the cavity's electromagnetic field. As these systems scale up and their design parameter spaces grow, the cost of conventional iterative simulation becomes prohibitive. We present two deep neural network (DNN) approaches that address this inverse-design problem at complementary levels of the design stack. The first proposes SRF cavity geometries that produce target cavity observables. The second proposes transmon qubit designs that produce target qubit-cavity parameters - the coupling rate, qubit frequency, and anharmonicity $(g, ν_q, α)$. The recovered candidate designs match the targets to within ~5% (cavity) and ~2% (transmon), confirmed by end-to-end re-simulation. Both approaches map desired device behavior directly to candidate designs, a fast alternative to the iterative simulation studies usually required.

Yaker, Joseph [Fermilab; Northwestern U.]↗

A First-order Prediction-Correction Algorithm for Time-varying (Constrained) Optimization: Preprint

This paper focuses on the design of online algorithms based on prediction-correction steps to track the optimal solution of a time-varying constrained problem. Existing prediction-correction methods have been shown to work well for unconstrained convex problems and for settings where obtaining the inverse of the Hessian of the cost function can be computationally affordable. The prediction-correction algorithm proposed in this paper addresses the limitations of existing methods by tackling constrained problems and by designing a first-order prediction step that relies on the Hessian of the cost function (and do not require the computation of its inverse). Analytical results are established to quantify the tracking error. Numerical simulations corroborate the analytical results and showcase performance and benefits of the algorithms.

97 MATHEMATICS AND COMPUTING↗

Effect of Ducting on Radio Occultation Measurements: An Assessment Based on High-Resolution Radiosonde Soundings

Recent studies have shown that the presence of elevated ducts in the lower atmosphere has an adverse effect on the inversion of GPS radio occultation data. The problem arises because the microwave refractivity within and below an elevated duct is no longer uniquely determined by the bending angle profile. Applying Abel inversion without a priori knowledge of the duct will introduce a negative bias in the retrieved refractivity profile within and below the duct. In this work, high vertical resolution radiosonde data are used to give a quantitative assessment of the characteristics and effects of ducts, including their frequency of occurrences, heights, and thicknesses at different latitudes and seasons. The negative bias from the Abel-retrieved refractivity profiles resulting from these ducts is also computed. The results give a strong indication that ducting in the lower troposphere is a frequent phenomenon over the tropics and midlatitudes. The ducts are shown to be predominantly caused by sharp changes in the vertical structure of water vapor. The majority of the ducts are found to be below 2 km, with a median duct layer thickness of about 100 m. The negative refractivity bias is shown to be largest below 2 km, with a median value of about 0.5-1% in the tropics and 0.2-0.5% in midlatitudes. The bias is about a factor of 2-3 smaller between 2 to 3 km and is negligible above 4 km.

signals↗

A combined experimental and numerical approach that eliminates the non-uniqueness associated with the Johnson-Cook parameters obtained using inverse methods

Abstract Johnson-Cook constitutive model is a commonly used material model for machining simulations. The model includes five parameters that capture the initial yield stress, strain-hardening, strain-rate hardening, and thermal softening behavior of the material. These parameters are difficult to determine using experiments since the conditions observed during machining (such as high strain-rates of the order of $$10^5$$ 10 5 /sec - $$10^6$$ 10 6 /sec) are challenging to recreate in the laboratory. To address this problem, several researchers have recently proposed inverse approaches where a combination of experiments and analytical models are used to predict the Johnson-Cook parameters. The errors between the measured cutting forces, chip thicknesses and temperatures and those predicted by analytical models are minimized and the parameters are determined. In this work, it is shown that only two of the five Johnson-Cook parameters can be determined uniquely using inverse approaches. Two different algorithms, namely, Adaptive Memory Programming for Global Optimization (AMPGO) and Particle Swarm Optimization (PSO), are used for this purpose. The extended Oxley’s model is used as the analytical tool for optimization. For determining a parameter’s value, a large range for each parameter is provided as an input to the algorithms. The algorithms converge to several different sets of values for the five Johnson-Cook parameters when all the five parameters are considered as unknown in the optimization algorithm. All of these sets, however, yield the same chip shape and cutting forces in FEM simulations. Further analyses show that only the strain-rate and thermal softening parameters can be determined uniquely and the three parameters present in the strain-hardening term of the Johnson-Cook model cannot be determined uniquely using the inverse method. A combined experimental and numerical approach is proposed to eliminate this determine all parameters uniquely.

42 ENGINEERING↗

Physics constrained learning for data-driven inverse modeling from sparse observations

Deep neural networks (DNN) have been used to model nonlinear relations between physical quantities. Those DNNs are embedded in physical systems described by partial differential equations (PDE) and trained by minimizing a loss function that measures the discrepancy between predictions and observations in some chosen norm. This loss function often includes the PDE constraints as a penalty term when only sparse observations are available. As a result, the PDE is only satisfied approximately by the solution. However, the penalty term typically slows down the convergence of the optimizer for stiff problems. We present a new approach that trains the embedded DNNs while numerically satisfying the PDE constraints. We develop an algorithm that enables differentiating both explicit and implicit numerical solvers in reverse-mode automatic differentiation. This allows the gradients of the DNNs and the PDE solvers to be computed in a unified framework. We demonstrate that our approach enjoys faster convergence and better stability in relatively stiff problems compared to the penalty method. Furthermore, our approach allows for the potential to solve and accelerate a wide range of data-driven inverse modeling, where the physical constraints are described by PDEs and need to be satisfied accurately.

97 MATHEMATICS AND COMPUTING↗

Planning collision free paths for two cooperating robots using a divide-and-conquer C-space traversal heuristic

A method was developed to plan feasible and obstacle-avoiding paths for two spatial robots working cooperatively in a known static environment. Cooperating spatial robots as referred to herein are robots which work in 6D task space while simultaneously grasping and manipulating a common, rigid payload. The approach is configuration space (c-space) based and performs selective rather than exhaustive c-space mapping. No expensive precomputations are required. A novel, divide-and-conquer type of heuristic is used to guide the selective mapping process. The heuristic does not involve any robot, environment, or task specific assumptions. A technique was also developed which enables solution of the cooperating redundant robot path planning problem without requiring the use of inverse kinematics for a redundant robot. The path planning strategy involves first attempting to traverse along the configuration space vector from the start point towards the goal point. If an unsafe region is encountered, an intermediate via point is identified by conducting a systematic search in the hyperplane orthogonal to and bisecting the unsafe region of the vector. This process is repeatedly applied until a solution to the global path planning problem is obtained. The basic concept behind this strategy is that better local decisions at the beginning of the trouble region may be made if a possible way around the 'center' of the trouble region is known. Thus, rather than attempting paths which look promising locally (at the beginning of a trouble region) but which may not yield overall results, the heuristic attempts local strategies that appear promising for circumventing the unsafe region.

Weaver, Johnathan M.↗

The quarter-point quadratic isoparametric element as a singular element for crack problems

The quadratic isoparametric elements which embody the inverse square root singularity are used for calculating the stress intensity factors at tips of cracks. The strain singularity at a point or an edge is obtained in a simple manner by placing the mid-side nodes at quarter points in the vicinity of the crack tip or an edge. These elements are implemented in NASTRAN as dummy elements. The method eliminates the use of special crack tip elements and in addition, these elements satisfy the constant strain and rigid body modes required for convergence.

Hussain, M. A.↗

Revivals in an attractive Bose-Einstein condensate in a double-well potential and their decoherence

We study the dynamics of ultracold attractive atoms in a weakly linked two potential wells. We consider an unbalanced initial state and monitor dynamics of the population difference between the two wells. The average imbalance between wells undergoes damped oscillations, like in a classical counterpart, but then it revives almost to the initial value. We explain in detail the whole behavior using three different models of the system. Furthermore, we investigate the sensitivity of the revivals on the decoherence caused by one- and three-body losses. We include the dissipative processes using appropriate master equations and solve them using the stochastic wave approximation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Detecting an underground tunnel by applying joint traveltime and waveform inversion

Underground tunnel and void detection is a challenging geophysical problem, and many methods have been proposed. Seismic techniques are promising because of the large seismic velocity contrasts between the air-filled void and the surrounding sediment and concrete. We apply a joint seismic traveltime and waveform inversion method to image a buried tunnel with concrete walls and a void space inside. The joint inversion images the top of the concrete tunnel as a high-velocity anomaly and the void space as a low-velocity anomaly. The location of the velocity anomalies predicted by the method agrees with the known location of the tunnel. As a comparison, the stand-alone full waveform inversion is also applied to the data. The first-arrival traveltime tomography shows weak nonlinearity but fails to image the hidden low-velocity layer. Full waveform inversion is able to image complex near-surface structures, but fitting waveforms may not honor the traveltime fit, especially when the data contain noise. Synthetic and real data tests show that the joint inversion method retains the advantages of both traveltime inversion and full waveform inversion and overcomes their respective drawbacks at the same time. The field example shows the joint inversion provides a better reconstruction of the high-velocity feature representing the top of the concrete wall in terms of its magnitude and location.

58 GEOSCIENCES↗

Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments

Parameter reduction can enable otherwise infeasible design and uncertainty studies with modern computational science models that contain several input parameters. In statistical regression, techniques for sufficient dimension reduction (SDR) use data to reduce the predictor dimension of a regression problem. A computational scientist hoping to use SDR for parameter reduction encounters a problem: a computer prediction is best represented by a deterministic function of the inputs, so data comprised of computer simulation queries fail to satisfy the SDR assumptions. To address this problem, here we interpret SDR methods sliced inverse regression (SIR) and sliced average variance estimation (SAVE) as estimating the directions of a ridge function, which is a composition of a low-dimensional linear transformation with a nonlinear function. Within this interpretation, SIR and SAVE estimate matrices of integrals whose column spaces are contained in the ridge directions’ span; we analyze and numerically verify convergence of these column spaces as the number of computer model queries increases. Moreover, we show example functions that are not ridge functions but whose inverse conditional moment matrices are low-rank. Consequently, the computational scientist should beware when using SIR and SAVE for parameter reduction, since SIR and SAVE may mistakenly suggest that truly important directions are unimportant.

97 MATHEMATICS AND COMPUTING↗

Comparing implementations of penalized weighted least-squares sinogram restoration

Purpose: A CT scanner measures the energy that is deposited in each channel of a detector array by x rays that have been partially absorbed on their way through the object. The measurement process is complex and quantitative measurements are always and inevitably associated with errors, so CT data must be preprocessed prior to reconstruction. In recent years, the authors have formulated CT sinogram preprocessing as a statistical restoration problem in which the goal is to obtain the best estimate of the line integrals needed for reconstruction from the set of noisy, degraded measurements. The authors have explored both penalized Poisson likelihood (PL) and penalized weighted least-squares (PWLS) objective functions. At low doses, the authors found that the PL approach outperforms PWLS in terms of resolution-noise tradeoffs, but at standard doses they perform similarly. The PWLS objective function, being quadratic, is more amenable to computational acceleration than the PL objective. In this work, the authors develop and compare two different methods for implementing PWLS sinogram restoration with the hope of improving computational performance relative to PL in the standard-dose regime. Sinogram restoration is still significant in the standard-dose regime since it can still outperform standard approaches and it allows for correction of effects that are not usually modeled in standard CT preprocessing. Methods: The authors have explored and compared two implementation strategies for PWLS sinogram restoration: (1) A direct matrix-inversion strategy based on the closed-form solution to the PWLS optimization problem and (2) an iterative approach based on the conjugate-gradient algorithm. Obtaining optimal performance from each strategy required modifying the naive off-the-shelf implementations of the algorithms to exploit the particular symmetry and sparseness of the sinogram-restoration problem. For the closed-form approach, the authors subdivided the large matrix inversion into smaller coupled problems and exploited sparseness to minimize matrix operations. For the conjugate-gradient approach, the authors exploited sparseness and preconditioned the problem to speed up convergence. Results: All methods produced qualitatively and quantitatively similar images as measured by resolution-variance tradeoffs and difference images. Despite the acceleration strategies, the direct matrix-inversion approach was found to be uncompetitive with iterative approaches, with a computational burden higher by an order of magnitude or more. The iterative conjugate-gradient approach, however, does appear promising, with computation times half that of the authors' previous penalized-likelihood implementation. Conclusions: Iterative conjugate-gradient based PWLS sinogram restoration with careful matrix optimizations has computational advantages over direct matrix PWLS inversion and over penalized-likelihood sinogram restoration and can be considered a good alternative in standard-dose regimes.

60 APPLIED LIFE SCIENCES↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Measurement from satellites of land surface parameters and fluxes in the thermal infrared bands: Problems and methods

The main problems arising in the elaboration of accurate and reliable algorithms for extracting land surface parameters and flux from their measured radiances are discussed. Methods of solution in the thermal infrared spectral domain are described. Particular interest is given to the inversion of thermal models and to the problems resulting from the heterogeneity of the observed surfaces.

Becker, F.↗

Inversion techniques for recovering two-dimensional distributions of auroral emission rates from tomographic rocket photometer measurements

This paper demonstrates how the spatial distribution of optical emission rates within an auroral arc may be recovered from rocket photometer measurements made in a tomographic spin scan mode. The tomographic inversion procedures required to recover this information and the implementation of two inversion algorithms that are particularly well suited for dealing with the problem of noise in the observational data are described. The performance of the inversion algorithms and the limitations of the rocket tomography technique are assessed using various sets of simulated rocket measurements that were generated from 'known' auroral emission-rate distributions. The simulations are used to investigate how the quality of the tomographic recovery may be influenced by various factors such as noise in the data, rocket penetration of the auroral form, background sources of emission, smearing due to the photometer field of view, and temporal variations in the auroral form.

Mcdade, Ian. C.↗

J-variational inequalities and zeroes of a family of maximal monotone operators by sunny generalized nonexpansive retraction

In this paper, using generalized resolvents and retractions onto shrinking closed subsets, we present new extragradient algorithms for finding the solution of a J-variational-like inequality, the zero points of a family of maximal monotone operators, and the solution set of mixed equilibrium problems for a J-α-inverse-strongly monotone-like operator in a 2-uniformly convex and 2-uniformly smooth Banach space. By introducing the new definitions, we prove strong convergence of generated iterates in the extragradient methods. Using FMINCON optimization toolbox in MATLAB, we give some numerical examples and compare them with several existence results in the literature to illustrate the usability of our results.

97 MATHEMATICS AND COMPUTING↗

On Weak Solutions to the Linear Boltzmann Equation with Inelastic Coulomb Collisions

This paper considers the time- and space-dependent linear Boltzmann equation with general boundary conditions in the case of inelastic (granular) collisions. First, in the (angular) cut-off case, mild L{sup 1}-solutions are constructed as limits of the iterate functions and boundedness of higher velocity moments are discussed in the case of inverse power collisions forces. Then the problem of the weak solutions, as weak limit of a sequence of mild solutions, is studied for a bounded body, in the case of very soft interactions (including the Coulomb case). Furthermore, strong convergence of weak solutions to the equilibrium, when time goes to infinity, is discussed, using a generalized H-theorem, together with a translation continuity property.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗