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,477 records · Page 82

Extended mapping and characteristics techniques for inverse aerodynamic design

Some ideas for using hodograph theory, mapping techniques and methods of characteristics to formulate typical aerodynamic design boundary value problems are developed. The inverse method of characteristics is shown to be a fast tool for design of transonic flow elements as well as supersonic flows with given shock waves.

Sobieczky, H.↗

The mathematical-physical problem of P prime(f) to N(h) inversion for anisotropic media

The requirements for a numerical inversion method to calculate electron density profiles from ionograms are discussed. A systematic investigation about the independence of the two magnetoionic components shows that the extent to which the range of ambiguity can be reduced depends mainly on the magnetic latitude. Error estimates and first-order corrections for less elaborate methods are included.

Paul, A. K.↗

Solving iTOUGH2 simulation and optimization problems using the PEST protocol

The PEST protocol has been implemented into the iTOUGH2 code, allowing the user to link any simulation program (with ASCII-based inputs and outputs) to iTOUGH2's sensitivity analysis, inverse modeling, and uncertainty quantification capabilities. These application models can be pre- or post-processors of the TOUGH2 non-isothermal multiphase flow and transport simulator, or programs that are unrelated to the TOUGH suite of codes. PEST-style template and instruction files are used, respectively, to pass input parameters updated by the iTOUGH2 optimization routines to the model, and to retrieve the model-calculated values that correspond to observable variables. We summarize the iTOUGH2 capabilities and demonstrate the flexibility added by the PEST protocol for the solution of a variety of simulation-optimization problems. In particular, the combination of loosely coupled and tightly integrated simulation and optimization routines provides both the flexibility and control needed to solve challenging inversion problems for the analysis of multiphase subsurface flow and transport systems.

54 ENVIRONMENTAL SCIENCES↗

Full configuration-interaction calculations with the simplest iterative complement method: Merit of the inverse Hamiltonian

The simplest iterative complement (SIC) calculations starting from Hartree-Fock and giving full configuration interaction (CI) at convergence were performed using regular and inverse Hamiltonians. Each iteration step is variational and involves only one variable. The convergence was slow when we used the regular Hamiltonian, but became very fast when we used the inverse Hamiltonian. This difference is due to the Coulomb singularity problem inherent in the regular Hamiltonian; the inverse Hamiltonian does not have such a problem. For this reason, the merit of the inverse Hamiltonian over the regular one becomes even more dramatic when we use a better-quality basis set. This was seen by comparing the calculations due to the minimal and double-{zeta} basis sets. Similar problematic situations exist in the Krylov sequence and in the Lanczos and Arnoldi methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Power Management for Large-Scale Battery Energy Storage Systems via Bayesian Inference

Large-scale battery energy storage systems (BESS) have found ever-increasing use across industry and society to accelerate clean energy transition and improve energy supply reliability and resilience. However, their optimal power management poses significant challenges: the underlying high-dimensional nonlinear nonconvex optimization lacks computational tractability in real-world implementation, and the uncertainty of the exogenous power demand makes exact optimization difficult. This paper presents a new solution framework to address these bottlenecks. The solution pivots on introducing power-sharing ratios to specify each cell’s power quota from the output power demand. To find the optimal power-sharing ratios, we formulate a nonlinear model predictive control (NMPC) problem to achieve power-loss-minimizing BESS operation while complying with safety, cell balancing, and power supply-demand constraints. We then propose a parameterized control policy for the power-sharing ratios, which utilizes only three parameters, to reduce the computational demand in solving the NMPC problem. This policy parameterization allows us to translate the NMPC problem into a Bayesian inference problem for the sake of 1) computational tractability, and 2) overcoming the nonconvexity of the optimization problem. We leverage the ensemble Kalman inversion technique to solve the parameter estimation problem. Concurrently, a low-level control loop is developed to seamlessly integrate our proposed approach with the BESS to ensure practical implementation. This low-level controller receives the optimal power-sharing ratios, generates output power references for the cells, and maintains a balance between power supply and demand despite uncertainty in output power. We conduct extensive simulations and experiments on a 20-cell prototype to validate the proposed approach.

Battery energy storage systems (BESSs)↗

Spatial operator factorization and inversion of the manipulator mass matrix

This paper advances two linear operator factorizations of the manipulator mass matrix. Embedded in the factorizations are many of the techniques that are regarded as very efficient computational solutions to inverse and forward dynamics problems. The operator factorizations provide a high-level architectural understanding of the mass matrix and its inverse, which is not visible in the detailed algorithms. They also lead to a new approach to the development of computer programs or organize complexity in robot dynamics.

Rodriguez, Guillermo↗

Efficient kinetic thermal inverse modeling for organic material decomposition

The prevalent use of organic materials in manufacturing is a fire safety concern, and motivates the need for predictive thermal decomposition models. A critical component of predictive modeling is numerical inference of kinetic parameters from bench scale data. Currently, an active area of computational pyrolysis research focuses on identifying efficient, robust methods for optimization. This paper demonstrates that kinetic parameter calibration problems can successfully be solved using classical gradient-based optimization. We explore calibration examples that exhibit characteristics of concern: high nonlinearity, high dimensionality, complicated schemes, overlapping reactions, noisy data, and poor initial guesses. The examples demonstrate that a simple, non-invasive change to the problem formulation can simultaneously avoid local minima, avoid computation of derivative matrices, achieve a computational efficiency speedup of 10x, and make optimization robust to perturbations of parameter components. Techniques from the mathematical optimization and inverse problem communities are employed. By re-examining gradient-based algorithms, we highlight opportunities to develop kinetic parameter calibration methods that should outperform current methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ON THE INVERSION OF STOKES PROFILES WITH LOCAL STRAY-LIGHT CONTAMINATION

