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 1,081 records · Page 60

AMReX: a framework for block-structured adaptive mesh refinement

AMReX is a C++ software framework that supports the development of block-structured adaptive mesh refinement (AMR) algorithms for solving systems of partial differential equations (PDEs) with complex boundary conditions on current and emerging architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving the local descriptions of different physical processes in complex multiphysics algorithms. Current AMReX-based application codes span a number of areas, including atmospheric modeling, astrophysics, combustion, cosmology, fluctuating hydrodynamics, multiphase flows, and particle accelerators. In particular, the AMReX-Astro GitHub repository holds a number of astrophysical modeling tools based on AMReX. The origins of AMReX trace back to the BoxLib software framework. AMReX supports a number of different time-stepping strategies and spatial discretizations. Solution strategies supported by AMReX range from level-by-level approaches (with or without subcycling in time) with multilevel synchronization to full-hierarchy approaches, and any combination thereof. User-defined kernels that operate on patches of data can be written in C++ or Fortran; there is also a Fortran-interface functionality which wraps the core C++ data structures and operations in Fortran wrappers so that an application code based on AMReX can be written entirely in Fortran.

97 MATHEMATICS AND COMPUTING↗

The AGORA High-resolution Galaxy Simulations Comparison Project. IV. Halo and Galaxy Mass Assembly in a Cosmological Zoom-in Simulation at z ≤ 2

In this fourth paper from the AGORA Collaboration, we study the evolution down to redshift z = 2 and below of a set of cosmological zoom-in simulations of a Milky Way mass galaxy by eight of the leading hydrodynamic simulation codes. We also compare this CosmoRun suite of simulations with dark matter-only simulations by the same eight codes. We analyze general properties of the halo and galaxy at z = 4 and 3, and before the last major merger, focusing on the formation of well-defined rotationally supported disks, the mass–metallicity relation, the specific star formation rate, the gas metallicity gradients, and the nonaxisymmetric structures in the stellar disks. Codes generally converge well to the stellar-to-halo mass ratios predicted by semianalytic models at z ~ 2. We see that almost all the hydro codes develop rotationally supported structures at low redshifts. Most agree within 0.5 dex with the observed mass–metallicity relation at high and intermediate redshifts, and reproduce the gas metallicity gradients obtained from analytical models and low-redshift observations. We confirm that the intercode differences in the halo assembly history reported in the first paper of the collaboration also exist in CosmoRun, making the code-to-code comparison more difficult. We show that such differences are mainly due to variations in code-dependent parameters that control the time stepping strategy of the gravity solver. We find that variations in the early stellar feedback can also result in differences in the timing of the low-redshift mergers. All the simulation data down to z = 2 and the auxiliary data will be made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

Exponential Time Differencing Gauge Method for Incompressible Viscous Flows

Abstract In this paper, we study an exponential time differencing method for solving the gauge system of incompressible viscous flows governed by Stokes or Navier-Stokes equations. The momentum equation is decoupled from the kinematic equation at a discrete level and is then solved by exponential time stepping multistep schemes in our approach. We analyze the stability of the proposed method and rigorously prove that the first order exponential time differencing scheme is unconditionally stable for the Stokes problem. We also present a compact representation of the algorithm for problems on rectangular domains, which makes FFT-based solvers available for the resulting fully discretized system. Various numerical experiments in two and three dimensional spaces are carried out to demonstrate the accuracy and stability of the proposed method.

Physics↗

Parallel Unsteady Turbopump Flow Simulations for Reusable Launch Vehicles

An efficient solution procedure for time-accurate solutions of Incompressible Navier-Stokes equation is obtained. Artificial compressibility method requires a fast convergence scheme. Pressure projection method is efficient when small time-step is required. The number of sub-iteration is reduced significantly when Poisson solver employed with the continuity equation. Both computing time and memory usage are reduced (at least 3 times). Other work includes Multi Level Parallelism (MLP) of INS3D, overset connectivity for the validation case, experimental measurements, and computational model for boost pump.

Kiris, Cetin↗

Weak second-order splitting schemes for Lagrangian Monte Carlo particle methods for the composition PDF/FDF transport equations

We study a class of methods for the numerical solution of the system of stochastic differential equations (SDEs) that arises in the modeling of turbulent combustion, specifically in the Monte Carlo particle method for the solution of the model equations for the composition probability density function (PDF) and the filtered density function (FDF). This system consists of an SDE for particle position and a random differential equation for particle composition. The numerical methods considered advance the solution in time with (weak) second-order accuracy with respect to the time step size. The four primary contributions of the paper are: (i) establishing that the coefficients in the particle equations can be frozen at the mid-time (while preserving second-order accuracy), (ii) examining the performance of three existing schemes for integrating the SDEs, (iii) developing and evaluating different splitting schemes (which treat particle motion, reaction and mixing on different sub-steps), and (iv) developing the method of manufactured solutions (MMS) to assess the convergence of Monte Carlo particle methods. Tests using MMS confirm the second-order accuracy of the schemes. In general, the use of frozen coefficients reduces the numerical errors. Otherwise no significant differences are observed in the performance of the different SDE schemes and splitting schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How well do CMIP5 climate simulations replicate historical trends and patterns of droughts?

