Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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.

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

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

An energy-conserving and asymptotic-preserving charged-particle orbit implicit time integrator for arbitrary electromagnetic fields

Here we present a new implicit asymptotic preserving time integration scheme for charged-particle orbit computation in arbitrary electromagnetic fields. The scheme is built on the Crank-Nicolson integrator and continues to recover full-orbit motion in the small time-step limit, but also recovers all the first-order guiding center drifts as well as the correct gyroradius when stepping over the gyration time-scale. In contrast to previous efforts in this direction, the new scheme also features exact energy conservation. In the derivation of the scheme, we find that a new numerical time-scale is introduced. This scale is analyzed and the resulting restrictions on time-step are derived. Based on this analysis, we develop an adaptive time-stepping strategy the respects these constraints while stepping over the gyration scale when physically justified. It is shown through numerical tests on single-particle motion that the scheme's energy conservation property results in tremendous improvements in accuracy, and that the scheme is able to transition smoothly between magnetized and unmagnetized regimes as a result of the adaptive time-stepping.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2013

Representation of Nucleation Mode Microphysics in a Global Aerosol Model with Sectional Microphysics

In models, nucleation mode (1 nm<Dp <10 nm) particle microphysics can be represented explicitly with aerosol microphysical processes or can be parameterized to obtain the growth and survival of nuclei to the model's lower size boundary. This study investigates how the representation of nucleation mode microphysics impacts aerosol number predictions in the TwO-Moment Aerosol Sectional (TOMAS) aerosol microphysics model running with the GISS GCM II-prime by varying its lowest diameter boundary: 1 nm, 3 nm, and 10 nm. The model with the 1 nm boundary simulates the nucleation mode particles with fully resolved microphysical processes, while the model with the 10 nm and 3 nm boundaries uses a nucleation mode dynamics parameterization to account for the growth of nucleated particles to 10 nm and 3 nm, respectively.We also investigate the impact of the time step for aerosol microphysical processes (a 10 min versus a 1 h time step) to aerosol number predictions in the TOMAS models with explicit dynamics for the nucleation mode particles (i.e., 3 nm and 1 nm boundary). The model with the explicit microphysics (i.e., 1 nm boundary) with the 10 min time step is used as a numerical benchmark simulation to estimate biases caused by varying the lower size cutoff and the time step. Different representations of the nucleation mode have a significant effect on the formation rate of particles larger than 10 nm from nucleated particles (J10) and the burdens and lifetimes of ultrafinemode (10 nm≤Dp ≤70 nm) particles but have less impact on the burdens and lifetimes of CCN-sized particles. The models using parameterized microphysics (i.e., 10 nm and 3 nm boundaries) result in higher J10 and shorter coagulation lifetimes of ultrafine-mode particles than the model with explicit dynamics (i.e., 1 nm boundary). The spatial distributions of CN10 (Dp ≥10 nm) and CCN(0.2 %) (i.e., CCN concentrations at 0.2%supersaturation) are moderately affected, especially CN10 predictions above ∼700 hPa where nucleation contributes most strongly to CN10 concentrations. The lowermost-layer CN10 is substantially improved with the 3 nm boundary (compared to 10 nm) in most areas. The overprediction in CN10 with the 3 nm and 10 nm boundaries can be explained by the overprediction of J10 or J3 with the parameterized microphysics, possibly due to the instantaneous growth rate assumption in the survival and growth parameterization. The errors in CN10 predictions are sensitive to the choice of the lower size boundary but not to the choice of the time step applied to the microphysical processes. The spatial distribution of CCN(0.2 %) with the 3 nm boundary is almost identical to that with the 1 nm boundary, but that with the 10 nm boundary can differ more than 10-40% in some areas. We found that the deviation in the 10 nm simulations is partly due to the longer time step (i.e., 1 h time step used in the 10 nm simulations compared to 10 min time step used in the benchmark simulations), but, even with the same time step, the 10 nm cutoff showed noticeably higher errors than the 3 nm cutoff. In conclusion, we generally recommend using a lower diameter boundary of 3 nm for studies focused on aerosol indirect effects but down to 1 nm boundary for studies focused on CN10 predictions or nucleation.

microphysics↗
DOE OSTI2024

Full time-dependent SOLPS-ITER simulation of the SPARC tokamak: actuator design for particle and divertor condition control *

