SEARCH · Search NASA

Results for “multiple time stepping”

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 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1982

Formulation of an explicit-multiple-time-step time integration method for use in a global primitive equation grid model

With appropriate modifications, a recently proposed explicit-multiple-time-step scheme (EMTSS) is incorporated into the UCLA model. In this scheme, the linearized terms in the governing equations that generate the gravity waves are split into different vertical modes. Each mode is integrated with an optimal time step, and at periodic intervals these modes are recombined. The other terms are integrated with a time step dictated by the CFL condition for low-frequency waves. This large time step requires a special modification of the advective terms in the polar region to maintain stability. Test runs for 72 h show that EMTSS is a stable, efficient and accurate scheme.

Chao, W. C.↗

NASA NTRSDate not supplied

A multiple-grid-time-step lattice Boltzmann method for transport phenomena with dissimilar time scales: Application in dendritic solidification

Explore the source record for details and available documents.

Elaheh Dorari↗

NASA NTRS2000

Computation of Transonic Nozzle Sound Transmission and Rotor Problems by the Dispersion-Relation-Preserving Scheme

The transonic nozzle transmission problem and the open rotor noise radiation problem are solved computationally. Both are multiple length scales problems. For efficient and accurate numerical simulation, the multiple-size-mesh multiple-time-step Dispersion-Relation-Preserving scheme is used to calculate the time periodic solution. To ensure an accurate solution, high quality numerical boundary conditions are also needed. For the nozzle problem, a set of nonhomogeneous, outflow boundary conditions are required. The nonhomogeneous boundary conditions not only generate the incoming sound waves but also, at the same time, allow the reflected acoustic waves and entropy waves, if present, to exit the computation domain without reflection. For the open rotor problem, there is an apparent singularity at the axis of rotation. An analytic extension approach is developed to provide a high quality axis boundary treatment.

Tam, Christopher K. W.↗

NASA NTRS2001

Better, Cheaper, Faster Molecular Dynamics

