Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic differentiation”

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 469 records · Page 26

Spectral element methods: Algorithms and architectures

Spectral element methods are high-order weighted residual techniques for partial differential equations that combine the geometric flexibility of finite element methods with the rapid convergence of spectral techniques. Spectral element methods are described for the simulation of incompressible fluid flows, with special emphasis on implementation of spectral element techniques on medium-grained parallel processors. Two parallel architectures are considered: the first, a commercially available message-passing hypercube system; the second, a developmental reconfigurable architecture based on Geometry-Defining Processors. High parallel efficiency is obtained in hypercube spectral element computations, indicating that load balancing and communication issues can be successfully addressed by a high-order technique/medium-grained processor algorithm-architecture coupling.

Fischer, Paul↗

Spectral element methods - Algorithms and architectures

Spectral element methods are high-order weighted residual techniques for partial differential equations that combine the geometric flexibility of finite element methods with the rapid convergence of spectral techniques. Spectral element methods are described for the simulation of incompressible fluid flows, with special emphasis on implementation of spectral element techniques on medium-grained parallel processors. Two parallel architectures are considered; the first, a commercially available message-passing hypercube system; the second, a developmental reconfigurable architecture based on Geometry-Defining Processors. High parallel efficiency is obtained in hypercube spectral element computations, indicating that load balancing and communication issues can be successfully addressed by a high-order technique/medium-grained processor algorithm-architecture coupling.

Fischer, Paul↗

Verification of MOOSE/Bison's Heat Conduction Solver Using Combined Spatiotemporal Convergence Analysis

Bison is a computational physics code that uses the finite element method to model the thermo-mechanical response of nuclear fuel. Since Bison is used to inform high-consequence decisions, it is important that its computational results are reliable and predictive. One important step in assessing the reliability and predictive capabilities of a simulation tool is the verification process, which quantifies numerical errors in a discrete solution relative to the exact solution of the mathematical model. One step in the verification process—called code verification—ensures that the implemented numerical algorithm is a faithful representation of the underlying mathematical model, including partial differential or integral equations, initial and boundary conditions, and auxiliary relationships. In this paper, the code verification process is applied to spatiotemporal heat conduction problems in Bison. Simultaneous refinement of the discretization in space and time is employed to reveal any potential mistakes in the numerical algorithms for the interactions between the spatial and temporal components of the solution. For each verification problem, the correct spatial and temporal order of accuracy is demonstrated for both first- and second-order accurate finite elements and a variety of time-integration schemes. Furthermore, these results provide strong evidence that the Bison numerical algorithm for solving spatiotemporal problems reliably represents the underlying mathematical model in MOOSE. The selected test problems can also be used in other simulation tools that numerically solve for conduction or diffusion.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗

An interaction solution algorithm for viscous aerodynamic performance prediction

A weak-interaction solution algorithm is established for aerodynamic flow field prediction about an isolated airfoil. It requires numerical solution of differential equations governing potential flow, viscous and turbulent boundary layer flow, and the turbulent wake flow downstream of a trailing edge. The algorithm accounts for computed viscous displacement effects on the potential flow. These in turn alter the viscous flow through imposed pressure gradients. Closure for turbulence is accomplished using a second order model. Numerical evaluations assess factors affecting solution accuracy, convergence and stability for the combined potential, boundary layer, and parabolic Navier-Stokes equation systems as solved using a finite element algorithm.

Baker, A. J.↗

Total Ozone from the Ozone Monitoring System (OMI) using TOMS and DOAS Methods

The Ozone Monitoring Instrument (OMI) is the Dutch-Finnish contribution to NASA's EOS-Aura satellite scheduled for launch in January 2004. OMI is an imaging spectrometer that will measure the back-scattered Solar radiance in the wavelength range of 270 to 500 nm. The instrument provides near global coverage in one day with a spatial resolution of 13x24 square kilometers. OMI is a new instrument, with a heritage from TOMS, SBW, GOME, GOMOS and SCIAMACHY. OMI'S unique capabilities for measuring important trace gases and aerosols with a small footprint and daily global coverage, in conjunction with the other Aura instruments, will make a major contribution to our understanding of stratospheric and tropospheric chemistry and climate change. OMI will provide data continuity with the 23-year ozone record of TOMS. There are three ozone products planned for OMI: total column ozone, ozone profile and tropospheric column ozone. We are developing two different algorithms for total column ozone: one similar to the algorithm currently being used to process the TOMS data, and the other an improved version of the differential optical absorption spectroscopy (DOAS) method, which has been applied to GOME and SCIAMACHY data. The main reasons for starting with two algorithms for total ozone have to do with heritage and past experience; our long-term goal is to combine the two to develop a more accurate and reliable total ozone product for OMI. We will compare the performance of these two algorithms by applying both of them to the GOME data. We will examine where and how the results differ, and use the extensive TOMS-Dobson comparison studies to assess the performance of the DOAS algorithm.

