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,801 records · Page 100

Parameter covariance and non-uniqueness in material model calibration using the Virtual Fields Method

Traditionally, material identification is performed using global load and displacement data from simple boundary-value problems such as uni-axial tensile and simple shear tests. More recently, however, inverse techniques such as the Virtual Fields Method (VFM) that capitalize on heterogeneous, full-field deformation data have gained popularity. In this work, we have written a VFM code in a finite-deformation framework for calibration of a viscoplastic (i.e. strain-rate dependent) material model for 304L stainless steel. Using simulated experimental data generated via finite-element analysis (FEA), we verified our VFM code and compared the identified parameters with the reference parameters input into the FEA. The identified material model parameters had surprisingly large error compared to the reference parameters, which was traced to parameter covariance and the existence of many essentially equivalent parameter sets. This parameter non-uniqueness and its implications for FEA predictions is discussed in detail. Lastly, we present two strategies to reduce parameter covariance – reduced parametrization of the material model and increased richness of the calibration data – which allow for the recovery of a unique solution.

304L stainless steel↗

Intrinsic beam emittance of laser-accelerated electrons measured by x-ray spectroscopic imaging

Here, the recent combination of ultra-intense lasers and laser-accelerated electron beams is enabling the development of a new generation of compact x-ray light sources, the coherence of which depends directly on electron beam emittance. Although the emittance of accelerated electron beams can be low, it can grow due to the effects of space charge during free-space propagation. Direct experimental measurement of this important property is complicated by micron-scale beam sizes, and the presence of intense fields at the location where space charge acts. Reported here is a novel, non-destructive, single-shot method that overcame this problem. It employed an intense laser probe pulse, and spectroscopic imaging of the inverse-Compton scattered x-rays, allowing measurement of an ultra-low value for the normalized transverse emittance, 0.15 (±0.06) π mm mrad, as well as study of its subsequent growth upon exiting the accelerator. The technique and results are critical for designing multi-stage laser-wakefield accelerators, and generating high-brightness, spatially coherent x-rays.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Maxwell strata and symmetries in the problem of optimal rolling of a sphere over a plane

The problem of rolling of a sphere over a plane without slipping or twisting is considered. It is required to roll the sphere from one contact configuration into another one so that the curve traced by the contact point be of minimum length. Extremal trajectories in this problem were described by Arthur, Walsh and Jurdjevic. In this work, discrete and continuous symmetries of the problem are constructed and fixed points of the action of these symmetries in the inverse image and image of the exponential map are studied. This analysis is used to derive necessary conditions for optimality; namely, upper bounds on the cut time along the extremal trajectories. Bibliography: 21 titles.

97 MATHEMATICS AND COMPUTING↗

Importance of the relaxation stage for adequate modeling of nuclear fission accompanied by light particle emission

We investigate the importance of accounting for the transient time within the framework of the statistical approach (SA) for describing the fission process beginning from the quasistationary nuclear configuration. Two arguments are given in favor of the positive point of view on this problem. First, the average scission time is shown to be always larger than the inverse quasistationary fission rate by the value that is close to the transient time {tau}{sub r}. Second, comparing the SA and the combined dynamical statistical approach (CDSA), we have found that suppressing the fission process for some delay time in the framework of the SA significantly reduces the amount of disagreement between the values of proper observables calculated using the SA and the CDSA.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive results. Conclusion: We have successfully developed a fast and automatic multi-objective optimization for intensity modulated radiotherapy. This work is supported by the National Natural Science Foundation of China (No: 81571771)

60 APPLIED LIFE SCIENCES↗

Holography beyond conformal invariance and AdS isometry?

We suggest that the principle of holographic duality be extended beyond conformal invariance and AdS isometry. Such an extension is based on a special relation between functional determinants of the operators acting in the bulk and on its boundary, provided that the boundary operator represents the inverse propagators of the theory induced on the boundary by the Dirichlet boundary value problem in the bulk spacetime. This relation holds for operators of a general spin-tensor structure on generic manifolds with boundaries irrespective of their background geometry and conformal invariance, and it apparently underlies numerous O(N{sup 0}) tests of the AdS/CFT correspondence, based on direct calculation of the bulk and boundary partition functions, Casimir energies, and conformal anomalies. The generalized holographic duality is discussed within the concept of the “double-trace” deformation of the boundary theory, which is responsible in the case of large-N CFT coupled to the tower of higher-spin gauge fields for the renormalization group flow between infrared and ultraviolet fixed points. Potential extension of this method beyond the one-loop order is also briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

The inference of atmospheric ozone using satellite nadir measurements in the 1042/cm band

A description and detailed analysis of a technique for inferring atmospheric ozone information from satellite nadir measurements in the 1042 cm band are presented. A method is formulated for computing the emission from the lower boundary under the satellite which circumvents the difficult analytical problems caused by the presence of atmospheric clouds and the watervapor continuum absorption. The inversion equations are expanded in terms of the eigenvectors and eigenvalues of a least-squares-solution matrix, and an analysis is performed to determine the information content of the radiance measurements. Under favorable conditions there are only two pieces of independent information available from the measurements: (1) the total ozone and (2) the altitude of the primary maximum in the ozone profile.

