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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Robust stabilization of the Space Station in the presence of inertia matrix uncertainty

This paper presents a robust H-infinity full-state feedback control synthesis method for uncertain systems with D11 not equal to 0. The method is applied to the robust stabilization problem of the Space Station in the face of inertia matrix uncertainty. The control design objective is to find a robust controller that yields the largest stable hypercube in uncertain parameter space, while satisfying the nominal performance requirements. The significance of employing an uncertain plant model with D11 not equal 0 is demonstrated.

Wie, Bong↗
NASA NTRS1994

A new flux-conserving numerical scheme for the steady, incompressible Navier-Stokes equations

This paper is concerned with the continued development of a new numerical method, the space-time solution element (STS) method, for solving conservation laws. The present work focuses on the two-dimensional, steady, incompressible Navier-Stokes equations. Using first an integral approach, and then a differential approach, the discrete flux conservation equations presented in a recent paper are rederived. Here a simpler method for determining the flux expressions at cell interfaces is given; a systematic and rigorous derivation of the conditions used to simulate the differential form of the governing conservation law(s) is provided; necessary and sufficient conditions for a discrete approximation to satisfy a conservation law in E2 are derived; and an estimate of the local truncation error is given. A specific scheme is then constructed for the solution of the thin airfoil boundary layer problem. Numerical results are presented which demonstrate the ability of the scheme to accurately resolve the developing boundary layer and wake regions using grids which are much coarser than those employed by other numerical methods. It is shown that ten cells in the cross-stream direction are sufficient to accurately resolve the developing airfoil boundary layer.

Scott, James R.↗
NASA NTRS1996

A Computer Program for the Computation of Running Gear Temperatures Using Green's Function

A new technique has been developed to study two dimensional heat transfer problems in gears. This technique consists of transforming the heat equation into a line integral equation with the use of Green's theorem. The equation is then expressed in terms of eigenfunctions that satisfy the Helmholtz equation, and their corresponding eigenvalues for an arbitrarily shaped region of interest. The eigenfunction are obtalned by solving an intergral equation. Once the eigenfunctions are found, the temperature is expanded in terms of the eigenfunctions with unknown time dependent coefficients that can be solved by using Runge Kutta methods. The time integration is extremely efficient. Therefore, any changes in the time dependent coefficients or source terms in the boundary conditions do not impose a great computational burden on the user. The method is demonstrated by applying it to a sample gear tooth. Temperature histories at representative surface locatons are given.

GREENS FUNCTIONS↗
NASA NTRS1997

U.S. Supersonic Commercial Aircraft: Assessing NASA's High Speed Research Program

The legislatively mandated objectives of the National Aeronautics and Space Administration (NASA) include "the improvement of the usefulness, performance, speed, safety, and efficiency of aeronautical and space vehicles" and "preservation of the United States' preeminent position in aeronautics and space through research and technology development related to associated manufacturing processes." Most of NASA's activities are focused on the space-related aspects of these objectives. However, NASA also conducts important work related to aeronautics. NASA's High Speed Research (HSR) Program is a focused technology development program intended to enable the commercial development of a high speed (i.e., supersonic) civil transport (HSCT). However, the HSR Program will not design or test a commercial airplane (i.e., an HSCT); it is industry's responsibility to use the results of the HSR Program to develop an HSCT. An HSCT would be a second generation aircraft with much better performance than first generation supersonic transports (i.e., the Concorde and the Soviet Tu-144). The HSR Program is a high risk effort: success requires overcoming many challenging technical problems involving the airframe, propulsion system, and integrated aircraft. The ability to overcome all of these problems to produce an affordable HSCT is far from certain. Phase I of the HSR Program was completed in fiscal year 1995; it produced critical information about the ability of an HSCT to satisfy environmental concerns (i-e., noise and engine emissions). Phase II (the final phase according to current plans) is scheduled for completion in 2002. Areas of primary emphasis are propulsion, airframe materials and structures, flight deck systems, aerodynamic performance, and systems integration.

Source record↗
DOE OSTI2026

A Flexible Quasi-Static Mooring Design Optimization Method for Floating Structures