Abstract This paper presents the application of full time-dependent SOLPS-ITER simulations for actuator design in the SPARC tokamak. This study employs both the EIRENE module, a neutral solver, and the B2.5 plasma module in a time-dependent mode. This is in contrast to most SOLPS simulations, which focus on steady-state solutions, where the neutral distribution is evolved without any time limit or for a time step of 1 ⋅ 10 − 3 second, which is several orders of magnitude larger than the fluid plasma time step. The time-dependent EIRENE was tested with a fixed B2.5 background and compared with a simple conductance based model in a simplified pump chamber geometry. This comparison aimed to verify the reliability of the neutral relaxation timescale derived from the time-dependent EIRENE. Subsequently, a full time-dependent simulation was performed in a realistic geometry, with the Monte-Carlo neutral time step synchronized with the plasma fluid time step. The numerical setup of the code, including relative time steps and the size of the census data used to store Monte-Carlo particle information is considered. The full-time dependent simulations are then applied to inform the design of the SPARC louver structure, which affects divertor plasma parameters by regulating the neutral conductance from the divertor to the pump. The response of the plasma and neutral parameters was captured on a timescale that enables the design of the actuator to consider time-dependent control capability. It was found that changing the louver opacity has an equivalent effect as varying the gas throughput via puff actuation. Therefore, equivalent divertor plasma conditions can be obtained from both actuators, while the neutral pressure distribution in the pump and divertor differs for each actuator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1988

Space Station Active Thermal Control System modeling

The Space Station Active Thermal Control System (ATCS) has been modeled using modified SINDA/SINFLO programs to solve two-phase Thermo-fluid problems. The modifications include changes in several subroutines to incorporate implicit solution which allows larger time step as compared to that for explicit solutions. Larger time step saves computer time but involves larger computational error. Several runs were made using various time steps for the ATCS model. It has been found that for a reasonable approach, three times larger time step as compared to that used in explicit method is a good value which will reduce the computer time by approximately 50 percent and still maintain the accuracy of the output data to within 90 percent of the explicit values.

Hye, Abdul↗
NASA NTRS1991

Time-marching methods for three-dimensional steady and unsteady viscous imcompressible flows

An implicit algorithm for the solution of three-dimensional, steady and unsteady, viscous, incompressible flows is presented. The algorithm is based on an upwind-relaxation finite-difference method. Steady-state solutions are carried out using a time-marching solution technique in combination with a local time-stepping strategy. To obtain time-accurate solutions, a subiterative procedure is employed at each physical time step using a global time step to ensure the divergence-free condition. Steady-state flows in several straight ducts and in a square duct with a 90-degree bend are computed and compared with analytical and experimental results. The classical problem of starting flow in a circular pipe is chosen to verify the time accuracy of the present scheme. Finally, the three-dimensional bubble-type vortex breakdown of a slender cylindrical vortex in an unbounded flow is investigated.

Hsu, C.-H.↗
DOE OSTI2023

CFL Optimized Forward–Backward Runge–Kutta Schemes for the Shallow-Water Equations

Abstract We present the formulation and optimization of a Runge–Kutta-type time-stepping scheme for solving the shallow-water equations, aimed at substantially increasing the effective allowable time step over that of comparable methods. This scheme, called FB-RK(3,2), uses weighted forward–backward averaging of thickness data to advance the momentum equation. The weights for this averaging are chosen with an optimization process that employs a von Neumann–type analysis, ensuring that the weights maximize the admittable Courant number. Through a simplified local truncation error analysis and numerical experiments, we show that the method is at least second-order in time for any choice of weights and exhibits low dispersion and dissipation errors for well-resolved waves. Further, we show that an optimized FB-RK(3,2) can take time steps up to 2.8 times as large as a popular three-stage, third-order strong stability-preserving Runge–Kutta method in a quasi-linear test case. In fully nonlinear shallow-water test cases relevant to oceanic and atmospheric flows, FB-RK(3,2) outperforms SSPRK3 in admittable time step by factors roughly between 1.6 and 2.2, making the scheme approximately twice as computationally efficient with little to no effect on solution quality. Significance Statement The purpose of this work is to develop and optimize time-stepping schemes for models relevant to oceanic and atmospheric flows. Specifically, for the shallow-water equations we optimize for schemes that can take time steps as large as possible while retaining solution quality. We find that our optimized schemes can take time steps between 1.6 and 2.2 times larger than schemes that cost the same number of floating point operations, translating directly to a corresponding speedup. Our ultimate goal is to use these schemes in climate-scale simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Fast Quasi-Static Time-Series Simulation for Accurate PV Inverter Semiconductor Fatigue Analysis with a Long-Term Solar Profile