Veefkind, J. P.↗

Three dimensions, two microscopes, one code: Automatic differentiation for x-ray nanotomography beyond the depth of focus limit

Conventional tomographic reconstruction algorithms assume that one has obtained pure projection images, involving no within-specimen diffraction effects nor multiple scattering. Advances in x-ray nanotomography are leading toward the violation of these assumptions, by combining the high penetration power of x-rays, which enables thick specimens to be imaged, with improved spatial resolution that decreases the depth of focus of the imaging system. We describe a reconstruction method where multiple scattering and diffraction effects in thick samples are modeled by multislice propagation and the 3D object function is retrieved through iterative optimization. We show that the same proposed method works for both full-field microscopy and for coherent scanning techniques like ptychography. Our implementation uses the optimization toolbox and the automatic differentiation capability of the open-source deep learning package TensorFlow, demonstrating a straightforward way to solve optimization problems in computational imaging with flexibility and portability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Electromagnetic Transient (EMT) Simulation Algorithm for Evaluation of Photovoltaic (PV) Generation Systems

Use of inverter-based resources facilitating renewable energy resources such as photovoltaic (PV) generation is increasing rapidly with decreasing costs and reduced emissions associated. To accommodate such rapid growth of inverter-based resources like PV systems, electromagnetic transient (EMT) simulation models of both PV systems and grids are required to analyze the interaction of PVs in the grid (like the post-event analysis). In addition, the EMT simulation would help with the planning of future power grid with a large number of PVs as well as other inverter-based distributed generation systems. In this paper, the EMT simulation models of PV systems and grids are developed based on the differential algebraic equations (DAEs) representing their EMT dynamics. Furthermore, advanced simulation algorithms including numerical stiffness-based hybrid discretization, DAE clustering and aggregation, multi-order integration, and matrix splitting approaches are applied to accelerate the EMT simulation. The proposed algorithm was applied to 125 PV inverters within 52-bus medium-voltage (MV) distribution grid.

Choi, Jongchan↗

Optimal trajectories for aeroassisted orbital transfer

Consideration is given to classical and minimax problems involved in aeroassisted transfer from high earth orbit (HEO) to low earth orbit (LEO). The transfer is restricted to coplanar operation, with trajectory control effected by means of lift modulation. The performance of the maneuver is indexed to the energy expenditure or, alternatively, the time integral of the heating rate. Firist-order optimality conditions are defined for the classical approach, as are a sequential gradient-restoration algorithm and a combined gradient-restoration algorithm. Minimization techniques are presented for the aeroassisted transfer energy consumption and time-delay integral of the heating rate, as well as minimization of the pressure. It is shown that the eigenvalues of the Jacobian matrix of the differential system is both stiff and unstable, implying that the sequential gradient restoration algorithm in its present version is unsuitable. A new method, involving a multipoint approach to the two-poing boundary value problem, is recommended.

Miele, A.↗

A modified model parametrization algorithm for solving a special type of heat and mass transfer systems

A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.

97 MATHEMATICS AND COMPUTING↗

Dynamic grid refinement for partial differential equations on parallel computers

The fast adaptive composite grid method (FAC) is an algorithm that uses various levels of uniform grids to provide adaptive resolution and fast solution of PDEs. An asynchronous version of FAC, called AFAC, that completely eliminates the bottleneck to parallelism is presented. This paper describes the advantage that this algorithm has in adaptive refinement for moving singularities on multiprocessor computers. This work is applicable to the parallel solution of two- and three-dimensional shock tracking problems.

Mccormick, S.↗

Parallel projection—An improved return mapping algorithm for finite element modeling of shape memory alloys

Here, we present a novel finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to resolve. Finite element analysis methods, which rely on Gauss quadrature integration schemes, must solve two sets of coupled differential equations: one at the global level and the other at the local, i.e. Gauss point level. In contrast to the conventional return mapping algorithm, which solves these two sets of coupled differential equations separately using a nested Newton procedure, we propose a scheme to solve the local and global differential equations simultaneously. In the process we also derive closed-form expressions used to update the internal/constitutive state variables, and unify the popular closest-point and cutting plane methods with our formulas. Numerical testing indicates that our method allows for larger thermomechanical loading steps and provides increased computational efficiency, over the standard return mapping algorithm.

42 ENGINEERING↗

Application of multivariate statistics to vestibular testing: discriminating between Meniere's disease and migraine associated dizziness

