Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic 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,369 records · Page 76

A sequential partly iterative approach for multicomponent reactive transport with CORE2D

CORE{sup 2D} V4 is a finite element code for modeling partly or fully saturated water flow, heat transport and multicomponent reactive solute transport under both local chemical equilibrium and kinetic conditions. It can handle coupled microbial processes and geochemical reactions such as acid-base, aqueous complexation, redox, mineral dissolution/precipitation, gas dissolution/exsolution, ion exchange, sorption via linear and nonlinear isotherms, sorption via surface complexation. Hydraulic parameters may change due to mineral precipitation/dissolution reactions. Coupled transport and chemical equations are solved by using sequential iterative approaches. A sequential partly-iterative approach (SPIA) is presented which improves the accuracy of the traditional sequential noniterative approach (SNIA) and is more efficient than the general sequential iterative approach (SIA). While SNIA leads to a substantial saving of computing time, it introduces numerical errors which are especially large for cation exchange reactions. SPIA improves the efficiency of SIA because the iteration between transport and chemical equations is only performed in nodes with a large mass transfer between solid and liquid phases. The efficiency and accuracy of SPIA are compared to those of SIA and SNIA using synthetic examples and a case study of reactive transport through the Llobregat Delta aquitard in Spain. SPIA is found to be as accurate as SIA while requiring significantly less CPU time. In addition, SPIA is much more accurate than SNIA with only a minor increase in computing time. A further enhancement of the efficiency of SPIA is achieved by improving the efficiency of the Newton-Raphson method used for solving chemical equations. Such an improvement is obtained by working with increments of log-concentrations and ignoring the terms of the Jacobian matrix containing derivatives of activity coefficients. A proof is given for the symmetry and non-singularity of the Jacobian matrix. Numerical analyses performed with synthetic examples confirm that these modifications improve the efficiency and convergence of the iterative algorithm.

54 ENVIRONMENTAL SCIENCES↗

Transforming jet flavour tagging at ATLAS

Jet flavour tagging enables the identification of jets originating from heavy-flavour quarks in proton–proton collisions at the Large Hadron Collider, playing a critical role in its physics programmes. This paper presents GN2, a transformer-based flavour tagging algorithm deployed by the ATLAS Collaboration that represents a different methodology compared to previous approaches. Designed to classify jets based on the flavour of their constituent particles, GN2 processes low-level tracking information in an end-to-end architecture and incorporates physics-informed auxiliary training objectives to enhance both interpretability and performance. Its performance is validated in both simulation and collision data. The measured c-jet (light-jet) rejection in data is improved by a factor of 3.5 (1.8) for a 70% b-jet tagging efficiency, compared to the previous algorithm. GN2 provides substantial benefits for physics analyses involving heavy-flavour jets, such as measurements of Higgs boson pair production and the couplings of bottom and charm quarks to the Higgs boson, and demonstrates the impact of advanced machine learning methods in experimental particle physics.

Characterization and analytical techniques↗

Quantum-assisted quantum compiling

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary U and a trainable unitary V as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap T r ( V † U ) but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.

97 MATHEMATICS AND COMPUTING↗

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems

We consider the nonlinear eigenvalue problem M ( λ ) x = 0, where M ( λ ) is a large parameter-dependent matrix. In several applications, M ( λ ) has a structure where the higher-order terms of its Taylor expansion have a particular low-rank structure. We propose a new Arnoldi-based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi's method applied to an operator whose reciprocal eigenvalues are solutions to the nonlinear eigenvalue problem. The iterates in the algorithm are functions represented in a particular structured vector-valued polynomial basis similar to the construction in the infinite Arnoldi method [Jarlebring, Michiels, and Meerbergen, Numer. Math., 122 (2012), pp. 169–195]. In this paper, the low-rank structure is exploited by applying an additional operator and by using a more compact representation of the functions. This reduces the computational cost associated with orthogonalization, as well as the required memory resources. The structure exploitation also provides a natural way in carrying out implicit restarting and locking without the need to impose structure in every restart. In conclusion, the efficiency and properties of the algorithm are illustrated with two large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Energy characteristics of multi-chiller load distribution algorithms in a large office building

