Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Minimax 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.

54 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Reduced-order modeling of neutron transport separated in energy by Minimax Proper Generalized Decomposition

In this article, we demonstrate a Petrov-Galerkin Proper Generalized Decomposition (PGD) known as Minimax PGD for modeling neutron transport separated in energy. To compare the Minimax with the classical Galerkin PGD, we assess both on a model problem of UO{sub 2} or Mixed Oxide (MOX) fuel pins in an infinite lattice with 3 industry-standard energy meshes. We find the Minimax PGD achieves a superior decomposition to Galerkin PGD, both with and without update of the energy modes. This suggests Minimax PGD may be more computationally efficient, provided this reduction in modes (to achieve a given accuracy) outweighs the cost of solving the necessary adjoint problems. In either case, we note that PGD offers an a priori Reduced-Order Model (ROM) which may be dramatically cheaper to solve than the full-order model, especially in problems with fine to ultrafine energy meshes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

The central dogma and cosmological horizons

The central dogma of black hole physics – which says that from the outside a black hole can be described in terms of a quantum system with exp(Area/4G N ) states evolving unitarily – has recently been supported by computations indicating that the interior of the black hole is encoded in the Hawking radiation of the exterior. In this paper, we probe whether such a dogma for cosmological horizons has any support from similar computations. The fact that the de Sitter bifurcation surface is a minimax surface (instead of a maximin surface) causes problems with this interpretation when trying to import calculations analogous to the AdS case. This suggests anchoring extremal surfaces to the horizon itself, where we formulate a two-sided extremization prescription and find answers consistent with general expectations for a quantum theory of de Sitter space: vanishing total entropy, an entropy of A/4G N when restricting to a single static patch, an entropy of a subregion of the horizon which grows as the region size grows until an island-like transition at half the horizon size when the entanglement wedge becomes the entire static patch interior, and a de Sitter version of the Hartman-Maldacena transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Trajectory optimization and guidance for a hypersonic vehicle

The optimal ascent problem for a hypersonic vehicle is formulated as an inverse dynamic problem. This formulation is essential in solving the trajectory optimization problem via the nonlinear programming approach. Both minimum-fuel and minimax type of performance indices are considered. The results reveal important features of the optimal trajectory and controls, and they are subsequently used to construct a nonlinear feedback midcourse control law. This control law not only greatly simplifies the difficult constrained optimization problem and yields improved solutions, but is also suitable for onboard implementation. Finally, off-nominal trajectory guidance is addressed using combination of feedback compensation and onboard generation of control through the inverse dynamics approach.

Lu, Ping↗
NASA NTRS2012

A Risk-Constrained Multi-Stage Decision Making Approach to the Architectural Analysis of Mars Missions

This paper presents a novel risk-constrained multi-stage decision making approach to the architectural analysis of planetary rover missions. In particular, focusing on a 2018 Mars rover concept, which was considered as part of a potential Mars Sample Return campaign, we model the entry, descent, and landing (EDL) phase and the rover traverse phase as four sequential decision-making stages. The problem is to find a sequence of divert and driving maneuvers so that the rover drive is minimized and the probability of a mission failure (e.g., due to a failed landing) is below a user specified bound. By solving this problem for several different values of the model parameters (e.g., divert authority), this approach enables rigorous, accurate and systematic trade-offs for the EDL system vs. the mobility system, and, more in general, cross-domain trade-offs for the different phases of a space mission. The overall optimization problem can be seen as a chance-constrained dynamic programming problem, with the additional complexity that 1) in some stages the disturbances do not have any probabilistic characterization, and 2) the state space is extremely large (i.e, hundreds of millions of states for trade-offs with high-resolution Martian maps). To this purpose, we solve the problem by performing an unconventional combination of average and minimax cost analysis and by leveraging high efficient computation tools from the image processing community. Preliminary trade-off results are presented.

entry, descent, and landing (EDL)↗
NASA NTRS1989

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗
NASA NTRS1995

The construction of high-accuracy schemes for acoustic equations

An accuracy analysis of various high order schemes is performed from an interpolation point of view. The analysis indicates that classical high order finite difference schemes, which use polynomial interpolation, hold high accuracy only at nodes and are therefore not suitable for time-dependent problems. Thus, some schemes improve their numerical accuracy within grid cells by the near-minimax approximation method, but their practical significance is degraded by maintaining the same stencil as classical schemes. One-step methods in space discretization, which use piecewise polynomial interpolation and involve data at only two points, can generate a uniform accuracy over the whole grid cell and avoid spurious roots. As a result, they are more accurate and efficient than multistep methods. In particular, the Cubic-Interpolated Psuedoparticle (CIP) scheme is recommended for computational acoustics.

Tang, Lei↗
NASA NTRS2002

Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments

The problem of partitioning irregular graphs and meshes for parallel computations on homogeneous systems has been extensively studied. However, these partitioning schemes fail when the target system architecture exhibits heterogeneity in resource characteristics. With the emergence of technologies such as the Grid, it is imperative to study the partitioning problem taking into consideration the differing capabilities of such distributed heterogeneous systems. In our model, the heterogeneous system consists of processors with varying processing power and an underlying non-uniform communication network. We present in this paper a novel multilevel partitioning scheme for irregular graphs and meshes, that takes into account issues pertinent to Grid computing environments. Our partitioning algorithm, called MiniMax, generates and maps partitions onto a heterogeneous system with the objective of minimizing the maximum execution time of the parallel distributed application. For experimental performance study, we have considered both a realistic mesh problem from NASA as well as synthetic workloads. Simulation results demonstrate that MiniMax generates high quality partitions for various classes of applications targeted for parallel execution in a distributed heterogeneous environment.

Bisws, Rupak↗
NASA NTRS1992

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↗
NASA NTRS1998

