Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 235 records · Page 13

On the attitude motion of an orbiting rigid body under the influence of gravity gradient torque

An investigation is made of the rotational motion of a rigid body orbiting the earth, under the influence of the geogravity-gradient torque. The attitude dynamics are formulated as perturbations from a nominal case. The perturbed equations are solved asymptotically, by the multiple scales technique. The independent variable, time, is extended into a space of higher dimension by means of new scales, fast, slow, etc. Integration of the equations is carried out separately in the new variables. The rapid and slow aspects of the attitude dynamics are systematically separated, resulting in a more efficient computer implementation and enhanced physical insight. The theory is applied to predict the attitude dynamics of an asymmetric rigid body satellite. A comparison is made of the maximum errors as the step size increases as predicted by the multiple scales solution and direct numerical integration. An improvement in computational speed of an order of magnitude is demonstrated.

Tao, Y. C.↗

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗

Deflection Shape Balancing: An Alternative to Modal Balancing

Rotor balancing is the final step in the rotor manufacturing process and may be necessary during rotor refurbishment. The process can be time consuming and costly, especially for supercritical monolithic rotors, impacting schedule and increasing costs. Modal balancing is a commonly used practice and is effective but requires multiple runs and at least one high-speed run. Deflection shape balancing is introduced as an alternative that may offer a more efficient method of balancing making the process faster with potentially fewer balancing runs. This paper explores the performance of the deflection shape fit balancing technique by utilizing MATLAB code simulations.

Morrell, William Jason↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗

Methodology for Designing Fault-Protection Software

A document describes a methodology for designing fault-protection (FP) software for autonomous spacecraft. The methodology embodies and extends established engineering practices in the technical discipline of Fault Detection, Diagnosis, Mitigation, and Recovery; and has been successfully implemented in the Deep Impact Spacecraft, a NASA Discovery mission. Based on established concepts of Fault Monitors and Responses, this FP methodology extends the notion of Opinion, Symptom, Alarm (aka Fault), and Response with numerous new notions, sub-notions, software constructs, and logic and timing gates. For example, Monitor generates a RawOpinion, which graduates into Opinion, categorized into no-opinion, acceptable, or unacceptable opinion. RaiseSymptom, ForceSymptom, and ClearSymptom govern the establishment and then mapping to an Alarm (aka Fault). Local Response is distinguished from FP System Response. A 1-to-n and n-to- 1 mapping is established among Monitors, Symptoms, and Responses. Responses are categorized by device versus by function. Responses operate in tiers, where the early tiers attempt to resolve the Fault in a localized step-by-step fashion, relegating more system-level response to later tier(s). Recovery actions are gated by epoch recovery timing, enabling strategy, urgency, MaxRetry gate, hardware availability, hazardous versus ordinary fault, and many other priority gates. This methodology is systematic, logical, and uses multiple linked tables, parameter files, and recovery command sequences. The credibility of the FP design is proven via a fault-tree analysis "top-down" approach, and a functional fault-mode-effects-and-analysis via "bottoms-up" approach. Via this process, the mitigation and recovery strategy(s) per Fault Containment Region scope (width versus depth) the FP architecture.

Barltrop, Kevin↗

Wireline Deep Drill for the Exploration of Icy Bodies

