Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational efficiency”

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,135 records · Page 63

Parallel Higher-order Finite Element Method for Accurate Field Computations in Wakefield and PIC Simulations

Over the past years, SLAC's Advanced Computations Department (ACD), under SciDAC sponsorship, has developed a suite of 3D (2D) parallel higher-order finite element (FE) codes, T3P (T2P) and Pic3P (Pic2P), aimed at accurate, large-scale simulation of wakefields and particle-field interactions in radio-frequency (RF) cavities of complex shape. The codes are built on the FE infrastructure that supports SLAC's frequency domain codes, Omega3P and S3P, to utilize conformal tetrahedral (triangular)meshes, higher-order basis functions and quadratic geometry approximation. For time integration, they adopt an unconditionally stable implicit scheme. Pic3P (Pic2P) extends T3P (T2P) to treat charged-particle dynamics self-consistently using the PIC (particle-in-cell) approach, the first such implementation on a conformal, unstructured grid using Whitney basis functions. Examples from applications to the International Linear Collider (ILC), Positron Electron Project-II (PEP-II), Linac Coherent Light Source (LCLS) and other accelerators will be presented to compare the accuracy and computational efficiency of these codes versus their counterparts using structured grids.

43 PARTICLE ACCELERATORS↗

An Objective and Efficient Method for Assessing the Impact of Reduced-Precision Calculations On Solution Correctness

Recent studies have shown that reducing the precision of floating-point calculations in an atmospheric model can improve the models' computational performance without affecting model fidelity, but code changes are needed to accommodate lower precision, and a small number of calculations might need to retain higher precision to prevent undue round-off error. For complex and computationally expensive systems like the Energy Exascale Earth System Model (E3SM), a method is needed to objectively assess the quality of the lower-precision simulations and to quickly identify problematic code pieces This paper demonstrates that solution correctness can be evaluated through a simple and quantitative error metric based on time step convergence. The proposed test method can unambiguously detect the accumulation of precision error and objectively assess its impact on solution accuracy. Since fast physical processes are known to affect key features of the multi-year mean climate in an atmospheric model, we show that the convergence test applied to short simulations can provide useful information about the impact of reduced precision on a model’s long-term behavior. In contrast, the traditional way of climate model evaluation requires multi-year simulations and involves inspecting many physical quantities for statistical significance in the presence of natural variability. The simplicity, computational efficiency, and objectivity of the proposed method makes it very attractive for high-resolution model development. The method is also expected to be applicable to other models that numerically solve time evolution equations.

97 MATHEMATICS AND COMPUTING↗

Configuration interaction singles natural orbitals: An orbital basis for an efficient and size intensive multireference description of electronic excited states

Multireference quantum chemical methods, such as the complete active space self-consistent field (CASSCF) method, have long been the state of the art for computing regions of potential energy surfaces (PESs) where complex, multiconfigurational wavefunctions are required, such as near conical intersections. Herein, we present a computationally efficient alternative to the widely used CASSCF method based on a complete active space configuration interaction (CASCI) expansion built from the state-averaged natural orbitals of configuration interaction singles calculations (CISNOs). This CISNO-CASCI approach is shown to predict vertical excitation energies of molecules with closed-shell ground states similar to those predicted by state averaged (SA)-CASSCF in many cases and to provide an excellent reference for a perturbative treatment of dynamic electron correlation. Absolute energies computed at the CISNO-CASCI level are found to be variationally superior, on average, to other CASCI methods. Unlike SA-CASSCF, CISNO-CASCI provides vertical excitation energies which are both size intensive and size consistent, thus suggesting that CISNO-CASCI would be preferable to SA-CASSCF for the study of systems with multiple excitable centers. The fact that SA-CASSCF and some other CASCI methods do not provide a size intensive/consistent description of excited states is attributed to changes in the orbitals that occur upon introduction of non-interacting subsystems. Finally, CISNO-CASCI is found to provide a suitable description of the PES surrounding a biradicaloid conical intersection in ethylene.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

RELATIVISTIC MAGNETOHYDRODYNAMICS: RENORMALIZED EIGENVECTORS AND FULL WAVE DECOMPOSITION RIEMANN SOLVER

