Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical programming”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

A method for digital image registration using a mathematical programming technique

A new algorithm based on a nonlinear programming technique to correct the geometrical distortions of one digital image with respect to another is discussed. This algorithm promises to be superior to existing ones in that it is capable of treating localized differential scaling, translational and rotational errors over the whole image plane. A series of piece-wise 'rubber-sheet' approximations are used, constrained in such a manner that a smooth approximation over the entire image can be obtained. The theoretical derivation is included. The result of using the algorithm to register four channel S065 Apollo IX digitized photography over Imperial Valley, California, is discussed in detail.

Yao, S. S.↗
NASA NTRS1979

Wing shape optimization for maximum cross-country speed, with mathematical programming

A computer program was developed to calculate numerically the speed and circling polars of an aircraft when the lift and drag characteristics of the wing airfoils are known. The planform of the wing is described by variables which are optimized so that the cross-country speed of the glider is maximum for the particular type of thermal model. Two thermal models are compared and shown that with a greater wing area than now normally used the performance can be increased.

Helwig, G.↗
NASA NTRS1988

Nonoscillatory solution of the steady-state inviscid Burgers' equation by mathematical programming

In order to obtain the physically relevant discontinuous numerical solution, the steady-state inviscid Burgers' equation is singularly perturbed through the addition of a small amount of viscosity. A 'cell-centered' finite-difference scheme is proposed which employs two points for the inviscid part and four points for the viscous one. While difficulties are experienced in the capture of interior layers centered at node points, computational results for interior layers centered between node points, and for boundary layers, exhibit accurate nonoscillatory solutions whose discontinuities are captured in one cell on both coarse and fine grids.

Lavery, John E.↗
NASA NTRS1990

Calculation of shocked one-dimensional flows on abruptly changing grids by mathematical programming

Cell-centered finite differences on cells of an arbitrarily spaced grid are presently used to discretize the steady-state inviscid and nearly inviscid Burgers' equations for steady-state shocked flow in a quasi-one-dimensional nozzle. The everdetermined system of nonlinear algebraic equations thus obtained is solved by a procedure which minimizes a weighted sum of the residuals' absolute values. Numerical solutions for both viscous and inviscid problems are accurate and nonoscillatory, on grids whose abrupt mesh lengths refinements are as great as a factor of 10,000.

Lavery, John E.↗
NASA NTRS1991

Solution of steady-state, two-dimensional conservation laws by mathematical programming

A truly two-dimensional algorithm is created for solving the steady-state two-dimensional conservation-law problem. An overdetermined system of algebraic equations is obtained through discretization by finite-volume formulas. These equations are perturbed nonsingularly and are solved by an efficient geometrically oriented l(1) procedure. The basic algorithm and the theory for the linear case f(u) = u are presented, and computational results for the nonlinear case f(u) = sq u are also analyzed. It is noted that the l(1) procedure captures boundary shocks as well as oblige and zigzag interior shocks in bands that are one cell wide, and the solution values are accurate up to the edge of the shock.

Lavery, John E.↗
NASA NTRS1988

SURE reliability analysis: Program and mathematics

The SURE program is a new reliability analysis tool for ultrareliable computer system architectures. The computational methods on which the program is based provide an efficient means for computing accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. Once a semi-Markov model is described using a simple input language, the SURE program automatically computes the upper and lower bounds on the probability of system failure. A parameter of the model can be specified as a variable over a range of values directing the SURE program to perform a sensitivity analysis automatically. This feature, along with the speed of the program, makes it especially useful as a design tool.

Butler, Ricky W.↗
NASA NTRS1989

The Fault Tree Compiler (FTC): Program and mathematics

The Fault Tree Compiler Program is a new reliability tool used to predict the top-event probability for a fault tree. Five different gate types are allowed in the fault tree: AND, OR, EXCLUSIVE OR, INVERT, AND m OF n gates. The high-level input language is easy to understand and use when describing the system tree. In addition, the use of the hierarchical fault tree capability can simplify the tree description and decrease program execution time. The current solution technique provides an answer precisely (within the limits of double precision floating point arithmetic) within a user specified number of digits accuracy. The user may vary one failure rate or failure probability over a range of values and plot the results for sensitivity analyses. The solution technique is implemented in FORTRAN; the remaining program code is implemented in Pascal. The program is written to run on a Digital Equipment Corporation (DEC) VAX computer with the VMS operation system.

Butler, Ricky W.↗