Search NASA⌕ Search

SEARCH · Search NASA

Results for “satisfiability problems”

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 595 records · Page 33

Analytical guidance law development for aerocapture at Mars

During the first part of this reporting period research has concentrated on performing a detailed evaluation, to zero order, of the guidance algorithm developed in the first period taking the numerical approach developed in the third period. A zero order matched asymptotic expansion (MAE) solution that closely satisfies a set of 6 implicit equations in 6 unknowns to an accuracy of 10(exp -10), was evaluated. Guidance law implementation entails treating the current state as a new initial state and repetitively solving the MAE problem to obtain the feedback controls. A zero order guided solution was evaluated and compared with optimal solution that was obtained by numerical methods. Numerical experience shows that the zero order guided solution is close to optimal solution, and that the zero order MAE outer solution plays a critical role in accounting for the variations in Loh's term near the exit phase of the maneuver. However, the deficiency that remains in several of the critical variables indicates the need for a first order correction. During the second part of this period, methods for computing a first order correction were explored.

Calise, A. J.↗

Robotic tape library system level testing at NSA: Present and planned

In the present of declining Defense budgets, increased pressure has been placed on the DOD to utilize Commercial Off the Shelf (COTS) solutions to incrementally solve a wide variety of our computer processing requirements. With the rapid growth in processing power, significant expansion of high performance networking, and the increased complexity of applications data sets, the requirement for high performance, large capacity, reliable and secure, and most of all affordable robotic tape storage libraries has greatly increased. Additionally, the migration to a heterogeneous, distributed computing environment has further complicated the problem. With today's open system compute servers approaching yesterday's supercomputer capabilities, the need for affordable, reliable secure Mass Storage Systems (MSS) has taken on an ever increasing importance to our processing center's ability to satisfy operational mission requirements. To that end, NSA has established an in-house capability to acquire, test, and evaluate COTS products. Its goal is to qualify a set of COTS MSS libraries, thereby achieving a modicum of standardization for robotic tape libraries which can satisfy our low, medium, and high performance file and volume serving requirements. In addition, NSA has established relations with other Government Agencies to complete this in-house effort and to maximize our research, testing, and evaluation work. While the preponderance of the effort is focused at the high end of the storage ladder, considerable effort will be extended this year and next at the server class or mid range storage systems.

Shields, Michael F.↗

Optimization with Neural Network Feasibility Surrogates: Formulations and Application to Security-Constrained Optimal Power Flow

In many areas of constrained optimization, representing all possible constraints that give rise to an accurate feasible region can be difficult and computationally prohibitive for online use. Satisfying feasibility constraints becomes more challenging in high-dimensional, non-convex regimes which are common in engineering applications. A prominent example that is explored in the manuscript is the security-constrained optimal power flow (SCOPF) problem, which minimizes power generation costs, while enforcing system feasibility under contingency failures in the transmission network. In its full form, this problem has been modeled as a nonlinear two-stage stochastic programming problem. In this work, we propose a hybrid structure that incorporates and takes advantage of both a high-fidelity physical model and fast machine learning surrogates. Neural network (NN) models have been shown to classify highly non-linear functions and can be trained offline but require large training sets. In this work, we present how model-guided sampling can efficiently create datasets that are highly informative to a NN classifier for non-convex functions. We show how the resultant NN surrogates can be integrated into a non-linear program as smooth, continuous functions to simultaneously optimize the objective function and enforce feasibility using existing non-linear solvers. Overall, this allows us to optimize instances of the SCOPF problem with an order of magnitude CPU improvement over existing methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Analysis of shape of porous cooled medium for an imposed surface heat flux and temperature

The surface of a porous cooled medium is to be maintained at a specified design temperature while being subjected to uniform heating by an external source. An analytical method is given for determining the shape of the medium surface that will satisfy these boundary conditions. The analysis accounts for temperature dependent variations of fluid density and viscosity and for temperature dependent matrix thermal conductivity. The energy equation is combined with Darcy's law in such a way that a potential can be defined that satisfies Laplace's equation. All of the heat-transfer and flow quantities are expressed in terms of this potential. The determination of the shape of the porous cooled region is thereby reduced to a free-boundary problem such as in inviscid free jet theory. Two illustrative examples are carried out: a porous leading edge with coolant supplied through a slot and a porous cooled duct with a rectangular outer boundary.

Siegel, R.↗