Here, this study evaluates the energy efficiency of multi-chiller systems in large office buildings, focusing on their optimization across various climate zones as defined by ASHRAE. Using EnergyPlus for simulations, the research examines five different load distribution algorithms in multi-chiller systems that range from one to ten chillers, aiming to understand their effectiveness in 15 distinct climate zones. The primary objectives of the study include identifying the energy efficiency of multi-chiller systems in each climate zone, determining the appropriate number of chillers for each zone, and evaluating the performance of the load distribution algorithms. Based on the U.S. Department of Energy’s commercial building model, the results suggest that multi-chiller systems can significantly reduce cooling energy consumption in various climates. Among the algorithms evaluated, the Sequential Uniform Part Load Ratio (SUPLR) algorithm demonstrates notable efficiency, especially in the 4A climate zone (Baltimore), where it achieves substantial energy savings. Applying the SUPLR algorithm in a multi-chiller setup with four chillers in this zone leads to an estimated 24.5 % reduction in energy usage, equivalent to 183 MW annually. The research indicates that a range of 3 to 5 chillers is typically optimal for most climate zones. In-depth analysis in the 4A climate zone highlights the importance of minimizing operation hours at low Part Load Ratios (PLR) to ensure that chillers operate at a high Coefficient of Performance (COP). This strategy underscores the potential of well-designed multi-chiller systems to reduce cooling energy demand, particularly in climates with transitional seasons. This study provides an overview of the energy-saving potential of multi-chiller systems, applicable across a variety of climatic scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Topology for Statistical Modeling of Petascale Data

Many commonly used algorithms for mathematical analysis do not scale well enough to accommodate the size or complexity of petascale data produced by computational simulations. The primary goal of this project is to develop new mathematical tools that address both the petascale size and uncertain nature of current data. At a high level, the approach of the entire team involving all three institutions is based on the complementary techniques of combinatorial topology and statistical modelling. In particular, we use combinatorial topology to filter out spurious data that would otherwise skew statistical modelling techniques, and we employ advanced algorithms from algebraic statistics to efficiently find globally optimal fits to statistical models. The overall technical contributions can be divided loosely into three categories: (1) advances in the field of combinatorial topology, (2) advances in statistical modelling, and (3) new integrated topological and statistical methods. Roughly speaking, the division of labor between our 3 groups (Sandia Labs in Livermore, Texas A&M in College Station, and U Utah in Salt Lake City) is as follows: the Sandia group focuses on statistical methods and their formulation in algebraic terms, and finds the application problems (and data sets) most relevant to this project, the Texas A&M Group develops new algebraic geometry algorithms, in particular with fewnomial theory, and the Utah group develops new algorithms in computational topology via Discrete Morse Theory. However, we hasten to point out that our three groups stay in tight contact via videconference every 2 weeks, so there is much synergy of ideas between the groups. The following of this document is focused on the contributions that had grater direct involvement from the team at the University of Utah in Salt Lake City.

97 MATHEMATICS AND COMPUTING↗

Implementing and Benchmarking the Locally Competitive Algorithm on the Loihi 2 Neuromorphic Processor

Neuromorphic processors have garnered considerable interest in recent years for their potential in enabling energy-efficient and high-speed computing. The Locally Competative Algorithm (LCA) has been utilized for power efficient sparse coding on neuromophic processors, including the first Loihi processor \cite{appletospikes, loihi1}. With the Loihi 2 processor enabling custom neuron models and graded spike communication, more complex implementations of LCA are possible \cite{loihi2}. We present a new implementation of LCA designed for the Loihi 2 processor and perform an initial set of benchmarks comparing it to LCA on CPU and GPU devices. In these experiments LCA on Loihi 2 is faster and orders of magnitude more efficient, while maintaining similar reconstruction quality. We find this performance improvement increases as the LCA parameters are tuned towards greater representation sparsity. Our study highlights the potential of neuromorphic processors, particularly Loihi 2, in enabling intelligent,autonomous, real-time processing on small robots, satellite where there are strict SWaP (small, lightweighr, and low-power) requirement. By demonstrating the superior performance of LCA on Loihi 2 compared to conventional computing device, our study suggests that Loihi 2 could be a valuable tool in advancing these types of applications. Overall, our study highlights the potential of neuromorphic processors for efficient and accurate data processing on resource-constrained devices.

