Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time step”

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

Role of Computational Parameters on Predicting Self-Consistent Residual Stress and Distortion during Wire Arc Additive Manufacturing

Production of three-dimensional metallic parts through integration of an articulated robot and gas metal arc welding, also known as wire arc additive manufacturing (WAAM), can produce large-scale components with moderate geometrical complexity. This technology is particularly appealing due to its high deposition rates, scalability, and cost-effective feedstock compared to other AM processes. Despite its advantages, WAAM adoption is hindered by challenges in ensuring geometric conformity without extensive distortion, defect-free structures, and consistent mechanical properties. Finite element analysis (FEA) is often used to address the challenge of geometrical conformity. As the size of parts increases, the best practices for mesh size and temporal resolution known in the literature become computationally unviable. This research examined the effects of mesh and time-step resolutions during transient FEA of a large-scale (248 layers) metallic part. The impact of computational parameters on the thermal history, displacement, and residual stress distributions were evaluated. The results showed that predicted distortion was consistent across resolutions, while time-step length significantly affected predicted thermal history, and mesh size influenced residual stress distributions. To investigate this relationship further, directionally biased meshes were considered and analyzed. The results indicated that increasing mesh resolution perpendicular to the welding path yielded stress predictions that aligned closely with higher-resolution models while offering substantial computational savings. In conclusion, the significances of this research are related to verification and validation of WAAM models for widespread industrial adoption and pragmatic guidelines for optimizing computation parameters for balancing computational efficiency and predictive accuracy of residual stress and distortion.