An explicit solution to the exoatmospheric powered flight guidance and trajectory optimization problem for rocket propelled vehicles

A derivation of an explicit solution to the two point boundary-value problem of exoatmospheric guidance and trajectory optimization is presented. Fixed initial conditions and continuous burn, multistage thrusting are assumed. Any number of end conditions from one to six (throttling is required in the case of six) can be satisfied in an explicit and practically optimal manner. The explicit equations converge for off nominal conditions such as engine failure, abort, target switch, etc. The self starting, predictor/corrector solution involves no Newton-Rhapson iterations, numerical integration, or first guess values, and converges rapidly if physically possible. A form of this algorithm has been chosen for onboard guidance, as well as real time and preflight ground targeting and trajectory shaping for the NASA Space Shuttle Program.

Jaggers, R. F.↗

Application of functional analysis to perturbation theory of differential equations

The deviation of the solution of the differential equation y' = f(t, y), y(O) = y sub O from the solution of the perturbed system z' = f(t, z) + g(t, z), z(O) = z sub O was investigated for the case where f and g are continuous functions on I x R sup n into R sup n, where I = (o, a) or I = (o, infinity). These functions are assumed to satisfy the Lipschitz condition in the variable z. The space Lip(I) of all such functions with suitable norms forms a Banach space. By introducing a suitable norm in the space of continuous functions C(I), introducing the problem can be reduced to an equivalent problem in terminology of operators in such spaces. A theorem on existence and uniqueness of the solution is presented by means of Banach space technique. Norm estimates on the rate of growth of such solutions are found. As a consequence, estimates of deviation of a solution due to perturbation are obtained. Continuity of the solution on the initial data and on the perturbation is established. A nonlinear perturbation of the harmonic oscillator is considered a perturbation of equations of the restricted three body problem linearized at libration point.

Bogdan, V. M.↗

Three-dimensional unsteady lifting surface theory in the subsonic range

The methods of the unsteady lifting surface theory are surveyed. Linearized Euler's equations are simplified by means of a Galileo-Lorentz transformation and a Laplace transformation so that the time and the compressibility of the fluid are limited to two constants. The solutions to this simplified problem are represented as integrals with a differential nucleus; these results in tolerance conditions, for which any exact solution must suffice. It is shown that none of the existing three-dimensional lifting surface theories in subsonic range satisfy these conditions. An oscillating elliptic lifting surface which satisfies the tolerance conditions is calculated through the use of Lame's functions. Numerical examples are calculated for the borderline cases of infinitely stretched elliptic lifting surfaces and of circular lifting surfaces. Out of the harmonic solutions any such temporal changes of the down current are calculated through the use of an inverse Laplace transformation.

Kuessner, H. G.↗

On orbital allotments for geostationary satellites

The following satellite synthesis problem is addressed: communication satellites are to be allotted positions on the geostationary arc so that interference does not exceed a given acceptable level by enforcing conservative pairwise satellite separation. A desired location is specified for each satellite, and the objective is to minimize the sum of the deviations between the satellites' prescribed and desired locations. Two mixed integer programming models for the satellite synthesis problem are presented. Four solution strategies, branch-and-bound, Benders' decomposition, linear programming with restricted basis entry, and a switching heuristic, are used to find solutions to example synthesis problems. Computational results indicate the switching algorithm yields solutions of good quality in reasonable execution times when compared to the other solution methods. It is demonstrated that the switching algorithm can be applied to synthesis problems with the objective of minimizing the largest deviation between a prescribed location and the corresponding desired location. Furthermore, it is shown that the switching heuristic can use no conservative, location-dependent satellite separations in order to satisfy interference criteria.

Gonsalvez, David J. A.↗

Constraint monitoring in TOSCA

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.

Beck, Howard↗

Theory and computation of optimal low- and medium-thrust transfers

This report presents two numerical methods considered for the computation of fuel-optimal, low-thrust orbit transfers in large numbers of burns. The origins of these methods are observations made with the extremal solutions of transfers in small numbers of burns; there seems to exist a trend such that the longer the time allowed to perform an optimal transfer the less fuel that is used. These longer transfers are obviously of interest since they require a motor of low thrust; however, we also find a trend that the longer the time allowed to perform the optimal transfer the more burns are required to satisfy optimality. Unfortunately, this usually increases the difficulty of computation. Both of the methods described use small-numbered burn solutions to determine solutions in large numbers of burns. One method is a homotopy method that corrects for problems that arise when a solution requires a new burn or coast arc for optimality. The other method is to simply patch together long transfers from smaller ones. An orbit correction problem is solved to develop this method. This method may also lead to a good guidance law for transfer orbits with long transfer times.

