SEARCH · Engineering Papers
Results for “computational challenges”
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.
Computational Science Challenges related to the First to High Yield Fusion Research Challenge.
Abstract not provided.
NAS Panel Talk: Quantum Computing - Engineering Challenges and Underlying Technologies.
Abstract not provided.
Additive Manufacturing Challenges for Computational Solid Mechanics.
Abstract not provided.
Extreme Scale Computing Grand Challenge System Software Review.
Abstract not provided.
Extreme-Scale Computing Grand Challenge LDRD: Alignment with DOE Exascale Strategy.
Abstract not provided.
Quantum Computing for High-Energy Physics: State of the Art and Challenges
Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage—namely, a significant (in some cases exponential) speedup of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small-scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models that are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this Roadmap paper, led by CERN, DESY, and IBM, we provide the status of high-energy physics quantum computations and give examples of theoretical and experimental target benchmark applications, which can be addressed in the near future. Having in mind hardware with about 100 qubits capable of executing several thousand two-qubit gates, where possible, we also provide resource estimates for the examples given using error-mitigated quantum computing. The ultimate declared goal of this task force is therefore to trigger further research in the high-energy physics community to develop interesting use cases for demonstrations on near-term quantum computers.
Sparsity Facilitates Chemical-Reaction Selection for Engine Simulations
Analysis of large-scale, realistic models incorporating detailed chemistry can be challenging because each simulation is computationally expensive, and a complete analysis may require many simulations. This paper addresses one such problem of this type, chemical-reaction selection in engine simulations. In this computationally challenging case, it is demonstrated how the important concept of sparsity can facilitate chemical-reaction selection, which is the process of finding the most important chemical reactions for modeling a chemical process. It is difficult to perform accurate reaction selection for engine simulations using realistic models of the chemistry, as each simulation takes processor weeks to complete. We developed a procedure to efficiently accomplish this selection process with a relatively small number of simulations using a form of global sensitivity analysis based on sparse regression. The chemical-reaction selection leads to an analysis of the ignition chemistry as it evolves within the compression-ignition engine simulations and allows for the spatial development of the selected chemical reactions to be studied in detail.
Linear Solver for Electromagnetic Simulation of General Distribution Feeders
High-fidelity electromagnetic transient (EMT) modeling is required for accurate simulation and analysis of power system dynamics in modern distribution feeders. However, the high-fidelity of EMT models often leads to significant computational challenges, particularly in terms of computational resources and simulation time. This paper investigates the development and application of a detailed EMT model for general distribution feeders, with a focus on improving computational efficiency. A direct linear solver is proposed for a bordered block diagonal (BBD) matrix structure commonly encountered in a EMT model of distribution feeders. The solver integrates the Schur complement method with the block tridiagonal matrix algorithm to enhance the computational performance. The proposed solver is validated using the primary feeder of the IEEE 342-node test system, demonstrating its accuracy and efficiency in EMT simulations. Furthermore, the solver’s performance is benchmarked against MATLAB’s built-in linear solvers, showing significant improvements in computation time while maintaining high fidelity and accuracy in simulation results.
Application of performance portability solutions for GPUs and many-core CPUs to track reconstruction kernels
Next generation High-Energy Physics (HEP) experiments are presented with significant computational challenges, both in terms of data volume and processing power. Using compute accelerators, such as GPUs, is one of the promising ways to provide the necessary computational power to meet the challenge. The current programming models for compute accelerators often involve using architecture-specific programming languages promoted by the hardware vendors and hence limit the set of platforms that the code can run on. Developing software with platform restrictions is especially unfeasible for HEP communities as it takes significant effort to convert typical HEP algorithms into ones that are efficient for compute accelerators. Multiple performance portability solutions have recently emerged and provide an alternative path for using compute accelerators, which allow the code to be executed on hardware from different vendors. We apply several portability solutions, such as Kokkos, SYCL, C++17 std::execution::par, Alpaka, and OpenMP/OpenACC, on two mini-apps extracted from the mkFit project: p2z and p2r. These apps include basic kernels for a Kalman filter track fit, such as propagation and update of track parameters, for detectors at a fixed z or fixed r position, respectively. The two mini-apps explore different memory layout formats. We report on the development experience with different portability solutions, as well as their performance on GPUs and many-core CPUs, measured as the throughput of the kernels from different GPU and CPU vendors such as NVIDIA, AMD and Intel.
Application of performance portability solutions for GPUs and many-core CPUs to track reconstruction kernels
Next generation High-Energy Physics (HEP) experiments are presented with significant computational challenges, both in terms of data volume and processing power. Using compute accelerators, such as GPUs, is one of the promising ways to provide the necessary computational power to meet the challenge. The current programming models for compute accelerators often involve using architecture-specific programming languages promoted by the hardware vendors and hence limit the set of platforms that the code can run on. Developing software with platform restrictions is especially unfeasible for HEP communities as it takes significant effort to convert typical HEP algorithms into ones that are efficient for compute accelerators. Multiple performance portability solutions have recently emerged and provide an alternative path for using compute accelerators, which allow the code to be executed on hardware from different vendors. We apply several portability solutions, such as Kokkos, SYCL, C++17 std::execution::par and Alpaka, on two mini-apps extracted from the mkFit project: p2z and p2r. These apps include basic kernels for a Kalman filter track fit, such as propagation and update of track parameters, for detectors at a fixed z or fixed r position, respectively. The two mini-apps explore different memory layout formats. We report on the development experience with different portability solutions, as well as their performance on GPUs and many-core CPUs, measured as the throughput of the kernels from different GPU and CPU vendors such as NVIDIA, AMD and Intel.
Model Order Reduction Algorithm for Estimating the Absorption Spectrum
The ab initio description of the spectral interior of the absorption spectrum poses both a theoretical and computational challenge for modern electronic structure theory. Due to the often spectrally dense character of this domain in the quantum propagator’s eigenspectrum for medium-to-large sized systems, traditional approaches based on the partial diagonalization of the propagator often encounter oscillatory and stagnating convergence. Electronic structure methods which solve the molecular response problem through the solution of spectrally shifted linear systems, such as the complex polarization propagator, offer an alternative approach which is agnostic to the underlying spectral density or domain location. This generality comes at a seemingly high computational cost associated with solving a large linear system for each spectral shift in some discretization of the spectral domain of interest. In this work, we present a novel, adaptive solution to this high computational overhead based on model order reduction techniques via interpolation. Model order reduction reduces the computational complexity of mathematical models and is ubiquitous in the simulation of dynamical systems and control theory. The efficiency and effectiveness of the proposed algorithm in the ab initio prediction of X-ray absorption spectra is demonstrated using a test set of challenging water clusters which are spectrally dense in the neighborhood of the oxygen K-edge. On the basis of a single, user defined tolerance we automatically determine the order of the reduced models and approximate the absorption spectrum up to the given tolerance. We also illustrate that, for the systems studied, the automatically determined model order increases logarithmically with the problem dimension, compared to a linear increase of the number of eigenvalues within the energy window. Furthermore, we observed that the computational cost of the proposed algorithm only scales quadratically with respect to the problem dimension.
Parallel accelerated vector similarity calculations for genomics applications
The surge in availability of genomic data holds promise for enabling determination of genetic causes of observed individual traits, with applications to problems such as discovery of the genetic roots of phenotypes, be they molecular phenotypes such as gene expression or metabolite concentrations, or complex phenotypes such as diseases. However, the growing sizes of these datasets and the quadratic, cubic or higher scaling characteristics of the relevant algorithms pose a serious computational challenge necessitating use of leadership scale computing. In this study we describe a new approach to performing vector similarity metrics calculations, suitable for parallel systems equipped with graphics processing units (GPUs) or Intel Xeon Phi processors. Our primary focus is the Proportional Similarity metric applied to Genome Wide Association Studies (GWAS) and Phenome Wide Association Studies (PheWAS). We describe the implementation of the algorithms on accelerated processors, methods used for eliminating redundant calculations due to symmetries, and techniques for efficient mapping of the calculations to many-node parallel systems. Finally, results are presented demonstrating high per-node performance and parallel scalability with rates of more than five quadrillion (5 × 10 15 ) elementwise comparisons achieved per second on the ORNL Titan system. In a companion paper we describe corresponding techniques applied to calculations of the Custom Correlation Coefficient for comparative genomics applications.
Evidence of Skewness and Sub-Gaussian Character in Temperature-Dependent Distributions of One Million Electronic Excitation Energies in PbS Quantum Dots
Obtaining statistical distributions by sampling a large number of conformations is vital for an accurate description of temperature-dependent properties of chemical systems. However, constructing distributions with 105??106 samples is computationally challenging because of the prohibitively high computational cost of performing rst-principles quantum-mechanical calculations. In this work, we present a new technique called the Eective Stochastic Potential Conguration Interaction Singles (ESP-CIS) method to obtain excitation energies. The ESP-CIS method uses random matrix theory for the construction of an eective stochastic representation of the Fock operator and combines it with linear-response theory. Here, we perform excitation calculations on PbS quantum dots (0.75-1.75 nm) at temperatures of 200-400 K. Results from a total of 15 million excitation energy calculations (1 million samples for each of the three dots at ve dierent temperatures) revealed the distributions to be sub-Gaussian in nature with negative skewness. The distributions progressively became red-shifted with increasing temperature. The study shows that random distortions in structure from the minimum-energy geometry of these quantum dots are more likely to lower the excitation energies.
Quantum Electromagnetic Transients Program
This work devises a quantum electromagnetic transients program (QEMTP) which is the first attempt to tackle the computational challenges in solving EMTP through quantum computing. The main contributions lie in: (1) A quantum-enabled EMTP formulation with Dommel's model encoded in quantum states; 2) An Harrow-Hassidim-Lloyd (HHL)-based QEMTP to solve the discrete-time nodal equations; 3) An iteration-based HHL revision for mitigating temporal errors to achieve high accuracy of QEMTP with limited quantum resources. Case studies verify the correctness and efficacy of QEMTP in simulating both fast and slow dynamics.