Search NASA⌕ Search

SEARCH · Search NASA

Results for “solving”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Decision making and problem solving with computer assistance

In modern guidance and control systems, the human as manager, supervisor, decision maker, problem solver and trouble shooter, often has to cope with a marginal mental workload. To improve this situation, computers should be used to reduce the operator from mental stress. This should not solely be done by increased automation, but by a reasonable sharing of tasks in a human-computer team, where the computer supports the human intelligence. Recent developments in this area are summarized. It is shown that interactive support of operator by intelligent computer is feasible during information evaluation, decision making and problem solving. The applied artificial intelligence algorithms comprehend pattern recognition and classification, adaptation and machine learning as well as dynamic and heuristic programming. Elementary examples are presented to explain basic principles.

Kraiss, F.↗
NASA NTRS1980

A comparison of finite difference methods for solving Laplace's equation on curvilinear coordinate systems

Various finite difference techniques used to solve Laplace's equation are compared. Curvilinear coordinate systems are used on two dimensional regions with irregular boundaries, specifically, regions around circles and airfoils. Truncation errors are analyzed for three different finite difference methods. The false boundary method and two point and three point extrapolation schemes, used when having the Neumann boundary condition are considered and the effects of spacing and nonorthogonality in the coordinate systems are studied.

Mccoy, M. J.↗
NASA NTRS1980

Improved local linearization algorithm for solving the quaternion equations

The objective of this paper is to develop a new and more accurate local linearization algorithm for numerically solving sets of linear time-varying differential equations. Of special interest is the application of this algorithm to the quaternion rate equations. The results are compared, both analytically and experimentally, with previous results using local linearization methods. The new algorithm requires approximately one-third more calculations per step than the previously developed local linearization algorithm; however, this disadvantage could be reduced by using parallel implementation. For some cases the new algorithm yields significant improvement in accuracy, even with an enlarged sampling interval. The reverse is true in other cases. The errors depend on the values of angular velocity, angular acceleration, and integration step size. One important result is that for the worst case the new algorithm can guarantee eigenvalues nearer the region of stability than can the previously developed algorithm.

Yen, K.↗
NASA NTRS1980

Numerical techniques for solving nonlinear instability problems in smokeless tactical solid rocket motors

The selection of a satisfactory numerical method for calculating the propagation of steep fronted shock life waveforms in a solid rocket motor combustion chamber is discussed. A number of different numerical schemes were evaluated by comparing the results obtained for three problems: the shock tube problems; the linear wave equation, and nonlinear wave propagation in a closed tube. The most promising method--a combination of the Lax-Wendroff, Hybrid and Artificial Compression techniques, was incorporated into an existing nonlinear instability program. The capability of the modified program to treat steep fronted wave instabilities in low smoke tactical motors was verified by solving a number of motor test cases with disturbance amplitudes as high as 80% of the mean pressure.

Baum, J. D.↗
NASA NTRS1980

A framework for automated decision making and problem solving

Problems can be subdivided into two main categories: well structured problems and ill structured problems. The first require routine repetitive decisions which are generally amenable to programmable decision processes. The second require novel nonprogrammable decision processes. The decision making processes can be subdivided into those representative of those done by humans and those done by machine. Many of such decision processes require a combination of humans d machines. Automated decision making and problem solving technologies are expected to have their greatest potential impact in the space program.

Heer, E.↗
NASA NTRS1982

A numerical method for solving the Vlasov equation

A numerical procedure is derived for the solution of the Vlasov-Poisson system of equations in two phase-space variables. Derivatives with respect to the phase-space variables are approximated by a weighted sum of the values of the distribution function at property chosen neighboring points. The resulting set of ordinary differential equations is then solved by using an appropriate time intergration scheme. The accuracy of the proposed method is tested with some simple model problems. The results for the free streaming case, linear Landau damping, and nonlinear Landau damping are investigated and compared with those of the splitting scheme. The proposed method is found to be very accurate and efficient.

Satofuka, N.↗
NASA NTRS1981

Comparison of PASCAL and FORTRAN for solving problems in the physical sciences

The paper compares PASCAL and FORTRAN for problem solving in the physical sciences, due to requests NASA has received to make PASCAL available on the Numerical Aerodynamic Simulator (scheduled to be operational in 1986). PASCAL disadvantages include the lack of scientific utility procedures equivalent to the IBM scientific subroutine package or the IMSL package which are available in FORTRAN. Advantages include a well-organized, easy to read and maintain writing code, range checking to prevent errors, and a broad selection of data types. It is concluded that FORTRAN may be the better language, although ADA (patterned after PASCAL) may surpass FORTRAN due to its ability to add complex and vector math, and the specify the precision and range of variables.

Watson, V. R.↗
NASA NTRS1983

Code Solves Three-Dimensional Navier-Stokes Equations

Set of computer codes solves three-dimensional Navier-Stokes equations for flow over nonaxisymmetric nozzles. Codes compute internal and external viscous flowfield about isolated nozzle, so flow characteristics and performance of three-dimensional jet engine exhaust nozzles can be predicted. Programs written in FORTRAN IV and ASSEMBLER.

Thomas, P.↗
NASA NTRS1983

On a finite-difference method for solving transient viscous flow problems