Assessing the uncertainties and understanding the deficiencies of climate models are fundamental to developing adaptation strategies. The objective of this study is to understand how well Coupled Model Intercomparison-Phase 5 (CMIP5) climate model simulations replicate ground-based observations of continental drought areas and their trends. The CMIP5 multimodel ensemble encompasses the Climatic Research Unit (CRU) ground-based observations of area under drought at all time steps. However, most model members overestimate the areas under extreme drought, particularly in the Southern Hemisphere (SH). Furthermore, the results show that the time series of observations and CMIP5 simulations of areas under drought exhibit more variability in the SH than in the Northern Hemisphere (NH). The trend analysis of areas under drought reveals that the observational data exhibit a significant positive trend at the significance level of 0.05 over all land areas. The observed trend is reproduced by about three-fourths of the CMIP5 models when considering total land areas in drought. While models are generally consistent with observations at a global (or hemispheric) scale, most models do not agree with observed regional drying and wetting trends. Over many regions, at most 40% of the CMIP5 models are in agreement with the trends of CRU observations. The drying/wetting trends calculated using the 3 months Standardized Precipitation Index (SPI) values show better agreement with the corresponding CRU values than with the observed annual mean precipitation rates. As a result, pixel-scale evaluation of CMIP5 models indicates that no single model demonstrates an overall superior performance relative to the other models.

54 ENVIRONMENTAL SCIENCES↗

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗

Time Series Evaluation of Radiation Portal Monitor Data for Point Source Detection

The time series of data from a Radiation Portal Monitor (RPM) system are evaluated for the presence of point sources by isolating the contribution of anomalous radiation. Energy-windowed background spectra taken from the RPM are compared with the observed spectra at each time step during a vehicle drive-through. The total signal is turned into a spectral distance index using this method. This provides a time series with reduced systematic fluctuations due to background attenuation by the vehicle, and allows for point source detection by time-series analyses. The anomalous time series is reanalyzed by using a wavelet filter function of similar size to the expected source profile. A number of real drive-through data sets taken at a U.S. port of entry are analyzed in this way. A set of isotopes are injected into the data set, and the resultant benign and injected data sets are analyzed with gross-counting, spectral-ratio, and time-based algorithms. Spectral and time methods together offer a significant increase to detection performance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Progress on Demonstration of a MOOSE-Based Coupled Capability for Hot Channel Factors in Fast Reactors

Hot channel factors (HCFs) are computed values that account for the impact on predicted peak fuel, cladding, and coolant temperatures due to uncertainties in the as-built reactor’s material properties and geometry as well as uncertainties due to modeling approximations. Reduction in computed HCF values via reduction or elimination of modeling approximations may translate to significant economic savings if the reactor power can be raised due to the extra temperature margin gained. While limited historical datasets exist for sodium-cooled fast reactors (SFRs), there are no available HCF data for lead-cooled fast reactors (LFRs) outside of work generated previously within NEAMS. The computation of HCFs involves insights from reactor physics, thermal fluids and heat conduction calculations to determine how the peak temperatures respond to various uncertainties in the design. Due to the significant advantages for multi-physics coupling offered by the MOOSE framework, Griffin (MOOSE-based reactor physics code), MOOSE Heat Conduction Module, and Cardinal (MOOSE-wrapped multi-physics application which includes the NekRS thermal fluids code) are being coupled together using the MOOSE MultiApp System to develop a highfidelity multi-physics modeling capability for HCF simulations. This high-fidelity coupling workflow may also be beneficial for other fast reactor applications in the future. In previous work, Griffin and NekRS were individually assessed to ensure the necessary capabilities were in place. This work describes initial efforts to couple the codes (including folding in the MOOSE Heat Conduction Module) and determining the workflow for the perturbed calculations which will leverage the Stochastic Tools Module (STM). To our knowledge, this is the first coupling of Griffin and NekRS as well as the first exploratory use of Stochastic Tools Module for Cardinal. In this report, the neutronics code Griffin, the heat conduction solver in MOOSE, and the MOOSE-wrapped application containing NekRS (Cardinal) are linked together to demonstrate the coupled capability. Griffin and Cardinal are linked dynamically by specifying shared libraries. Different coupling hierarchies are tested for selecting the most appropriate coupling strategy. A coupling scheme is selected based on the efficiency of calculation and ease of data communication. Multiple tests are performed to choose suitable mesh structure, model configurations, scheme setup and boundary conditions to avoid loss of energy due to data interpolation between different modules or weak imposition of fluxes in finite element codes. Computational experiments are performed to study the tolerance control of each type of iteration to avoid false convergence. The coupled capability is demonstrated in both single pin and 7-pin models based on LFR materials and geometry. The study finds that the use of too large a time step size in the heat conduction module can lead to temperature oscillation even though the heat conduction equation does not have a time-derivative kernel, but only the time-dependent boundary condition. A 7-pin model without duct region achieved good convergence in the coupled calculation while a 7 pin model with duct region experienced data communication issues which need to be resolved.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Sodar - PNNL Scintec MFAS, Oregon Raceway Park - Reviewed Data