This paper presents a flexible and efficient design method for optimizing the mooring systems of floating structures. Mooring system optimization is challenging because of the strong nonlinearity of mooring system behavior and the many technical constraints that must be satisfied. Furthermore, different mooring configurations can have very different design spaces. While some successful examples of mooring design optimization exist in the literature, developing an optimization approach that can work across various mooring design problems is a larger challenge. We present such a method based on a flexible parameterization that allows a wide variety of mooring designs to be described by a list of variables, a quasi-static mooring model that provides efficient evaluation of a mooring design without directly considering mooring system dynamics, and an optimization framework that generates, evaluates, and adjusts the mooring design while considering user-specified constraints such as offset limits, strength safety factors, and seabed contact limits. We demonstrate the design optimization framework on four mooring design problems, each for a different type of mooring system. We compare the use of different design modes to simplify the optimization problem, showing that they can reduce the computation time by up to 75%. We also compare different optimization algorithms and find that the resulting computational speed can vary by up to 51 times. We perform a sensitivity study on one design and find that the local sensitivity of anchoring radius to water depth has a positive correlation of 0.29, but the global sensitivity shows large nonlinearities. Lastly, we perform a coupled dynamic analysis on one of the optimized designs and find that the predicted mean platform motions and mooring line tensions are within 1% of dynamic results and the extreme motions and tensions are within 14%. Lastly, we show that a DEA-Chain-Polyester mooring configuration is cost-optimal for the given design problem of the demonstrations, which aligns with general industry practice.

16 TIDAL AND WAVE POWER↗
NASA NTRS1977

Solution of transient optimization problems by using an algorithm based on nonlinear programming

An algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine.

Teren, F.↗
NASA NTRS1977

Solution of transient optimization problems by using an algorithm based on nonlinear programming

A new algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine.

Teren, F.↗
NASA NTRS1985

Topics in spectral methods

After detailing the construction of spectral approximations to time-dependent mixed initial boundary value problems, a study is conducted of differential equations of the form 'partial derivative of u/partial derivative of t = Lu + f', where for each t, u(t) belongs to a Hilbert space such that u satisfies homogeneous boundary conditions. For the sake of simplicity, it is assumed that L is an unbounded, time-independent linear operator. Attention is given to Fourier methods of both Galerkin and pseudospectral method types, the Galerkin method, the pseudospectral Chebyshev and Legendre methods, the error equation, hyperbolic partial differentiation equations, and time discretization and iterative methods.

Gottlieb, D.↗
NASA NTRS1988

Consistent boundary conditions for reduced Navier-Stokes (RNS) scheme applied to three-dimensional internal viscous flows

Three-dimensional internal viscous flow problems are presently addressed by a consistent and efficient set of boundary conditions for the multisweep space-marching, pressure-elliptic Reduced Navier-Stokes scheme. Since continuity is by this means directly satisfied at all points in the flow domain, the first-order momentum equations are directly solvable for pressure without the requirement for a Poisson pressure-correction equation. Incompressible flow solutions are obtained for straight and curved ducts of square cross section, in order to validate the procedure. Usefulness is demonstrated for internal flows with strong interactions, as would be found in turbomachine geometries.

Reddy, D. R.↗
NASA NTRS1992

The Triton: Design concepts and methods

During the design of the C & P Aerospace Triton, a few problems were encountered that necessitated changes in the configuration. After the initial concept phase, the aspect ratio was increased from 7 to 7.6 to produce a greater lift to drag ratio (L/D = 13) which satisfied the horsepower requirements (118 hp using the Lycoming O-235 engine). The initial concept had a wing planform area of 134 sq. ft. Detailed wing sizing analysis enlarged the planform area to 150 sq. ft., without changing its layout or location. The most significant changes, however, were made just prior to inboard profile design. The fuselage external diameter was reduced from 54 to 50 inches to reduce drag to meet the desired cruise speed of 120 knots. Also, the nose was extended 6 inches to accommodate landing gear placement. Without the extension, the nosewheel received an unacceptable percentage (25 percent) of the landing weight. The final change in the configuration was made in accordance with the stability and control analysis. In order to reduce the static margin from 20 to 13 percent, the horizontal tail area was reduced from 32.02 to 25.0 sq. ft. The Triton meets all the specifications set forth in the design criteria. If time permitted another iteration of the calculations, two significant changes would be made. The vertical stabilizer area would be reduced to decrease the aircraft lateral stability slope since the current value was too high in relation to the directional stability slope. Also, the aileron size would be decreased to reduce the roll rate below the current 106 deg/second. Doing so would allow greater flap area (increasing CL(sub max)) and thus reduce the overall wing area. C & P would also recalculate the horsepower and drag values to further validate the 120 knot cruising speed.

Meholic, Greg↗
NASA NTRS1995

The formal verification used for the AAMP5 and AAMP-FV