Obtaining the magnetic properties of non-resolved structures in the solar photosphere is always challenging and problems arise because the inversion is carried out through the numerical minimization of a merit function that depends on the proposed model. We investigate the reliability of inversions in which the stray-light contamination is obtained from the same observations as a local average. In this case, we show that it is fundamental to include the covariance between the observed Stokes profiles and the stray-light contamination. The ensuing modified merit function of the inversion process penalizes large stray-light contaminations simply because of the presence of positive correlations between the observables and the stray light, fundamentally produced by spatially variable systematics. We caution that if the wrong merit function is used, artificially large stray-light contaminations might be inferred. Since this effect disappears if the stray-light contamination is obtained as an average over the full field of view, we recommend taking into account stray-light contamination using a global approach.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗

Exact solution of an n baryon problem in the Gross-Neveu model

Recently it was shown that kink baryons and kink-antikink scattering in the massless Gross-Neveu model are closely related to one- and two-soliton solutions of the sinh-Gordon equation. Here we generalize these findings to the case of n kinks and antikinks. Using the known n-soliton solution of the sinh-Gordon equation, we solve the general n kink-antikink scattering problem in the large N Gross-Neveu model analytically, mapping the time-dependent Hartree-Fock approach onto inverse scattering theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Integrated Approach to the Dynamics and Control of Maneuvering Flexible Aircraft

This work uses a fundamental approach to the problem of simulating the flight of flexible aircraft. To this end, it integrates into a single formulation the pertinent disciplines, namely, analytical dynamics, structural dynamics, aerodynamics, and controls. It considers both the rigid body motions of the aircraft, three translations (forward motion, sideslip and plunge) and three rotations (roll, pitch and yaw), and the elastic deformations of every point of the aircraft, as well as the aerodynamic, propulsion, gravity and control forces. The equations of motion are expressed in a form ideally suited for computer processing. A perturbation approach yields a flight dynamics problem for the motions of a quasi-rigid aircraft and an 'extended aeroelasticity' problem for the elastic deformations and perturbations in the rigid body motions, with the solution of the first problem entering as an input into the second problem. The control forces for the flight dynamics problem are obtained by an 'inverse' process and the feedback controls for the extended aeroservoelasticity problem are determined by the LQG theory. A numerical example presents time simulations of rigid body perturbations and elastic deformations about 1) a steady level flight and 2) a level steady turn maneuver.

Waszak, Martin R.↗

The Prediction Properties of Inverse and Reverse Regression for the Simple Linear Calibration Problem

The calibration of measurement systems is a fundamental but under-studied problem within industrial statistics. The origins of this problem go back to basic chemical analysis based on NIST standards. In today's world these issues extend to mechanical, electrical, and materials engineering. Often, these new scenarios do not provide "gold standards" such as the standard weights provided by NIST. This paper considers the classic "forward regression followed by inverse regression" approach. In this approach the initial experiment treats the "standards" as the regressor and the observed values as the response to calibrate the instrument. The analyst then must invert the resulting regression model in order to use the instrument to make actual measurements in practice. This paper compares this classical approach to "reverse regression," which treats the standards as the response and the observed measurements as the regressor in the calibration experiment. Such an approach is intuitively appealing because it avoids the need for the inverse regression. However, it also violates some of the basic regression assumptions.

Parker, Peter A.↗

Kalman filtering, smoothing, and recursive robot arm forward and inverse dynamics

The recursive difference equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing, arising in the state estimation theory for linear state space systems, are used here to solve problems of serial manipulator inverse and forward dynamics. The configuration analyzed is that of a joint connected N-link serial manipulator attached to an immobile base. The equivalence between the filtering and smoothing techniques from state estimation theory and recursive robot dynamics methods is demonstrated. Several areas for future research are suggested.

Rodriguez, Guillermo↗

Numerical optimization in Hilbert space using inexact function and gradient evaluations

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

Carter, Richard G.↗

Polarimetric SAR Interferometry Evaluation in Mangroves

TanDEM-X (TDX) enables to generate an interferometric coherence without temporal decorrelation effect that is the most critical factor for a successful Pol-InSAR inversion, as have recently been used for forest parameter retrieval. This paper presents mangrove forest height estimation only using single-pass/single-baseline/dual-polarization TDX data by means of new dual-Pol-InSAR inversion technique. To overcome a lack of one polarization in a conventional Pol- InSAR inversion (i.e. an underdetermined problem), the ground phase in the Pol-InSAR model is directly estimated from TDX interferograms assuming flat underlying topography in mangrove forest. The inversion result is validated against lidar measurement data (NASA's G-LiHT data).

Mangrove↗

Preconditioned domain decomposition scheme for three-dimensional aerodynamic sensitivity analysis

A discrete sensitivity analysis algorithm had previously been developed and applied to two-dimensional aerodynamic optimization problems, where the computational domains were discretized by using single grids. The sparse, unsymmetric systems of linear equations resulting from this algorithm were solved by a direct matrix inversion matrix. However, for large two-dimensional problems and, practically, all three-dimensional problems, direct inversion methods become inapplicable, primarily due to the prohibitive computer storage needed. In an attempt to alleviate such hindrances, the sensitivity analysis with domain decomposition (SADD) scheme was developed. This scheme divides the computational domain into smaller and nonoverlapping subdomains (multiblock grids) that are solved separately. Then, the final solution is constructed from the subdomain solutions. As the number of grid points in the interface boundaries of the subdomains becomes large, the computer memory required to store the effective coefficient matrix of these interface points starts to increase. Presented in this Technical Note is a preconditioned iterative procedure to overcome this particular problem.

Eleshaky, Mohamed E.↗