Search NASA⌕ Search

SEARCH · Search NASA

Results for “Minimization”

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,063 records · Page 59

OPTIM: Computer program to generate a vertical profile which minimizes aircraft fuel burn or direct operating cost. User's guide

A profile of altitude, airspeed, and flight path angle as a function of range between a given set of origin and destination points for particular models of transport aircraft provided by NASA is generated. Inputs to the program include the vertical wind profile, the aircraft takeoff weight, the costs of time and fuel, certain constraint parameters and control flags. The profile can be near optimum in the sense of minimizing: (1) fuel, (2) time, or (3) a combination of fuel and time (direct operating cost (DOC)). The user can also, as an option, specify the length of time the flight is to span. The theory behind the technical details of this program is also presented.

Source record↗

Preconditioned Minimal Residual Methods for Chebyshev Spectral Caluclations

The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is considered. The numerical sensitiveness to variations of the coefficients of the operator are investigated for two classes of preconditioning matrices: one arising from finite differences, the other from finite elements. The preconditioned system is solved by a conjugate gradient type method, and by a DuFort-Frankel method with dynamical parameters. The methods are compared on some test problems with the Richardson method and with the minimal residual Richardson method.

Canuto, C.↗

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗

Minimizing inner product data dependencies in conjugate gradient iteration

The amount of concurrency available in conjugate gradient iteration is limited by the summations required in the inner product computations. The inner product of two vectors of length N requires time c log(N), if N or more processors are available. This paper describes an algebraic restructuring of the conjugate gradient algorithm which minimizes data dependencies due to inner product calculations. After an initial start up, the new algorithm can perform a conjugate gradient iteration in time c*log(log(N)).

Vanrosendale, J.↗

Minimizing Convection During Crystal Growth

Buoyant convection during crystal growth from solution minimized in experiment cell using boundary-layer stabilizing configurants such as downward isothermal growth or upward growth into thermal gradient.

Shlichta, P. J.↗

Method and apparatus for minimizing convection during crystal growth from solution

A method and apparatus are disclosed for growing in a gravitational field a microscopic crystal from a solution. The solution is held in a vertical chamber which is relatively thin, the thin being generally perpendicular to the vertical. There is a substrate crystal disposed at either the upper or lower end of the chamber and the crystal grows from this substrate crystal in one direction. The temperature conditions of the solution are controlled so that, as the crystal forms, the effects of buoyant convection within the solution are minimized. This is accomplished in two different ways depending upon whether the crystal is grown from the upper or lower end of the chamber. When grown from the upper end of the chamber, the temperature of the solution is controlled so that it remains essentially isothermal so that there is essentially no heat loss from the solution. When the crystal is grown from the lower end of the chamber, the temperature of the solution is controlled so that there is a differential in temperature throughout the solution which provides a positive thermal gradient within the chamber.

Shlichta, P. J.↗

Continued research on selected parameters to minimize community annoyance from airport noise

A mathematical model of the annoyance created at an airport by aircraft operations is developed. The model incorporates population distribution considerations around an airport and the annoyance caused by aircraft noise. The objective function of this model corresponds to seeking to minimize total population annoyance created by all aircraft operations in a 24-hour period. Several factors are included in this model as constraint bounded. Demand for flight services is incorporated by including lower bounds on the number of operations by type of aircraft, runway used and time period. Also upper bounds on the number of operations for each runway are included. The mathematical model as formulated is recognized as corresponding to a nonlinear integer mathematical programming problem.

Frair, L.↗

Simulations for Full Unit-memory and Partial Unit-memory Convolutional Codes with Real-time Minimal-byte-error Probability Decoding Algorithm

A program which was written to simulate Real Time Minimal-Byte-Error Probability (RTMBEP) decoding of full unit-memory (FUM) convolutional codes on a 3-bit quantized AWGN channel is described. This program was used to compute the symbol-error probability of FUM codes and to determine the signal to noise (SNR) required to achieve a bit error rate (BER) of 10 to the minus 6th power for corresponding concatenated systems. A (6,6/30) FUM code, 6-bit Reed-Solomon code combination was found to achieve the required BER at a SNR of 1.886 dB. The RTMBEP algorithm was then modified for decoding partial unit-memory (PUM) convolutional codes. A simulation program was also written to simulate the symbol-error probability of these codes.

Vo, Q. D.↗

Newton like: Minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗

Application of augmented-Lagrangian methods in meteorology: Comparison of different conjugate-gradient codes for large-scale minimization

A Lagrange multiplier method using techniques developed by Bertsekas (1982) was applied to solving the problem of enforcing simultaneous conservation of the nonlinear integral invariants of the shallow water equations on a limited area domain. This application of nonlinear constrained optimization is of the large dimensional type and the conjugate gradient method was found to be the only computationally viable method for the unconstrained minimization. Several conjugate-gradient codes were tested and compared for increasing accuracy requirements. Robustness and computational efficiency were the principal criteria.

Navon, I. M.↗