The main goal of the project was two-fold: First, to investigate the feasibility of formally specifying and verifying a complex commercial microprocessor that was not expressly designed for formal verification. Second, to explore effective ways to transfer the technology to an industrial setting. The choice of the AAMP5 satisfied the first goal since the AAMP5 was not designed for formal verification, but to provide a more than threefold performance improvement while remaining object-code-compatible with the earlier AAMP2, which is used in numerous avionics applications, including the Boeing 737, 747, 757, and 767. To satisfy the technology transfer objective, we had to develop a suitable verification methodology and a formal infrastructure to make the technology usable by practicing engineers. This infrastructure includes techniques for decomposing the microcompressor verification problem into a st of verification conditions that the engineers can formulate and strategies to automate the proof of the verification conditions. The development of the infrastructure was one of the key accomplishments of the project. Most of the infrastructure and methodology are general enough to be reused for other microprocessors, certainly in the verification of another member of the AAMP family. This methodology was used to formally specify the entire microarchitecture and more than half of the instruction set and to verify a core set of eleven AAMP5 instructions representative of several instruction classes. However, the methodology and the formal machinery developed are adequate to cover most of the remaining AAMP5 instructions. Although PVS was the vehicle of the experiment, the methodology is applicable to other sufficiently powerful theorem provers.

Srivas, Mandayam↗
NASA NTRS1999

PARC Analysis of the NASA/GE 2D NRA Mixer/Ejector Nozzle

Interest in developing a new generation supersonic transport has increased in the past several years. Current projections indicate this aircraft would cruise at approximately Mach 2.4, have a range of 5000 nautical miles and carry at least 250 passengers. A large market for such an aircraft will exist in the next century due to a predicted doubling of the demand for long range air transportation by the end of the century and the growing influence of the Pacific Rim nations. Such a proposed aircraft could more than halve the flying time from Los Angeles to Tokyo. However, before a new economically feasible supersonic transport can be built, many key technologies must be developed. Among these technologies is noise suppression. Propulsion systems for a supersonic transport using current technology would exceed acceptable noise levels. All new aircraft must satisfy FAR 36 Stage III noise regulations. The largest area of concern is the noise generated during takeoff. A concerted effort under NASA's High Speed Research (HSR) program has begun to address the problem of noise suppression. One of the most promising concepts being studied in the area of noise suppression is the mixer/ejector nozzle. This study analyzes a typical noise suppressing mixer ejector nozzle at take off conditions, using a Full Navier-Stokes (FNS) computational fluid dynamics (CFD) code.

DeBonis, J. R.↗
NASA NTRS2024

Automated Detection of Spurious Signals in VLBI Phase Calibration Data

In this memorandum, a set of processing strategies for automatic masking of phase calibration tones is outlined as implemented in the software package PIMA in the task Generate Phase Calibration Mask, or GEPM. The task relies on a robust procedure of cleaning phase calibration data before employing several mathematical strategies designed to selectively identify spurious signals from phase calibration tones. These strategies were derived as more rigorous implementations of heuristics traditionally used by analysts in manually identifying problematic phase calibration data. The task is intended to automate the process of generating a phase calibration mask and in so doing increase the speed and regularity of VLBI analysis. At the outset of the project, a series of goals were identified to evaluate the success of this mask generation. This included the development of an algorithm to identify and mask short-term (defined as less than 10 seconds in length) spurious signals affecting phase calibration data, the development of an algorithm to identify and mask phase calibration tones affected by constant radio-frequency interference, the implementation of a detection scheme for identifying large jumps in phase calibration phase caused by clock breaks, and finally a method of reporting phase calibration health metrics to the user. Processing of over 10 experiments has demonstrated that the final form of the task GEPM as detailed in this technical memorandum satisfies each of these conditions and satisfactorily performs the task of automatic phase calibration data masking, although the wide variety in quality and characteristics of phase calibration data makes a single solution to the problem quite difficult. A series of user inputs have therefore been defined to assist analysts in tailoring automatic masking to specific stations and phase calibration generators. The vast majority of applicable code was written in FORTRAN to increase execution speed and ease of interfacing with the existing code base in PIMA, but a wrapper function in Python was also written to allow for a simpler method of interacting with GEPM and inputting relevant parameters. In addition to this report, thorough documentation was added to the already existing repositories associated with PIMA as a whole.

Geodesy↗
DOE OSTI2024

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗
NASA NTRS1996

Development of Finite Elements for Two-Dimensional Structural Analysis Using the Integrated Force Method

The Integrated Force Method has been developed in recent years for the analysis of structural mechanics problems. This method treats all independent internal forces as unknown variables that can be calculated by simultaneously imposing equations of equilibrium and compatibility conditions. In this paper a finite element library for analyzing two-dimensional problems by the Integrated Force Method is presented. Triangular- and quadrilateral-shaped elements capable of modeling arbitrary domain configurations are presented. The element equilibrium and flexibility matrices are derived by discretizing the expressions for potential and complementary energies, respectively. The displacement and stress fields within the finite elements are independently approximated. The displacement field is interpolated as it is in the standard displacement method, and the stress field is approximated by using complete polynomials of the correct order. A procedure that uses the definitions of stress components in terms of an Airy stress function is developed to derive the stress interpolation polynomials. Such derived stress fields identically satisfy the equations of equilibrium. Moreover, the resulting element matrices are insensitive to the orientation of local coordinate systems. A method is devised to calculate the number of rigid body modes, and the present elements are shown to be free of spurious zero-energy modes. A number of example problems are solved by using the present library, and the results are compared with corresponding analytical solutions and with results from the standard displacement finite element method. The Integrated Force Method not only gives results that agree well with analytical and displacement method results but also outperforms the displacement method in stress calculations.

