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 199 records · Page 11

Scientific Discovery through Advanced Computing (SciDAC-3) Partnership Project Annual Report

The Applying Computationally Efficient Schemes for BioGeochemical Cycles ACES4BGC Project is advancing the predictive capabilities of Earth System Models (ESMs) by reducing two of the largest sources of uncertainty, aerosols and biospheric feedbacks, with a highly efficient computational approach. In particular, this project is implementing and optimizing new computationally efficient tracer advection algorithms for large numbers of tracer species; adding important biogeochemical interactions between the atmosphere, land, and ocean models; and applying uncertainty quanti cation (UQ) techniques to constrain process parameters and evaluate uncertainties in feedbacks between biogeochemical cycles and the climate system.

54 ENVIRONMENTAL SCIENCES↗

A primer on the energy efficiency of computing

The efficiency of computing at peak output has increased rapidly since the dawn of the computer age. This paper summarizes some of the key factors affecting the efficiency of computing in all usage modes. While there is still great potential for improving the efficiency of computing devices, we will need to alter how we do computing in the next few decades because we are finally approaching the limits of current technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast and robust all-electron density functional theory calculations in solids using orthogonalized enriched finite elements

Here, we present a computationally efficient approach to perform systematically convergent real-space all-electron Kohn-Sham density functional theory calculations for solids using an enriched finite element (FE) basis. The enriched FE basis is constructed by augmenting the classical FE basis with atom-centered numerical basis functions, comprising of atomic solutions to the Kohn-Sham problem. Notably, to improve the conditioning, we orthogonalize the enrichment functions with respect to the classical FE basis, without sacrificing the locality of the resultant basis. In addition to improved conditioning, this orthogonalization procedure also renders the overlap matrix block diagonal, greatly simplifying its inversion. Subsequently, we use a Chebyshev polynomial based filtering technique to efficiently compute the occupied eigenspace in each self-consistent field iteration. We demonstrate the accuracy and efficiency of the proposed approach on periodic unit cells and supercells. The benchmark studies show a staggering 130× speedup of the orthogonalized enriched FE basis over the classical FE basis. We also present a comparison of the orthogonalized enriched FE basis with the linearized augmented plane-wave + local orbitals basis, both in terms of accuracy and efficiency. Notably, we demonstrate that the orthogonalized enriched FE basis can handle large system sizes of ~10 000 electrons. Finally, we observe good parallel scalability of our implementation with 92% efficiency at 22× speedup for a system with 620 electrons

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Redesign of the DFT/MRCI Hamiltonian

The combined density functional theory and multireference configuration interaction (DFT/MRCI) method of Grimme and Waletzke [J. Chem. Phys. 111, 5645 (1999)] is a well-established semi-empirical quantum chemical method for efficiently computing excited-state properties of organic molecules. As it turns out, the method fails to treat bi-chromophores owing to the strong dependence of the parameters on the excitation class. In this work, we present an alternative form of correcting the matrix elements of a MRCI Hamiltonian which is built from a Kohn-Sham set of orbitals. It is based on the idea of constructing individual energy shifts for each of the state functions of a configuration. The new parameterization is spin-invariant and incorporates less empirism compared to the original formulation. By utilizing damping techniques together with an algorithm of selecting important configurations for treating static electron correlation, the high computational efficiency has been preserved. The robustness of the original and redesigned Hamiltonians has been tested on experimentally known vertical excitation energies of organic molecules yielding similar statistics for the two parameterizations. Besides that, our new formulation is free from artificially low-lying doubly excited states, producing qualitatively correct and consistent results for excimers. The way of modifying matrix elements of the MRCI Hamiltonian presented here shall be considered as default choice when investigating photophysical processes of bi-chromophoric systems such as singlet fission or triplet-triplet upconversion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamical modeling of tidal streams

I present a new framework for modeling the dynamics of tidal streams. The framework consists of simple models for the initial action-angle distribution of tidal debris, which can be straightforwardly evolved forward in time. Taking advantage of the essentially one-dimensional nature of tidal streams, the transformation to position-velocity coordinates can be linearized and interpolated near a small number of points along the stream, thus allowing for efficient computations of a stream's properties in observable quantities. I illustrate how to calculate the stream's average location (its 'track') in different coordinate systems, how to quickly estimate the dispersion around its track, and how to draw mock stream data. As a generative model, this framework allows one to compute the full probability distribution function and marginalize over or condition it on certain phase-space dimensions as well as convolve it with observational uncertainties. This will be instrumental in proper data analysis of stream data. In addition to providing a computationally efficient practical tool for modeling the dynamics of tidal streams, the action-angle nature of the framework helps elucidate how the observed width of the stream relates to the velocity dispersion or mass of the progenitor, and how the progenitors of 'orphan' streams could be located. The practical usefulness of the proposed framework crucially depends on the ability to calculate action-angle variables for any orbit in any gravitational potential. A novel method for calculating actions, frequencies, and angles in any static potential using a single orbit integration is described in the Appendix.