These data provide measurements of wind speed and direction up to 400 m above ground level (AGL) (max). The data are stored in two forms: ASCII and raw (binary). ASCII files contain averaged data (currently: 15 min time step and 10 m range gate). Raw files can be reprocessed with sodar software (APRun by Scintec) to produce ASCII files with different time and/or height averaging settings (highest resolution is approximately 90 sec and 10 m). NOTE: Wind direction is reported with respect to magnetic North.

17 WIND ENERGY↗

CAVE3: A general transient heat transfer computer code utilizing eigenvectors and eigenvalues

The method of solution is a hybrid analytical numerical technique which utilizes eigenvalues and eigenvectors. The method is inherently stable, permitting large time steps even with the best of conductors with the finest of mesh sizes which can provide a factor of five reduction in machine time compared to conventional explicit finite difference methods when structures with small time constants are analyzed over long time periods. This code will find utility in analyzing hypersonic missile and aircraft structures which fall naturally into this class. The code is a completely general one in that problems involving any geometry, boundary conditions and materials can be analyzed. This is made possible by requiring the user to establish the thermal network conductances between nodes. Dynamic storage allocation is used to minimize core storage requirements. This report is primarily a user's manual for CAVE3 code. Input and output formats are presented and explained. Sample problems are included which illustrate the usage of the code as well as establish the validity and accuracy of the method.

Palmieri, J. V.↗

A Transient Response Method for Linear Coupled Substructures

A method is presented for determining the transient response of a discrete coordinate model of a linear structural system composed of substructures. The method is applicable to systems consisting of any number of substructures, both determinate and indeterminate interface boundaries, and any topological arrangement of the substructures. The method is simple to implement from a computational point of view because the equations of motion of each of the substructures are solved independently, and the interface boundary compatibility conditions are enforced at each integration time step by a matrix multiplication. The method is demonstrated for a structural system consisting of two beam segments and acted upon by a time dependent force. The numerical results from the demonstration problem validates the accuracy of the method. The application of this method to structural systems with changing interface boundary conditions between substructures is discussed.

Admire, J. R.↗

Three-Dimensional High-Order Spectral Volume Method for Solving Maxwell's Equations on Unstructured Grids

A three-dimensional, high-order, conservative, and efficient discontinuous spectral volume (SV) method for the solutions of Maxwell's equations on unstructured grids is presented. The concept of discontinuous 2nd high-order loca1 representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) method, but instead of using a Galerkin finite-element formulation, the SV method is based on a finite-volume approach to attain a simpler formulation. Conventional unstructured finite-volume methods require data reconstruction based on the least-squares formulation using neighboring cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In the SV method, one starts with a relatively coarse grid of triangles or tetrahedra, called spectral volumes (SVs), and partition each SV into a number of structured subcells, called control volumes (CVs), that support a polynomial expansion of a desired degree of precision. The unknowns are cell averages over CVs. If all the SVs are partitioned in a geometrically similar manner, the reconstruction becomes universal as a weighted sum of unknowns, and only a few universal coefficients need to be stored for the surface integrals over CV faces. Since the solution is discontinuous across the SV boundaries, a Riemann solver is thus necessary to maintain conservation. In the paper, multi-parameter and symmetric SV partitions, up to quartic for triangle and cubic for tetrahedron, are first presented. The corresponding weight coefficients for CV face integrals in terms of CV cell averages for each partition are analytically determined. These discretization formulas are then applied to the integral form of the Maxwell equations. All numerical procedures for outer boundary, material interface, zonal interface, and interior SV face are unified with a single characteristic formulation. The load balancing in a massive parallel computing environment is therefore easier to achieve. A parameter is introduced in the Riemann solver to control the strength of the smoothing term. Important aspects of the data structure and its effects to communication and the optimum use of cache memory are discussed. Results will be presented for plane TE and TM waves incident on a perfectly conducting cylinder for up to fifth order of accuracy, and a plane wave incident on a perfectly conducting sphere for up to fourth order of accuracy. Comparisons are made with exact solutions for these cases.

