Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 451 records · Page 25

Fully Threaded Tree for Adaptive Refinement Fluid Dynamics Simulations

A fully threaded tree (FTT) for adaptive refinement of regular meshes is described. By using a tree threaded at all levels, tree traversals for finding nearest neighbors are avoided. All operations on a tree including tree modifications are O(N), where N is a number of cells, and are performed in parallel. An efficient implementation of the tree is described that requires 2N words of memory. A filtering algorithm for removing high frequency noise during mesh refinement is described. A FTT can be used in various numerical applications. In this paper, it is applied to the integration of the Euler equations of fluid dynamics. An adaptive mesh time stepping algorithm is described in which different time steps are used at different l evels of the tree. Time stepping and mesh refinement are interleaved to avoid extensive buffer layers of fine mesh which were otherwise required ahead of moving shocks. Test examples are presented, and the FTT performance is evaluated. The three dimensional simulation of the interaction of a shock wave and a spherical bubble is carried out that shows the development of azimuthal perturbations on the bubble surface.

FINITE ELEMENT ANALYSIS↗

Comparison of exponential integrators and traditional time integration schemes for the shallow water equations

We report the time integration scheme is probably one of the most fundamental choices in the development of an ocean model. In this paper, we investigate several time integration schemes when applied to the shallow water equations. This set of equations is accurate enough for the modeling of a shallow ocean and is also relevant to study as it is the one solved for the barotropic (i.e. vertically averaged) component of a three dimensional ocean model. We analyze different time stepping algorithms for the linearized shallow water equations. High order explicit schemes are accurate but the time step is constrained by the Courant-Friedrichs-Lewy stability condition. Implicit schemes can be unconditionally stable but, in practice lack accuracy when used with large time steps. In this paper we propose a detailed comparison of such classical schemes with exponential integrators. The accuracy and the computational costs are analyzed in different configurations.

97 MATHEMATICS AND COMPUTING↗

Vacuum vessel design with lofted toroidal surfaces for a QHS configuration

A vacuum vessel in between the hot plasma and the magnetic coils is crucial for a fusion reactor. In this study, a tool is presented to perform the initial design of such a vessel automatically. Starting from the last closed flux surface, an algorithm is developed which lofts this manifold out as much as possible. At the same time, the algorithm makes sure that no intersection with the coils takes place. In the presented work, this algorithm is applied to the HSX stellarator and it has been verified that the resulting vessel wall can be built from an engineering perspective. Using field line tracing, the strikepoints on the vessel wall indicate the initial locations for a divertor.

HSX↗

Combining Iteration-Free Polarization with Large Time Step Stochastic-Isokinetic Integration

In order to accelerate molecular dynamics simulations using polarizable force fields, we combine a new extended Lagrangian approach that eliminates the self-consistent field step (iEL/0-SCF) with a stochastic integration scheme that allows for a long time step using a multiple time scale algorithm (SIN(R)). We consider different algorithms for the combined scheme that places different components of the nonbonded forces into different time scales, as well as splitting individual nonbonded forces across time scales, to demonstrate that the combined method works well for bulk water as well as for a concentrated salt solution, aqueous peptide, and solvated protein. Depending on system and desired accuracy, the iEL/0-SCF and SIN(R) combination yields lower bound computational speed-ups of ~6–8 relative to a molecular dynamics Verlet integration using a standard SCF solver implemented in the reference program TINKER 8.1. Finally, the combined approach embodies a significant advance for equilibrium simulations in the canonical ensemble of many-body potential energy surfaces for condensed phase systems with speed-ups that exceed what is possible by either method alone.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SPADES (Scalable Parallel Discrete Events Simulation) [SWR-24-99]

