Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

A Frequency-Domain Substructure System Identification Algorithm

A new frequency-domain system identification algorithm is presented for system identification of substructures, such as payloads to be flown aboard the Space Shuttle. In the vibration test, all interface degrees of freedom where the substructure is connected to the carrier structure are either subjected to active excitation or are supported by a test stand with the reaction forces measured. The measured frequency-response data is used to obtain a linear, viscous-damped model with all interface-degree of freedom entries included. This model can then be used to validate analytical substructure models. This procedure makes it possible to obtain not only the fixed-interface modal data associated with a Craig-Bampton substructure model, but also the data associated with constraint modes. With this proposed algorithm, multiple-boundary-condition tests are not required, and test-stand dynamics is accounted for without requiring a separate modal test or finite element modeling of the test stand. Numerical simulations are used in examining the algorithm's ability to estimate valid reduced-order structural models. The algorithm's performance when frequency-response data covering narrow and broad frequency bandwidths is used as input is explored. Its performance when noise is added to the frequency-response data and the use of different least squares solution techniques are also examined. The identified reduced-order models are also compared for accuracy with other test-analysis models and a formulation for a Craig-Bampton test-analysis model is also presented.

Blades, Eric L.↗
NASA NTRS1985

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from a source surface, given the proper boundary conditions. The results of this work; describing the mathematical formalism that was developed, the numerical techniques employed, and the stability criteria developed for these numerical schemes are presented. An analytical solution is used for a test case; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent ( 5%).

Wu, S. T.↗
NASA NTRS2002

A De-centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is decentralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗
NASA NTRS2002

A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗
NASA NTRS1990

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from the photosphere, given the proper boundary conditions. This paper presents the results of this work, describing the mathematical formalism that was developed, the numerical techniques employed, and comments on the stability criteria and accuracy developed for these numerical schemes. An analytical solution is used for a benchmark test; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent (less than 5 percent). This newly developed scheme was applied to analyze a solar vector magnetogram, and the results were compared with the results deduced from the classical potential field method. The comparison shows that additional physical features of the vector magnetogram were revealed in the nonlinear force-free case.

Wu, S. T.↗
NASA NTRS2013

Faster Heavy Ion Transport for HZETRN

The deterministic particle transport code HZETRN was developed to enable fast and accurate space radiation transport through materials. As more complex transport solutions are implemented for neutrons, light ions (Z < 2), mesons, and leptons, it is important to maintain overall computational efficiency. In this work, the heavy ion (Z > 2) transport algorithm in HZETRN is reviewed, and a simple modification is shown to provide an approximate 5x decrease in execution time for galactic cosmic ray transport. Convergence tests and other comparisons are carried out to verify that numerical accuracy is maintained in the new algorithm.

Slaba, Tony C.↗
NASA NTRS1992

An implicit Navier-Stokes code for turbulent flow modeling

This paper presents a numerical approach to calculating turbulent flows employing advanced turbulence models. The main features include a line-by-line Gauss-Seidel algorithm using Roe's approximate Riemann solver, TVD numerical schemes, implicit boundary conditions and a decoupled turbulence-model solver. Based on the problems tested so far, the method has consistently demonstrated its ability in offering accuracy, boundedness and a fast rate of convergence to steady-state solution.

Huang, P. G.↗
NASA NTRS1994

Development of homotopy algorithms for fixed-order mixed H2/H(infinity) controller synthesis

A major difficulty associated with H-infinity and mu-synthesis methods is the order of the resulting compensator. Whereas model and/or controller reduction techniques are sometimes applied, performance and robustness properties are not preserved. By directly constraining compensator order during the optimization process, these properties are better preserved, albeit at the expense of computational complexity. This paper presents a novel homotopy algorithm to synthesize fixed-order mixed H2/H-infinity compensators. Numerical results are presented for a four-disk flexible structure to evaluate the efficiency of the algorithm.

Whorton, M.↗
NASA NTRS2001

Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics

An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.

Watson, W. R.↗
NASA NTRS1971

Efficient digital comparison technique for logic circuits

Tolerance compare technique indicates discompare only when numerical difference value exceeds prescribed limit. Algorithm involving binary number properties is defined, in lieu of arithmetic operation which requires relatively complex circuitry. Extension of algorithm may be made to encompass tolerances other than one unit.

Mccarthy, C. E.↗
NASA NTRS1975

Finite element shell instability analysis

