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.

SourceResearch connectionFrom yearThrough year

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

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2024

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

Causal explicit algorithm for heat conduction in a plasma

Hyperbolic heat conduction extends standard Spitzer-Harm heat conduction by including a term proportional to the time derivative of the heat flux. The new term arises from a kinetic derivation of the heat flux that includes higher order corrections. Here we present a causal explicit numerical algorithm for solving the nonlinear hyperbolic heat conduction equation in an unmagnetized plasma. The maximum stable timestep for the causal explicit algorithm scales linearly with the cell size, owing to the hyperbolic nature of the problem. This is in contrast to the quadratic scaling of the maximum stable timestep with the cell size for the parabolic forward time centered space algorithm. The favorable scaling of the timestep with the cell size enables a practical explicit implementation of heat conduction in high-performance massively parallel plasma codes. In particular, we have implemented the causal explicit algorithm in the laser plasma interaction code pF3D. We verify the CE algorithm and analyze its convergence rate by simulating a harmonic mode, which has an analytic solution within the context of the HHC model. We also compare simulations using the CE algorithm to those using the forward time centered space algorithm on a pair of test problems: evolution in time of a Gaussian temperature perturbation in a uniform plasma and heat transport in the presence of inverse bremsstrahlung heating by a Gaussian laser speckle.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1982

Numerical simulation of viscous-inviscid interactions on indented nose tips

An implicit numerical algorithm to solve the unsteady thin-layer Navier-Stokes equations in a strong conservative form has been used to compute the viscous flow over indented nose tips placed in a supersonic free stream. Numerical solutions are presented for axisymmetric and three-dimensional indented configurations for laminar flow conditions. Results demonstrate the capability of the present numerical procedure to predict flow fields that contain strong viscous-inviscid interactions, including boundary-layer separation, reattachment, and embedded discontinuities. Comparisons with available experimental data for the shock shape and surface pressure are also given.

Rizk, Y. M.↗

NASA NTRS1995

A Parallel Incompressible Navier-Stokes Solver With a Parallel Multigrid Elliptic Kernal

The paper describes numerical algorithms and parallel implementations of a time-dependent, incompressible Navier-Stokes flow solver and a multigrid elliptic solver, which is also used as a computation kernal in the flow solver. The implemented solvers are numerically stable and computationally efficient, and they scale well to a large number of processors for problems with moderate granularity.

solver Navier-Stokes solver multigrid elliptic sol↗

NASA NTRS1991

Minimum jerk trajectory planning for robotic manipulators

It has been experimentally verified that the jerk of the desired trajectory adversely affects the performance of the tracking control algorithms for robotic manipulators. In this paper, the reasons behind this effect are investigated, and an optimization problem that minimizes joint jerk over a prespecified Cartesian space trajectory is stated. The necessary conditions are derived, and a numerical algorithm is presented.

Kyriakopoulos, K. J.↗

NASA NTRS1994

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗

NASA NTRS1979

Simulation of three-dimensional compressible viscous flow on the Illiac IV computer

Complicated three-dimensional viscous transonic flows about bodies at high angles of attack are solved on the Illiac IV computer. It is shown that certain approximate forms of the compressible Reynolds-averaged Navier-Stokes equations can be computed about realistic three-dimensional geometries with relative ease on the Illiac IV. The ease and efficiency with which this can be done depend on the approximations made in the basic equations, the choice of the numerical algorithm used for the solution, and the data-base system that controls the data management and identifies and manipulates the vectors. A pencil data-base system is found to be particularly suitable for the approximations and numerical method chosen to produce the results presented. In addition, some comparisons are made of computer predictions with experimental results for various lows about hemisphere-cylinders in both subsonic and supersonic free streams. The same viscous model and numerical model are used, showing good qualitative agreement in the location of separation lines and pressure distributions.

Pulliam, T. H.↗

NASA NTRS1980

Numerical method for predicting flow characteristics and performance of nonaxisymmetric nozzles. Part 2: Applications

A computer implemented numerical method for predicting the flow in and about an isolated three dimensional jet exhaust nozzle is summarized. The approach is based on an implicit numerical method to solve the unsteady Navier-Stokes equations in a boundary conforming curvilinear coordinate system. Recent improvements to the original numerical algorithm are summarized. Equations are given for evaluating nozzle thrust and discharge coefficient in terms of computed flowfield data. The final formulation of models that are used to simulate flow turbulence effect is presented. Results are presented from numerical experiments to explore the effect of various quantities on the rate of convergence to steady state and on the final flowfield solution. Detailed flowfield predictions for several two and three dimensional nozzle configurations are presented and compared with wind tunnel experimental data.

