Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 163 records · Page 9

A Green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials

Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. Furthermore, the computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.

36 MATERIALS SCIENCE↗

Development and Experimental Optimization of High-Temperature Modeling Tools and Methods for Concentrated Solar Power Particle - Systems

A novel, open-source radiative modeling toolset was developed to extend the functionality of particle-based modeling software (e.g. discrete element method (DEM)) to environmental conditions relevant to concentrated solar power applications. This toolset was optimized for deployment on desktop workstations instead of high-performance computing systems, to render such tools more accessible to the research community. Both particle-based modeling and radiative exchange modeling are computationally expensive and often require specialized programming expertise, making these methods cumbersome to use. Recent developments in DEM software by DCS Computing have greatly reduced these challenges, providing a graphical-user-interface based platform and modeling optimization for desktop workstations, HPCs, and cloud computing. The University of Dayton leveraged the experience of DCS Computing in developing a user-friendly, open-source radiative heat transfer expansion for DEM modeling. The University of Dayton DEM+ radiative modeling toolset was developed using a combination of fundamental experimental measurements, modeling, and simplified flow experiments over a range of temperatures and flow conditions. The toolset provides researchers with access to multiple radiative models including an accelerated Monte-Carlo Ray Tracing (application agnostic, highly computationally expensive), an expanded database of distance-based approximations (application limited, computationally light), and a weighted blending of the two methods capable of achieving over 90% reduction in computation time with equivalent accuracy compared to Monte-Carlo Ray Tracing. Through a graphical user interface, users can customize the radiative models to match their desired accuracy and available computational resources, improving access to particle based modeling for the research community. Ceramic sintered bauxite proppants were used in modeling and experimentally as a baseline. Both the radiative heat transfer and flow properties for particulate systems were investigated at elevated temperatures up to 800 °C. The major accomplishments for this work include a verified, open-source radiative modeling toolset to be distributed amongst the research community and the fabrication of three small-scale test facilities to investigate particle behavior and tune DEM flow properties for operation up to 800 °C. The findings have been shared with the research community via conference modeling workshops, deployment of the tools in DCS Computing Aspherix®, and open-source access to the developed radiative modeling tool. The development of next-generation CSP facilities and thermal energy storage systems based on ceramic particles requires providing access to computationally efficient and accurate modeling tools. Particles will experience a wide range of environments (20-800 °C) and handling conditions (dilute curtains or dense packing), requiring specially designed and optimized equipment. Optimizing solid particle physics models and establishing best-practices for particle modeling in CSP environments will assist researchers with designing optimized equipment, accelerating the deployment of more economically-competitive CSP facilities.

14 SOLAR ENERGY↗

Control optimization for parametric Hamiltonians by pulse reconstruction

Optimal control techniques provide a means to tailor the control pulses required to generate customized quantum gates, which helps to improve the resilience of quantum simulations to gate errors and device noise. However, the significant amount of (classical) computation required to generate customized gates can quickly undermine the effectiveness of this approach, especially when pulse optimization needs to be iterated. We propose a method to reduce the computational time required to generate the control pulse for a Hamiltonian that is parametrically dependent on a time-varying quantity. We use simple interpolation schemes to accurately reconstruct the control pulses from a set of pulses obtained in advance for a discrete set of predetermined parameter values. We obtain a reconstruction with very high fidelity and a significant reduction in computational effort. We report the results of the application of the proposed method to device-level quantum simulations of the unitary (real) time evolution of two interacting neutrons based on superconducting qubits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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

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

Han, Mengjiao↗

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

3d point cloud processing↗

A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet

