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,621 records · Page 90

Boundary coefficient determination for an eddy current problem based on the potential field method

We study a recovery problem for an unknown boundary coefficient relating to one material characteristic in an eddy current field. The field equations are represented in terms of the potential field method (T-ψ method) and can be solved numerically by the nodal finite element method. We introduce a measurement as an additional condition and prove the existence and uniqueness of the weak solution. Further, we present an iteration algorithm for the recovery problem and validate its efficiency by two numerical experiments.

97 MATHEMATICS AND COMPUTING↗

TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze

Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored variational quantum eigensolver), which iteratively builds up variational a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled- gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware. Published by the American Physical Society 2024

Anastasiou, Panagiotis G. (ORCID:0000000256601791)↗

A physics-motivated Centroidal Voronoi Particle domain decomposition method

In this paper, we propose a novel domain decomposition method for large-scale simulations in continuum mechanics by merging the concepts of Centroidal Voronoi Tessellation (CVT) and Voronoi Particle dynamics (VP). The CVT is introduced to achieve a high-level compactness of the partitioning subdomains by the Lloyd algorithm which monotonically decreases the CVT energy. The number of computational elements between neighboring partitioning subdomains, which scales the communication effort for parallel simulations, is optimized implicitly as the generated partitioning subdomains are convex and simply connected with small aspect-ratios. Moreover, Voronoi Particle dynamics employing physical analogy with a tailored equation of state is developed, which relaxes the particle system towards the target partition with good load balance. Since the equilibrium is computed by an iterative approach, the partitioning subdomains exhibit locality and the incremental property. Numerical experiments reveal that the proposed Centroidal Voronoi Particle (CVP) based algorithm produces high-quality partitioning with high efficiency, independently of computational-element types. Thus it can be used for a wide range of applications in computational science and engineering.

97 MATHEMATICS AND COMPUTING↗

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids: Preprint

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for real time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗

High Performance Computing - Power Application Programming Interface Specification

Achieving practical exascale supercomputing will require massive increases in energy efficiency. The bulk of this improvement will likely be derived from hardware advances such as improved semiconductor device technologies and tighter integration, hopefully resulting in more energy efficient computer architectures. Still, software will have an important role to play. With every generation of new hardware, more power measurement and control capabilities are exposed. Many of these features require software involvement to maximize feature benefits. This trend will allow algorithm designers to add power and energy efficiency to their optimization criteria. Similarly, at the system level, opportunities now exist for energy-aware scheduling to meet external utility constraints such as time of day cost charging and power ramp rate limitations. Finally, future architectures might not be able to operate all components at full capability for a range of reasons including temperature considerations or power delivery limitations. Software will need to make appropriate choices about how to allocate the available power budget given many, sometimes conflicting considerations.

97 MATHEMATICS AND COMPUTING↗

Error Convergence Characterization for Stochastic Transport Methods

There has been increased interest in reliably and efficiently solving engineering systems involving uncertainty in recent years. Characterization of the convergence of errors within the problem, including statistical and bias errors, increases confidence that chosen solution methods are appropriate for a particular problem and quantity of interest (QoI), that implementation errors have not been made, and can aid users or algorithms in solving problems within a tolerance efficiently. We demonstrate a method for characterizing error convergence in a simple stochastic transport problem. Though the approach is applicable to problems with more complicated physics, our simple problem enables analytic QoI solutions so that error convergence behavior and the identification of limiting errors can be presented with high precision. A one-dimensional, two-material, neutral-particle, and absorption-only transport problem involving uniformly distributed uncertain total cross sections is presented. Random sampling (RS) and stochastic collocation (SC) are used as stochastic solvers which sample from the uncertain space and Monte Carlo (MC) transport is employed to solve transport results on the resulting realizations. Probability density functions (PDFs) are created using either RS solutions or samples taken from a polynomial chaos expansion (PCE) constructed with SC solutions. The convergence of each solver is characterized with respect to the QoI against analytic solutions, convergence behavior is used to efficiently solve a QoI within a tolerance, and convergence plots are used to identify dominant solution errors.

