SEARCH · Search NASA

Results for “numerical algorithm”

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 649 records · Page 36

All sources NASA NTRS DOE OSTI

NASA NTRS1990

An efficient numerical integral in three-dimensional electromagnetic field computations

An improved algorithm for efficiently computing a sinusoid and an exponential integral commonly encountered in method-of-moments solutions is presented. The new algorithm has been tested for accuracy and computer execution time against both numerical integration and other existing numerical algorithms, and has outperformed them. Typical execution time comparisons on several computers are given.

Whetten, Frank L.↗

NASA NTRS1987

Optimal placement of excitations and sensors for verification of large dynamical systems

The computationally difficult problem of the optimal placement of excitations and sensors to maximize the observed measurements is studied within the framework of combinatorial optimization, and is solved numerically using a variation of the simulated annealing heuristic algorithm. Results of numerical experiments including a square plate and a 960 degrees-of-freedom Control of Flexible Structure (COFS) truss structure, are presented. Though the algorithm produces suboptimal solutions, its generality and simplicity allow the treatment of complex dynamical systems which would otherwise be difficult to handle.

Salama, M.↗

NASA NTRS1984

A comparison of the efficiency of numerical methods for integrating chemical kinetic rate equations

The efficiency of several algorithms used for numerical integration of stiff ordinary differential equations was compared. The methods examined included two general purpose codes EPISODE and LSODE and three codes (CHEMEQ, CREK1D and GCKP84) developed specifically to integrate chemical kinetic rate equations. The codes were applied to two test problems drawn from combustion kinetics. The comparisons show that LSODE is the fastest code available for the integration of combustion kinetic rate equations. It is shown that an iterative solution of the algebraic energy conservation equation to compute the temperature can be more efficient then evaluating the temperature by integrating its time-derivative.

Radhakrishnan, K.↗

NASA NTRS1986

On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations

Substructuring methods are in common use in mechanics problems where typically the associated linear systems of algebraic equations are positive definite. Here these methods are extended to problems which lead to nonpositive definite, nonsymmetric matrices. The extension is based on an algorithm which carries out the block Gauss elimination procedure without the need for interchanges even when a pivot matrix is singular. Examples are provided wherein the method is used in connection with finite element solutions of the stationary Stokes equations and the Helmholtz equation, and dual methods for second-order elliptic equations.

Gunzburger, M. D.↗

NASA NTRS1991

Ignition transient analysis of solid rocket motor

Measurement data on the performance of Space Shuttle Solid Rocket Motor show wide variations in the head-end pressure changes and the total thrust build-up during the ignition transient periods. To analyze the flow and thermal behavior in the tested solid rocket motors, a 1-dimensional, ideal gas flow model via the SIMPLE algorithm was developed. Numerical results showed that burning patterns in the star-shaped head-end segment of the propellant and the erosive burning rate are two important factors controlling the ignition transients. The objective of this study is to extend the model to include the effects of aluminum particle commonly used in solid propellants. To treat the effects of aluminum-oxide particles in the combustion gas, conservation of mass, momentum, and energy equations for the particles are added in the numerical formulation and integrated by an inter-phase-slip algorithm.

Han, Samuel S.↗

NASA NTRS2012

Research and Development of Automated Eddy Current Testing for Composite Overwrapped Pressure Vessels

Eddy current testing (ET) was used to scan bare metallic liners used in the fabrication of composite overwrapped pressure vessels (COPVs) for flaws which could result in premature failure of the vessel. The main goal of the project was to make improvements in the areas of scan signal to noise ratio, sensitivity of flaw detection, and estimation of flaw dimensions. Scan settings were optimized resulting in an increased signal to noise ratio. Previously undiscovered flaw indications were observed and investigated. Threshold criteria were determined for the system software's flaw report and estimation of flaw dimensions were brought to an acceptable level of accuracy. Computer algorithms were written to import data for filtering and a numerical derivative filtering algorithm was evaluated.

Carver, Kyle L.↗

NASA NTRS1992

Numerical simulations using a dynamic solution-adaptive grid algorithm, with applications to unsteady internal flows

An investigation into the numerical simulation of unsteady flows is undertaken using a two-stage Runge-Kutta scheme coupled with the dynamic solution-adaptive grid algorithm developed by the authors. The inviscid fluxes are described by a modified Advective Upwind Split Method to eliminate the need for artificial dissipation. A well-documented numerical example containing moving discontinuities is presented that demonstrates the ability of the coupled grid/solver scheme to accurately capture unsteady flowfield phenomena. Applications are to a typical inlet diffuser configuration at Mach 3.0 with excessive back pressure inducing inlet unstart.

Benson, Rusty A.↗

DOE OSTI2024

Dimensionally Aligned Signal Projection Algorithms Library