A method has been developed to solve the unsteady, compressible Navier-Stokes equation with the property of consistency and the ability of minimizing the equation stiffness. It relies on innovative extensions of the state-of-the-art finite-difference techniques and is composed of: (1) the upwind scheme for split-flux and the central scheme for conventional flux terms in the inviscid and viscous regions, respectively; (2) the characteristic treatment of both inviscid and viscous boundaries; (3) an ADI procedure compatible with interior and boundary points; and (4) a scalar matrix coefficient including viscous terms. The performance of this method is assessed with four sample problems; namely, a standing shock in the Laval duct, a shock reflected from the wall, the shock-induced boundary-layer separation, and a transient internal nozzle flow. The results from the present method, an existing hybrid block method, and a well-known two-step explicit method are compared and discussed. It is concluded that this method has an optimal trade-off between the solution accuracy and computational economy, and other desirable properties for analyzing transient viscous flow problems.

Li, C. P.↗
NASA NTRS1982

The use of solution adaptive grids in solving partial differential equations

The grid point distribution used in solving a partial differential equation using a numerical method has a substantial influence on the quality of the solution. An adaptive grid which adjusts as the solution changes provides the best results when the number of grid points available for use during the calculation is fixed. Basic concepts used in generating and applying adaptive grids are reviewed in this paper, and examples illustrating applications of these concepts are presented.

Anderson, D. A.↗
NASA NTRS1983

A method for solving the transonic full-potential equation for general configurations

A method is developed for solving the full-potential equation for two-dimensional and axisymmetric flow which retains the grid and boundary condition simplicity of the transonic small-disturbance codes. The method is based on a finite-volume formulation of the mass conservation equation in a Cartesian coordinate system, and is an extension of the method of Purvis and Burkhalter (1979). This finite-volume approach, combined with the simple boundary treatment, is shown to result in a highly robust method applicable to a wide range of geometries and flow conditions. The accuracy of the method is demonstrated for general geometries in two-dimensional and axisymmetric flows. The use of this method results in significant gains in convergence rate over the vertical-line over-relaxation scheme by incorporating an AF2-type algorithm (Ballhaus et al., 1978). It is suggested that the simplicity of this method shold allow a relatively easy extension to complex geometries in three-dimensional flows, and complex two-dimensional configurations such as multielement airfoils should be amenable to this method.

Wedan, B.↗
NASA NTRS1985

Algorithm Solves Constrained and Unconstrained Optimization Problems

Is quasi-Newton iteration utilizing Broyden/Fletcher/Goldfarb/Shanno update on inverse Hessian matrix. Capable of solving constrained optimization unconstrained optimization and constraints only problems with one to five independent variables from one to five constraint functions and one dependent function optimized.

Denson, M. A.↗
NASA NTRS1983

XTRAN2L: A program for solving the general-frequency unsteady transonic small disturbance equation

A program, XTRAN2L, for solving the general-frequency unsteady transonic small disturbance potential equation was developed. It is a modification of the LTRAN2-NLR code. The alternating-direction-implicit (ADI) method of Rizzetta and Chin is used to advance solutions of the potential equation in time Engquist-Osher monotone spatial differencing is used in the ADI solution algorithm. As a result, the XTRAN2L code is more robust and more efficient than similar codes that use Murman-Cole type-dependent spatial differencing. Nonreflecting boundary conditions that are consistent with the general-frequency equation have been developed and implemented at the far-field boundaries. Use of those conditions allow the computational boundaries to be moved closer to the airfoil with no loss of accuracy. This makes the XTRAN2L code more economical to use.

Whitlow, W., Jr.↗
NASA NTRS1984

Adapting iterative algorithms for solving large sparse linear systems for efficient use on the CDC CYBER 205

Adapting and designing mathematical software to achieve optimum performance on the CYBER 205 is discussed. Comments and observations are made in light of recent work done on modifying the ITPACK software package and on writing new software for vector supercomputers. The goal was to develop very efficient vector algorithms and software for solving large sparse linear systems using iterative methods.

Kincaid, D. R.↗
NASA NTRS1984

Algorithms for solving large sparse systems of simultaneous linear equations on vector processors

Very efficient algorithms for solving large sparse systems of simultaneous linear equations have been developed for serial processing computers. These involve a reordering of matrix rows and columns in order to obtain a near triangular pattern of nonzero elements. Then an LU factorization is developed to represent the matrix inverse in terms of a sequence of elementary Gaussian eliminations, or pivots. In this paper it is shown how these algorithms are adapted for efficient implementation on vector processors. Results obtained on the CYBER 200 Model 205 are presented for a series of large test problems which show the comparative advantages of the triangularization and vector processing algorithms.

David, R. E.↗
NASA NTRS1984

On the method of pseudo compressibility for numerically solving incompressible flows

Pseudo compressibility is used for numerically solving incompressible flows to achieve computational efficiency. The use of pseudo compressibility results in a system of hyperbolic-type equations of motion that introduce waves of finite speed. The interactions of the wave propagation and the vorticity spreading are analyzed. A criterion governing the dependence of the pseudo compressiblity on the Reynolds number and the characteristic length of the flow geometry is obtained that allows for a proper convergence. It is demonstrated that the solution does tend to the incompressible limit. External and internal viscous flow test problems are presented to verify the theory.

Chang, J. L. C.↗
NASA NTRS1986

Solving Large Systems of Normal Equations

SOLVE II program combines any number of sets of normal equations and obtains solution vector and related statistics. Normal equations of square, nonnegative definite matrix form. Program utilizes only upper symmetric portion of matrix. Program uses partitioned Cholesky decomposition method for matrix inversion to accommodate large parameter systems.

Putney, B.↗