Chuang, C.-H.↗

Large area mapping of soil moisture using the ESTAR passive microwave radiometer

Investigations designed to study land surface hydrologic-atmospheric interactions, showing the potential of L band passive microwave radiometry for measuring surface soil moisture over large areas, are discussed. Satisfying the data needs of these investigations requires the ability to map large areas rapidly. With aircraft systems this means a need for more beam positions over a wider swath on each flightline. For satellite systems the essential problem is resolution. Both of these needs are currently being addressed through the development and verification of Electronically Scanned Thinned Array Radiometer (ESTAR) technology. The ESTAR L band radiometer was evaluated for soil moisture mapping applications in two studies. The first was conducted over the semiarid rangeland Walnut Gulch watershed located in south eastern Arizona (U.S.). The second was performed in the subhumid Little Washita watershed in south west Oklahoma (U.S.). Both tests showed that the ESTAR is capable of providing soil moisture with the same level of accuracy as existing systems.

Jackson, T. J.↗

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↗

Solid Rocket Motor Performance Analysis and Prediction

Current design practices are reviewed and assessed, and guidance is established for achieving greater consistency in design, reliability in the end product, and efficiency in the design effort. The total problem is discussed, and design elements involved in successful design are identified. Design criteria are described, and the rule, guide, limitation, or standard which must be imposed on each essential design element is given. Recommended practices are presented for satisfying each of the criteria.

Source record↗

Application of Papkovich-Neuber potentials to a crack problem.

The problem of an elastic solid containing a semi-infinite plane crack subjected to concentrated shears parallel to the edge of the crack is considered in this paper. A closed form solution using four harmonic functions is found to satisfy the finite displacement and inverse square root stress singularity at the edge of the crack. Explicit expressions in terms of elementary functions are given for the distribution of stress and displacement in the solid. These are obtained by employing Fourier and Kontorovich-Lebedev integral transforms and certain singular solutions of Laplace equations in three dimensions. The variations of the intensity of the local stress field along the crack border are shown graphically.

Kassir, M. K.↗

The evolution of galaxies. III - Metal-enhanced star formation

The problem of the paucity of low-metal-abundance low-mass stars is discussed. One alternative to the variable-initial-mass-function (VIMF) solution is proposed. It is shown that this solution - metal-enhanced star formation - satisfies the classical test which prompted the VIMF hypothesis. Furthermore, with no additional parameters it provides improved fits to other tests - e.g., inhomogeneities in the abundances in young stars, concordance of all nucleo-cosmochronologies, and a required yield of heavy-element production which is consistent with current stellar evolution theory. In this model the age of the Galaxy is 18.6 plus or minus 5.7 b.y.

Talbot, R. J., Jr.↗

A spectral numerical method for the Navier-Stokes equations with applications to Taylor-Couette flow

A new spectral method for solving the incompressible Navier-Stokes equations in a plane channel and between concentric cylinders is presented. The method uses spectral expansions which inherently satisfy the boundary conditions and the continuity equation and yield banded matrices which are efficiently solved at each time step. In addition, the number of dependent variables is reduced, resulting in a reduction in computer memory requirements. Several test problems have been computed for the channel flow and for flow between concentric cylinders, including Taylor-Couette flow with axisymmetric Taylor vortices and wavy vortices. In all cases, agreement with available experimental and theoretical results is very good.

Moser, R. D.↗

Reasoning about real-time systems with temporal interval logic constraints on multi-state automata

Models of real-time systems using a single paradigm often turn out to be inadequate, whether the paradigm is based on states, rules, event sequences, or logic. A model-based approach to reasoning about real-time systems is presented in which a temporal interval logic called TIL is employed to define constraints on a new type of high level automata. The combination, called hierarchical multi-state (HMS) machines, can be used to model formally a real-time system, a dynamic set of requirements, the environment, heuristic knowledge about planning-related problem solving, and the computational states of the reasoning mechanism. In this framework, mathematical techniques were developed for: (1) proving the correctness of a representation; (2) planning of concurrent tasks to achieve goals; and (3) scheduling of plans to satisfy complex temporal constraints. HMS machines allow reasoning about a real-time system from a model of how truth arises instead of merely depending of what is true in a system.

Gabrielian, Armen↗