Parpart, Gavin G.↗

Modeling laser wakefield accelerators in a Lorentz boosted frame

Modeling of laser-plasma wakefield accelerators in an optimal frame of reference is shown to produce orders of magnitude speed-up of calculations from first principles. Obtaining these speedups requires mitigation of a high-frequency instability that otherwise limits effectiveness in addition to solutions for handling data input and output in a relativistically boosted frame of reference. The observed high-frequency instability is mitigated using methods including an electromagnetic solver with tunable coefficients, its extension to accomodate Perfectly Matched Layers and Friedman's damping algorithms, as well as an efficient large bandwidth digital filter. It is shown that choosing the frame of the wake as the frame of reference allows for higher levels of filtering and damping than is possible in other frames for the same accuracy. Detailed testing also revealed serendipitously the existence of a singular time step at which the instability level is minimized, independently of numerical dispersion, thus indicating that the observed instability may not be due primarily to Numerical Cerenkov as has been conjectured. The techniques developed for Cerenkov mitigation prove nonetheless to be very efficient at controlling the instability. Using these techniques, agreement at the percentage level is demonstrated between simulations using different frames of reference, with speedups reaching two orders of magnitude for a 0.1 GeV class stages. The method then allows direct and efficient full-scale modeling of deeply depleted laser-plasma stages of 10 GeV-1 TeV for the first time, verifying the scaling of plasma accelerators to very high energies. Over 4, 5 and 6 orders of magnitude speedup is achieved for the modeling of 10 GeV, 100 GeV and 1 TeV class stages, respectively.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling laser wakefield accelerators in a Lorentz boosted frame

Modeling of laser-plasma wakefield accelerators in an optimal frame of reference [1] is shown to produce orders of magnitude speed-up of calculations from first principles. Obtaining these speedups requires mitigation of a high frequency instability that otherwise limits effectiveness in addition to solutions for handling data input and output in a relativistically boosted frame of reference. The observed high-frequency instability is mitigated using methods including an electromagnetic solver with tunable coefficients, its extension to accomodate Perfectly Matched Layers and Friedman's damping algorithms, as well as an efficient large bandwidth digital filter. It is shown that choosing theframe of the wake as the frame of reference allows for higher levels of filtering and damping than is possible in other frames for the same accuracy. Detailed testing also revealed serendipitously the existence of a singular time step at which the instability level is minimized, independently of numerical dispersion, thus indicating that the observed instability may not be due primarily to Numerical Cerenkov as has been conjectured. The techniques developed for Cerenkov mitigation prove nonetheless to be very efficient at controlling the instability. Using these techniques, agreement at the percentage level is demonstrated between simulations using different frames of reference, with speedups reaching two orders of magnitude for a 0.1 GeV class stages. The method then allows direct and efficient full-scale modeling of deeply depleted laser-plasma stages of 10 GeV-1 TeV for the first time, verifying the scaling of plasma accelerators to very high energies. Over 4, 5 and 6 orders of magnitude speedup is achieved for the modeling of 10 GeV, 100 GeV and 1 TeV class stages, respectively.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Accelerated Cartesian expansions for the rapid solution of periodic multiscale problems

We present an algorithm for the fast and efficient solution of integral equations that arise in the analysis of scattering from periodic arrays of PEC objects, such as multiband frequency selective surfaces (FSS) or metamaterial structures. Our approach relies upon the method of Accelerated Cartesian Expansions (ACE) to rapidly evaluate the requisite potential integrals. ACE is analogous to FMM in that it can be used to accelerate the matrix vector product used in the solution of systems discretized using MoM. Here, ACE provides linear scaling in both CPU time and memory. Details regarding the implementation of this method within the context of periodic systems are provided, as well as results that establish error convergence and scalability. In addition, we also demonstrate the applicability of this algorithm by studying several exemplary electrically dense systems.

97 MATHEMATICS AND COMPUTING↗

A computationally efficient ductile damage model accounting for nucleation and micro-inertia at high triaxialities