One of the most pressing current questions in space science is whether life has ever arisen anywhere else in the universe. Water is a critical prerequisite for all life-as-we-know-it, thus the possible exploration targets for extraterrestrial life are bodies that have or had copious liquid: Mars, Europa, and Enceladus. Due to the oxidizing nature of Mars' surface, as well as subsurface liquid water reservoirs present on Europa and Enceladus, the search for evidence of existing life must likely focus on subsurface locations, at depths sufficient to support liquid water or retain biologic signatures. To address these questions, an Auto-Gopher sampler has been developed that is a wireline type drill. This drill is suspended on a tether and its motors and mechanisms are built into a tube that ends with a coring bit. The tether provides the mechanical connection to a rover/lander on a surface as well as power and data communication. Upon penetrating to a target depth, the drill is retracted from the borehole, the core is deposited into a sample transfer system, and the drill is lowered back into the hole. Wireline operation sidesteps one of the major drawbacks of traditional continuous drill string systems by obviating the need for multiple drill sections, which add significantly to the mass and the complexity of the system (i.e. penetration rate was 40 cm per hour). Drilling to 2 meter depth and recovering of cores every 10 cm took a total time of 15 hours (a single step of drilling 10 cm and retrieving the core was 45 minutes). Total energy to reach the 2 m depth was 500 Whr. The Weight on Bit was limited to less than 70 Newton. The core recovery was 100%.

sampling↗

Probabilistic Round Trip Contamination Analysis of a Mars Sample Acquisition and Handling Process Using Markovian Decompositions

A method for evaluating the probability of a Viable Earth Microorganism (VEM) contaminating a sample during the sample acquisition and handling (SAH) process of a potential future Mars Sample Return mission is developed. A scenario where multiple core samples would be acquired using a rotary percussive coring tool, deployed from an arm on a MER class rover is analyzed. The analysis is conducted in a structured way by decomposing sample acquisition and handling process into a series of discrete time steps, and breaking the physical system into a set of relevant components. At each discrete time step, two key functions are defined: The probability of a VEM being released from each component, and the transport matrix, which represents the probability of VEM transport from one component to another. By defining the expected the number of VEMs on each component at the start of the sampling process, these decompositions allow the expected number of VEMs on each component at each sampling step to be represented as a Markov chain. This formalism provides a rigorous mathematical framework in which to analyze the probability of a VEM entering the sample chain, as well as making the analysis tractable by breaking the process down into small analyzable steps.

Hudson, Nicolas↗

A systematic comparison of machine learning methods for modeling of dynamic processes applied to combustion emission rate modeling

Ten established, data-driven dynamic algorithms are surveyed and a practical guide for understanding these methods generated. Existing Python programming packages for implementing each algorithm are acknowledged, and the model equations necessary for prediction are presented. A case study on a coal-fired power plant’s NO x emission rates is performed, directly comparing each modeling method’s performance on a mutual system. Each model is evaluated by its root mean squared error (RMSE) on out-of-sample future horizon predictions. Optimal hyperparameters are identified using either an exhaustive search or genetic algorithm. The top five model structures of each method are used to recursively predict future NO x emission rates over a 60-step time horizon. The RMSE at each future timestep is determined, and the recursive output prediction trends compared against measurements in time. The GRU neural network is identified as the best candidate for representing the system, demonstrating accurate and stable predictions across the future horizon by all considered models, while satisfactory performance was observed in several of the ARX/NARX formulations. Finally, these efforts have contributed 1) a concise resource of multiple proven dynamic machine learning methods, 2) a practical guide explaining the use of these methods, effectively lowering the “barrier-to-entry” of deploying such models in control systems, 3) a comparison study evaluating each method’s performance on a mutual system, 4) demonstration of accurate multi-timestep emissions modeling suitable for systems-level control, and 5) generalizable results demonstrating the suitability of each method for prediction over a multi-step future horizon to other complex dynamic systems.

42 ENGINEERING↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.

TRT-THEORETICAL↗

Foam Optics and Mechanics