We consider the scientifically challenging and policy-relevant task of understanding the past and projecting the future dynamics of the Antarctic ice sheet. The Antarctic ice sheet has shown a highly nonlinear threshold response to past climate forcings. Triggering such a threshold response through anthropogenic greenhouse gas emissions would drive drastic and potentially fast sea level rise with important implications for coastal flood risks. Previous studies have combined information from ice sheet models and observations to calibrate model parameters. These studies have broken important new ground but have either adopted simple ice sheet models or have limited the number of parameters to allow for the use of more complex models. These limitations are largely due to the computational challenges posed by calibration as models become more computationally intensive or when the number of parameters increases. Here, we propose a method to alleviate this problem: a fast sequential Monte Carlo method that takes advantage of the massive parallelization afforded by modern high-performance computing systems. We use simulated examples to demonstrate how our sample-based approach provides accurate approximations to the posterior distributions of the calibrated parameters. The drastic reduction in computational times enables us to provide new insights into important scientific questions, for example, the impact of Pliocene era data and prior parameter information on sea level projections. These studies would be computationally prohibitive with other computational approaches for calibration such as Markov chain Monte Carlo or emulation-based methods. We also find considerable differences in the distributions of sea level projections when we account for a larger number of uncertain parameters. For example, based on the same ice sheet model and data set, the 99th percentile of the Antarctic ice sheet contribution to sea level rise in 2300 increases from 6.5 m to 13.1 m when we increase the number of calibrated parameters from three to 11. With previous calibration methods, it would be challenging to go beyond five parameters. Here, this work provides an important next step toward improving the uncertainty quantification of complex, computationally intensive and decision-relevant models.

54 ENVIRONMENTAL SCIENCES↗

Emulator-based Bayesian calibration of a subglacial drainage model

Subglacial drainage models, often motivated by the relationship between hydrology and ice flow, sensitively depend on numerous unconstrained parameters. We explore using borehole water-pressure time series to calibrate the uncertain parameters of a popular subglacial drainage model, taking a Bayesian perspective to quantify the uncertainty in parameter estimates and in the calibrated model predictions. To reduce the computation time associated with Markov Chain Monte Carlo sampling, we construct a fast Gaussian process emulator to stand in for the subglacial drainage model. We first carry out a calibration experiment using synthetic observations consisting of model simulations with hidden parameter values as a demonstration of the method. Using real borehole water pressures measured in western Greenland, we find meaningful constraints on four of the eight model parameters and a factor-of-three reduction in uncertainty of the calibrated model predictions. These experiments illustrate Gaussian process-based Bayesian inference as a useful tool for calibration and uncertainty quantification of complex glaciological models using field data. However, significant differences between the calibrated model and the borehole data suggest that structural limitations of the model, rather than poorly constrained parameters or computational cost, remain the most important constraint on subglacial drainage modelling.

58 GEOSCIENCES↗

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗

Wind farm blockage effects: comparison of different engineering models

The work presents four engineering methods to estimate the induction zone in front of a wind turbine and account for the wind farm blockage effect. The methods comprise the vortex cylinder model, vortex dipole model, self-similar model, and wake projection model. The majority of the models presented account for yaw misalignments and ground effect. Actuator disk simulations are used to verify the individual models. The performance of each model is evaluated both in terms of precision and computational time. The induction models are coupled to wake models within the FLOw Redirection and Induction in Steady State framework to provide the full velocity field within a wind farm. Sample wind farm computations are presented, and the impact of including induction effects into wind farm performance predictions is reported. The different codes are publicly available online.

17 WIND ENERGY↗

A unified thermionic and thermionic-field emission (TE–TFE) model for ideal Schottky reverse-bias leakage current

We present a unified thermionic emission (TE) and thermionic-field emission (TFE) model for the ideal reverse-bias leakage current in Schottky junctions. The unified TE–TFE analytical model advances upon previous analytical TFE models by Murphy–Good and Padovani–Stratton, which are the two most widely adopted models by the community, in two major aspects: (i) the applicability of the TFE expression therein is extended to near-zero surface electric fields by an error-function correction, allowing for the calculation of the total current by a nontrivial sum of TE (over-the-barrier current) and TFE (below-the-barrier current) contributions; therefore, an accurate description of the TE-to-TFE transition region is captured analytically for the first time; (ii) image-force lowering is considered with much-simpler correction terms. Comparisons with the reference numerical model show that the unified TE–TFE model has excellent accuracy, as well as a 10 000× reduction in computation time. The unified model is further tested against experimental data from Schottky barrier diodes based on Si, 4H-SiC, GaN, and β-Ga 2 O 3 , revealing accurate extractions of barrier heights and correct descriptions of the ideal reverse leakage characteristics. With the extended applicable range, improved accuracy, and computational efficiency, the unified TE–TFE model is highly valuable for the design and analysis of devices based on Schottky junctions, as well as for potential integration in technology computer-aided design (TCAD) tools.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Serpent transient analyses of GIACINT geometrical change experiments