Recent, revolutionary progress in genomics and structural, molecular and cellular biology has created new opportunities for molecular-level computer simulations of biological systems by providing vast amounts of data that require interpretation. These opportunities are further enhanced by the increasing availability of massively parallel computers. For many problems, the method of choice is classical molecular dynamics (iterative solving of Newton's equations of motion). It focuses on two main objectives. One is to calculate the relative stability of different states of the system. A typical problem that has' such an objective is computer-aided drug design. Another common objective is to describe evolution of the system towards a low energy (possibly the global minimum energy), "native" state. Perhaps the best example of such a problem is protein folding. Both types of problems share the same difficulty. Often, different states of the system are separated by high energy barriers, which implies that transitions between these states are rare events. This, in turn, can greatly impede exploration of phase space. In some instances this can lead to "quasi non-ergodicity", whereby a part of phase space is inaccessible on time scales of the simulation. To overcome this difficulty and to extend molecular dynamics to "biological" time scales (millisecond or longer) new physical formulations and new algorithmic developments are required. To be efficient they should account for natural limitations of multi-processor computer architecture. I will present work along these lines done in my group. In particular, I will focus on a new approach to calculating the free energies (stability) of different states and to overcoming "the curse of rare events". I will also discuss algorithmic improvements to multiple time step methods and to the treatment of slowly decaying, log-ranged, electrostatic effects.

Pohorille, Andrew↗

NASA NTRS2003

Videogrammetry Using Projected Circular Targets: Proof-of-Concept Test

Videogrammetry is the science of calculating 3D object coordinates as a function of time from image sequences. It expands the method of photogrammetry to multiple time steps enabling the object to be characterized dynamically. Photogrammetry achieves the greatest accuracy with high contrast, solid-colored, circular targets. The high contrast is most often effected using retro-reflective targets attached to the measurement article. Knowledge of the location of each target allows those points to be tracked in a sequence of images, thus yielding dynamic characterization of the overall object. For ultra-lightweight and inflatable gossamer structures (e.g. solar sails, inflatable antennae, sun shields, etc.) where it may be desirable to avoid physically attaching retro-targets, a high-density grid of projected circular targets - called dot projection - is a viable alternative. Over time the object changes shape or position independently of the dots. Dynamic behavior, such as deployment or vibration, can be characterized by tracking the overall 3D shape of the object instead of tracking specific object points. To develop this method, an oscillating rigid object was measured using both retroreflective targets and dot projection. This paper details these tests, compares the results, and discusses the overall accuracy of dot projection videogrammetry.

Pappa, Richard S.↗

NASA NTRS2003

Videogrammetry Using Projected Circular Targets: Proof-of-Concept Test

Videogrammetry is the science of calculating 3D object coordinates as a function of time from image sequences. It expands the method of photogrammetry to multiple time steps enabling the object to be characterized dynamically. Photogrammetry achieves the greatest accuracy with high contrast, solid-colored circular targets. The high contrast is most often effected using retro-reflective targets attached to the measurement article. Knowledge of the location of each target allows those points to be tracked in a sequence of images, thus yielding dynamic characterization of the overall object. For ultra-lightweight and inflatable gossamer structures (e.g. solar sails, inflatable antennae, sun shields, etc.) where it may be desirable to avoid physically attaching retro-targets, a high-density grid of projected circular targets - called dot projection - is a viable alternative. Over time the object changes shape or position independently of the dots. Dynamic behavior, such as deployment or vibration, can be characterized by tracking the overall 3D shape of the object instead of tracking specific object points. To develop this method, an oscillating rigid object was measured using both retro- reflective targets and dot projection. This paper details these tests, compares the results, and discusses the overall accuracy of dot projection videogrammetry.

Black, Jonathan T.↗

NASA NTRS2003

Research in Computational Astrobiology

We report on several projects in the field of computational astrobiology, which is devoted to advancing our understanding of the origin, evolution and distribution of life in the Universe using theoretical and computational tools. Research projects included modifying existing computer simulation codes to use efficient, multiple time step algorithms, statistical methods for analysis of astrophysical data via optimal partitioning methods, electronic structure calculations on water-nuclei acid complexes, incorporation of structural information into genomic sequence analysis methods and calculations of shock-induced formation of polycylic aromatic hydrocarbon compounds.

Chaban, Galina↗

NASA NTRS2004

Explanation Constraint Programming for Model-based Diagnosis of Engineered Systems

We can expect to see an increase in the deployment of unmanned air and land vehicles for autonomous exploration of space. In order to maintain autonomous control of such systems, it is essential to track the current state of the system. When the system includes safety-critical components, failures or faults in the system must be diagnosed as quickly as possible, and their effects compensated for so that control and safety are maintained under a variety of fault conditions. The Livingstone fault diagnosis and recovery kernel and its temporal extension L2 are examples of model-based reasoning engines for health management. Livingstone has been shown to be effective, it is in demand, and it is being further developed. It was part of the successful Remote Agent demonstration on Deep Space One in 1999. It has been and is being utilized by several projects involving groups from various NASA centers, including the In Situ Propellant Production (ISPP) simulation at Kennedy Space Center, the X-34 and X-37 experimental reusable launch vehicle missions, Techsat-21, and advanced life support projects. Model-based and consistency-based diagnostic systems like Livingstone work only with discrete and finite domain models. When quantitative and continuous behaviors are involved, these are abstracted to discrete form using some mapping. This mapping from the quantitative domain to the qualitative domain is sometimes very involved and requires the design of highly sophisticated and complex monitors. We propose a diagnostic methodology that deals directly with quantitative models and behaviors, thereby mitigating the need for these sophisticated mappings. Our work brings together ideas from model-based diagnosis systems like Livingstone and concurrent constraint programming concepts. The system uses explanations derived from the propagation of quantitative constraints to generate conflicts. Fast conflict generation algorithms are used to generate and maintain multiple candidates whose consistency can be tracked across multiple time steps.

Narasimhan, Sriram↗

NASA NTRS2004

Algorithm for Training a Recurrent Multilayer Perceptron

An improved algorithm has been devised for training a recurrent multilayer perceptron (RMLP) for optimal performance in predicting the behavior of a complex, dynamic, and noisy system multiple time steps into the future. [An RMLP is a computational neural network with self-feedback and cross-talk (both delayed by one time step) among neurons in hidden layers]. Like other neural-network-training algorithms, this algorithm adjusts network biases and synaptic-connection weights according to a gradient-descent rule. The distinguishing feature of this algorithm is a combination of global feedback (the use of predictions as well as the current output value in computing the gradient at each time step) and recursiveness. The recursive aspect of the algorithm lies in the inclusion of the gradient of predictions at each time step with respect to the predictions at the preceding time step; this recursion enables the RMLP to learn the dynamics. It has been conjectured that carrying the recursion to even earlier time steps would enable the RMLP to represent a noisier, more complex system.

Parlos, Alexander G.↗

NASA NTRS2011

Modeling Humans as Reinforcement Learners: How to Predict Human Behavior in Multi-Stage Games

This paper introduces a novel framework for modeling interacting humans in a multi-stage game environment by combining concepts from game theory and reinforcement learning. The proposed model has the following desirable characteristics: (1) Bounded rational players, (2) strategic (i.e., players account for one anothers reward functions), and (3) is computationally feasible even on moderately large real-world systems. To do this we extend level-K reasoning to policy space to, for the first time, be able to handle multiple time steps. This allows us to decompose the problem into a series of smaller ones where we can apply standard reinforcement learning algorithms. We investigate these ideas in a cyber-battle scenario over a smart power grid and discuss the relationship between the behavior predicted by our model and what one might expect of real human defenders and attackers.

Lee, Ritchie↗

NASA NTRS2013

Simulation of Inflated Pahoehoe Lava Flows

A new stochastic model simulates late-stage pahoehoe lobes where random processes dominate emplacement. The model prescribes probabilistic rules for determining where and when parcels of lava move within the lobe. Unlike a classical Brownian motion random walk, the model allows individual parcels to remain dormant, but fluid, for multiple time steps. The randomness of parcel volume transfers within the lobe interior as well as at the margins qualitatively reflects inflation processes observed in the field. The fraction of inflated volume to total volume increases with the total volume, with greater than 75% of the lobe volume contributed through inflation for typical lobes. The influence on planform shape and topographic cross-sectional profiles of total volume, source area and shape, topographic confinement, and sequential breakouts at the lobe margins, are all explored with the stochastic model. Each of these factors influences the overall lobe thickness and width. The model provides a means for assessing the relative importance of these processes through comparisons with field data. For the first time, Gaussian and parabolic functions are quantitatively fit to field measurements of pahoehoe lobes. Both functional forms provide adequate description of the cross-sectional flow shapes. When comparing simulated lobes to field data, sequential breakouts at the lobe margins are found to be an important process controlling the final topographic distribution of observed pahoehoe lobes.

modeling↗

NASA NTRSDate not supplied

Magnetic Mapping in the Inner Magnetosphere using Kamodo

Many models require specialized access and interpolation schemes to effectively extract and interpolate their outputs. In particular, the Block-Adaptive Tree Solarwind Roe Upwind Scheme (BATSRUS) component of the Space Weather Modeling Framework (SWMF) requires Kamodo to take advantage of its block-based adaptive grid structure, and the Lyon-Fedder Mobarry magnetosphere model (or its successor GAMERA) needs a scheme that appreciates the distorted spherical arrangement of grid vertices on a non-orthogonal grid. With the flythrough layer developed by Ringuette et al. (SH42E-2337), the underlying model readers have been adapted to use multiple time steps in a single Python session to perform 4- dimensional interpolations in time and space. Kamodo now utilizes lazy interpolation that loads data only when needed. We present the successful integration of SWMF/BATSRUS magnetosphere access and interpolation into the new 4D Kamodo framework utilizing an external library of C code. Through function composition, Kamodo facilitates the calculation of derived quantities and the transformation of positions and vectors into different coordinate systems. This work is a significant step towards performing field line tracing in Kamodo with SWMF magnetosphere outputs.

Lutz Rastaetter↗

NASA NTRS1988

Spatio-temporal adaptation algorithm for two-dimensional reacting flows

A spatio-temporal adaptive algorithm for solving the unsteady Euler equations with chemical source terms is presented. Quadrilateral cells are used in two spatial dimensions which allow for embedded meshes tracking moving flow features with spatially varying time-steps which are multiples of global minimum time-steps. Blast wave interactions corresponding to a perfect gas (frozen) and a Lighthill dissociating gas (nonequilibrium) are considered for circular arc cascade and 90 degree bend duct geometries.

Pervaiz, Mehtab M.↗

NASA NTRS1986

Reduction of the effects of the communication delays in scientific algorithms on message passing MIMD architectures

The efficient implementation of algorithms on multiprocessor machines requires that the effects of communication delays be minimized. The effects of these delays on the performance of a model problem on a hypercube multiprocessor architecture is investigated and methods are developed for increasing algorithm efficiency. The model problem under investigation is the solution by red-black Successive Over Relaxation YOUN71 of the heat equation; most of the techniques described here also apply equally well to the solution of elliptic partial differential equations by red-black or multicolor SOR methods. Methods for reducing communication traffic and overhead on a multiprocessor are identified and results of testing these methods on the Intel iPSC Hypercube reported. Methods for partitioning a problem's domain across processors, for reducing communication traffic during a global convergence check, for reducing the number of global convergence checks employed during an iteration, and for concurrently iterating on multiple time-steps in a time-dependent problem. Empirical results show that use of these models can markedly reduce a numewrical problem's execution time.

Saltz, J. H.↗

NASA NTRS1987

Multigrid solution of inviscid transonic flow through rotating blade passages

A fast Euler solver for three dimensional inviscid transonic flow in rotating domains is described. The time dependent Euler equations are discretized spatially with finite volumes, and are advanced temporally with a multiple stage time stepping scheme. A dramatic increase in the rate of convergence for steady solutions is achieved with a multigrid algorithm that employs the multistage scheme as its smoothing procedure. The effectiveness of the multistage scheme as a multigrid driver is enhanced by the utilization of analytically determined combinations of the governing parameters.

Smith, Wayne A.↗

NASA NTRS1984

Analysis of inviscid and viscous flows in cascades with an explicit multiple-grid algorithm

A rapid technique is used for calculating inviscid and viscous flows in turbomachinery cascades. The Euler and thin-layer Navier-Stokes equations are solved using the original explicit MacCormack algorithm. The Baldwin-Lomax eddy viscosity model is used for turbulent flows. Convergence to a steady state is accelerated by use of a variable time-step and a multiple-grid scheme. Computer time is reduced through vectorization. Details of the numerical method are presented along with computed results for two low-speed wind tunnel turning vanes, a space shuttle fuel pump turbine rotor, and a supersonic inflow compressor rotor. The method can predict subtle viscous flow phenomena in cascades and is fast enough to be used as a design tool.

Chima, R. V.↗

NASA NTRS1984

Analysis of inviscid and viscous flows in cascades with an explicit multiple-grid algorithm

Chima, R. V.↗

NASA NTRS1995

A Data Parallel Multizone Navier-Stokes Code

We have developed a data parallel multizone compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the "chimera" approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. The design choices can be summarized as: 1. finite differences on structured grids; 2. implicit time-stepping with either distributed solves or data motion and local solves; 3. sequential stepping through multiple zones with interzone data transfer via a distributed data structure. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran (HPF). One interesting feature is the issue of turbulence modeling, where the architecture of a parallel machine makes the use of an algebraic turbulence model awkward, whereas models based on transport equations are more natural. We will present some performance figures for the code on the CM-5, and consider the issues involved in transitioning the code to HPF for portability to other parallel platforms.

Jespersen, Dennis C.↗