42 ENGINEERING↗

On the implicit immersed boundary method in coupled discrete element and lattice Boltzmann method

The coupled discrete element method and lattice Boltzmann method (DEMLBM) has increasingly drawn attention of researchers in geomechanics due to its mesoscopic nature since 2000. Immersed boundary method (IBM) and immersed moving boundary (IMB) are two popular schemes for coupling fluid particle in DEMLBM. This work aims at coupling DEM and LBM using the latest IBM algorithm and investigating its accuracy, computational efficiency, and applicability. Two benchmark tests, interstitial fluid flow in an ideal packing and single particle sedimentation in viscous fluid, are carried out to demonstrate the accuracy of IBM through semi-empirical Ergun equation, finite element method (FEM), and IMB. Then, simulations of particle migration with relatively large velocity in Poiseuille flow are utilized to address limitations of IBM in DEMLBM modeling. In addition, advantages and deficiencies of IBM are discussed and compared with IMB. It is found that the accuracy of IBM can be only guaranteed when sufficient boundary points are used and it is not suitable for geomechanical problems involving large fluid or particle velocity.

58 GEOSCIENCES↗

Quantum microgrid state estimation

This paper investigates the feasibility and efficiency of quantum-circuit-based algorithms for microgrid state estimation. Here, our new contributions include: (1) a general quantum state estimation (GQSE) formulation is devised for swing-bus-contained microgrids through the quantized Gaussian–Newton iteration, (2) a preconditioned quantum linear solver (PQLS) is developed for tackling the ill-conditioned GQSE with limited quantum resources, and (3) an enhanced quantum state estimation (EQSE) algorithm is further established for hierarchical-control-based microgrids with exogenous disturbances. Extensive case studies demonstrate the correctness of GQSE, PQLS and EQSE in two typical microgrids. The robustness and convergence performance of EQSE are also verified.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

An enhanced artificial neural network with a shuffled complex evolutionary global optimization with principal component analysis

The classical Back-Propagation (BP) scheme with gradient-based optimization in training Artificial Neural Networks (ANNs) suffers from many drawbacks, such as the premature convergence, and the tendency of being trapped in local optimums. Therefore, as an alternative for the BP and gradient-based optimization schemes, various Evolutionary Algorithms (EAs), i.e., Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Simulated Annealing (SA), and Differential Evolution (DE), have gained popularity in the field of ANN weight training. This study applied a new efficient and effective Shuffled Complex Evolutionary Global Optimization Algorithm with Principal Component Analysis – University of California Irvine (SP-UCI) to the weight training process of a three-layer feed-forward ANN. A large-scale numerical comparison is conducted among the SP-UCI-, PSO-, GA-, SA-, and DE-based ANNs on 17 benchmark, complex, and real-world datasets. Here the results show that SP-UCI-based ANN outperforms other EA-based ANNs in the context of convergence and generalization. Results suggest that the SP-UCI algorithm possesses good potential in support of the weight training of ANN in real-word problems. In addition, the suitability of different kinds of EAs on training ANN is discussed. The large-scale comparison experiments conducted in this paper are fundamental references for selecting proper ANN weight training algorithms in practice.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

The backward phase flow and FBI-transform-based Eulerian Gaussian beams for the Schroedinger equation

We propose the backward phase flow method to implement the Fourier-Bros-Iagolnitzer (FBI)-transform-based Eulerian Gaussian beam method for solving the Schroedinger equation in the semi-classical regime. The idea of Eulerian Gaussian beams has been first proposed in . In this paper we aim at two crucial computational issues of the Eulerian Gaussian beam method: how to carry out long-time beam propagation and how to compute beam ingredients rapidly in phase space. By virtue of the FBI transform, we address the first issue by introducing the reinitialization strategy into the Eulerian Gaussian beam framework. Essentially we reinitialize beam propagation by applying the FBI transform to wavefields at intermediate time steps when the beams become too wide. To address the second issue, inspired by the original phase flow method, we propose the backward phase flow method which allows us to compute beam ingredients rapidly. Numerical examples demonstrate the efficiency and accuracy of the proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