Russell, J. M., III↗

Asteroid Lightcurve Inversion

The application of convex profile inversion (CPI) to the interpretation of asteroid lightcurves is discussed. This technique investigates the problem of extracting information about an asteroid's shape from its lightcurve. Whenever four ideal conditions are met, P is an estimator for the asteroids mean cross section C, a convex set defined as the average of all cross sections C(Z) cut by planes a distance z above the asteroids equatorial plane. C is therefore a 2-D average of the asteroids 3-D shape. The method is tested by inverting lightcurves generated analytically for geometrically scattered ellipsoids (GSE's) with semiaxes a or = B or = C. Using a defined 'distance measure' to quantify the difference between any two profiles, the deviation of P from C for GSE's as a function of lightcurve noise level, rotation phase sampling interval delta theta, and departure from ideal conditions is calibrated. The distance between P and a circle provides a gauge of the asteroid's nonsphericity and incorporates all the information contained in the lightcurve.

Ostrow, S. J.↗

On the electromagnetic scattering from infinite rectangular conducting grids

The study and development of two numerical techniques for the analysis of electromagnetic scattering from a rectangular wire mesh are described. Both techniques follow from one basic formulation and they are both solved in the spectral domain. These techniques were developed as a result of an investigation towards more efficient numerical computation for mesh scattering. These techniques are efficient for the following reasons: (a1) make use of the Fast Fourier Transform; (b2) they avoid any convolution problems by converting integrodifferential equations into algebraic equations; and (c3) they do not require inversions of any matrices. The first method, the SIT or Spectral Iteration Technique, is applied for regions where the spacing between wires is not less than two wavelengths. The second method, the SDCG or Spectral Domain Conjugate Gradient approach, can be used for any spacing between adjacent wires. A study of electromagnetic wave properties, such as reflection coefficient, induced currents and aperture fields, as functions of frequency, angle of incidence, polarization and thickness of wires is presented. Examples and comparisons or results with other methods are also included to support the validity of the new algorithms.

Christodoulou, C.↗

Connections between conventional and singular-value-based multi-variable flight control system design techniques

It is proposed that frequency-domain multivariable robustness techniques, when combined with classical multivariable procedures, can offer an additional means of evaluating FCS designs. A lateral-directional FCS for an advanced fighter is used as an example. Robustness to unstructured aircraft-input uncertainties is assessed using purely numerical singular-value procedures. Literal approximations for the singular values of the open-loop plant and controller and for the inverse return difference are shown to provide a means of decomposing and diagnosing robustness problems that are insoluble via purely numerical methods.

Mcruer, D. T.↗

An inverse dynamics approach to trajectory optimization for an aerospace plane

An inverse dynamics approach for trajectory optimization is proposed. This technique can be useful in many difficult trajectory optimization and control problems. The application of the approach is exemplified by ascent trajectory optimization for an aerospace plane. Both minimum-fuel and minimax types of performance indices are considered. When rocket augmentation is available for ascent, it is shown that accurate orbital insertion can be achieved through the inverse control of the rocket in the presence of disturbances.

Lu, Ping↗

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Comparison of Control Allocation Methods in the Presence of Parametric Model Uncertainty

When allocating redundant effectors to virtual control commands, linear (generalized inverse) allocators have historically been used on aircraft and spacecraft. While simple to implement, generalized inverses are unable to realize a significant portion of the attainable moments. To address this drawback, the control allocation problem can also be formulated as a linear programming or quadratic programming problem and solved using convex optimization based solvers. These approaches have been shown to access a larger set of attainable moments, however, little work has been done to understand the performance of convex optimization-based control allocation in the presence of parametric model uncertainty. This paper seeks to compare the performance of several control allocation approaches, including two forms of generalized inverse allocators, the pseudo inverse and minimum-variance, and the linear programming and quadratic programming approach in the presence of parametric model uncertainty. The performance of these four allocators were tested on an aircraft model in the presence of realistic parametric model uncertainty and the convex optimization approaches were shown to outperform the generalized inverses.

Luke J Miller↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Numerical solutions of the triple-deck equations for laminar trailing-edge stall

The problem of determining the effect of laminar boundary layers on the lift of thin wings in subsonic flow at high Reynolds numbers is considered. The boundary value problem is formulated in the framework of the triple-deck theory of Brown and Stewartson. The resulting fourth-order boundary value was solved by an iterative finite-difference technique. An inverse iteration procedure provides proper treatment of the trailing-edge singularity, and asymptotic far-field expansions and coordinate stretchings are used to deal with the problem of the slow algebraic decay of the solution.

Chow, R.↗

Refine your search to explore more results.