Thomas, P. D.↗

NASA NTRS1990

Application of a finite element algorithm for high speed viscous flows using structured and unstructured meshes

A higher-order streamline upwinding Petrov-Galerkin finite element method is employed for high speed viscous flow analysis using structured and unstructured meshes. For a Mach 8.03 shock interference problem, successive mesh adaptation was performed using an adaptive remeshing method. Results from the finite element algorithm compare well with both experimental data and results from an upwind cell-centered method. Finite element results for a Mach 14.1 flow over a 24 degree compression corner compare well with experimental data and two other numerical algorithms for both structured and unstructured meshes.

Vemaganti, Gururaja R.↗

NASA NTRS1981

A PANSONIC Navier-Stokes solver

A finite-difference formulation of the full Navier-Stokes equations which demonstrates a capability to economically solve two-dimensional problems has been developed. The basic algorithm was derived from the full, Reynolds-averaged, conservative, Navier-Stokes equations expressed in curvilinear coordinates. Eddy viscosity was determined by the Baldwin and Lomax algebraic turbulence model. This non-iterative, second-order accurate, implicit, numerical algorithm is based on the approximate factorization finite-difference scheme of Beam and Warming. Results indicate a facility for solving subsonic, transonic, and supersonic (hence PANSONIC) flows about arbitrary airfoils for a wide range of Reynolds numbers, Mach numbers, and angles of attack. Current computations demonstrate that vectorized implementations of this algorithm can solve steady-state, two-dimensional problems in five to ten minutes of computer time.

Cooper, G. K.↗

NASA NTRS1998

Algorithms and Libraries

This exploratory study initiated our inquiry into algorithms and applications that would benefit by latency tolerant approach to algorithm building, including the construction of new algorithms where appropriate. In a multithreaded execution, when a processor reaches a point where remote memory access is necessary, the request is sent out on the network and a context--switch occurs to a new thread of computation. This effectively masks a long and unpredictable latency due to remote loads, thereby providing tolerance to remote access latency. We began to develop standards to profile various algorithm and application parameters, such as the degree of parallelism, granularity, precision, instruction set mix, interprocessor communication, latency etc. These tools will continue to develop and evolve as the Information Power Grid environment matures. To provide a richer context for this research, the project also focused on issues of fault-tolerance and computation migration of numerical algorithms and software. During the initial phase we tried to increase our understanding of the bottlenecks in single processor performance. Our work began by developing an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. Based on the results we achieved in this study we are planning to study other architectures of interest, including development of cost models, and developing code generators appropriate to these architectures.

Dongarra, Jack↗

NASA NTRSDate not supplied

Algorithm Stability and the Long-Term Geospace Data Record from TIMED/SABER

The ability of satellite instruments to accurately observe long-term changes in atmospheric temperature depends on many factors including the absolute accuracy of the measurement, the stability of the calibration of the instrument, the stability of the satellite orbit, and the stability of the numerical algorithm that produces the temperature data. We present an example of algorithm instability recently discovered in the temperature dataset from the SABER instrument on the NASA TIMED satellite. The instability resulted in derived temperatures that were substantially colder than anticipated from mid-December 2019 to mid-2022. This algorithm-induced change in temperature over one to two years corresponded to the expected change over several decades from increasing anthropogenic CO2. This paper highlights the importance of algorithm stability in developing Geospace Data Records (GDRs) for Earth’s mesosphere and lower thermosphere. A corrected version (Version 2.08) of the temperatures from SABER is described.

M G Mlynczak↗

NASA NTRS1988

A 3D-PNS computer code for the calculation of supersonic combusting flows

A computer code has been developed based on the three-dimensional parabolized Navier-Stokes (PNS) equations which govern the supersonic combusting flow of the hydrogen-air system. The finite difference algorithm employed was a hybrid of the Schiff-Steger algorithm and the Vigneron, et al., algorithm which is fully implicit and fully coupled. The combustion of hydrogen and air was modeled by the finite-rate two-step combustion model of Rogers-Chinitz. A new dependent variable vector was introduced to simplify the numerical algorithm. Robustness of the algorithm was considerably enhanced by introducing an adjustable parameter. The computer code was used to solve a premixed shock-induced combustion problem and the results were compared with those of a full Navier-Stokes code. Reasonably good agreement was obtained at a fraction of the cost of the full Navier-Stokes procedure.