We obtain renormalized sets of right and left eigenvectors of the flux vector Jacobians of the relativistic MHD equations, which are regular and span a complete basis in any physical state including degenerate ones. The renormalization procedure relies on the characterization of the degeneracy types in terms of the normal and tangential components of the magnetic field to the wave front in the fluid rest frame. Proper expressions of the renormalized eigenvectors in conserved variables are obtained through the corresponding matrix transformations. Our work completes previous analysis that present different sets of right eigenvectors for non-degenerate and degenerate states, and can be seen as a relativistic generalization of earlier work performed in classical MHD. Based on the full wave decomposition (FWD) provided by the renormalized set of eigenvectors in conserved variables, we have also developed a linearized (Roe-type) Riemann solver. Extensive testing against one- and two-dimensional standard numerical problems allows us to conclude that our solver is very robust. When compared with a family of simpler solvers that avoid the knowledge of the full characteristic structure of the equations in the computation of the numerical fluxes, our solver turns out to be less diffusive than HLL and HLLC, and comparable in accuracy to the HLLD solver. The amount of operations needed by the FWD solver makes it less efficient computationally than those of the HLL family in one-dimensional problems. However, its relative efficiency increases in multidimensional simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

Uncertainty analysis of correlated parameters in automated reaction mechanism generation

Abstract Uncertainty analysis is a useful tool for inspecting and improving detailed kinetic mechanisms because it can identify the greatest sources of model output error. Owing to the very nonlinear relationship between kinetic and thermodynamic parameters and computed concentrations, model predictions can be extremely sensitive to uncertainties in some parameters while uncertainties in other parameters can be irrelevant. Error propagation becomes even more convoluted in automatically generated kinetic models, where input uncertainties are correlated through kinetic rate rules and thermodynamic group values. Local and global uncertainty analyses were implemented and used to analyze error propagation in Reaction Mechanism Generator (RMG), an open‐source software for generating kinetic models. A framework for automatically assigning parameter uncertainties to estimated thermodynamics and kinetics was created, enabling tracking of correlated uncertainties. Local first‐order uncertainty propagation was implemented using sensitivities computed natively within RMG. Global uncertainty analysis was implemented using adaptive Smolyak pseudospectral approximations as implemented in the MIT Uncertainty Quantification Library to efficiently compute and construct polynomial chaos expansions to approximate the dependence of outputs on a subset of uncertain inputs. Cantera was used as a backend for simulating the reactor system in the global analysis. Analyses were performed for a phenyldodecane pyrolysis model. Local and global methods demonstrated similar trends; however, many uncertainties were significantly overestimated by the local analysis. Both local and global analyses show that correlated uncertainties based on kinetic rate rules and thermochemical groups drastically reduce a model's degrees of freedom and have a large impact on the determination of the most influential input parameters. These results highlight the necessity of incorporating uncertainty analysis in the mechanism generation workflow.

Gao, Connie W.↗

Enforcing global constraints for the dispersion closure problem: τ 2 -SIMPLE algorithm

Permeability and effective dispersion tensors are critical parameters to characterize flow and transport in porous media at the continuum scale. Homogenization theory defines a framework in which such effective properties are first computed from solving a closure problem in a repeating unit cell of the periodic microstructure and then used in a macroscopic formulation for efficient computation. The closure problem is formulated as a local boundary value problem subjected to global constraints, which guarantee the uniqueness of the solution and can be difficult to satisfy for complex geometries and at high flow conditions. These constraints also ensure that pore-scale pressure, velocity, and concentration fields can be accurately reconstructed from the closure variable. Building on a previous work, here we present a framework that allows to satisfy global constraints associated to both the permeability and the dispersion closure problems by introducing two artificial time scales. The algorithm, called τ 2 -SIMPLE, computes both permeability and effective dispersion given an arbitrarily complex geometry and flow condition. Furthermore, this algorithm is demonstrated to be accurate for both 2D and 3D geometries across varying flow conditions, and thus it can be used to quickly characterize effective properties from porous media images in many applications.