Liu, Yen↗

Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of accuracy increases, the partitioning for 3D requires the introduction of a large number of parameters, whose optimization to achieve convergence becomes increasingly more difficult. Also, the number of interior facets required to subdivide non-planar faces, and the additional increase in the number of quadrature points for each facet, increases the computational cost greatly.

Liu, Yen↗

Supervised Learning Applied to Air Traffic Trajectory Classification

Given the recent increase of interest in introducing new vehicle types and missions into the National Airspace System, a transition towards a more autonomous air traffic control system is required in order to enable and handle increased density and complexity. This paper presents an exploratory effort of the needed autonomous capabilities by exploring supervised learning techniques in the context of aircraft trajectories. In particular, it focuses on the application of machine learning algorithms and neural network models to a runway recognition trajectory-classification study. It investigates the applicability and effectiveness of various classifiers using datasets containing trajectory records for a month of air traffic. A feature importance and sensitivity analysis are conducted to challenge the chosen time-based datasets and the ten selected features. The study demonstrates that classification accuracy levels of 90% and above can be reached in less than 40 seconds of training for most machine learning classifiers when one track data point, described by the ten selected features at a particular time step, per trajectory is used as input. It also shows that neural network models can achieve similar accuracy levels but at higher training time costs.

Bosson, Christabelle S.↗

Supervised Learning Applied to Air Traffic Trajectory Classification

Given the recent increase of interest in introducing new vehicle types and missions into the National Airspace System, a transition towards a more autonomous air traffic control system is required in order to enable and handle increased density and complexity. This paper presents an exploratory effort of the needed autonomous capabilities by exploring supervised learning techniques in the context of aircraft trajectories. In particular, it focuses on the application of machine learning algorithms and neural network models to a runway recognition trajectory-classification study. It investigates the applicability and effectiveness of various classifiers using datasets containing trajectory records for a month of air traffic. A feature importance and sensitivity analysis are conducted to challenge the chosen time-based datasets and the ten selected features. The study demonstrates that classification accuracy levels of 90% and above can be reached in less than 40 seconds of training for most machine learning classifiers when one track data point, described by the ten selected features at a particular time step, per trajectory is used as input. It also shows that neural network models can achieve similar accuracy levels but at higher training time costs.

Bosson, Christabelle↗

Data-Based Predictive Control with Multirate Prediction Step

Data-based predictive control is an emerging control method that stems from Model Predictive Control (MPC). MPC computes current control action based on a prediction of the system output a number of time steps into the future and is generally derived from a known model of the system. Data-based predictive control has the advantage of deriving predictive models and controller gains from input-output data. Thus, a controller can be designed from the outputs of complex simulation code or a physical system where no explicit model exists. If the output data happens to be corrupted by periodic disturbances, the designed controller will also have the built-in ability to reject these disturbances without the need to know them. When data-based predictive control is implemented online, it becomes a version of adaptive control. One challenge of MPC is computational requirements increasing with prediction horizon length. This paper develops a closed-loop dynamic output feedback controller that minimizes a multi-step-ahead receding-horizon cost function with multirate prediction step. One result is a reduced influence of prediction horizon and the number of system outputs on the computational requirements of the controller. Another result is an emphasis on portions of the prediction window that are sampled more frequently. A third result is the ability to include more outputs in the feedback path than in the cost function.

Barlow, Jonathan S.↗

Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps

We present a novel visual representation and interface named the matrix of isosurface similarity maps (MISM) for effective exploration of large time-varying multivariate volumetric data sets. MISM synthesizes three types of similarity maps (i.e., self, temporal, and variable similarity maps) to capture the essential relationships among isosurfaces of different variables and time steps. Additionally, it serves as the main visual mapping and navigation tool for examining the vast number of isosurfaces and exploring the underlying time-varying multivariate data set. We present temporal clustering, variable grouping, and interactive filtering to reduce the huge exploration space of MISM. In conjunction with the isovalue and isosurface views, MISM allows users to identify important isosurfaces or isosurface pairs and compare them over space, time, and value range. More importantly, we introduce path recommendation that suggests, animates, and compares traversal paths for effectively exploring MISM under varied criteria and at different levels-of-detail. A silhouette-based method is applied to render multiple surfaces of interest in a visually succinct manner. We demonstrate the effectiveness of our approach with case studies of several time-varying multivariate data sets and an ensemble data set, and evaluate our work with two domain experts.

97 MATHEMATICS AND COMPUTING↗