A minimal residual method for transonic potential flows

For transonic flow calculations, a combination of the successive line over-relaxation (SLOR) and the preconditioned conjugate gradient (CG) method has been suggested by Wong and Hafez (1981). This paper studies the method of minimal residual (MR) which avoids a combined iteration. This method is closely related to the CG method, may be regarded as a first-order gradient method, and is applicable to symmetric and nonsymmetric matrices. The problem is formulated as a nonlinear mixed elliptic-hyperbolic partial differential equation which includes an artificial viscosity and a switching function which is zero in subsonic regions and nonzero in supersonic regions. Alternatives to the SLOR method which provide faster convergence rates are introduced. The preconditioned MR algorithm is developed, and transonic potential flows around NACA 0012 airfoil are calculated for different Mach numbers and angles of attack. Preliminary results are presented, demonstrating that the MR algorithm requires no parameter estimation and rapidly converges for subsonic flows.

Wong, Y. S.↗

SASS wind ambiguity removal by direct minimization. II - Use of smoothness and dynamical constraints

A variational analysis method (VAM) is used to remove the ambiguity of the Seasat-A Satellite Scatterometer (SASS) winds. The VAM yields the best fit to the data by minimizing an objective function S which is a measure of the lack of fit. The SASS data are described and the function S and the analysis procedure are defined. Analyses of a single ship report which are analogous to Green's functions are presented. The analysis procedure is tuned and its sensitivity is described using the QE II storm. The procedure is then applied to a case study of September 6, 1978, south of Japan.

Hoffman, R. N.↗

New short constraint length, rate 1/N convolutional codes which minimize the required SNR for given desired bit error rates

It is pointed out that for a convolutional coding system, the Bit Error Rate (BER) at the Viterbi decoder output is upper-bounded by the transfer function bound. A large number of rate 1/N convolutional codes have been reported. The criteria used for determining the quality of a code in code search procedures, however, may not be very suited for cases in which the required BER is in the moderate range. For this reason, it may be best to select the code with the aim to minimize the required SNR for a given disired BER. Partial code searching techniques are presented, and a table listing the code search results is provided.

Lee, P. J.↗

Newton-like minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗

A minimal living system and the origin of a protocell

The essential molecular attributes of a minimal living system are discussed, and the evolution of a protocell from such a system is considered. Present thought on the emergence and evolution of life is summarized, and the complexity of biological systems is reviewed. The five fundamental molecular attributes considered are: informational molecules, catalytic peptides, a decoding and translation system, protoribosomes, and protomembranes. Their functions in a primitive cell are discussed. Positive feedback interaction between proto-RNA, proto-AA-tRNA, and protoenzyme are identified as the three major steps to the formation of a primitive living cell.

Oro, J.↗

Aircraft drag prediction and reduction. Addendum 1: Computational drag analyses and minimization; mission impossible?

The Special Course on Aircraft Drag Prediction was sponsored by the AGARD Fluid Dynamics Panel and the von Karman Institute and presented at the von Karman Institute, Rhode-Saint-Genese, Belgium, on 20 to 23 May 1985 and at the NASA Langley Research Center, Hampton, Virginia, USA, 5 to 6 August 1985. The course began with a general review of drag reduction technology. Then the possibility of reduction of skin friction through control of laminar flow and through modification of the structure of the turbulence in the boundary layer were discussed. Methods for predicting and reducing the drag of external stores, of nacelles, of fuselage protuberances, and of fuselage afterbodies were then presented followed by discussion of transonic drag rise. The prediction of viscous and wave drag by a method matching inviscid flow calculations and boundary layer integral calculations, and the reduction of transonic drag through boundary layer control are also discussed. This volume comprises Paper No. 9 Computational Drag Analyses and Minimization: Mission Impossible, which was not included in AGARD Report 723 (main volume).

Slooff, J. W.↗

Preconditioned minimal residual methods for Chebyshev spectral calculations

The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is considered. The numerical sensitiveness to variations of the coefficients of the operator are investigated for two classes of preconditioning matrices: one arising from finite differences, the other from finite elements. The preconditioned system is solved by a conjugate gradient type method, and by a Dufort-Frankel method with dynamical parameters. The methods are compared on some test problems with the Richardson method and with the minimal residual Richardson method.

Canuto, C.↗

The minimal residual QR-factorization algorithm for reliably solving subset regression problems

A new algorithm to solve test subset regression problems is described, called the minimal residual QR factorization algorithm (MRQR). This scheme performs a QR factorization with a new column pivoting strategy. Basically, this strategy is based on the change in the residual of the least squares problem. Furthermore, it is demonstrated that this basic scheme might be extended in a numerically efficient way to combine the advantages of existing numerical procedures, such as the singular value decomposition, with those of more classical statistical procedures, such as stepwise regression. This extension is presented as an advisory expert system that guides the user in solving the subset regression problem. The advantages of the new procedure are highlighted by a numerical example.

Verhaegen, M. H.↗