97 MATHEMATICS AND COMPUTING↗

Basis functions for electronic structure calculations on spheres

We introduce a new basis function (the spherical Gaussian) for electronic structure calculations on spheres of any dimension D. We find general expressions for the one- and two-electron integrals and propose an efficient computational algorithm incorporating the Cauchy-Schwarz bound. Using numerical calculations for the D = 2 case, we show that spherical Gaussians are more efficient than spherical harmonics when the electrons are strongly localized.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling molecule-plasmon interactions using quantized radiation fields within time-dependent electronic structure theory

We present a combined cavity quantum electrodynamics/ab initio electronic structure approach for simulating plasmon-molecule interactions in the time domain. The simple Jaynes-Cummings-type model Hamiltonian typically utilized in such simulations is replaced with one in which the molecular component of the coupled system is treated in a fully ab initio way, resulting in a computationally efficient description of general plasmon-molecule interactions. Mutual polarization effects are easily incorporated within a standard ground-state Hartree-Fock computation, and time-dependent simulations carry the same formal computational scaling as real-time time-dependent Hartree-Fock theory. As a proof of principle, we apply this generalized method to the emergence of a Fano-like resonance in coupled molecule-plasmon systems; this feature is quite sensitive to the nanoparticle-molecule separation and the orientation of the molecule relative to the polarization of the external electric field.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Position Papers for Inverse Methods for Complex Systems under Uncertainty Workshop

The ability to solve inverse problems – inferring unknown parameters, structures, or states of a system from observed data – is essential for advancing scientific discovery and innovation capabilities for the DOE mission. Basic research needs and challenges are particularly acute in emerging areas such as the interactive, data-driven, modeling and simulation of digital twins; decision support for experiments at DOE scientific user facilities; and for other complex systems and workflows. Inverse problems are at the heart of understanding and controlling complex systems due to factors such as observational data with varying modalities and fidelities, inherent uncertainties in physical measurements and numerical models, and the computational demands of rapid and high-fidelity simulations. The convergence of recent scientific computing trends – scientific machine learning, artificial intelligence, and computing advances such as exascale computing – is creating unprecedented opportunities. These advancements offer the potential to revolutionize how we approach inverse problems to extract actionable insights with the required level of accuracy and computational efficiency. This workshop and the Call for Position Papers are vital steps in bringing together experts to collectively explore and identify the new computational and mathematical directions needed in inverse methods for complex systems under uncertainty.

97 MATHEMATICS AND COMPUTING↗

Experimental feasibility of the airborne measurement of absolute oil fluorescence spectral conversion efficiency

Airborne lidar oil spill experiments carried out to determine the practicability of the AOFSCE (absolute oil fluorescence spectral conversion efficiency) computational model are described. The results reveal that the model is suitable over a considerable range of oil film thicknesses provided the fluorescence efficiency of the oil does not approach the minimum detection sensitivity limitations of the lidar system. Separate airborne lidar experiments to demonstrate measurement of the water column Raman conversion efficiency are also conducted to ascertain the ultimate feasibility of converting such relative oil fluorescence to absolute values. Whereas the AOFSCE model is seen as highly promising, further airborne water column Raman conversion efficiency experiments with improved temporal or depth-resolved waveform calibration and software deconvolution techniques are thought necessary for a final determination of suitability.

Hoge, F. E.↗

Improved Depiction Of Computed Unsteady Flows

PLOT4D and STREAKER programs increase ease of production and utility of animated depictions of unsteady flows simulated numerically by advanced computational fluid dynamics. Programs developed to maximize information displayed while minimizing amount stored. PLOT4D, an extended version of PLOT3D, used to depict steady three-dimensional flows, incorporates features making it more computationally efficient than to visualize unsteady flow as succession of steady flows, animating frame by frame. PLOT4D postprocesses numerical output of fluid-dynamical computation into maps of flow quantities on two-coordinate surfaces depicting cut through flow field or conform to body surface. STREAKER generates streaklines, close approximations of patterns traced by streams of dye or smoke released into simulated flows. Streaklines defined via spatial succession of endpoints of pathlines of massless particles released into flow. STREAKER computes endpoints by fourth-order Runge-Kutta integration of velocity vectors.