Kaljevic, Igor↗
NASA NTRS1992

Human-like agents with posture planning ability

Human body models are geometric structures which may be ultimately controlled by kinematically manipulating their joints, but for animation, it is desirable to control them in terms of task-level goals. We address a fundamental problem in achieving task-level postural goals: controlling massively redundant degrees of freedom. We reduce the degrees of freedom by introducing significant control points and vectors, e.g., pelvis forward vector, palm up vector, and torso up vector, etc. This reduced set of parameters are used to enumerate primitive motions and motion dependencies among them, and thus to select from a small set of alternative postures (e.g., bend vs. squat to lower shoulder height). A plan for a given goal is found by incrementally constructing a goal/constraint set based on the given goal, motion dependencies, collision avoidance requirements, and discovered failures. Global postures satisfying a given goal/constraint set are determined with the help of incremental mental simulation which uses a robust inverse kinematics algorithm. The contributions of the present work are: (1) There is no need to specify beforehand the final goal configuration, which is unrealistic for the human body, and (2) the degrees of freedom problem becomes easier by representing body configurations in terms of 'lumped' control parameters, that is, control points and vectors.

Jung, Moon R.↗
DOE OSTI2023

High precision tests of QCD without scale or scheme ambiguities: The 40th anniversary of the Brodsky–Lepage–Mackenzie method

A key issue in making precise predictions in QCD is the uncertainty in setting the renormalization scale μ r and thus determining the correct values of the QCD running coupling α s (μ r ) at each order in the perturbative expansion of a QCD observable. It has often been conventional to simply set the renormalization scale to the typical scale of the process Q and vary it in the range μ r $\in$ [Q/2, 2Q] in order to estimate the theoretical error. This is the practice of Conventional Scale Setting (CSS). The resulting CSS prediction will however depend on the theorist’s choice of renormalization scheme and the resulting pQCD series will diverge factorially. It will also disagree with renormalization scale setting used in QED and electroweak theory thus precluding grand unification. A solution to the renormalization scale-setting problem is offered by the Principle of Maximum Conformality (PMC), which provides a systematic way to eliminate the renormalization scale-and-scheme dependence in perturbative calculations. The PMC method has rigorous theoretical foundations, it satisfies Renormalization Group Invariance (RGI) and preserves all self-consistency conditions derived from the renormalization group. The PMC cancels the renormalon growth, reduces to the Gell-Mann–Low scheme in the N c → 0 Abelian limit and leads to scale- and scheme-invariant results. The PMC has now been successfully applied to many high-energy processes. In this article we summarize recent developments and results in solving the renormalization scale and scheme ambiguities in perturbative QCD. In particular, we present a recently developed method the PMC ∞ and its applications, comparing the results with CSS. The method preserves the property of renormalizable SU(N)/U(1) gauge theories defined as Intrinsic Conformality (iCF). This property underlies the scale invariance of physical observables and leads to a remarkably efficient method to solve the conventional renormalization scale ambiguity at every order in pQCD. This new method reflects the underlying conformal properties displayed by pQCD at NNLO, eliminates the scheme dependence of pQCD predictions and is consistent with the general properties of the PMC. A new method to identify conformal and β-terms, which can be applied either to numerical or to theoretical calculations is also shown. We present results for the thrust and C-parameter distributions in e + e - annihilation showing errors and comparison with the CSS. We also show results for a recent innovative comparison between the CSS and the PMC ∞ applied to the thrust distribution investigating both the QCD conformal window and the QED N c → 0 limit. In order to determine the thrust distribution along the entire renormalization group flow from the highest energies to zero energy, we consider the number of flavors near the upper boundary of the conformal window. In this flavor-number regime the theory develops a perturbative infrared interacting fixed point. These results show that PMC ∞ leads to higher precision and introduces new interesting features in the PMC. In fact, this method preserves with continuity the position of the peak, showing perfect agreement with the experimental data already at NNLO. We also show a detailed comparison of the PMC ∞ with the other PMC approaches: the multi-scale-setting approach (PMCm) and the single-scale-setting approach (PMCs) by comparing their predictions for three important fully integrated quantities R e+e- , R$_Τ$ and Γ (H→$b\bar{b}$) up to the four-loop accuracy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