The Foam Optics and Mechanics (FOAM) project will exploit the microgravity environment to more accurately measure the rheological and optical characteristics of wet aqueous foams. Using both rheology and laser light scattering diagnostics, the goal is to quantify the unusual elastic character of foams in terms of their underlying microscopic structure and dynamics. Of particular interest is determining how the elastic character vanishes, i.e., how the foam 'melts' into a simple viscous liquid, as a function of both increasing liquid content and increasing shear strain rate. The unusual elastic character of foams will be quantified macroscopically by measurement of the shear stress as a function of shear strain rate and of time following a step strain. Such data will be analyzed in terms of a yield stress, shear moduli, and dynamical time scales. Microscopic information about bubble packing and rearrangement dynamics, from which the macroscopic non-Newtonian properties ultimately arise, will be obtained non-invasively by multiple-light scattering: diffuse transmission spectroscopy (DTS) and diffusing wave spectroscopy (DWS). Quantitative trends with materials parameters, most importantly average bubble size and liquid content, will be sought in order to elucidate the fundamental connection between the microscopic structure and dynamics and the macroscopic rheology.

Durian, Douglas J.↗

Cloud Properties Simulated by a Single-Column Model. Part II: Evaluation of Cumulus Detrainment and Ice-phase Microphysics Using a Cloud Resolving Model

This paper is the second in a series in which kilometer-scale-resolving observations from the Atmospheric Radiation Measurement program and a cloud-resolving model (CRM) are used to evaluate the single-column model (SCM) version of the National Centers for Environmental Prediction Global Forecast System model. Part I demonstrated that kilometer-scale cirrus properties simulated by the SCM significantly differ from the cloud radar observations while the CRM simulation reproduced most of the cirrus properties as revealed by the observations. The present study describes an evaluation, through a comparison with the CRM, of the SCM's representation of detrainment from deep cumulus and ice-phase microphysics in an effort to better understand the findings of Part I. It is found that detrainment occurs too infrequently at a single level at a time in the SCM, although the detrainment rate averaged over the entire simulation period is somewhat comparable to that of the CRM simulation. Relatively too much detrained ice is sublimated when first detrained. Snow falls over too deep of a layer due to the assumption that snow source and sink terms exactly balance within one time step in the SCM. These characteristics in the SCM parameterizations may explain many of the differences in the cirrus properties between the SCM and the observations (or between the SCM and the CRM). A possible improvement for the SCM consists of the inclusion of multiple cumulus cloud types as in the original Arakawa-Schubert scheme, prognostically determining the stratiform cloud fraction and snow mixing ratio. This would allow better representation of the detrainment from deep convection, better coupling of the volume of detrained air with cloud fraction, and better representation of snow field.

Luo, Yali↗

Servomotor and Controller Having Large Dynamic Range

A recently developed micro-commanding rotational-position-control system offers advantages of less mechanical complexity, less susceptibility to mechanical resonances, less power demand, less bulk, less weight, and lower cost, relative to prior rotational-position-control systems based on stepping motors and gear drives. This system includes a digital-signal- processor (DSP)-based electronic controller, plus a shaft-angle resolver and a servomotor mounted on the same shaft. Heretofore, micro-stepping has usually been associated with stepping motors, but in this system, the servomotor is micro-commanded in response to rotational-position feedback from the shaft-angle resolver. The shaft-angle resolver is of a four-speed type chosen because it affords four times the resolution of a single-speed resolver. A key innovative aspect of this system is its position-feedback signal- conditioning circuits, which condition the resolver output signal for multiple ranges of rotational speed. In the preferred version of the system, two rotational- speed ranges are included, but any number of ranges could be added to expand the speed range or increase resolution in particular ranges. In the preferred version, the resolver output is conditioned with two resolver-to-digital converters (RDCs). One RDC is used for speeds from 0.00012 to 2.5 rpm; the other RDC is used for speeds of 2.5 to 6,000 rpm. For the lower speed range, the number of discrete steps of RDC output per revolution was set at 262,144 (4 quadrants at 16 bits per quadrant). For the higher speed range, the number of discrete steps per revolution was set at 4,096 (4 quadrants at 10 bits per quadrant).

Alhorn, Dean C.↗

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗

Augmented signal processing in Liquid Argon Time Projection Chambers with a deep neural network