Analysis and compression of six-dimensional gyrokinetic datasets using higher order singular value decomposition

Higher order singular value decomposition (HOSVD) is explored as a tool for analyzing and compressing gyrokinetic data. An efficient numerical implementation of an HOSVD algorithm is described. HOSVD is used to analyze the full six-dimensional (three spatial, two velocity space, and time dimensions) gyrocenter distribution function from gyrokinetic simulations of ion temperature gradient, electron temperature gradient, and trapped electron mode driven turbulence. The HOSVD eigenvalues for the velocity space coordinates decay very rapidly, indicating that only a few structures in velocity space can capture the most important dynamics. In almost all of the cases studied, HOSVD extracts parallel velocity space structures which are very similar to orthogonal polynomials. HOSVD is also used to compress gyrokinetic datasets, an application in which it is shown to significantly outperform the more commonly used singular value decomposition. It is shown that the effectiveness of the HOSVD compression improves as the dimensionality of the dataset increases. (C) 2012 Elsevier Inc. All rights reserved.

equation↗

Regular sensitivity computation avoiding chaotic effects in particle-in-cell plasma methods

Particle-in-cell (PIC) simulation methods are attractive for representing species distribution functions in plasmas. However, as a model, they introduce uncertain parameters, and for quantifying their prediction uncertainty it is useful to be able to assess the sensitivity of a quantity-of-interest (QoI) to these parameters. Such sensitivity information is likewise useful for optimization. However, computing sensitivity for PIC methods is challenging due to the chaotic particle dynamics, and sensitivity techniques remain underdeveloped compared to those for Eulerian discretizations. This challenge is examined from a dual particle–continuum perspective that motivates a new sensitivity discretization. Two routes to sensitivity computation are presented and compared: a direct fully-Lagrangian particle-exact approach provides sensitivities of each particle trajectory, and a new particle-pdf discretization, which is formulated from a continuum perspective but discretized by particles to take the advantages of the same type of Lagrangian particle description leveraged by PIC methods. Since the sensitivity particles in this approach are only indirectly linked to the plasma-PIC particles, they can be positioned and weighted independently for efficiency and accuracy. The corresponding numerical algorithms are presented here in mathematical detail. The advantage of the particle-pdf approach in avoiding the spurious chaotic sensitivity of the particle-exact approach is demonstrated for Debye shielding and sheath configurations. In essence, the continuum perspective makes implicit the distinctness of the particles, which circumvents the Lyapunov instability of the N -body PIC system. The cost of the particle-pdf approach is comparable to the baseline PIC simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards scaling community detection on distributed-memory heterogeneous systems

Distributed multi-GPU systems pose significant challenges and opportunities for efficient execution of parallel applications. Graph algorithms are generally characterized by irregular memory accesses, low computation to communication ratios, and load balancing problems that are especially hard to address on multi-GPU systems. Graph community detection is an important problem in the emerging domain of graph analytics with numerous applications. In this paper, we present our ongoing work on distributed-memory multi-GPU implementation for graph community detection. Our work parallelizes the widely used (albeit serial) Louvain method on distributed multi-GPU platforms. Supported by an extensive set of experiments on a multi-GPU enabled supercomputer (OLCF Summit) and a single compute node (Nvidia DGX-2®), we demonstrate competitive performance to existing distributed-memory CPU-based implementation, and up to 6.5 better results than Nvidia RAPIDS® CUGRAPH. To the best of our knowledge, this work represents the first effort for community detection on distributed multi-GPU systems. Our approach and related findings can be extended to numerous other iterative graph algorithms on multi-GPU systems.

97 MATHEMATICS AND COMPUTING↗