Solsbee, Brandon [Univ. of Tennessee, Knoxville, T↗

Tailoring explicit time-marching schemes to improve convergence characteristics

Multi-stage time-stepping schemes, tailored to chosen spatial-differencing operators, are derived and tested. The schemes are constructed to give optimal damping of the high-frequency waves. They are ideal for use with multi-grid acceleration. The concept of characteristic time-stepping, necessary for the extension of the scalar analysis to systems of equations, is presented. The schemes show a marked improvement over Runge-Kutta schemes.

Powell, Kenneth G.↗

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.↗

Microphysical Timescales in Clouds and their Application in Cloud-Resolving Modeling

Computational phenomena (i.e., spurious supersaturation and negative mixing ratio of cloud water) usually exist in cloud-resolving models when the time step for explicit integration is larger than a microphysical timescale in clouds. In this paper, the microphysical timescales in clouds are studied, showing that the timescale of water vapor condensation (or cloud water evaporation) is smaller than 10 s - the order of a typical time step for cloud-resolving models. To avoid spurious computational phenomena in cloud-resolving modeling, it is suggested that moist entropy be used as a prognostic thermodynamic variable, and temperature be diagnosed from that and other prognostic variables. A simple numerical model with moist entropy as a prognostic variable, for example, is presented to show that spurious computational phenomena are removed when moist entropy is used as a prognostic variable.

Zeng, Xi-Ping↗

CDGPS-Based Relative Navigation for Multiple Spacecraft

This thesis investigates the use of Carrier-phase Differential GPS (CDGPS) in relative navigation filters for formation flying spacecraft. This work analyzes the relationship between the Extended Kalman Filter (EKF) design parameters and the resulting estimation accuracies, and in particular, the effect of the process and measurement noises on the semimajor axis error. This analysis clearly demonstrates that CDGPS-based relative navigation Kalman filters yield good estimation performance without satisfying the strong correlation property that previous work had associated with "good" navigation filters. Several examples are presented to show that the Kalman filter can be forced to create solutions with stronger correlations, but these always result in larger semimajor axis errors. These linear and nonlinear simulations also demonstrated the crucial role of the process noise in determining the semimajor axis knowledge. More sophisticated nonlinear models were included to reduce the propagation error in the estimator, but for long time steps and large separations, the EKF, which only uses a linearized covariance propagation, yielded very poor performance. In contrast, the CDGPS-based Unscented Kalman relative navigation Filter (UKF) handled the dynamic and measurement nonlinearities much better and yielded far superior performance than the EKF. The UKF produced good estimates for scenarios with long baselines and time steps for which the EKF would diverge rapidly. A hardware-in-the-loop testbed that is compatible with the Spirent Simulator at NASA GSFC was developed to provide a very flexible and robust capability for demonstrating CDGPS technologies in closed-loop. This extended previous work to implement the decentralized relative navigation algorithms in real time.

Mitchell, Megan Leigh↗

Real Gas Computation Using an Energy Relaxation Method and High-Order WENO Schemes

In this paper, we use a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition into two parts: one part is associated with a simpler pressure law and the other part (the nonlinear deviation) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the first part. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Montarnal, Philippe↗

Interactive Visualization of High-Dimensional Petascale Ocean Data

We describe an application for interactive visualization of 5 petabytes of time-varying multivariate data from a high-resolution global ocean circulation model. The input data are 10311 hourly (ocean time) time steps of various 2D and 3D fields from a 22-billion point 1/48- degree “lat-lon cap” configuration of the MIT General Circulation Model (MITgcm). We map the global horizontal model domain onto our 128-screen (8x16) tiled display wall to produce a canonical tiling with approximately one MITgcm grid point per display pixel, and using this tiling we encode the entire time series for multiple native and computed scalar quantities at a collection of ocean depths. We reduce disk bandwidth requirements by converting the model’s floating point data to 16-bit fixed point values, and compressing those values with a lossless video encoder, which together allow synchronized playback at 24 time steps per second across all 128 displays. The application allows dynamic assignment of any two encoded tiles to any display, and has multiple interfaces for quickly specifying various orderly arrangements of tiles. All subsequent rendering is done on the fly, with run time control of colormaps, transfer functions, histogram equalization, and labeling. The two data streams on each screen can be rendered independently and combined in various ways, including blending, differencing, horizontal/ vertical wipes, and checkerboarding. The two data streams on any screen can optionally be displayed as a scatterplot in their joint attribute space. All scatterplots and map-view plots from the same x/y location and depth are linked so they all show the current brushable selection. Ocean scientists have used the system, and have found previously unidentified features in the data.

Interactive↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

Earth Satellite Population Instability: Underscoring the Need for Debris Mitigation

A recent study by NASA indicates that the implementation of international orbital debris mitigation measures alone will not prevent a significant increase in the artificial Earth satellite population, beginning in the second half of this century. Whereas the focus of the aerospace community for the past 25 years has been on the curtailment of the generation of long-lived orbital debris, active remediation of the current orbital debris population should now be reconsidered to help preserve near-Earth space for future generations. In particular, we show in this paper that even if launch operations were to cease today, the population of space debris would continue to grow. Further, proposed remediation techniques do not appear to offer a viable solution. We therefore recommend that, while the aerospace community maintains the current debris-limiting mission regulations and postmission disposal procedures, future emphasis should be placed on finding new remediation technologies for solving this growing problem. Since the launch of Sputnik 1, space activities have created an orbital debris environment that poses increasing impact risks to existing space systems, including human space flight and robotic missions (1, 2). Currently, more than 9,000 Earth orbiting man-made objects (including many breakup fragments), with a combined mass exceeding 5 million kilograms, are tracked by the US Space Surveillance Network and maintained in the US satellite catalog (3-5). Three accidental collisions between cataloged satellites during the period from late 1991 to early 2005 have already been documented (6), although fortunately none resulted in the creation of large, trackable debris clouds. Several studies conducted during 1991-2001 demonstrated, with assumed future launch rates, the unintended growth potential of the Earth satellite population, resulting from random, accidental collisions among resident space objects (7-13). In some low Earth orbit (LEO) altitude regimes where the number density of satellites is above a critical spatial density, the production rate of new satellites (i.e., debris) due to collisions exceeds the loss of objects due to orbital decay. NASA s evolutionary satellite population model LEGEND (LEO-to-GEO Environment Debris model), developed by the Orbital Debris Program Office at the NASA Lyndon B. Johnson Space Center, is a high fidelity three-dimensional physical model that is capable of simulating the historical satellite environment, as well as the evolution of future debris populations (14, 15). The subject study assumed no rocket bodies and spacecraft were launched after December 2004, and no future disposal maneuvers were allowed for existing spacecraft, few of which currently have such a capability. The rate of satellite explosions would naturally decrease to zero within a few decades as the current satellite population ages. The LEGEND future projection adopts a Monte Carlo approach to simulate future on-orbit explosions and collisions. Within a given projection time step, once the explosion probability is estimated for an intact object, a random number is drawn and compared with the probability to determine if an explosion would occur. A similar procedure is applied to collisions for each pair of target and projectile involved within the same time step. Due to the nature of the Monte Carlo process, multiple projection runs must be performed and analyzed before one can draw reliable and meaningful conclusions from the outcome. A total of fifty, 200-year future projection Monte Carlo simulations were executed and evaluated (16).

Liou, Jer-chyi↗

Bringing discrete-time Langevin splitting methods into agreement with thermodynamics

In light of the recently published complete set of statistically correct Grønbech–Jensen (GJ) methods for discrete-time thermodynamics, we revise a differential operator splitting method for the Langevin equation in order to comply with the basic GJ thermodynamic sampling features, namely, the Boltzmann distribution and Einstein diffusion, in linear systems. This revision, which is based on the introduction of time scaling along with flexibility of a discrete-time velocity attenuation parameter, provides a direct link between the ABO splitting formalism and the GJ methods. This link brings about the conclusion that any GJ method has at least weak second order accuracy in the applied time step. It further helps identify a novel half-step velocity, which simultaneously produces both correct kinetic statistics and correct transport measures for any of the statistically sound GJ methods. Explicit algorithmic expressions are given for the integration of the new half-step velocity into the GJ set of methods. Finally, numerical simulations, including quantum-based molecular dynamics (QMD) using the QMD suite Los Alamos Transferable Tight-Binding for Energetics, highlight the discussed properties of the algorithms as well as exhibit the direct application of robust, time-step-independent stochastic integrators to QMD.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

Numerical challenges in modeling gravothermal collapse in Self-Interacting Dark Matter halos

When dark matter has a large cross section for self scattering, halos can undergo a process known as gravothermal core collapse, where the inner core rapidly increases in density and temperature. To date, several methods have been used to implement Self-Interacting Dark Matter (SIDM) in N-body codes, but there has been no systematic study of these different methods or their accuracy in the core-collapse phase. In this paper, we compare three different numerical implementations of SIDM, including the standard methods from the GIZMO and Arepo codes, by simulating idealized dwarf halos undergoing significant dark matter self interactions (σ/m = 50 cm 2 /g). When simulating these halos, we also vary the mass resolution, time-stepping criteria, and gravitational force-softening scheme. The various SIDM methods lead to distinct differences in a halo's evolution during the core-collapse phase, as each results in spurious scattering rate differences and energy gains/losses. The use of adaptive force softening for gravity can lead to numerical heating that artificially accelerates core collapse, while an insufficiently small simulation time step can cause core evolution to stall or completely reverse. Additionally, particle numbers must be large enough to ensure that the simulated halos are not sensitive to noise in the initial conditions. Even for the highest-resolution simulations tested in this study (10 6 particles per halo), we find that variations of order 10% in collapse time are still present. Here, the results of this work underscore the sensitivity of SIDM modeling on the choice of numerical implementation and motivate a careful study of how these results generalize to halos in a cosmological context.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Modeling DC electrical breakdown using a truncated emission spectrum for trapped radiation

Spontaneously emitted radiation from excited atoms can be of principle importance in certain modes of electrical breakdown, especially positive streamers and some regimes of Townsend breakdown. The electrostatic particle-in-cell code Aleph utilizes the direct simulation Monte Carlo method to compute radiation transport. When there is strong radiation trapping, this approach is limited in that it must resolve the timescale associated with self-absorption. This renders many cases computationally intractable as sub-femtosecond time steps can be required to compute solutions for phenomena that occur over nanoseconds or microseconds. For two specific cases which exhibit strong radiation trapping, we find that spontaneous emissions having a frequency near the line center are inactive in the breakdown process and can be neglected. This enables larger time steps and a computational speedup of up to two orders of magnitude is observed. Some considerations for determining the validity of making such an approximation for Townsend breakdown problems and positive ionization wave problems are presented.

Roberds, N. A.↗

High Order Discontinuous Gelerkin Methods for Convection Dominated Problems with Application to Aeroacoustics

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. On the analysis side, we have studied the efficient and stable discontinuous Galerkin framework for small second derivative terms, for example in Navier-Stokes equations, and also for related equations such as the Hamilton-Jacobi equations. This is a truly local discontinuous formulation where derivatives are considered as new variables. On the applied side, we have implemented and tested the efficiency of different approaches numerically. Related issues in high order ENO and WENO finite difference methods and spectral methods have also been investigated. Jointly with Hu, we have presented a discontinuous Galerkin finite element method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the RungeKutta discontinuous Galerkin finite element method for solving conservation laws. The method has the flexibility of treating complicated geometry by using arbitrary triangulation, can achieve high order accuracy with a local, compact stencil, and are suited for efficient parallel implementation. One and two dimensional numerical examples are given to illustrate the capability of the method. Jointly with Hu, we have constructed third and fourth order WENO schemes on two dimensional unstructured meshes (triangles) in the finite volume formulation. The third order schemes are based on a combination of linear polynomials with nonlinear weights, and the fourth order schemes are based on combination of quadratic polynomials with nonlinear weights. We have addressed several difficult issues associated with high order WENO schemes on unstructured mesh, including the choice of linear and nonlinear weights, what to do with negative weights, etc. Numerical examples are shown to demonstrate the accuracies and robustness of the methods for shock calculations. Jointly with P. Montarnal, we have used a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition under the form epsilon = epsilon(sub 1) + epsilon(sub 2), where epsilon(sub 1) is associated with a simpler pressure law (gamma)-law in this paper) and the nonlinear deviation epsilon(sub 2) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the epsilon(sub l) gamma-law. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Shu, Chi-Wang↗