79 ASTRONOMY AND ASTROPHYSICS↗

Likelihood-informed dimension reduction for nonlinear inverse problems

The intrinsic dimensionality of an inverse problem is affected by prior information, the accuracy and number of observations, and the smoothing properties of the forward operator. From a Bayesian perspective, changes from the prior to the posterior may, in many problems, be confined to a relatively low-dimensional subspace of the parameter space. We present a dimension reduction approach that defines and identifies such a subspace, called the 'likelihood-informed subspace' (LIS), by characterizing the relative influences of the prior and the likelihood over the support of the posterior distribution. This identification enables new and more efficient computational methods for Bayesian inference with nonlinear forward models and Gaussian priors. In particular, we approximate the posterior distribution as the product of a lower-dimensional posterior defined on the LIS and the prior distribution marginalized onto the complementary subspace. Markov chain Monte Carlo sampling can then proceed in lower dimensions, with significant gains in computational efficiency. We also introduce a Rao–Blackwellization strategy that de-randomizes Monte Carlo estimates of posterior expectations for additional variance reduction. We demonstrate the efficiency of our methods using two numerical examples: inference of permeability in a groundwater system governed by an elliptic PDE, and an atmospheric remote sensing problem based on Global Ozone Monitoring System (GOMOS) observations.

42 ENGINEERING↗

SPARTAN (Scalable Probabilistic Application Reconfigurable Tensor Autonomous Network)

The technical founder of Ludwig Computing Inc has been competitively selected for support by Cyclotron Road, a U.S. Department of Energy (DOE) Advanced Manufacturing Office (AMO) Lab-Embedded Entrepreneurship Program (LEEP) through an approved merit review process. Ludwig Computing Inc, supported by the U.S. Department of Energy's Advanced Manufacturing Office through the Cyclotron Road program, has investigated the advantages of probabilistic computing for real-world compute-intensive applications. This research adds to the understanding of alternative computing paradigms by exploring a unique hardware-software co-design that integrates quantum computing methods with nature-inspired problem-solving techniques. The project's focus on areas such as combinatorial optimization, graph analytics, and machine learning demonstrates the potential for significant advancements in computational efficiency and performance. By harnessing natural randomness to streamline large circuits into fewer devices, Ludwig's approach enables massive parallelism, potentially offering higher throughput, speed, and energy efficiency compared to conventional hardware solutions. This work benefits the public by paving the way for more efficient computing solutions that could address complex real-world problems while potentially reducing energy consumption in data-intensive industries.

97 MATHEMATICS AND COMPUTING↗

The Minos Computing Library: Efficient Parallel Programming for Extremely Heterogeneous Systems

Hardware specialization has become the silver bullet to achieve efficient high performance, from Systems-on-Chip systems, where hardware specialization can be ``extreme'', to large-scale HPC systems. As the complexity of the systems increases, so does the complexity of programming such architectures in a portable way. This work introduces the Minos Computing Library (MCL), as system software, programming model, and programming model runtime that facilitate programming extremely heterogeneous systems. MCL supports the execution of several multi-threaded applications within the same compute node, performs asynchronous execution of application tasks, efficiently balances computation across hardware resources, and provides performance portability. We show that code developed on a personal desktop automatically scales up to fully utilize powerful workstations with 8 GPUs and down to power-efficient embedded systems. MCL provides up to 17.5x speedup over OpenCL on NVIDIA DGX-1 systems and up to 1.88x speedup on single-GPU systems. In multi-application workloads, MCL dynamically resource allocation provides up to 2.43x performance improvement over manual, static allocation of computing resources.

Gioiosa, Roberto↗

Computing the energy of a water molecule using multideterminants: A simple, efficient algorithm

Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.

97 MATHEMATICS AND COMPUTING↗

Energy Efficiency Scaling for 2 Decades (EES2) Roadmap for Computing

In response to the looming crisis in global energy consumption required for advanced computing applications, the United States Department of Energy (DOE) Advanced Materials and Manufacturing Technology Office (AMMTO) is leading a multi-organizational effort to define a roadmap for energy efficiency scaling for two decades (EES2) with the aim to reduce energy use in all aspects of computation by more than a factor of 1000 in two decades. By July of 2024, over 60 organizations representing industry, academia, and the national laboratories have pledged to work in various aspects of research and development to enable energy efficiency in computing including in the development of the EES2 roadmap, with an initial public release in 2024 as the first phase of an ongoing commitment to energy-efficient and sustainable computation.

Kaarsberg, Tina [U.S. Department of Energy (DOE)]↗

Leveraging dendritic complexity for neuromorphic computing