Smith, Merritt H.↗

Recursive time-varying filter banks for subband image coding

Filter banks and wavelet decompositions that employ recursive filters have been considered previously and are recognized for their efficiency in partitioning the frequency spectrum. This paper presents an analysis of a new infinite impulse response (IIR) filter bank in which these computationally efficient filters may be changed adaptively in response to the input. The filter bank is presented and discussed in the context of finite-support signals with the intended application in subband image coding. In the absence of quantization errors, exact reconstruction can be achieved and by the proper choice of an adaptation scheme, it is shown that IIR time-varying filter banks can yield improvement over conventional ones.

Smith, Mark J. T.↗

Description and use of LSODE, the Livermore Solver for Ordinary Differential Equations

LSODE, the Livermore Solver for Ordinary Differential Equations, is a package of FORTRAN subroutines designed for the numerical solution of the initial value problem for a system of ordinary differential equations. It is particularly well suited for 'stiff' differential systems, for which the backward differentiation formula method of orders 1 to 5 is provided. The code includes the Adams-Moulton method of orders 1 to 12, so it can be used for nonstiff problems as well. In addition, the user can easily switch methods to increase computational efficiency for problems that change character. For both methods a variety of corrector iteration techniques is included in the code. Also, to minimize computational work, both the step size and method order are varied dynamically. This report presents complete descriptions of the code and integration methods, including their implementation. It also provides a detailed guide to the use of the code, as well as an illustrative example problem.

Radhakrishnan, Krishnan↗

Modeling composite and fluffy grains: The effects of porosity

Recent studies of interplanetary and interstellar dust provide evidence that cosmic dust grains are fluffy, composite objects, highlighting the need for models of the electromagnetic scattering by these grains. Effective medium theory (EMT) with Mie-type series solutions has been used to explore the effects of porosity which would be important in composite dust particles. While this indirect approach is both flexible and computationally efficient, it is not necessarily a good approximation. The need for EMT and its rather restrictive assumptions may be circumvented through a direct computation of the scattering properties via finite element methods, such as the discrete dipole approximation (DDA). Recently, the utility of the DDA method has been advanced significantly through improvements in theory, in numerical algorithms, and in computer hardware. Extensive calculations with the DDA method are used here to examine more directly the effects of porosity. A particular emphasis is placed upon developing a valid methodology. For both solid and porous targets we establish both numerical and physical convergence properties over the range of size parameter that is required for our study. DDA cross sections for grains with a range of porosity are compared to those computed by the EMT/series expansion technique to examine the applicability of several mixing rules, including two extensions of the Bruggeman rule. We show that for particles with Rayleigh vacuum inclusions, the extension proposed by Rouleau & Martin is quite successful. We also investigate the effects of larger, non-Rayleigh vacuum inclusions for various levels of porosity and find that they can be significant.

Wolff, Michael J.↗

A Parallel Incompressible Navier-Stokes Solver with Multigrid Iterations

We developed a parallel, numerically accurate and stable, and computationally efficient finate-difference incompressible Navier-Stokes (N-S) fluid flow solver. The solver runs on both sequential and massively parallel computers. The numerical method used here is a second-order projection method on a staggered grid. The code is highly modular and it can be used either as a stand-alone flow solver and or a template code which can be adapted or expanded to a specific application. Numerical results and parallel performances of our code on Intel Delta and Paragon are reported.

Navier-Stokes solver↗

Efficient Synchronization Stability Metrics for Fault Clearing

Direct methods can provide rapid screening of the dynamical security of large numbers fault and contingency scenarios by avoiding extensive time simulation. We introduce a computationally-efficient direct method based on optimization that leverages efficient cutting plane techniques. The method considers both unstable equilibrium points and the effects of additional relay tripping on dynamical security[1]. Similar to other direct methods, our approach yields conservative results for dynamical security, however, the optimization formulation potentially lends itself to the inclusion of additional constraints to reduce this conservatism.

24 POWER TRANSMISSION AND DISTRIBUTION↗