SEARCH · Search NASA

Results for “numerical algorithm computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64

All sources NASA NTRS DOE OSTI

NASA NTRS1983

Calculations of transonic potential flows by a parameter free procedure

A parameter-free computational procedure for transonic potential flows around an airfoil is presented. The method is based on an inexact, Newton-like iterative scheme, and a preconditioned minimal residual algorithm is used to solve the linear system of equations arising at each iterate. This iterative procedure is formulated so that the difficulties associated with the approximate factorization technique, namely the requirement of iteration parameters and the boundary conditions for the intermediate variable are eliminated. Numerical experiments are given for potential flows around NACA 0012 airfoil with different Mach numbers and different angles of attack. These results are then compared with those obtained by the approximate factorization techniques.

Wong, Y. S.↗

NASA NTRS1983

A finite element method for diffusion dominated unsteady viscous flows

A general conforming finite element scheme for computing viscous flows is presented which is of second-order accuracy in space and time. Viscous terms are treated implicitly and advection terms are treated explicitly in the time marching segment of the algorithm. A method for solving the algebraic equations at each time step is given. The method is demonstrated on two test problems, one of them being a plane vortex flow for which asymptotic methods are used to obtain suitable numerical boundary conditions at each time step.

Gunzburger, M. D.↗

NASA NTRS1986

Two-dimensional nonsteady viscous flow simulation on the Navier-Stokes computer miniNode

The needs of large-scale scientific computation are outpacing the growth in performance of mainframe supercomputers. In particular, problems in fluid mechanics involving complex flow simulations require far more speed and capacity than that provided by current and proposed Class VI supercomputers. To address this concern, the Navier-Stokes Computer (NSC) was developed. The NSC is a parallel-processing machine, comprised of individual Nodes, each comparable in performance to current supercomputers. The global architecture is that of a hypercube, and a 128-Node NSC has been designed. New architectural features, such as a reconfigurable many-function ALU pipeline and a multifunction memory-ALU switch, have provided the capability to efficiently implement a wide range of algorithms. Efficient algorithms typically involve numerically intensive tasks, which often include conditional operations. These operations may be efficiently implemented on the NSC without, in general, sacrificing vector-processing speed. To illustrate the architecture, programming, and several of the capabilities of the NSC, the simulation of two-dimensional, nonsteady viscous flows on a prototype Node, called the miniNode, is presented.

Nosenchuck, Daniel M.↗

NASA NTRS1989

An indirect method for numerical optimization using the Kreisselmeir-Steinhauser function

A technique is described for converting a constrained optimization problem into an unconstrained problem. The technique transforms one of more objective functions into reduced objective functions, which are analogous to goal constraints used in the goal programming method. These reduced objective functions are appended to the set of constraints and an envelope of the entire function set is computed using the Kreisselmeir-Steinhauser function. This envelope function is then searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. Advantages of this approach are the use of unconstrained optimization methods to find a constrained minimum without the draw down factor typical of penalty function methods, and that the technique may be started from the feasible or infeasible design space. In multiobjective applications, the approach has the advantage of locating a compromise minimum design without the need to optimize for each individual objective function separately.

Wrenn, Gregory A.↗

NASA NTRS1989

A real-time guidance algorithm for aerospace plane optimal ascent to low earth orbit

Problems of onboard trajectory optimization and synthesis of suitable guidance laws for ascent to low Earth orbit of an air-breathing, single-stage-to-orbit vehicle are addressed. A multimode propulsion system is assumed which incorporates turbojet, ramjet, Scramjet, and rocket engines. An algorithm for generating fuel-optimal climb profiles is presented. This algorithm results from the application of the minimum principle to a low-order dynamic model that includes angle-of-attack effects and the normal component of thrust. Maximum dynamic pressure and maximum aerodynamic heating rate constraints are considered. Switching conditions are derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another. A nonlinear transformation technique is employed to derived a feedback controller for tracking the computed trajectory. Numerical results illustrate the nature of the resulting fuel-optimal climb paths.

Calise, A. J.↗

NASA NTRS1989

A parallel structure transient response algorithm using independent substructure response computation

An algorithm for parallel computation of transient response for structures is presented in which responses of substructures are computed independently for dozens of time steps at a time, and these substructure responses are then corrected to obtain the response of the overall coupled structure. The correction of the uncoupled substructure responses only requires the responses computed for interfaces at occasional points in time, and is done independently for different substructures in a very efficient procedure. A numerical example is presented to demonstrate the method and show the accuracy of the method.

Bennighof, Jeffrey K.↗

NASA NTRS1994

The delayed-detonation model of a type Ia supernovae. 1: The deflagration phase