Joint optimization of electric bus charging infrastructure, vehicle scheduling, and charging management

High upfront costs of vehicles and charging infrastructure as well as the lack of knowledge related to infrastructure planning and electric bus system operation are major obstacles to the implementation of battery electric buses (BEBs). To tackle the obstacles and promote BEB adoption, a comprehensive optimization framework was developed to address the combined charging infrastructure planning, vehicle scheduling, and charging management problem for BEB systems, with the goal to minimize the total cost of ownership. The problem was formulated as a mixed-integer non-linear problem. A genetic algorithm-based approach was then proposed to solve the problem. Last, three alternative scenarios based on a sub-transit network in Salt Lake City, Utah, were analyzed and compared with the optimal scenario results in the numerical experiments. Our comparison results demonstrate the effectiveness of the proposed model and solution algorithm in determining a cost-efficient planning strategy for BEB systems.

33 ADVANCED PROPULSION SYSTEMS↗

First-Principles Grand-Canonical Simulations of Water Adsorption in Proton-Exchanged Zeolites

Water appears by design or as impurities in many important reactive systems. For those catalyzed by porous solid acids, such as widely used zeolites, experimentally quantifying the amount or elucidating the structure of adsorbed water clusters at reaction conditions is challenging, while computational studies (e.g., first-principles molecular dynamics simulations) often need to assume the loading to examine solvation effects. Furthermore, we perform first-principles grand-canonical simulations to predict water adsorption to H-ZSM-5 zeolites under specified experimental conditions. Presampling with inexpensive force fields and a pool-based parallelization algorithm are used to improve simulation efficiency, while molecular dynamics is used to sample configurations involving hydronium species. We observe that H + exchange dramatically increases the hydrophilicity of zeolite MFI and an appreciable amount of water is present at very low relative humidities. At all conditions examined, the zeolitic protons are found to dissociate readily from the surface basic sites and become mobile by participating in the hydrogen-bonded chains of adsorbed water molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-hadron states in Lattice QCD spectroscopy

The ability to reliably measure the energy of an excited hadron in Lattice QCD simulations hinges on the accurate determination of all lower-lying energies in the same symmetry channel. These include not only single-particle energies, but also the energies of multi-hadron states. This talk deals with the determination of multi-hadron energies in Lattice QCD. The group-theoretical derivation of lattice interpolating operators that couple optimally to multi-hadron states is described. We briefly discuss recent algorithmic developments which allow for the efficient implementation of these operators in software, and present numerical results from the Hadron Spectrum Collaboration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Analytic energy gradients for the coupled-cluster singles and doubles method with the density-fitting approximation

An efficient implementation is presented for analytic gradients of the coupled-cluster singles and doubles (CCSD) method with the density-fitting approximation, denoted DF-CCSD. Frozen core terms are also included. When applied to a set of alkanes, the DF-CCSD analytic gradients are significantly accelerated compared to conventional CCSD for larger molecules. The efficiency of our DF-CCSD algorithm arises from the acceleration of several different terms, which are designated as the “gradient terms”: computation of particle density matrices (PDMs), generalized Fock-matrix (GFM), solution of the Z-vector equation, formation of the relaxed PDMs and GFM, back-transformation of PDMs and GFM to the atomic orbital (AO) basis, and evaluation of gradients in the AO basis. For the largest member of the alkane set (C{sub 10}H{sub 22}), the computational times for the gradient terms (with the cc-pVTZ basis set) are 2582.6 (CCSD) and 310.7 (DF-CCSD) min, respectively, a speed up of more than 8-folds. For gradient related terms, the DF approach avoids the usage of four-index electron repulsion integrals. Based on our previous study [U. Bozkaya, J. Chem. Phys. 141, 124108 (2014)], our formalism completely avoids construction or storage of the 4-index two-particle density matrix (TPDM), using instead 2- and 3-index TPDMs. The DF approach introduces negligible errors for equilibrium bond lengths and harmonic vibrational frequencies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