Dimensionally aligned signal projection (DASP) algorithms are used to analyze fast Fourier transforms (FFTs) and generate visualizations that help focus on the harmonics for specific signals. At a high level, these algorithms extract the FFT segments around each harmonic frequency center, and then align them in equally sized arrays ordered by increasing distance from the base frequency. This allows for a focused view of the harmonic frequencies, which, among other use cases, can enable machine learning algorithms to more easily identify salient patterns. This work seeks to provide an effective open-source implementation of the DASP algorithms proposed by Vann et al. (2018) as well as functionality to help explore and test how these algorithms work with an interactive dashboard and signal-generation tool. The DASP library is implemented in Python and contains four types of algorithms for implementing these feature engineering techniques: fixed harmonically aligned signal projection (HASP), decimating HASP, interpolating HASP, and frequency aligned signal projection (FASP). Each algorithm returns a numerical array, which can be visualized as an image. The HASP algorithms are variations of the algorithms originally presented by Vann et al. (2018). For consistency, FASP, which is the terminology used for the short-time Fourier transform (STFT), has been implemented as part of the library to provide a similar interface to the STFT of the raw signal. Additionally, the library contains an algorithm to generate artificial signals with basic customizations such as the base frequency, sample rate, duration, number of harmonics, noise, and number of signals. Finally, the library provides multiple interactive visualizations, each of which is implemented using IPyWidgets and works in a Jupyter environment. A dashboard-style visualization is provided, which contains some common signal-processing visual components (signal, FFT, spectogram) updating in unison with the HASP functions (see Figure 1 below). Separate from the dashboard, an independent visualization is provided for each of the DASP algorithms as well as for the artifical signal generator. These visualizations are included in the library to aid in developing an intuitive understanding how the algorithms are affected by different input signals and parameter selections.

harmonics↗

NASA NTRS1989

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

NASA NTRS2004

Investigation of the Seasonal Freeze/Thaw Cycle of Soils in the GAPP Regions

The objective of this project is to understand the current and future impacts and feedbacks of seasonally frozen ground on the regional and global climate system and the ecosystem as a whole. More specifically, we proposed to: investigate the dynamics of the seasonally freezing and thawing processes and their relations to current climatic conditions through in situ data analysis and numerical modeling; develop a comprehensive algorithm to detect surface soil freeze/thaw status for snow-free land surface using passive microwave remote sensing data and for snow-covered land surface using numerical modeling, and validate the algorithm and numerical model using available ground-based measurements; investigate seasonal and inter-annual variations of frozen soils in the GAPP regions using data generated from the new validated algorithm and their relations to the environmental factors such as air temperature, snow cover, surface morphology, soil type and soil moisture; generate a frozen soil data set which describes the timing, duration, thickness, and area extent of seasonally frozen ground for the period from 1978 to present. The proposed research will be accomplished through data analysis, remote sensing, and numerical modeling.

FREEZE-THAW TESTS↗

NASA NTRS1989

Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information

For optimization problems associated with engineering design, parameter estimation, image reconstruction, and other optimization/simulation applications, low accuracy function and gradient values are frequently much less expensive to obtain than high accuracy values. Here, researchers investigate the computational performance of trust region methods for nonlinear optimization when high accuracy evaluations are unavailable or prohibitively expensive, and confirm earlier theoretical predictions when the algorithm is convergent even with relative gradient errors of 0.5 or more. The proper choice of the amount of accuracy to use in function and gradient evaluations can result in orders-of-magnitude savings in computational cost.

Carter, Richard G.↗

NASA NTRS1991

Parallel algorithms for placement and routing in VLSI design

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Brouwer, Randall Jay↗

NASA NTRS1999

Long-Time Numerical Integration of the Three-Dimensional Wave Equation in the Vicinity of a Moving Source

We propose a family of algorithms for solving numerically a Cauchy problem for the three-dimensional wave equation. The sources that drive the equation (i.e., the right-hand side) are compactly supported in space for any given time; they, however, may actually move in space with a subsonic speed. The solution is calculated inside a finite domain (e.g., sphere) that also moves with a subsonic speed and always contains the support of the right-hand side. The algorithms employ a standard consistent and stable explicit finite-difference scheme for the wave equation. They allow one to calculate tile solution for arbitrarily long time intervals without error accumulation and with the fixed non-growing amount of tile CPU time and memory required for advancing one time step. The algorithms are inherently three-dimensional; they rely on the presence of lacunae in the solutions of the wave equation in oddly dimensional spaces. The methodology presented in the paper is, in fact, a building block for constructing the nonlocal highly accurate unsteady artificial boundary conditions to be used for the numerical simulation of waves propagating with finite speed over unbounded domains.

Ryabenkii, V. S.↗

NASA NTRS1990

Numerical solution of the incompressible Navier-Stokes equations