The nature of the 'delayed detonation' mechanism of Khokhlov for the explosion of Type Ia supernovae is investigated by using two-dimensional numerical hydrodynamics simulations. A new algorithm is used to treat the deflagration front. Assuming that it propagates locally at the laminar flame speed, the deflagration is insufficient to unbind the star. Expansion shuts of the flame; much of this small production of iron group nuclei occurs at lower densities, which reduces the electron-capture problem. The burning front does become wrinkled, but the wavelength of the instability is much larger than the computational grid size and is resolved; this is consistent with previous analysis. Because the degenerate star has an adiabatic exponent only slightly above 4/3, the energy released by deflagration drives a pulsation of large amplitude. During the first expansion phase, adiabatic cooling shuts off the burning, and a Rayleigh-Taylor instability then gives mixing of high-entropy ashes with low-entropy fuel. During the first contraction phase, compressional heating reignites the material. This paper deals with the deflagration phase, from the onset of burning, through expansion and quenching of the flame, to the first contraction.

Arnett, David↗

NASA NTRS1996

Indirect Identification of Linear Stochastic Systems with Known Feedback Dynamics

An algorithm is presented for identifying a state-space model of linear stochastic systems operating under known feedback controller. In this algorithm, only the reference input and output of closed-loop data are required. No feedback signal needs to be recorded. The overall closed-loop system dynamics is first identified. Then a recursive formulation is derived to compute the open-loop plant dynamics from the identified closed-loop system dynamics and known feedback controller dynamics. The controller can be a dynamic or constant-gain full-state feedback controller. Numerical simulations and test data of a highly unstable large-gap magnetic suspension system are presented to demonstrate the feasibility of this indirect identification method.

Huang, Jen-Kuang↗

NASA NTRS1994

Dynamics of Numerics and CFD

This lecture attempts to illustrate the basic ideas of how the recent advances in nonlinear dynamical systems theory (dynamics) can provide new insights into the understanding of numerical algorithms used in solving nonlinear differential equations (DEs). Examples will be given of the use of dynamics to explain unusual phenomena that occur in numerics. The inadequacy of the use of linearized analysis for the understanding of long time behavior of nonlinear problems will be illustrated, and the role of dynamics in studying the nonlinear stability, accuracy, convergence property and efficiency of using time- dependent approaches to obtaining steady-state numerical solutions in computational fluid dynamics (CFD) will briefly be explained.

Yee, H. C.↗

NASA NTRS2016

Phase-Retrieval Uncertainty Estimation and Algorithm Comparison for the JWST-ISIM Test Campaign

Phase retrieval, the process of determining the exitpupil wavefront of an optical instrument from image-plane intensity measurements, is the baseline methodology for characterizing the wavefront for the suite of science instruments (SIs) in the Integrated Science Instrument Module (ISIM) for the James Webb Space Telescope (JWST). JWST is a large, infrared space telescope with a 6.5-meter diameter primary mirror. JWST is currently NASA's flagship mission and will be the premier space observatory of the next decade. ISIM contains four optical benches with nine unique instruments, including redundancies. ISIM was characterized at the Goddard Space Flight Center (GSFC) in Greenbelt, MD in a series of cryogenic vacuum tests using a telescope simulator. During these tests, phase-retrieval algorithms were used to characterize the instruments. The objective of this paper is to describe the Monte-Carlo simulations that were used to establish uncertainties (i.e., error bars) for the wavefronts of the various instruments in ISIM. Multiple retrieval algorithms were used in the analysis of ISIM phase-retrieval focus-sweep data, including an iterativetransform algorithm and a nonlinear optimization algorithm. These algorithms emphasize the recovery of numerous optical parameters, including low-order wavefront composition described by Zernike polynomial terms and high-order wavefront described by a point-by-point map, location of instrument best focus, focal ratio, exit-pupil amplitude, the morphology of any extended object, and optical jitter. The secondary objective of this paper is to report on the relative accuracies of these algorithms for the ISIM instrument tests, and a comparison of their computational complexity and their performance on central and graphical processing unit clusters. From a phase-retrieval perspective, the ISIM test campaign includes a variety of source illumination bandwidths, various image-plane sampling criteria above and below the Nyquist- Shannon critical sampling value, various extended object sizes, and several other impactful effects.

Design Analysis↗

NASA NTRSDate not supplied

Impact of Analytic Derivatives on Optimization of N-Impulse Orbit Transfer

Several formulations are possible for the optimization of N-impulse two-body orbit transfers. One formulation that assumes the firstN−1impulses are design variables and implements Lambert’s algorithm in the final leg is here considered. This paper presents a derivation for the analytic expressions of the gradients needed to optimize this formulation. The impact of using these analytic expressions on the optimization computational cost is also presented. A linear system of equations is developed that approximates the Lambert’s problem solution in a way that is suitable for computing the analytic gradients. The derivations of the analytic gradients, as well as numerical case studies for 2-impulse and 3-impulse orbit transfers, are presented. The numerical case studies highlights a significant reduction in the computational cost, measured in terms of the number of function calls.

Ahmed Ellithy↗

NASA NTRS1974

Finite element solution theory for three-dimensional boundary flows