Meniere's disease (MD) and migraine associated dizziness (MAD) are two disorders that can have similar symptomatologies, but differ vastly in treatment. Vestibular testing is sometimes used to help differentiate between these disorders, but the inefficiency of a human interpreter analyzing a multitude of variables independently decreases its utility. Our hypothesis was that we could objectively discriminate between patients with MD and those with MAD using select variables from the vestibular test battery. Sinusoidal harmonic acceleration test variables were reduced to three vestibulo-ocular reflex physiologic parameters: gain, time constant, and asymmetry. A combination of these parameters plus a measurement of reduced vestibular response from caloric testing allowed us to achieve a joint classification rate of 91%, independent quadratic classification algorithm. Data from posturography were not useful for this type of differentiation. Overall, our classification function can be used as an unbiased assistant to discriminate between MD and MAD and gave us insight into the pathophysiologic differences between the two disorders.

NASA Discipline Neuroscience↗

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

Deliberate Motion Analytics Fused Radar and Video Test Results Deployed Beyond the Perimeter Fence in a High Noise Environment

Security systems that protect the nation’s critical facilities must be capable of detecting physical intrusions in all weather conditions. Intrusion detection sensors in a perimeter with a high nuisance alarm rate (NAR) significantly undermine detection performance and degrade security system effectiveness. This research demonstrated a fused sensor system that can differentiate foliage and weather-induced nuisance alarms from those caused by intruders, providing reliable detection within a two-fence perimeter or beyond the fence. A key element of this work is the creation and application of a “deliberate motion algorithm” that fuses alarm data from radar and video analytics to create video motion detection fused radar system. The two-layer architecture of the algorithm uses machine learning, multi-hypothesis tracking, and Dynamic Bayes Nets to differentiate intruder alarms from weather induced alarms.

47 OTHER INSTRUMENTATION↗

Real-Time Modeling of Thermal Interactions in Cryogenic Ball Bearings

Based on the integration of classical differential equations of motion of bearing elements, a real-time dynamic simulation of ball bearing performance is coupled with simultaneous modeling of thermal interactions between the bearing elements. The transient heat generations are time averaged over a significantly larger time step before they are used to compute the changes in bearing temperature fields. Such an averaging algorithm eliminates the numerical difficulties associated with simultaneous integration of mechanical thermal differential equations with vastly different time scales. Under stable operation, the step change in temperatures at each thermal time step converges to a steady-state solution. Following is a list of accomplishments in the present investigation: (1) A real-time dynamic performance of both 440C and hybrid ball bearings in a LOX environment is modeled in both transient and steady-state time domains, as the inner race accelerates to a prescribed operating speed. (2) The frictional interactions at the ball to race contacts are modeled by experimentally measured traction coefficients as a function of slide-to-roll ratios. (3) Bearing heat generation, as defined by the heat transferred to circulating LOX, is validated against experimental values determined by measured LOX temperatures under prescribed pressures and flow rates. The predicted heat generation is in good agreement with the experimental values. (4) The steady-state solutions are shown to be independent of initial conditions. This establishes convergence of the numerical integration of a differential equation of motion of the bearing elements. (5) Churning and drag losses in the circulating LOX constitutes the majority of bearing heat generation under the experimental test conditions. (6) The heat dissipated in frictional interactions in hybrid bearings is significantly lower in hybrid bearings in comparison to that simulated in all-steel bearings, while the churning and drag losses are relatively unchanged.

Gupta, P. K.↗

Discovering causal structure with reproducing-kernel Hilbert space ε -machines

We merge computational mechanics’ definition of causal states (predictively equivalent histories) with reproducing-kernel Hilbert space (RKHS) representation inference. The result is a widely applicable method that infers causal structure directly from observations of a system’s behaviors whether they are over discrete or continuous events or time. A structural representation—a finite- or infinite-state kernel ϵ-machine—is extracted by a reduced-dimension transform that gives an efficient representation of causal states and their topology. In this way, the system dynamics are represented by a stochastic (ordinary or partial) differential equation that acts on causal states. We introduce an algorithm to estimate the associated evolution operator. Paralleling the Fokker–Planck equation, it efficiently evolves causal-state distributions and makes predictions in the original data space via an RKHS functional mapping. We demonstrate these techniques, together with their predictive abilities, on discrete-time, discrete-value infinite Markov-order processes generated by finite-state hidden Markov models with (i) finite or (ii) uncountably infinite causal states and (iii) continuous-time, continuous-value processes generated by thermally driven chaotic flows. The method robustly estimates causal structure in the presence of varying external and measurement noise levels and for very high-dimensional data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