This paper simulates seven transient experiments with geometrical movements performed at the GIACINT facility of Belarus. These experiments include three slow control rods insertion in more than 25 s, one fast control rod insertion in less than 1 s, and three water moderator draining transients. In the fast control rod insertion experiment, the control rods are first pushed by a mechanical spring and then let fall by gravity in the assembly. In this experiment, the control rods speed varies because of the initial spring force, the gravitational acceleration, and the water buoyancy force. In all other transient experiments, the geometry change occurs with a constant speed. The Serpent computer program was utilized to simulate these transient experiments with geometrical changes by performing two separate computations. One time-independent computation is performed in criticality mode and the other time-dependent computation is performed in dynamic-source mode. The first computation writes the neutron population and delayed neutron precursors for starting the transient simulation. The second computation divides the transient time into several time bins, reads the two files from the first computation, and updates them at the end of each time bin. The Serpent simulation results obtained for this set of experiments are in good agreement with the time dependent experimental measurements. In addition, Serpent and MCNP simulations results show an excellent agreement for the water moderator transient

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The DESC stellarator code suite. Part 1. Quick and accurate equilibria computations

Three-dimensional equilibrium codes are vital for stellarator design and operation, and high-accuracy equilibria are also necessary for stability studies. This paper details comparisons of two three-dimensional equilibrium codes: VMEC, which uses a steepest-descent algorithm to reach a minimum-energy plasma state, and DESC, which minimizes the magnetohydrodynamic (MHD) force error in real space directly. Accuracy as measured by satisfaction of MHD force balance is presented for each code, along with the computation time. It is shown that DESC is able to achieve more accurate solutions, especially near axis. The importance of higher-accuracy equilibria is shown in DESC's better agreement of stability metrics with asymptotic formulae. DESC's global Fourier–Zernike basis also yields solutions with analytic derivatives explicitly everywhere in the plasma volume, provides improved accuracy in the radial direction versus conventional finite differences and allows for exponential convergence. Further, DESC can compute a solution with the same accuracy as VMEC in order-of-magnitude less time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

twoaxistracking – a python package for simulating self-shading of two-axis tracking solar collectors

Self-shading in fields of two-axis tracking collectors typically ranges from 1% to 6% of the annual incident irradiation. It is thus essential to account for shading in order to obtain accurate yield estimates and financing for such solar projects. The present study presents the free and open-source Python package twoaxistracking for simulating self-shading in fields of two-axis tracking collectors. The package is freely available at: https://github.com/pvlib/twoaxistracking. The main steps of the method and mathematical formulation are described. Additionally, a demonstration of how to use the package is presented. The shading calculation method excels over previous methods found in the literature in that it can: handle arbitrary aperture geometries and distinguish between the total and active areas; account for sloped ground and collectors with different heights within the same field; reduce computation time by skipping calculations at high solar elevation angles.

14 SOLAR ENERGY↗

Fast and Flexible Inference Framework for Continuum Reverberation Mapping Using Simulation-based Inference with Deep Learning