A Global Magnetohydrodynamic Model of Jovian Magnetosphere

The goal of this project was to develop a new global magnetohydrodynamic model of the interaction of the Jovian magnetosphere with the solar wind. Observations from 28 orbits of Jupiter by Galileo along with those from previous spacecraft at Jupiter, Pioneer 10 and 11, Voyager I and 2 and Ulysses, have revealed that the Jovian magnetosphere is a vast, complicated system. The Jovian aurora also has been monitored for several years. Like auroral observations at Earth, these measurements provide us with a global picture of magnetospheric dynamics. Despite this wide range of observations, we have limited quantitative understanding of the Jovian magnetosphere and how it interacts with the solar wind. For the past several years we have been working toward a quantitative understanding of the Jovian magnetosphere and its interaction with the solar wind by employing global magnetohydrodynamic simulations to model the magnetosphere. Our model has been an explicit MHD code (previously used to model the Earth's magnetosphere) to study Jupiter's magnetosphere. We continue to obtain important insights with this code, but it suffers from some severe limitations. In particular with this code we are limited to considering the region outside of 15RJ, with cell sizes of about 1.5R(sub J). The problem arises because of the presence of widely separated time scales throughout the magnetosphere. The numerical stability criterion for explicit MHD codes is the CFL limit and is given by C(sub max)(Delta)t/(Delta)x less than 1 where C(sub max) is the maximum group velocity in a given cell, (Delta)x is the grid spacing and (Delta)t is the time step. If the maximum wave velocity is C(sub w) and the flow speed is C(sub f), C(sub max) = C(sub w) + C(sub f). Near Jupiter the Alfven wave speed becomes very large (it approaches the speed of light at one Jovian radius). Operating with this time step makes the calculation essentially intractable. Therefore under this funding we have been designing a new MHD model that will be able to compute solutions in the wide parameter regime of the Jovian magnetosphere.

Walker, Raymond J.↗

Measure This, Not That: Pareto Optimal Trade-Offs between Model-Based Information Content and Measurements Cost

The slides present a novel convex optimization formulation to compute the best set of measurements for multi-response dynamical systems with asynchronous time steps that maximize the Fisher information content subject to budget constraints. The trace (A-optimality) or determinant (D-optimality) of the Fisher Information Matrix (FIM) quantifies the information content. The framework supports arbitrary (positive semi-definite) variance and covariances between every pair of responses and their time steps.

Wang, Jialu↗

Scalable multiscale modeling of platelets with 100 million particles

Here, we developed the core components of the AI-aided multiple time stepping algorithm for multiscale modeling of cell dynamics. This algorithm was implemented and analyzed on two supercomputer architectures with an application of simulating the aggregation of 250 platelets, or 102 million particles. To scale on these computers with complex memory and network architectures with GPUs, we devised a biomechanics-informed task mapping scheme to optimize load imbalance, communications, and memory utilization. Our simulations, scaling well up to 192 nodes on a Summit-like supercomputer with a peak speed of 11 petaflops, achieved a rate of 423 μs/day which is 500 times faster than the conventional algorithm using static time step and this has enabled studies of record size blood clots at record spatial–temporal resolutions. Additionally, we discovered the sensitive dependence of the scalability and execution time on the methods of decomposition, CPU–GPU coupling, and task mapping.

97 MATHEMATICS AND COMPUTING↗

Constrained Self-adaptive Solutions Procedures for Structure Subject to High Temperature Elastic-plastic Creep Effects

This paper will develop a new solution strategy which can handle elastic-plastic-creep problems in an inherently stable manner. This is achieved by introducing a new constrained time stepping algorithm which will enable the solution of creep initiated pre/postbuckling behavior where indefinite tangent stiffnesses are encountered. Due to the generality of the scheme, both monotone and cyclic loading histories can be handled. The presentation will give a thorough overview of current solution schemes and their short comings, the development of constrained time stepping algorithms as well as illustrate the results of several numerical experiments which benchmark the new procedure.

Padovan, J.↗