Design of Constant Gain Dissipative Controllers for Eigensystem Assignment in Passive Systems

Partial eigensystem assignment with output feedback can lead to an unstable closed-loop system. However, output feedback with passive linear time-invariant systems, such as flexible space structures, is guaranteed to be stable if the controller is dissipative. This paper presents a novel approach for synthesis of dissipative output feedback gain matrices for assigning a selected number of closed-loop poles. Dissipativity of a gain matrix is known to be equivalent to positive semidefiniteness of the symmetric part of the matrix. A sequential procedure is presented to assign one self-conjugate pair of closed-loop eigenvalues at each step using dissipative output feedback gain matrices, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The problem of assigning one closed-loop pair is reduced to a constrained solution of a system of quadratic equations, and necessary and sufficient conditions for the existence of a solution are presented. A minimax approach is presented for determining parameters which satisfy these conditions. This method can assign as many closed-loop system poles as the number of control inputs. A numerical example of damping enhancement for a flexible structure is presented to demonstrate the approach.

Maghami, Peiman G.↗
NASA NTRS1992

Minimax confidence intervals in geomagnetism

The present paper uses theory of Donoho (1989) to find lower bounds on the lengths of optimally short fixed-length confidence intervals (minimax confidence intervals) for Gauss coefficients of the field of degree 1-12 using the heat flow constraint. The bounds on optimal minimax intervals are about 40 percent shorter than Backus' intervals: no procedure for producing fixed-length confidence intervals, linear or nonlinear, can give intervals shorter than about 60 percent the length of Backus' in this problem. While both methods rigorously account for the fact that core field models are infinite-dimensional, the application of the techniques to the geomagnetic problem involves approximations and counterfactual assumptions about the data errors, and so these results are likely to be extremely optimistic estimates of the actual uncertainty in Gauss coefficients.

Stark, Philip B.↗
DOE OSTI2020

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1977

Study of synthesis techniques for insensitive aircraft control systems

Insensitive flight control system design criteria was defined in terms of maximizing performance (handling qualities, RMS gust response, transient response, stability margins) over a defined parameter range. Wing load alleviation for the C-5A was chosen as a design problem. The C-5A model was a 79-state, two-control structure with uncertainties assumed to exist in dynamic pressure, structural damping and frequency, and the stability derivative, M sub w. Five new techniques (mismatch estimation, uncertainty weighting, finite dimensional inverse, maximum difficulty, dual Lyapunov) were developed. Six existing techniques (additive noise, minimax, multiplant, sensitivity vector augmentation, state dependent noise, residualization) and the mismatch estimation and uncertainty weighting techniques were synthesized and evaluated on the design example. Evaluation and comparison of these six techniques indicated that the minimax and the uncertainty weighting techniques were superior to the other six, and of these two, uncertainty weighting has lower computational requirements. Techniques based on the three remaining new concepts appear promising and are recommended for further research.

Harvey, C. A.↗
NASA NTRS2001

Aeroservoelastic Uncertainty Model Identification from Flight Data

Uncertainty modeling is a critical element in the estimation of robust stability margins for stability boundary prediction and robust flight control system development. There has been a serious deficiency to date in aeroservoelastic data analysis with attention to uncertainty modeling. Uncertainty can be estimated from flight data using both parametric and nonparametric identification techniques. The model validation problem addressed in this paper is to identify aeroservoelastic models with associated uncertainty structures from a limited amount of controlled excitation inputs over an extensive flight envelope. The challenge to this problem is to update analytical models from flight data estimates while also deriving non-conservative uncertainty descriptions consistent with the flight data. Multisine control surface command inputs and control system feedbacks are used as signals in a wavelet-based modal parameter estimation procedure for model updates. Transfer function estimates are incorporated in a robust minimax estimation scheme to get input-output parameters and error bounds consistent with the data and model structure. Uncertainty estimates derived from the data in this manner provide an appropriate and relevant representation for model development and robust stability analysis. This model-plus-uncertainty identification procedure is applied to aeroservoelastic flight data from the NASA Dryden Flight Research Center F-18 Systems Research Aircraft.

Brenner, Martin J.↗
NASA NTRS1975

Advances in data compression

A rigorous real-variables treatment of general data compression and encoding problems, centered on formulation and proof of relevant existence theorems and a unified formulation of source coding (both noiseless and with a fidelity criterion) in inaccurately or incompletely specified statistical environments. Difficulties in modeling of sources with unknown or imperfectly known statistical descriptions are analyzed and source codes (SC) are classified (variable-rate noiseless SC, fixed-rate noiseless SC) and analyzed, along with types of code sequences (weighted-universal, maximin-universal, strongly or weakly minimax-universal). Universal coding on video data, variable-rate coding with distortion, and distortion-rate functions are discussed. Design strategies for universal coding algorithms are suggested, but the article is not oriented to specific methods of synthesizing data compression systems.

Davisson, L. D.↗
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Practical choices for space-filling designs

Space-filling designs are now commonly used as a flexible model-free strategy for providing good coverage throughout an input space of interest for a variety of computer and physical experiment design scenarios. Some of the preliminary choices about how to frame the problem and which type of design to use can have a substantial impact on the success or failure of the experiment, and yet how to make these critical choices is often under-emphasized in the literature. In this paper, we explore several of the practical choices required by the experimenter and describe a sequence of steps to help create an ideal design that matches the goals and constraints of the experiment. These choices include the specification of the input space, the scaling of the variables, the degree of uniformity of the design points across the input space, and the space-filling characteristics. In addition, some new tools for defining the weights to implement non-uniform space-filling designs are provided. Finally, the methods are demonstrated with several illustrative examples and a real-world chemical engineering experiment for carbon capture.

42 ENGINEERING↗