Power system simulations with long-term data typically have large time steps varying from one second to a few minutes. However, for PV inverter semiconductors, the minimum thermal stress cycle occurs over the fundamental grid frequency (50 or 60 Hz). This requires the time step of the fatigue simulation to be around 100 µs. This small time step requires long computation times to process yearly power production profiles. This paper proposes a fast fatigue simulation for inverter semiconductors using the quasi-static time series (QSTS) simulation concept. The proposed simulation calculates the steady state of the semiconductor junction temperature by using a Fast Fourier Transform (FFT). The small thermal cycling during a switching period and even over the fundamental waveform is disregarded to further accelerate the simulation speed. The resulting time step of the fatigue simulation is 15 minutes, which is consistent with the solar dataset. The error of the proposed simulation is 0.16% compared to the fatigue simulation results using the complete thermal stress profile. A PV inverter that responds to a Transactive Energy System (TES) is simulated to demonstrate the use of the proposed fatigue simulation. The proposed simulation has the potential to co-simulate with system level simulation tools that also adopt the QSTS concept.

Liu, Yunting↗
NASA NTRS1987

High resolution finite volume methods on arbitrary grids via wave propagation

A generalization of Godunov's method for systems of conservation laws has been developed and analyzed that can be applied with arbitrary time steps on arbitrary grids in one space dimension. Stability for arbitrary time steps is achieved by allowing waves to propagate through more than one mesh cell in a time step. The method is extended here to second order accuracy and to a finite volume method in two space dimensions. This latter method is based on solving one dimensional normal and tangential Riemann problems at cell interfaces and again propagating waves through one or more mesh cells. By avoiding the usual time step restriction of explicit methods, it is possible to use reasonable time steps on irregular grids where the minimum cell area is much smaller than the average cell. Boundary conditions for the Euler equations are discussed and special attention is given to the case of a Cartesian grid cut by an irregular boundary. In this case small grid cells arise only near the boundary, and it is desirable to use a time step appropriate for the regular interior cells. Numerical results in two dimensions show that this can be achieved.

Leveque, Randall J.↗
NASA NTRS1988

High resolution finite volume methods on arbitrary grids via wave propagation

A generalization of Godunov's method for systems of conservation laws has been developed and analyzed that can be applied with arbitrary time steps on arbitrary grids in one space dimension. Stability for arbitrary time steps is achieved by allowing waves to propagate through more than one mesh cell in a time step. The method is extended here to second order accuracy and to a finite volume method in two space dimensions. This latter method is based on solving one dimensional normal and tangential Rieman problems at cell interfaces and again propagating waves through one or more mesh cells. By avoiding the usual time step restriction of explicit methods, it is possible to use reasonable time steps on irregular grids where the minimum cell area is much smaller than the average cell. Boundary conditions for the Euler equations are discussed and special attention is given to the case of a Cartesian grid cut by an irregular boundary. In this case small grid cells arise only near the boundary, and it is desirable to use a time step appropriate for the regular interior cells. Numerical results in two dimensions show that this can be achieved.

Leveque, Randall J.↗
NASA NTRS1995

Advanced in Visualization of 3D Time-Dependent CFD Solutions

Numerical simulations of complex 3D time-dependent (unsteady) flows are becoming increasingly feasible because of the progress in computing systems. Unfortunately, many existing flow visualization systems were developed for time-independent (steady) solutions and do not adequately depict solutions from unsteady flow simulations. Furthermore, most systems only handle one time step of the solutions individually and do not consider the time-dependent nature of the solutions. For example, instantaneous streamlines are computed by tracking the particles using one time step of the solution. However, for streaklines and timelines, particles need to be tracked through all time steps. Streaklines can reveal quite different information about the flow than those revealed by instantaneous streamlines. Comparisons of instantaneous streamlines with dynamic streaklines are shown. For a complex 3D flow simulation, it is common to generate a grid system with several millions of grid points and to have tens of thousands of time steps. The disk requirement for storing the flow data can easily be tens of gigabytes. Visualizing solutions of this magnitude is a challenging problem with today's computer hardware technology. Even interactive visualization of one time step of the flow data can be a problem for some existing flow visualization systems because of the size of the grid. Current approaches for visualizing complex 3D time-dependent CFD solutions are described. The flow visualization system developed at NASA Ames Research Center to compute time-dependent particle traces from unsteady CFD solutions is described. The system computes particle traces (streaklines) by integrating through the time steps. This system has been used by several NASA scientists to visualize their CFD time-dependent solutions. The flow visualization capabilities of this system are described, and visualization results are shown.

Lane, David A.↗
NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional 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. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. 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. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗
NASA NTRS2010

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗
DOE OSTI2020

Efficient and Robust Dynamic Simulation of Power Systems With Holomorphic Embedding