SPADES (Solver for PArallel Discrete Event Simulation) is an open-source parallel discrete event simulation (PDES) package built on the AMReX library. Targeted at solving discrete event systems in parallel, this software package aims to be performance portable and scalable on heterogeneous computing architectures, e.g., graphic processing units (GPU). SPADES implements optimistic synchronization with rollback through an implementation of the Time Warp algorithm. An alternative conservative synchronization approach is also implemented using the Lower Bound on Incoming Time Stamp. In our implementation, logical processes are represented as cells in a grid and event messages are represented as particles. SPADES supports various parallel decomposition strategies, including the use of the Message Passing Interface (MPI) and OpenMP threading. All major GPU architectures (e.g., Intel, AMD, NVIDIA) are supported through the use of performance portability functionalities implemented in AMReX. The SPADES software is released in NREL Software Record SWR-24-99 “SPADES (Scalable Parallel Discrete Events Simulation)”.

Henry de Frahan, Marc [National Renewable Energy L↗

Adaptive Time Stepping for Transient Network Flow Simulation in Rocket Propulsion Systems

Fluid and thermal transients found in rocket propulsion systems such as propellant feedline system is a complex process involving fast phases followed by slow phases. Therefore their time accurate computation requires use of short time step initially followed by the use of much larger time step. Yet there are instances that involve fast-slow-fast phases. In this paper, we present a feedback control based adaptive time stepping algorithm, and discuss its use in network flow simulation of fluid and thermal transients. The time step is automatically controlled during the simulation by monitoring changes in certain key variables and by feedback. In order to demonstrate the viability of time adaptivity for engineering problems, we applied it to simulate water hammer and cryogenic chill down in pipelines. Our comparison and validation demonstrate the accuracy and efficiency of this adaptive strategy.

Majumdar, Alok K.↗

A compensatory algorithm for the slow-down effect on constant-time-separation approaches

In seeking methods to improve airport capacity, the question arose as to whether an electronic display could provide information which would enable the pilot to be responsible for self-separation under instrument conditions to allow for the practical implementation of reduced separation, multiple glide path approaches. A time based, closed loop algorithm was developed and simulator validated for in-trail (one aircraft behind the other) approach and landing. The algorithm was designed to reduce the effects of approach speed reduction prior to landing for the trailing aircraft as well as the dispersion of the interarrival times. The operational task for the validation was an instrument approach to landing while following a single lead aircraft on the same approach path. The desired landing separation was 60 seconds for these approaches. An open loop algorithm, previously developed, was used as a basis for comparison. The results showed that relative to the open loop algorithm, the closed loop one could theoretically provide for a 6 pct. increase in runway throughput. Also, the use of the closed loop algorithm did not affect the path tracking performance and pilot comments indicated that the guidance from the closed loop algorithm would be acceptable from an operational standpoint. From these results, it is concluded that by using a time based, closed loop spacing algorithm, precise interarrival time intervals may be achievable with operationally acceptable pilot workload.

Abbott, Terence S.↗

A parallel algorithm for switch-level timing simulation on a hypercube multiprocessor

The parallel approach to speeding up simulation is studied, specifically the simulation of digital LSI MOS circuitry on the Intel iPSC/2 hypercube. The simulation algorithm is based on RSIM, an event driven switch-level simulator that incorporates a linear transistor model for simulating digital MOS circuits. Parallel processing techniques based on the concepts of Virtual Time and rollback are utilized so that portions of the circuit may be simulated on separate processors, in parallel for as large an increase in speed as possible. A partitioning algorithm is also developed in order to subdivide the circuit for parallel processing.

Rao, Hariprasad Nannapaneni↗

UWB Tracking System Design for Free-Flyers

This paper discusses an ultra-wideband (UWB) tracking system design effort for Mini-AERCam (Autonomous Extra-vehicular Robotic Camera), a free-flying video camera system under development at NASA Johnson Space Center for aid in surveillance around the International Space Station (ISS). UWB technology is exploited to implement the tracking system due to its properties, such as high data rate, fine time resolution, and low power spectral density. A system design using commercially available UWB products is proposed. A tracking algorithm TDOA (Time Difference of Arrival) that operates cooperatively with the UWB system is developed in this research effort. Matlab simulations show that the tracking algorithm can achieve fine tracking resolution with low noise TDOA data. Lab experiments demonstrate the UWB tracking capability with fine resolution.

Ni, Jianjun↗

The Genesis Solar Wind Sample Return Mission

The Genesis spacecraft was launched on August 8 from Cape Canaveral on a journey to become the first spacecraft to return from interplanetary space. The fifth in NASA's line of low-cost Discovery-class missions, its goal is to collect samples of solar wind and return them to Earth for detailed isotopic and elemental analysis. The spacecraft is to collect solar wind for over two years, while circling the L1 point 1.5 million km sunward of the earth, before heading back for a capsule-style re-entry in September, 2004. After parachute deployment, a mid-air helicopter recovery will be used to avoid a hard landing. The mission has been in the planning stages for over ten years. Its cost, including development, mission operations, and sample analysis, is approximately $209M. The Genesis science team, headed by principal investigator Donald Burnett of Caltech, consists of approximately 20 co-investigators from universities and science centers around the country and internationally. The spacecraft consists of a relatively flat spacecraft bus containing most of the subsystem components, situated below a sample return capsule (SRC) which holds the solar-wind collection substrates and an electrostatic solar wind concentrator. Some of the collectors are exposed throughout the collection period, for a sample of bulk solar wind, while others are exposed only to certain solar wind regimes, or types of flow. Ion and electron spectrometers feed raw data to the spacecraft control and data-handling (C&DH) unit, which determines ion moments and electron flux geometries in real time. An algorithm is used to robotically decide between interstream (IS), coronal hole (CH), and coronal mass ejection (CME) regimes, and to control deployment of the proper arrays to sample these wind regimes independently. This is the first time such a solar-wind decision algorithm has been used on board a spacecraft.

Wiens, Roger C.↗

Accuracy and stability of time-split finite-difference schemes

In a recently published work by Abarbanel and Gottlieb (1980), a new class of explicit time-split algorithms designed for application to the compressible Navier-Stokes equations was developed. These algorithms, which utilize locally-one-dimensional (LOD) spatial steps, were shown to possess stability characteristics superior to those of other time-split schemes. In the present work, the properties of an implicit LOD method, analogous to the Abarbanel-Gottlieb algorithm, are examined using the two-dimensional heat conduction equation as the test problem. Both temporal and spatial inconsistencies inherent in the scheme are identified, and a new consistent, implicit splitting approach is developed and applied to the linear Burgers' equation. The relationship between this new method and other time-split implicit schemes is explained and stability problems encountered with the method in three dimensions are discussed.

Dwoyer, D. L.↗

Algorithm advances and applications of time‐dependent first‐principles simulations for ultrafast dynamics

Abstract Far from equilibrium phenomenon is a central theme of contemporary material research. Such phenomenon can exhibit itself in atomic structure and dynamics, but very often it also happens as non‐equilibrium phenomenon in the electronic structure. In ab initio material simulation, density functional theory (DFT) has played an essential role in studying electronic ground state problems. For excited states, besides many‐body perturbation theory, another powerful tool is the time dependent DFT (TDDFT) method. In particular, the real‐time TDDFT (rt‐TDDFT) method can be used to simulate many non‐equilibrium phenomena directly. Here we introduce our works on some algorithm advances based on our recently rt‐TDDFT method. This method uses the plane‐wave basis set, and significantly accelerates its efficiency by increasing the time step from 0.1–1 as in traditional methods to 0.2–0.5 fs. The noncollinear magnetic moments and spin–orbit coupling have also been included in our rt‐TDDFT method. Furthermore, a Boltzmann‐TDDFT algorithm has been developed to solve the hot carrier overheating problem in Ehrenfest dynamics, and a natural orbital branching algorithm has been developed to overcome the mean‐field approximation in Ehrenfest dynamics nuclear trajectory, thus allows stochastic multiple paths in chemical reactions. Utilizing these methods, we have studied the photoinduced ultrafast demagnetization, ultrafast phase transition, energy transfer between plasmon and hot carriers, as well as the high‐energy ion implantation and low‐energy atomic diffusion in semiconductors. We believe the tools as the ones introduced here can enable us to study a wide range of phenomena which are of great interest in modern day material research. This article is categorized under: Structure and Mechanism > Computational Materials Science Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory

Liu, Wen‐Hao↗

Grain boundary effects in high-temperature liquid-metal dealloying: a multi-phase field study

Abstract A multi-phase field model is employed to study the microstructural evolution of an alloy undergoing liquid dealloying, specifically considering the role of grain boundaries. A semi-implicit time-stepping algorithm using spectral methods is implemented, which enables simulating large 2D and 3D domains over long time scales while still maintaining a realistic interfacial thickness. Simulations reveal a mechanism of coupled grain–boundary migration to maintain equilibrium contact angles with the topologically complex solid–liquid interface, which locally accelerates diffusion-coupled growth of a liquid channel into the precursor. This mechanism asymmetrically disrupts the ligament connectivity of the dealloyed structure in qualitative agreement with published experimental observations. The grain boundary migration-assisted corrosion channels form even for precursors with small amounts of the dissolving alloy species, below the parting limit . The activation of this grain boundary dealloying mechanism depends strongly on grain boundary mobility.

36 MATERIALS SCIENCE↗

Implementation of variable time step stochastic dynamics for electronically inelastic gas-surface collisions

A variable time step algorithm has been implemented for solving the stochastic equations of motion for gas-surface collisions. It has been tested for a simple model of electronically inelastic collisions with an insulator surface in which the phonon manifold acts as a heat bath and electronic states are localized. In addition to reproducing the accurate nuclear dynamics of the surface atoms, numerical calculations have shown the algorithm to yield accurate ensemble averages of physical observables such as electronic transition probabilities and total energy loss of the gas atom to the surface. This new algorithm offers a gain in efficieny of up to an order of magnitude compared to fixed time step integration.

Garrett, Bruce C.↗

Evaluation of Boundary Conditions for the Gust-Cascade Problem

Using a high-order accuracy finite-difference time-domain algorithm, the acoustic scattering from a flat-plate cascade is computed. Keeping the grid and time step fixed, the effect of four different boundary conditions on the accuracy and stability of the computed solution is compared.

Hixon, R.↗

A Computational Fluid Dynamics Algorithm on a Massively Parallel Computer

The discipline of computational fluid dynamics is demanding ever-increasing computational power to deal with complex fluid flow problems. We investigate the performance of a finite-difference computational fluid dynamics algorithm on a massively parallel computer, the Connection Machine. Of special interest is an implicit time-stepping algorithm; to obtain maximum performance from the Connection Machine, it is necessary to use a nonstandard algorithm to solve the linear systems that arise in the implicit algorithm. We find that the Connection Machine ran achieve very high computation rates on both explicit and implicit algorithms. The performance of the Connection Machine puts it in the same class as today's most powerful conventional supercomputers.

Jespersen, Dennis C.↗

A Kriging Surrogate Model for Computing Gas Mixture Equations of State

Accurate simulation of the complex flow following the detonation of an explosive material is a challenging problem. In these flows, the detonation products of the explosive must be treated as a real gas while the surrounding air is treated as an ideal gas. As the detonation process unfolds and the blast wave moves into the surrounding ambient air, the products of detonation expand outward and interact with the air creating a mixture region. In this region, both of the state equations for air and the products must be satisfied. One of the most accurate, yet computationally expensive, methods to handle this problem is an algorithm that iterates between the equations of state until both pressure and temperature reach an equilibrium inside of a computational cell. Since this mixture region moves and grows over time, this algorithm must be performed millions, or even billions, of times in a typical detonation simulation. As such, these calculations can account for a large percentage of the overall solution time. This work aims to use a kriging surrogate model to replace this process. The iterative method solves a nonlinear system of equations created from the gas mixture density, internal energy, and composition using a Broyden iterative solver to obtain an output pressure and temperature. Kriging is used to produce curve fits which interpolate selected pressures and temperatures from this solver from appropriate ranges of the mixture input quantities. Using a finite volume hydrocode, the performance of the model with respect to the iterative solver is demonstrated in the simulation of a pentaerythritol tetranitrate (PETN) charge detonation. The model's computational speed and accuracy are quantified as a function of the choice of sampling points in order to try optimize the combination as well as to show the benefits of this novel approach.

Engineering↗