Continuum reverberation mapping (CRM) of active galactic nuclei (AGN) monitors multiwavelength variability signatures to constrain accretion disk structure and supermassive black hole (SMBH) properties. The upcoming Vera Rubin Observatory’s Legacy Survey of Space and Time will survey tens of millions of AGN over the next decade, with thousands of AGN monitored with almost daily cadence in the deep drilling fields. However, existing CRM methodologies often require long computation time and are not designed to handle such large amounts of data. In this paper, we present a fast and flexible inference framework for CRM using simulation-based inference (SBI) with deep learning to estimate SMBH properties from AGN light curves. We use a long short-term memory summary network to reduce the high dimensionality of the light curve data and then use a neural density estimator to estimate the posterior of SMBH parameters. Using simulated light curves, we find SBI can produce more accurate SMBH parameter estimation with 10 3 –10 5 times speed up in inference efficiency compared to traditional methods. The SBI framework is particularly suitable for wide-field CRM surveys as the light curves will have identical observing patterns, which can be incorporated into the SBI simulation. We explore the performance of our SBI model on light curves with irregular-sampled, realistic observing cadence and alternative variability characteristics to demonstrate the flexibility and limitation of the SBI framework.

79 ASTRONOMY AND ASTROPHYSICS↗

GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis

Integrating renewable resources within the transmission grid at a wide scale poses significant challenges for economic dispatch as it requires analysis with more optimization parameters, constraints, and sources of uncertainty. This motivates the investigation of more efficient computational methods, especially those for solving the underlying linear systems, which typically take more than half of the overall computation time. In this paper, we present our work on sparse linear solvers that take advantage of hardware accelerators, such as graphical processing units (GPUs), and improve the overall performance when used within economic dispatch computations. We treat the problems as sparse, which allows for faster execution but also makes the implementation of numerical methods more challenging. We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements when using high-performance linear solvers within alternating current optimal power flow (ACOPF) analysis. Furthermore, we demonstrate the feasibility of getting significant performance improvements by executing the entire computation on GPU-based hardware. Finally, we identify outstanding research issues and opportunities for even better utilization of heterogeneous systems, including those equipped with GPUs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling the 4D discharge of lithium-ion batteries with a multiscale time-dependent deep learning framework

The lithium-ion battery (LIB) field is moving towards the direction of investigating spatially resolved physical phenomena in the 3D porous microstructure of electrodes. These pore-scale simulations give new insights into the local dynamics of lithiation/de-lithiation and charge transport, Nevertheless, the computational time of these simulations limits the integration of these models in optimization workflows of cycling conditions or electrode manufacturing processes. Machine learning models present a way of assessing in real-time the performance of materials. While several successful techniques for replicating simulations with machine learning have been proposed, this case study presents a more demanding problem, due to the necessity of understanding the behavior of heterogeneous 3D local data, as it evolves in time: this poses both a scientific and a technical challenge. To this end, we propose an autoregressive multiscale convolutional neural network model to predict relevant quantities at the pore-scale in the solid phase: the lithium concentration (in the active material) and potential (in the active material and carbon binder). Here, these are ultimately used to reconstruct the battery discharge curve. 3D images of the electrode microstructures are the input to the network, trained with a dataset of finite element method simulations to predict the discharge behavior of the cathode side in lithium ion batteries. We propose this machine learning model as a proof-of-concept of the applicability of multiscale networks for time-dependent physics problems. The trained model exhibits very high accuracy (with errors lower than 2 %) in forecasting the discharge behavior of new unseen cathodes.

25 ENERGY STORAGE↗

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗

A learning-augmented approach for AC optimal power flow

Because of the high nonlinearity of AC optimal power flow (OPF), numerous efforts have been made in recent decades to find efficient methods. Machine learning (ML) has proven to significantly reduce the computational costs in many real-world problems. Thus, this paper develops a learning-augmented method for solving AC OPF, which integrates both power network equations and ML to yield near-optimal solutions. More specifically, ML models are developed to first predict bus voltage magnitudes and angles. Then, physics-based network equations are employed to calculate the power injection at different buses. Three ML algorithms, i.e., random forest, multi-target decision tree, and extreme learning machine, are explored and compared. To evaluate the efficiency of the proposed learning-augmented AC OPF solver, the MATPOWER Interior Point Solver is adopted as a baseline. Case studies on both 500-bus and 4918-bus test networks show that the proposed learning-augmented method has reduced the computational time by 15–100 times depending on the network size with a minimal loss in optimality.

42 ENGINEERING↗