Formulation procedures and the associated computer program for finite element thin shell instability analysis are discussed. Data cover: (1) formulation of basic element relationships, (2) construction of solution algorithms on both the conceptual and algorithmic levels, and (3) conduction of numerical analyses to verify the accuracy and efficiency of the theory and related programs therein are described.

Source record↗
NASA NTRS1980

On the numerical solution of time-dependent viscous incompressible fluid flows involving solid boundaries

An inherent numerical problem associated with the fully explicit pseudospectral numerical simulation of the incompressible Navier-Stokes equation for viscous flows with no-slip walls is described. A semi-implicit scheme which circumvents this numerical difficulty is presented. In this algorithm the equation of continuity rather than the Poisson equation for pressure is solved directly. Pseudospectral formulation of the channel flow problem using Fourier series and Chebyshev polynomials expansions is given for this scheme. An example demonstrating the applicability of the method is given.

Moin, P.↗
NASA NTRS1981

Rapid inversion of limb radiance data using an emissivity growth approximation

The time-consuming nature of limb relaxation-type inversion algorithms is due primarily to the numerous integrations over an absorption band to obtain forward radiance values with which to compare measured values. A new method has been devised for the quick and accurate (0.5% error) calculation of single gas broadband (approximately 100 per cm) limb radiance. The method uses a precalculated data base consisting of homogeneous path emissivity vs mass path data for a wide range of temperature and pressure. A 50-km altitude range, 1-km resolution, constituent inversion employing this method requires under 1 sec of computational time when run on modern computer hardware. The method does not rely upon a priori statistical knowledge.

Gordley, L. L.↗
NASA NTRS1982

Solidification of a binary mixture

The time dependent concentration and temperature profiles of a finite layer of a binary mixture are investigated during solidification. The coupled time dependent Stefan problem is solved numerically using an implicit finite differencing algorithm with the method of lines. Specifically, the temporal operator is approximated via an implicit finite difference operator resulting in a coupled set of ordinary differential equations for the spatial distribution of the temperature and concentration for each time. Since the resulting differential equations set form a boundary value problem with matching conditions at an unknown spatial point, the method of invariant imbedding is used for its solution.

Antar, B. N.↗
NASA NTRS1982

Survey of new vector computers: The CRAY 1S from CRAY research; the CYBER 205 from CDC and the parallel computer from ICL - architecture and programming

Problems which can arise with vector and parallel computers are discussed in a user oriented context. Emphasis is placed on the algorithms used and the programming techniques adopted. Three recently developed supercomputers are examined and typical application examples are given in CRAY FORTRAN, CYBER 205 FORTRAN and DAP (distributed array processor) FORTRAN. The systems performance is compared. The addition of parts of two N x N arrays is considered. The influence of the architecture on the algorithms and programming language is demonstrated. Numerical analysis of magnetohydrodynamic differential equations by an explicit difference method is illustrated, showing very good results for all three systems. The prognosis for supercomputer development is assessed.

Gentzsch, W.↗
NASA NTRS1983

A multigrid method for the Euler equations

A multigrid algorithm has been developed for the numerical solution of the steady two-dimensional Euler equations. Flux vector splitting and one-sided differencing are employed to define the spatial discretization. Newton's method is used to solve the nonlinear equations, and a multigrid solver is used on each linear problem. The relaxation scheme for the linear problems is symmetric Gauss-Seidel. Standard restriction and interpolation operators are employed. Local mode analysis is used to predict the convergence rate of the multigrid process on the linear problems. Computed results for transonic flows over airfoils are presented.

Jespersen, D. C.↗
NASA NTRS1984

Multiple steady states for characteristic initial value problems

The time dependent, isentropic, quasi-one-dimensional equations of gas dynamics and other model equations are considered under the constraint of characteristic boundary conditions. Analysis of the time evolution shows how different initial data may lead to different steady states and how seemingly anamolous behavior of the solution may be resolved. Numerical experimentation using time consistent explicit algorithms verifies the conclusions of the analysis. The use of implicit schemes with very large time steps leads to erroneous results.

Salas, M. D.↗
NASA NTRS1985

An Eigensystem Realization Algorithm for Application to Modal Testing

Important features of the Eigensystem Realization Algorithm (ERA) are summarized as follows: (1) from the computational standpoint, the algorithm is attractive, since only simple numerical operations are needed; (2) the computational procedure is numerically stable; (3) the structural dynamics requirements for modal parameter identification and the control design requirements for a reduced-state space model are satisfied; (4) data from more than one test can be used simultaneously to efficiently identify the closely spaced eigenvalues; and (5) no restrictions on number of measurements are imposed.

Juang, J. N.↗