Abstract Beyond-von Neumann computing approaches are necessary to sustain the growth of microelectronics and the increasing appetite for artificial intelligence/machine learning algorithms. Neuromorphic computing is an emerging paradigm that takes inspiration from the brain to provide a path forward to improve the computational efficiency and computational density of next-generation computing architectures. In nature, we observe brains performing complex computations with a much smaller energy footprint than conventional computing approaches. Current neuromorphic systems are focused primarily on scalability, namely, increasing the number of computational units (neurons) and connections between units (synapses). However, for brain-like cognition and efficiency in next-generation computing hardware, we need increased complexity in function, as well as improved connection density for scalability. Here, we present our work that aims to incorporate dendrites for ‘compute-on-wire’ in neuromorphic architectures to increase the computational complexity (e.g. number of programmable parameters, nonlinear dynamics) as well as computational efficiency (energy/compute) of artificial neural networks (ANNs). We do this by showcasing neuromorphic dendrite elements that can be leveraged for various applications. We will present examples of neuroscience-inspired direction-selective circuits and an ANN with active dendrites leveraging shunting inhibition. We also demonstrate the benefits of using dendrites in deep neural networks. To conclude, we discuss how we can utilize emerging hardware devices in these systems and design next-generation neuromorphic architectures with dendrites.

Cardwell, Suma G. (ORCID:0000000226575545)↗

Redox transistors for neuromorphic computing

Efficiency bottlenecks inherent to conventional computing in executing neural algorithms have spurred the development of novel devices capable of “in-memory” computing. Commonly known as “memristors,” a variety of device concepts including conducting bridge, vacancy filament, phase change, and other types have been proposed as promising elements in artificial neural networks for executing inference and learning algorithms. In this article, we review the recent advances in memristor technology for neuromorphic computing and discuss strategies for addressing the most significant performance challenges, including nonlinearity, high read/write currents, and endurance. As an alternative to two-terminal memristors, we introduce the three-terminal electrochemical memory based on the redox transistor (RT), which uses a gate to tune the redox state of the channel. Decoupling the “read” and “write” operations using a third terminal and storage of information as a charge-compensated redox reaction in the bulk of the transistor enables high-density information storage. These properties enable low-energy operation without compromising analog performance and nonvolatility. Finally, we discuss the RT operating mechanisms using organic and inorganic materials, approaches for array integration, and prospects for achieving the device density and switching speeds necessary to make electrochemical memory competitive with established digital technology.

97 MATHEMATICS AND COMPUTING↗

Extreme Load Computational Fluid Dynamics Analysis and Verification for a Multibody Wave Energy Converter

A wave energy converter (WEC) must be designed to survive the extreme sea states that it will be subject to throughout its lifetime. Although there are many analysis methods and codes available to accomplish this, there are currently several engineering challenges to WEC survival design. Foremost, the computational design approach will typically involve a trade-off between accuracy and computational efficiency. Additionally, most computational fluid dynamics (CFD) codes are not ideally suited to modeling extreme events for WECs with multibody dynamics, power-take-off systems, and mooring systems. Finally, although WEC design standards and CFD guidelines are emerging, with the current immaturity of the WEC industry, they are not yet well established. In this study, loads on a 1:35-scale, moored, multibody WEC are evaluated with CFD. The CFD results are compared with results obtained from a computationally efficient, midfidelity model based on linearized potential flow hydrodynamics. For these model verification comparisons, both operational and survival configurations are considered. The extreme load results obtained, using both codes, indicate that the survival configuration successfully sheds loads during extreme sea states. It is also found that WEC-Sim, when appropriately applied, can provide reasonable load results, at a fraction of the computational expense of CFD. However, for the more extreme sea states, and for higher-order effects not included in the WEC-Sim model, the linear-based results have significant errors in comparison to the CFD-based results, and should be used judiciously.

16 TIDAL AND WAVE POWER↗

Extreme Load Computational Fluid Dynamics Analysis and Verification for a Multibody Wave Energy Converter: Preprint

A wave energy converter (WEC) must be designed to survive the extreme sea states that it will be subject to throughout its lifetime. Although there are many analysis methods and codes available to accomplish this, there are currently several engineering challenges to WEC survival design. Foremost, the computational design approach will typically involve a trade-off between accuracy and computational efficiency. Additionally, most computational fluid dynamics (CFD) codes are not ideally suited to modeling extreme events for WECs with multibody dynamics, power-take-off systems, and mooring systems. Finally, although WEC design standards and CFD guidelines are emerging, with the current immaturity of the WEC industry, they are not yet well established. In this study, loads on a 1:35-scale, moored, multibody WEC are evaluated with CFD. The CFD results are compared with results obtained from a computationally efficient, midfidelity model based on linearized potential flow hydrodynamics. For these model verification comparisons, both operational and survival configurations are considered. The extreme load results obtained, using both codes, indicate that the survival configuration successfully sheds loads during extreme sea states. It is also found that WEC-Sim, when appropriately applied, can provide reasonable load results, at a fraction of the computational expense of CFD. However, for the more extreme sea states, and for higher-order effects not included in the WEC-Sim model, the linear-based results have significant errors in comparison to the CFD-based results, and should be used judiciously.

16 TIDAL AND WAVE POWER↗

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