Dynamic simulation is vitally important in power system analysis, but traditional approaches based on numerical integration over small time steps are time-consuming. Also, the Newton-Raphson method suffers from difficulty in convergence when solving nonlinear algebraic equations. In this paper, we propose a novel dynamic simulation approach based on holomorphic embedding. By obtaining a high-order approximation of system dynamics, it achieves a much larger time step and thus enhances the computational efficiency significantly. In addition, the new approach avoids non-convergence issues in solving algebraic equations, which improves robustness. The approach includes flexible modeling of synchronous generators and controllers, and we propose a method for modeling generator coordinate transformations. The approach is tested on the IEEE 39-bus, 10-generator system and a Polish 2383-bus, 327-generator system. The results demonstrate promising computational efficiency and satisfactory numerical robustness for the analysis of large-scale power systems.

42 ENGINEERING↗
DOE OSTI2022

Accelerated Probabilistic Marching Cubes by Deep Learning for Time-Varying Scalar Ensembles

Visualizing the uncertainty of ensemble simulations is challenging due to the large size and multivariate and temporal features of en-semble data sets. One popular approach to studying the uncertainty of ensembles is analyzing the positional uncertainty of the level sets. Probabilistic marching cubes is a technique that performs Monte Carlo sampling of multivariate Gaussian noise distributions for positional uncertainty visualization of level sets. However, the technique suffers from high computational time, making interactive visualization and analysis impossible to achieve. This paper introduces a deep-learning-based approach to learning the level-set uncertainty for two-dimensional ensemble data with a multivariate Gaussian noise assumption. We train the model using the first few time steps from time-varying ensemble data in our workflow. We demonstrate that our trained model accurately infers uncertainty in level sets for new time steps and is up to 170X faster than that of the original probabilistic model with serial computation and 10X faster than that of the original parallel computation.

Han, Mengjiao↗
NASA NTRS1991

Numerical algorithm comparison for the accurate and efficient computation of high-incidence vortical flow

Computations from two Navier-Stokes codes, NSS and F3D, are presented for a tangent-ogive-cylinder body at high angle of attack. Features of this steady flow include a pair of primary vortices on the leeward side of the body as well as secondary vortices. The topological and physical plausibility of this vortical structure is discussed. The accuracy of these codes are assessed by comparison of the numerical solutions with experimental data. The effects of turbulence model, numerical dissipation, and grid refinement are presented. The overall efficiency of these codes are also assessed by examining their convergence rates, computational time per time step, and maximum allowable time step for time-accurate computations. Overall, the numerical results from both codes compared equally well with experimental data, however, the NSS code was found to be significantly more efficient than the F3D code.

Chaderjian, Neal M.↗
NASA NTRS1991

Three-dimensional blade vortex interactions

A three-dimensional time dependent Navier-Stokes analysis was applied to the rotor blade vortex interaction problem. The numerical procedure is an iterative implicit procedure using three point central differences to represent spatial derivatives. A series of calculations were made to determine the time steps, pseudo-time steps, iterations, artificial dissipation level, etc. required to maintain a nondissipative vortex. Results show the chosen method to have excellent non-dissipative properties provided the correct parameters are chosen. This study was used to set parameters for both two- and three-dimensional blade vortex interaction studies. The case considered was the interaction between a vortex and a NACA0012 airfoil. The results showed the detailed physics during the interaction including the pressure pulse propagating from the blade. The simulated flow physics was qualitatively similar to that experimentally observed. The BVI phenomena is the result of the buildup and violent collapse of the shock waves and local supersonic pockets on the blade surfaces. The resulting pressure pulse build-up appears to be centered at the blade leading edge.

Davoudzadeh, Farhad↗
NASA NTRS1990

Two- and three-dimensional blade vortex interactions

A three-dimensional time dependent Navier-Stokes analysis was applied to the rotor blade vortex interaction (BVI) problem. The numerical procedure is an iterative implicit procedure using three point central differences to represent spatial derivatives. A series of calculations were made to determine the time steps, pseudo-time steps, iterations, artificial dissipation level, etc. required to maintain a nondissipative vortex. Results show the chosen method to have excellent non-dissipative properties provided the correct parameters are chosen. This study was used to set parameters for both two- and three-dimensional blade vortex interaction studies. The two-dimensional study considered the interaction between a vortex and a NACA0012 airfoil. The results showed the detailed physics during the interaction including the pressure pulse propagating from the blade. The simulated flow physics was qualitatively similar to that experimentally observed. The 2-D BVI phenomena is the result of the buildup and violent collapse of the shock waves and local supersonic pockets on the blade surfaces. The resulting pressure pulse build-up appears to be centered at the blade leading edge. The three-dimensional interaction study considered the case of a vortex at 20 deg incidence to the blade leading edge. Although the qualitative results were similar to that of the two-dimensional interaction, details clearly showed the three-dimensional nature of the interaction process.

Davoudzadeh, F.↗
NASA NTRS1993

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