The current work is initiated in an effort to obtain an efficient, accurate, and robust algorithm for the numerical solution of the incompressible Navier-Stokes equations in two- and three-dimensional generalized curvilinear coordinates for both steady-state and time-dependent flow problems. This is accomplished with the use of the method of artificial compressibility and a high-order flux-difference splitting technique for the differencing of the convective terms. Time accuracy is obtained in the numerical solutions by subiterating the equations in psuedo-time for each physical time step. The system of equations is solved with a line-relaxation scheme which allows the use of very large pseudo-time steps leading to fast convergence for steady-state problems as well as for the subiterations of time-dependent problems. Numerous laminar test flow problems are computed and presented with a comparison against analytically known solutions or experimental results. These include the flow in a driven cavity, the flow over a backward-facing step, the steady and unsteady flow over a circular cylinder, flow over an oscillating plate, flow through a one-dimensional inviscid channel with oscillating back pressure, the steady-state flow through a square duct with a 90 degree bend, and the flow through an artificial heart configuration with moving boundaries. An adequate comparison with the analytical or experimental results is obtained in all cases. Numerical comparisons of the upwind differencing with central differencing plus artificial dissipation indicates that the upwind differencing provides a much more robust algorithm, which requires significantly less computing time. The time-dependent problems require on the order of 10 to 20 subiterations, indicating that the elliptical nature of the problem does require a substantial amount of computing effort.

Rogers, Stuart E.↗

NASA NTRS1992

Numerical analysis of a thermal deicer

An algorithm has been developed to numerically model the concurrent phenomena of two-dimensional transient heat transfer, ice accretion and ice shedding which arise from the use of an electrothermal pad. The Alternating Direction Implicit method is used to simultaneously solve the heat transfer and accretion equations occurring in a multilayered body covered with ice. In order to model the phase change between ice and water, a technique was used which assumes a phase for each node. This allows the equations to be linearized such that a direct solution is possible. This technique requires an iterative procedure to find the correct phase at each node. The computer program developed to find this solution has been integrated with the NASA/Lewis flow/trajectory code LEWICE.

Wright, W. B.↗

DOE OSTI2026

ReMU: regional minimal updating for model-based derivative-free optimization

Derivative-free optimization (DFO) problems are optimization problems where derivative information is unavailable or extremely difficult to obtain. Model-based DFO solvers have been applied extensively in scientific computing. Powell's NEWUOA (2004) [Powell, The NEWUOA software for unconstrained optimization without derivatives, in Large-Scale Nonlinear Optimization, Nonconvex Optimization and its Applications Vol. 83, G. Di Pillo and M. Roma, eds., Springer, 2006, pp. 255–297] and Wild's POUNDerS (2014) [Wild, Solving derivative-free nonlinear least squares problems with POUNDERS, in Advances and Trends in Optimization with Engineering Applications, T. Terlaky, M.F. Anjos, and S. Ahmed, eds., SIAM, 2017, pp. 529–540] explore the numerical power of the minimal norm Hessian (MNH) model for DFO and contributed to the open discussion on building better models with fewer data to achieve faster numerical convergence. Another decade later, we propose the regional minimal updating (ReMU) models, and extend the previous models into a broader class, including the H 2 norm models [Xie and Yuan, Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms, IMA J. Numer. Anal. 46 (2025), pp. 21–50]. This paper shows motivation behind ReMU models, computational details, theoretical and numerical results on particular extreme points and the barycentre of ReMU's weight coefficient region, and the associated KKT matrix error and distance. Novel metrics, such as the truncated Newton step error, are proposed to numerically understand the new models' properties. A new algorithmic strategy, based on iteratively adjusting the ReMU model type, is also proposed, and shows numerical advantages by combining and switching between the barycentric model and the classic least Frobenius norm model in an online fashion.

derivative-free trust-region methods↗

NASA NTRS1990

Large scale nonlinear numerical optimal control for finite element models of flexible structures

This paper discusses the development of large scale numerical optimal control algorithms for nonlinear systems and their application to finite element models of structures. This work is based on our expansion of the optimal control algorithm (DDP) in the following steps: improvement of convergence for initial policies in non-convex regions, development of a numerically accurate penalty function method approach for constrained DDP problems, and parallel processing on supercomputers. The expanded constrained DDP algorithm was applied to the control of a four-bay, two dimensional truss with 12 soft members, which generates geometric nonlinearities. Using an explicit finite element model to describe the structural system requires 32 state variables and 10,000 time steps. Our numerical results indicate that for constrained or unconstrained structural problems with nonlinear dynamics, the results obtained by our expanded constrained DDP are significantly better than those obtained using linear-quadratic feedback control.

Shoemaker, Christine A.↗

NASA NTRS1990

A numerical method for prediction of compressible turbulent flows with closure models

A new computer code to solve the time averaged Navier-Stokes equations is developed. Many of the state-of-the-art numerical techniques and algorithms have been tested and implemented in the program in order to achieve a better numerical accuracy and code efficiency. Various turbulence models are tested for a wide range of flows. The initial focus has been on two-equation eddy-viscosity models, which are the most advanced available in current compressible flow codes. The long term goal will be to test Reynolds-Stress models and to explore their performance in the high Mach number range. Although testing and improvement of turbulence models for supersonic and hypersonic flows is the primary objective of this research, part of the effort has been devoted to analyzing the vortex breakdown phenomena using new computer programs. Some preliminary results on the breakdown of a vortex flow in a tube are reported. Present calculations are restricted to two dimensional flow geometry.

Huang, P. G.↗