The Liquid Argon Time Projection Chamber (LArTPC) is an advanced neutrino detector technology widely used in recent and upcoming accelerator neutrino experiments. It features a low energy threshold and high spatial resolution that allow for comprehensive reconstruction of event topologies. In current-generation LArTPCs, the recorded data consist of digitized waveforms on wires produced by induced signal on wires of drifting ionization electrons, which can also be viewed as two-dimensional (2D) (time versus wire) projection images of charged-particle trajectories. For such an imaging detector, one critical step is the signal processing that reconstructs the original charge projections from the recorded 2D images. For the first time, we introduce a deep neural network in LArTPC signal processing to improve the signal region of interest detection. By combining domain knowledge (e.g., matching information from multiple wire planes) and deep learning, this method shows significant improvements over traditional methods. This work details the method, software tools, and performance evaluated with realistic detector simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Preliminary Investigation of Target keff Search for Fuel Feed in MSRs

Fluid fuel molten salt reactor (MSR) concepts may achieve continuous-at-power operation with continuous or batch fresh fuel feed to counter reactivity loss from fuel burnup and fission product buildup. Accurate modeling and simulation of MSRs requires consideration of online fuel feed during depletion as well as a capability to determine the required feed amount to maintain a target multiplication factor (keff). As a first step supporting a full implementation of a new search capability into the SCALE code system’s TRITON reactor physics and depletion sequence, a preliminary investigation was performed to identify the best approach for a critical feed search capability considering computation time and accuracy. Using a simple iterative approach in which initial feed amounts were guessed based on previous depletion steps, the main drivers of computation time were found as the Monte Carlo neutron transport settings and the applied tolerance for the target keff. In the applied model, with tight convergence criteria (keff convergence to 8 pcm and a tolerance of ±15 pcm), the critical search calculation required twice the number of neutron transport calculations compared to a depletion calculation without critical search. In contrast, with a relaxed tolerance of ±50 pcm, the overall computation time for the critical search for merely increased by 30-40%. Further studies will be performed before implementing the critical search capability into TRITON.

Faulkner, Jonathon [ORNL]↗

Supersonic flow over three-dimensional ablated nosetips using an unsteady implicit numerical procedure

The three-dimensional supersonic flow over passive, that is, nonablating, indented nosetips of reentry vehicles is determined using an unsteady implicit numerical algorithm which solves either the inviscid Euler equations or the 'thin-layer' Navier-Stokes equations. A nonorthogonal independent variable transformation is used to map the distorted physical domain, containing multiple zones of embedded subsonic flow and separated flow regions into a rectangular computational volume at whose boundaries the required permeable or impermeable boundary conditions are simulated. Use of the implicit algorithm results in faster convergence to the steady state because of a larger allowable time step over conventional explicit schemes. The numerical results obtained compare favorably with existing numerical solutions and experimental data for simple spheres which validates the program. Results are also presented for analytically defined indented bodies for both laminar and turbulent flow conditions that demonstrate the program's capability for computing such flows.

Kutler, P.↗

Characterizing the Joint Effect of Diverse Test-Statistic Correlation Structures and Effect Size on False Discovery Rates in a Multiple-Comparison Study of Many Outcome Measures

In their 2009 Annals of Statistics paper, Gavrilov, Benjamini, and Sarkar report the results of a simulation assessing the robustness of their adaptive step-down procedure (GBS) for controlling the false discovery rate (FDR) when normally distributed test statistics are serially correlated. In this study we extend the investigation to the case of multiple comparisons involving correlated non-central t-statistics, in particular when several treatments or time periods are being compared to a control in a repeated-measures design with many dependent outcome measures. In addition, we consider several dependence structures other than serial correlation and illustrate how the FDR depends on the interaction between effect size and the type of correlation structure as indexed by Foerstner s distance metric from an identity. The relationship between the correlation matrix R of the original dependent variables and R~, the correlation matrix of associated t-statistics is also studied. In general R~ depends not only on R, but also on sample size and the signed effect sizes for the multiple comparisons.

Feiveson, Alan H.↗