Chitsomboon, Tawit↗

NASA NTRS2001

Computation of Reacting Flows in Combustion Processes

The objective of this research is to develop an efficient numerical algorithm with unstructured grids for the computation of three-dimensional chemical reacting flows that are known to occur in combustion components of propulsion systems. During the grant period (1996 to 1999), two companion codes have been developed and various numerical and physical models were implemented into the two codes.

Keith, Theo G., Jr.↗

DOE OSTI2023

Neural Networks-Based Inverter Control: Modeling and Adaptive Optimization for Smart Distribution Networks

The optimal voltage control of inverter-based resources, especially under the high penetration of solar photovoltaics, is critical to the stability of the distribution power system. However, the computational complexity as well as the coordinated operation performance of the voltage control optimization in the distribution power system limits the real-time applications. To mitigate this issue, a model-free based adaptive optimal control scheme for the smart inverter is proposed to maximize the active power generation, minimize the power loss, and maintain the bus voltages in smart distribution networks. An inverter-based optimization model for coordinated operation is first established, considering the uncertainties of renewable power generation. Subsequently, by collecting the data and control strategies, the neural networks (NNs) based algorithm is proposed to efficiently predict the best possible control strategy. The main objective of this scheme is to accurately predict candidate optimal solutions with near-negligible feasibility and optimization gaps, with the advantage of avoiding complicated iteration-based numerical algorithms. Thereafter, the co-simulation among OpenDSS, MATLAB, and Python is set up to fully take advantage of the three individual software. Experiments are conducted based on different control parameter characteristics and structures of NNs. Finally, the results reveal that an average mean squared error of 0.013 and 1 ms response time are achieved, which is lower than some state-of-the-art methods.

42 ENGINEERING↗

NASA NTRS1994

Modeling composite and fluffy grains: The effects of porosity

Recent studies of interplanetary and interstellar dust provide evidence that cosmic dust grains are fluffy, composite objects, highlighting the need for models of the electromagnetic scattering by these grains. Effective medium theory (EMT) with Mie-type series solutions has been used to explore the effects of porosity which would be important in composite dust particles. While this indirect approach is both flexible and computationally efficient, it is not necessarily a good approximation. The need for EMT and its rather restrictive assumptions may be circumvented through a direct computation of the scattering properties via finite element methods, such as the discrete dipole approximation (DDA). Recently, the utility of the DDA method has been advanced significantly through improvements in theory, in numerical algorithms, and in computer hardware. Extensive calculations with the DDA method are used here to examine more directly the effects of porosity. A particular emphasis is placed upon developing a valid methodology. For both solid and porous targets we establish both numerical and physical convergence properties over the range of size parameter that is required for our study. DDA cross sections for grains with a range of porosity are compared to those computed by the EMT/series expansion technique to examine the applicability of several mixing rules, including two extensions of the Bruggeman rule. We show that for particles with Rayleigh vacuum inclusions, the extension proposed by Rouleau & Martin is quite successful. We also investigate the effects of larger, non-Rayleigh vacuum inclusions for various levels of porosity and find that they can be significant.

Wolff, Michael J.↗

DOE OSTI2025

Euler equations and the Sod shock tube problem

The Euler equations are a subset of the magnetohydrodynamic (MHD) equations in the infinitely collisional, unmagnetized limit. MHD modeling is central to many areas of plasma physics, ranging from low-temperature glow discharges to inertial confinement fusion. An important aspect of the Euler equations is their ability to describe states with discontinuities, such as shock waves. A standard benchmark test for numerical implementation of the Euler equations is the Sod shock tube. In this test, the system is initialized at rest with a pressure and density discontinuity, which results in a shock wave traveling into the low-pressure region and a rarefaction wave traveling into the high-pressure region. Starting with the presentation of the Euler equations, a numerical algorithm is presented here to solve these equations in one dimension. This is followed by an overview of the Sod shock tube problem that includes the precise initial setup and the analytic solution. Finally, the analytic solution is compared with results from numerical simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1986

A space-marching method for viscous incompressible internal flows

A numerical algorithm for calculating steady subsonic two-dimensional incompressible channel flows in ducts is developed and extended to three-dimensional flows. A space-marching method similar to that developed by Schiff and Steger (1980) for supersonic flows is applied, and numerical results for developing laminar flows in a two-dimensional channel, in a straight square duct, and in a mildly curved square duct are presented graphically. Good agreement with experimental data and analytical results is found.

Pouagare, M.↗