The computational formulation of a micro-mechanical material model for the dynamic failure of ductile metals is presented in this paper. The statistical nature of porosity initiation is accounted for by introducing an arbitrary probability density function which describes the pores nucleation pressures. Each micropore within the representative volume element is modeled as a thick spherical shell made of plastically incompressible material. The treatment of porosity by a distribution of thick-walled spheres also allows for the inclusion of micro-inertia effects under conditions of shock and dynamic loading. The second order ordinary differential equation governing the microscopic porosity evolution is solved with a robust implicit procedure. A new Chebyshev collocation method is employed to approximate the porosity distribution and remapping is used to optimize memory usage. The adaptive approximation of the porosity distribution leads to a reduction of computational time and memory usage of up to two orders of magnitude. Moreover, the proposed model affords consistent performance: changing the nucleation pressure probability density function and/or the applied strain rate does not reduce accuracy or computational efficiency of the material model. The numerical performance of the model and algorithms presented is tested against three problems for high density tantalum: single void, one-dimensional uniaxial strain, and two-dimensional plate impact. Here, the results using the integration and algorithmic advances suggest a significant improvement in computational efficiency and accuracy over previous treatments for dynamic loading conditions.

42 ENGINEERING↗

Techno-Economic Analysis of Recuperated Joule-Brayton Pumped Thermal Energy Storage

This article describes a techno-economic model for pumped thermal energy storage systems based on recuperated Joule-Brayton cycles and two-tank liquid storage. Models have been developed for each component, with particular emphasis on the heat exchangers. Economic metrics such as the power and energy capital costs (i.e., per-kW and per-kWh capacity) and levelized cost of storage are evaluated by gathering numerous cost correlations from the literature, thereby enabling estimates of uncertainty. It is found that the use of heat exchangers with effectivenesses up to 0.95 is economically worthwhile, but higher values lead to rapidly escalating component size and system cost. Several hot storage fluids are considered; those operating at the highest temperatures (chloride salts) improve the round-trip efficiency but the benefit is marginal and may not warrant the additional material costs and risk when compared to lower-temperature nitrate salts. Cost-efficiency trade-offs are explored using a multi-objective optimization algorithm, yielding optimal designs with round-trip efficiencies in the range 59-72% and corresponding levelized storage costs of 0.12 0.03 and 0.38 0.10 $/kWhe. Lifetime costs are competitive with lithium-ion batteries for discharging durations greater than 6 h under current scenarios.

Carnot battery↗

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]↗

Robust Spectral Unmixing of Sparse Multispectral Lidar Waveforms using Gamma Markov Random Fields

Here, this paper presents a new Bayesian spectral un-mixing algorithm to analyse remote scenes sensed via sparse multispectral Lidar measurements. To a first approximation, in the presence of a target, each Lidar waveform consists of a main peak, whose position depends on the target distance and whose amplitude depends on the wavelength of the laser source considered (i.e, on the target reflectivity). Besides, these temporal responses are usually assumed to be corrupted by Poisson noise in the low photon count regime. When considering multiple wavelengths, it becomes possible to use spectral information in order to identify and quantify the main materials in the scene, in addition to estimation of the Lidar-based range profiles. Due to its anomaly detection capability, the proposed hierarchical Bayesian model, coupled with an efficient Markov chain Monte Carlo algorithm, allows robust estimation of depth images together with abundance and outlier maps associated with the observed 3D scene. The proposed methodology is illustrated via experiments conducted with real multispectral Lidar data acquired in a controlled environment. The results demonstrate the possibility to unmix spectral responses constructed from extremely sparse photon counts (less than 10 photons per pixel and band).

97 MATHEMATICS AND COMPUTING↗

Hierarchical Optimal Power Flow with Improved Gradient Evaluation

Existing algorithms to solve alternating-current optimal power flow (AC-OPF) often exploit linear approximations to simplify system models and accelerate computations. In this paper, we improve a recent hierarchical OPF algorithm, which rested on primal-dual gradients evaluated in a linearized distribution power flow model. Specifically, we identify a risk of voltage violation arising from the model linearization, and propose a more accurate gradient evaluation method to eliminate that risk. We further develop a hierarchical primal-dual algorithm to solve OPF based on the proposed gradient evaluation method. Numerical results on IEEE networks show that our algorithm can enhance voltage safety with satisfactory computational efficiency.

distributed algorithm↗