A finite element algorithm is derived for the numerical solution of a three-dimensional flow field described by a system of initial-valued, elliptic boundary value partial differential equations. The familiar three-dimensional boundary layer equations belong to this description when diffusional processes in only one coordinate direction are important. The finite element algorithm transforms the original description into large order systems of ordinary differential equations written for the dependent variables discretized at node points of an arbitrarily irregular computational lattice. The generalized elliptic boundary conditions is piecewise valid for each dependent variable on boundaries that need not explicitly coincide with coordinate surfaces. Solutions for sample problems in laminar and turbulent boundary flows illustrate favorable solution accuracy, convergence, and versatility.

Baker, A. J.↗

NASA NTRS1977

Variants and extensions of a fast direct numerical cauchy-riemann solver, with illustrative applications

Revised and extended versions of a fast, direct (noniterative) numerical Cauchy-Riemann solver are presented for solving finite difference approximations of first order systems of partial differential equations. Although the difference operators treated are linear and elliptic, one significant application of these extended direct Cauchy-Riemann solvers is in the fast, semidirect (iterative) solution of fluid dynamic problems governed by the nonlinear mixed elliptic-hyperbolic equations of transonic flow. Different versions of the algorithms are derived and the corresponding FORTRAN computer programs for a simple example problem are described and listed. The algorithms are demonstrated to be efficient and accurate.

Martin, E. D.↗

NASA NTRS1984

An efficient coordinate transformation technique for unsteady, transonic aerodynamic analysis of low aspect-ratio wings

An efficient coordinate transformation technique is presented for constructing grids for unsteady, transonic aerodynamic computations for delta-type wings. The original shearing transformation yielded computations that were numerically unstable and this paper discusses the sources of those instabilities. The new shearing transformation yields computations that are stable, fast, and accurate. Comparisons of those two methods are shown for the flow over the F5 wing that demonstrate the new stability. Also, comparisons are made with experimental data that demonstrate the accuracy of the new method. The computations were made by using a time-accurate, finite-difference, alternating-direction-implicit (ADI) algorithm for the transonic small-disturbance potential equation.

Guruswamy, G. P.↗

NASA NTRS1986

Semi-implicit and fully implicit shock-capturing methods for hyperbolic conservation laws with stiff source terms

Some numerical aspects of finite-difference algorithms for nonlinear multidimensional hyperbolic conservation laws with stiff nonhomogenous (source) terms are discussed. If the stiffness is entirely dominated by the source term, a semi-implicit shock-capturing method is proposed provided that the Jacobian of the soruce terms possesses certain properties. The proposed semi-implicit method can be viewed as a variant of the Bussing and Murman point-implicit scheme with a more appropriate numerical dissipation for the computation of strong shock waves. However, if the stiffness is not solely dominated by the source terms, a fully implicit method would be a better choice. The situation is complicated by problems that are higher than one dimension, and the presence of stiff source terms further complicates the solution procedures for alternating direction implicit (ADI) methods. Several alternatives are discussed. The primary motivation for constructing these schemes was to address thermally and chemically nonequilibrium flows in the hypersonic regime. Due to the unique structure of the eigenvalues and eigenvectors for fluid flows of this type, the computation can be simplified, thus providing a more efficient solution procedure than one might have anticipated.

Yee, H. C.↗

NASA NTRS1987

Semi-implicit and fully implicit shock-capturing methods for hyperbolic conservation laws with stiff source terms

Some numerical aspects of finite-difference algorithms for nonlinear multidimensional hyperbolic conservation laws with stiff nonhomogeneous (source) terms are discussed. If the stiffness is entirely dominated by the source term, a semi-implicit shock-capturing method is proposed provided that the Jacobian of the source terms possesses certain properties. The proposed semi-implicit method can be viewed as a variant of the Bussing and Murman point-implicit scheme with a more appropriate numerical dissipation for the computation of strong shock waves. However, if the stiffness is not solely dominated by the source terms, a fully implicit method would be a better choice. The situation is complicated by problems that are higher than one dimension, and the presence of stiff source terms further complicates the solution procedures for alternating direction implicit (ADI) methods. Several alternatives are discussed. The primary motivation for constructing these schemes was to address thermally and chemically nonequilibrium flows in the hypersonic regime. Due to the unique structure of the eigenvalues and eigenvectors for fluid flows of this type, the computation can be simplified, thus providing a more efficient solution procedure than one might have anticipated.

Yee, H. C.↗

NASA NTRS1991

Multi-Dimensional ENO Schemes for General Geometries

A class of ENO schemes is presented for the numerical solution of multidimensional hyperbolic systems of conservation laws in structured and unstructured grids. This is a class of shock-capturing schemes which are designed to compute cell-averages to high order accuracy. The ENO scheme is composed of a piecewise-polynomial reconstruction of the solution form its given cell-averages, approximate evolution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is based on an adaptive selection of stencil for each cell so as to avoid spurious oscillations near discontinuities while achieving high order of accuracy away from them.

Harten, Ami↗

NASA NTRS1991

A trajectory planning scheme for spacecraft in the space station environment

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

Soller, Jeffrey Alan↗