Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel 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 145 records · Page 8

Progress Toward Generation of a Navier-Stokes Database for a Harrier in Ground Effect

The Harrier YAV-8B aircraft is capable of vertical and short-field take-off and landing (V/STOL) by directing its four exhaust nozzles toward the ground, or conventional flight by rotating its nozzles into a horizontal position. The British Royal Air Force and the United States Marine Corps have used this aircraft for more than 30 years to provide a quick reaction time for troop support, and reduce the need for long runways. The success of this powered-lift (PL) vehicle has also prompted the more recent design of the Joint Strike Fighter (JSF). However there are significant safety issues that must be addressed when operating a PL vehicle in close proximity to the ground. Hot Gas Ingestion (HGI) by the inlets can result in a rapid loss of powered lift; and high-speed jet flows along the ground plane can induce low pressures underneath the vehicle, causing a 'suck-down' effect. Under these conditions, departure from controlled flight may occur. Moreover, unsteady ground vortices and jet fountains can affect the aircraft,s controllability and its proximity to ground troops. The viscous, time-dependent flow fields of PL vehicles are difficult to accurately and efficiently predict using Computational Fluid Dynamics (CFD). A number of researchers have used the time-dependent Reynolds-averaged Navier-Stokes (RANS) equations to compute flows for single and multiple jets in a cross-flow. A few have added some geometric complexity to the problem by computing flows for jet-augmented delta wings near a ground plane. Smith et.al. computed for the first time a single RANS solution about a simplified Harrier. This geometry included a fuselage, wing, leading edge root extension (LERX), inlets, and exhaust nozzles. All of these investigations cite two practical problems with computing these flows: 1) the need for improved solution accuracy; and, 2) the need for faster solution methods. We view the need for faster solution methods as key to improving the solution accuracy and making this class of computation more routine. One can hardly refine grids, explore the use of advanced turbulence models, and generate databases when it takes weeks of dedicated computer time for a single solution. Chaderjian, Ahmad, Pandya, and Murman have focused on reducing the time-to-solution for this very difficult and complex problem through process automation and exploitation of parallel computing. They began with the Harrier geometry reported, and added a deflected wing flap and empennage for greater realism. To date more than 80 solutions have been carried out. This paper will describe this process and progress made in reducing the time required to generate a simple longitudinal force and moment database for a Harrier in ground effect. It shows a typical snap-shot from an unsteady streakline animation, where fluid particles are colored by temperature. The ground vortex and a jet-fountain vortex are highlighted. It also shows a similar streakline image, where HGI occurs due to the vehicle in close proximity to the ground. It is show the mean lift coefficient as a function of angle of attack and height. The angle of attack range was 4 deg less than or = alpha less than or = 10 deg with an increment of 1 degree, and the height range was 10 ft less than or = h less than or = 30ft with an increment of 5 feet. This 35 solution database was extended to over 2500 cases using a monotone cubic-spline interpolation procedure. The suck-down effect (reduction of lift near the ground) is highlighted in the figure. The "cushion effect," the conventional reduction of lift as the vehicle moves out of ground effect, is also indicated. All 35 RANS solutions were obtained using 952 Silicon Graphics Origin 2000 and 3000 processors in dedicated mode for one week. Typically, 112 processors were assigned to each case. Some other cases used fewer processors to utilize all available CPUS. The final paper will report on the automation of the solution process, including: grid generation, job monitoring, solution completion criteria, and post processing. Moreover, improvements in parallel efficiency for a dual time-step algorithm for the RANS equations will also be presented. Results will be discussed in detail using unsteady streakline flow visualization to correlate unsteady flow structures with dominant aerodynamic frequencies. The stability derivatives, CL, and CL, will also be presented.

Chaderjian, Neal M.↗

A scalable compressible volume of fluid solver using a stratified flow model

Here, in this paper, a Volume of Fluid method which uses a Stratified Flow model for flux calculation is proposed to solve a compressible multiphase flow in a way that has high parallel efficiency. The solver is part of an open-source computing tool to study fuel entrainment and combustion in the application of paraffin-based hybrid rocket motors. This paper focuses on the compressible Volume of Fluid solver for the liquid and gaseous phases in this environment. This solver uses perfect gas and stiffened gas models for equation of state, with the ability to easily add other models as desired. Additionally a comparison of a Riemann solver versus an AUSM+up scheme is conducted, showing improvement with the later in the solution of multiphase flows. This solver successfully reproduces shock tube cases with the expected accuracy, as well as simulating two-dimensional shear and gravity-driven flows. Results also show that the code is able to utilize a Stratified Flow model to evaluate shear flow without the need for interface reconstruction or gradient calculations. Finally, it is shown that the solver has near-ideal scaling under strong scaling tests as well as good performance in static scaling, giving improved performance over current options and implying future advancement of high-performance computing efficiency for multiphase flow solvers.

97 MATHEMATICS AND COMPUTING↗

Fragme∩t: An Open‐Source Framework for Multiscale Quantum Chemistry Based on Fragmentation

Fragment-based quantum chemistry offers a means to circumvent the nonlinear computational scaling of conventional electronic structure calculations, by partitioning a large calculation into smaller subsystems then considering the many-body interactions between them. Variants of this approach have been used to parameterize classical force fields and machine learning potentials, applications that benefit from interoperability between quantum chemistry codes. However, there is a dearth of software that provides interoperability yet is purpose-built to handle the combinatorial complexity of fragment-based calculations. To fill this void we introduce “Fragme∩t”, an open-source software application that provides a tool for community validation of fragment-based methods, a platform for developing new approximations, and a framework for analyzing many-body interactions. Fragme∩t includes algorithms for automatic fragment generation and structure modification, and for distance- and energy-based screening of the requisite subsystems. Checkpointing, database management, and parallelization are handled internally and results are archived in a portable database. Interfaces to various quantum chemistry engines are easy to write and exist already for Q-Chem, PySCF, xTB, Orca, CP2K, MRCC, Psi4, NWChem, GAMESS, and MOPAC. Applications reported here demonstrate parallel efficiencies around 96% on more than 1000 processors but also showcase that the code can handle large-scale protein fragmentation using only workstation hardware, all with a codebase that is designed to be usable by non-experts. Fragme∩t conforms to modern software engineering best practices and is built upon well established technologies including Python, SQLite, and Ray. The source code is available under the Apache 2.0 license.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)↗

An extension to V ORO ++ for multithreaded computation of Voronoi cells

V ORO ++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. V ORO ++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. Further, the multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.

97 MATHEMATICS AND COMPUTING↗

Moments-based interface reconstruction, remap and advection

Here, we present a new moment-of-fluid (MOF 2 ) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to reconstruct a convex material polygon or a union of convex polygons that approximate the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The MOF 2 method allows to exactly reproduce several convex shapes: corners, filaments, and some concave shapes: cell-complements to corners and filaments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. We present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on a variety of meshes. We describe how to perform two-material advection using the MOF 2 method and present the results for the classical advection tests. We also show the examples of material interface remapping needed in the framework of multi-material arbitrary Lagrangian-Eulerian methods, and give a brief description of a procedure that can be used to update the material moments on the Lagrangian stage of those methods.

97 MATHEMATICS AND COMPUTING↗

An adaptive moments-based interface reconstruction using intersection of the cell with one half-plane, two half-planes and a circle

We present a new adaptive moment-of-fluid (A-MOF) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to construct a shape that approximates the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The adaptive method chooses between shapes obtained by the intersection of the cell with one half-plane, two half-planes, or a circle. The A-MOF method allows to exactly reproduce several convex shapes: corners, filaments, and their concave cell-complements; as well as pieces of the circles and its cell-compliments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. In conclusion, we present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on the entire mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A nonhydrostatic formulation for MPAS-Ocean

The Model for Prediction Across Scales-Ocean (MPAS-Ocean) is an open-source, global ocean model and is one component of a family of climate models within the MPAS framework, including atmosphere, sea-ice, and land-ice models. Here, in this work, a new formulation for the ocean model is presented that solves the nonhydrostatic, incompressible Boussinesq equations on an unstructured, staggered, z-level grid. The introduction of this nonhydrostatic capability is necessary for the resolution of internal wave dynamics and large eddy simulations. Compared to the standard, hydrostatic formulation, a nonhydrostatic pressure solver and a vertical momentum equation are added, where the PETSc (Portable Extensible Toolkit for Scientific Computation) library is used for the inversion of a large sparse system for the nonhydrostatic pressure. Numerical results on a stratified seiche, internal solitary wave, overflow and lock-exchange test cases are presented, and the parallel efficiency of the code is evaluated using up to 1024 processors.

3D Poisson equation↗

A nonhydrostatic formulation for MPAS-Ocean

The Model for Prediction Across Scales-Ocean (MPAS-Ocean) is an open-source, global ocean model and is one component of a family of climate models within the MPAS framework, including atmosphere, sea-ice, and land-ice models. Here, in this work, a new formulation for the ocean model is presented that solves the nonhydrostatic, incompressible Boussinesq equations on an unstructured, staggered, z-level grid. The introduction of this nonhydrostatic capability is necessary for the resolution of internal wave dynamics and large eddy simulations. Compared to the standard, hydrostatic formulation, a nonhydrostatic pressure solver and a vertical momentum equation are added, where the PETSc (Portable Extensible Toolkit for Scientific Computation) library is used for the inversion of a large sparse system for the nonhydrostatic pressure. Numerical results on a stratified seiche, internal solitary wave, overflow and lock-exchange test cases are presented, and the parallel efficiency of the code is evaluated using up to 1024 processors.

3D Poisson equation↗

PySpawn: Software for Nonadiabatic Quantum Molecular Dynamics

The ab initio multiple spawning (AIMS) method enables nonadiabatic quantum molecular dynamics simulations in an arbitrary number of dimensions, with potential energy surfaces provided by electronic structure calculations performed on-the-fly. However, the intricacy of the AIMS algorithm complicates software development, deployment on modern shared computer resources, and post-simulation data analysis. PySpawn is a nonadiabatic molecular dynamics software package that addresses these issues. Here, the program is designed to be easily interfaced with electronic structure software, and an interface to the TeraChem software package is described here. PySpawn introduces a task-based reorganization of the AIMS algorithm, allowing fine-grained restart capability and setting the stage for efficient parallelization in a future release. PySpawn includes a user-friendly and interactive Python analysis module that will enable novice users to painlessly adopt AIMS. As a demonstration of PySpawn’s simulation capability and analysis module, we report complete active space self-consistent field–based AIMS simulations of the 1,2- dithienyl-1,2-dicyanoethene molecule, a promising molecular photoswitch.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Massively Parallel Implementation of the CCSD(T) Method Using the Resolution-of-the-Identity Approximation and a Hybrid Distributed/Shared Memory Parallelization Model

In this work, a parallel algorithm is described for the coupled-cluster singles and doubles method augmented with a perturbative correction for triple excitations [CCSD(T)] using the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs). The algorithm bypasses the storage of four-center ERIs by adopting an integral-direct strategy. The CCSD amplitude equations are given in a compact quasi-linear form by factorizing them in terms of amplitude-dressed three-center intermediates. A hybrid MPI/OpenMP parallelization scheme is employed, which uses the OpenMP-based shared memory model for intranode parallelization and the MPI-based distributed memory model for internode parallelization. Parallel efficiency has been optimized for all terms in the CCSD amplitude equations. Two different algorithms have been implemented for the rate-limiting terms in the CCSD amplitude equations that entail and -scaling computational costs, where N O and N V denote the number of correlated occupied and virtual orbitals, respectively. One of the algorithms assembles the four-center ERIs requiring N V 4 and N O 2 N V 2 -scaling memory costs in a distributed manner on a number of MPI ranks, while the other algorithm completely bypasses the assembling of quartic memory-scaling ERIs and thus largely reduces the memory demand. It is demonstrated that the former memory-expensive algorithm is faster on a few hundred cores, while the latter memory-economic algorithm shows a better strong scaling in the limit of a few thousand cores. The program is shown to exhibit a near-linear scaling, in particular for the compute-intensive triples correction step, on up to 8000 cores. The performance of the program is demonstrated via calculations involving molecules with 24–51 atoms and up to 1624 atomic basis functions. As the first application, the complete basis set (CBS) limit for the interaction energy of the π-stacked uracil dimer from the S66 data set has been investigated. This work reports the first calculation of the interaction energy at the CCSD(T)/aug-cc-pVQZ level without local orbital approximation. The CBS limit for the CCSD correlation contribution to the interaction energy was found to be -8.01 kcal/mol, which agrees very well with the value -7.99 kcal/mol reported by Schmitz, Hättig, and Tew [ Phys. Chem. Chem. Phys. 2014 , 16 , 22167-22178]. The CBS limit for the total interaction energy was estimated to be -9.64 kcal/mol.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Energy-Screened Many-Body Expansion for Protein–Ligand Interactions: Examining Convergence for Metalloenzymes Through Seven–Body Interactions

Fragment-based quantum chemistry is a powerful strategy for calculating protein−ligand interaction energies using quantum chemistry methods. Rigorous convergence often requires hundreds of atoms in the protein binding-site model, especially if that model is constructed using distance-based criteria to select amino acid residues, while three- and four-body calculations exhibit instability related to combinatorial proliferation in the number of subsystem calculations. Here, we report an energy-based screening protocol for the many-body expansion applied to protein−ligand interactions, implemented in the open-source FRAGME∩T code. Using a combination of aggressive screening based on semiempirical quantum chemistry, with an improved graph-theoretical algorithm to eliminate unimportant subsystems, we are able to perform n-body calculations up to n = 7 using density functional theory in triple-ζ basis sets. Distance cutoffs further reduce the cost without compromising accuracy. Rapid and stable convergence of the many-body expansion is obtained by n = 4, for a pair of metalloenzymes in which a divalent ion coordinates directly to the ligand. As compared to previous results that relied solely on distance cutoffs, oscillations in the n-body corrections are reduced or eliminated, although residual errors remain in one case. This work demonstrates that benchmark-quality protein−ligand interaction energies can be systematically converged using a method with excellent parallel efficiency and scalability.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Monte Carlo Explicitly Correlated Second-Order Many-Body Green’s Function Calculations of Semiconductor Band Gaps

A systematically converging series of ab initio, post-density-functional, size-consistent, electron-correlated approximations is desired for predictive computing of felectronic band structures of insulating, semiconducting, and metallic solids. A series that meets all of these desiderata (except the applicability to metals) is ab initio many-body Green's function theory based on Gaussian-type-orbital (GTO) basis sets. Here, its leading-order approximation, the second-order Green's function (GF2) method in the diagonal and frequency-independent approximations with the aug-cc-pVDZ basis set, is applied to the fundamental band gaps of three semiconductors (diamond, silicon, and silicon carbide in the zincblende structure) using cluster models. Corrections are made to the basis-set-incompleteness errors by the explicit-correlation (F12) ansatz (GF2-F12) for the valence band edges. The crystals are modeled as surface-passivated clusters of increasing sizes, whose wave functions are expanded by up to 2709 GTO basis functions. Immense computational costs of these calculations are overcome by the highly scalable stochastic algorithm of the Monte Carlo GF2-F12 method, whose operation cost per state increases only as a cubic power of system size, which has a tiny memory footprint and easily achieves near-perfect parallel efficiency on thousands of CPUs or on hundreds of GPUs. The correlated, F12-corrected highest-occupied and lowest-unoccupied molecular-orbital energy (HOMO-LUMO) gap is 5.78 ± 0.07 eV for C 87 H 76 as compared with the experimental value of the fundamental (indirect) band gap of bulk diamond at 5.48 eV. The correlated, F12-corrected HOMO-LUMO gaps for Si 75 H 76 and Si 32 C 43 H 76 are 2.56 ± 0.15 eV and 3.50 ± 0.12 eV, respectively, which are expected to decrease further with increasing cluster sizes. As a result, the experimental fundamental (indirect) band gaps of bulk silicon and silicon carbide are 1.17 eV and 2.42 eV, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Training data selection for accuracy and transferability of interatomic potentials

Abstract Advances in machine learning (ML) have enabled the development of interatomic potentials that promise the accuracy of first principles methods and the low-cost, parallel efficiency of empirical potentials. However, ML-based potentials struggle to achieve transferability, i.e., provide consistent accuracy across configurations that differ from those used during training. In order to realize the promise of ML-based potentials, systematic and scalable approaches to generate diverse training sets need to be developed. This work creates a diverse training set for tungsten in an automated manner using an entropy optimization approach. Subsequently, multiple polynomial and neural network potentials are trained on the entropy-optimized dataset. A corresponding set of potentials are trained on an expert-curated dataset for tungsten for comparison. The models trained to the entropy-optimized data exhibited superior transferability compared to the expert-curated models. Furthermore, the models trained to the expert-curated set exhibited a significant decrease in performance when evaluated on out-of-sample configurations.

36 MATERIALS SCIENCE↗

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗

TurboRVB: A many-body toolkit for ab initio electronic simulations by quantum Monte Carlo

TurboRVB is a computational package for ab initio Quantum Monte Carlo (QMC) simulations of both molecular and bulk electronic systems. The code implements two types of well established QMC algorithms: Variational Monte Carlo (VMC) and diffusion Monte Carlo in its robust and efficient lattice regularized variant. A key feature of the code is the possibility of using strongly correlated many-body wave functions (WFs), capable of describing several materials with very high accuracy, even when standard mean-field approaches [e.g., density functional theory (DFT)] fail. The electronic WF is obtained by applying a Jastrow factor, which takes into account dynamical correlations, to the most general mean-field ground state, written either as an antisymmetrized geminal power with spin-singlet pairing or as a Pfaffian, including both singlet and triplet correlations. This WF can be viewed as an efficient implementation of the so-called resonating valence bond (RVB) Ansatz, first proposed by Pauling and Anderson in quantum chemistry [L. Pauling, The Nature of the Chemical Bond (Cornell University Press, 1960)] and condensed matter physics [P.W. Anderson, Mat. Res. Bull 8, 153 (1973)], respectively. The RVB Ansatz implemented in TurboRVB has a large variational freedom, including the Jastrow correlated Slater determinant as its simplest, but nontrivial case. Moreover, it has the remarkable advantage of remaining with an affordable computational cost, proportional to the one spent for the evaluation of a single Slater determinant. Therefore, its application to large systems is computationally feasible. The WF is expanded in a localized basis set. Several basis set functions are implemented, such as Gaussian, Slater, and mixed types, with no restriction on the choice of their contraction. The code implements the adjoint algorithmic differentiation that enables a very efficient evaluation of energy derivatives, comprising the ionic forces. Thus, one can perform structural optimizations and molecular dynamics in the canonical NVT ensemble at the VMC level. For the electronic part, a full WF optimization (Jastrow and antisymmetric parts together) is made possible, thanks to state-of-the-art stochastic algorithms for energy minimization. In the optimization procedure, the first guess can be obtained at the mean-field level by a built-in DFT driver. The code was efficiently parallelized by using a hybrid MPI-OpenMP protocol, which is also an ideal environment for exploiting the computational power of modern Graphics Processing Unit accelerators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Stochastic evaluation of fourth-order many-body perturbation energies

A scalable, stochastic algorithm evaluating the fourth-order many-body perturbation (MP4) correction to energy is proposed. Three hundred Goldstone diagrams representing the MP4 correction are computer generated and then converted into algebraic formulas expressed in terms of Green’s functions in real space and imaginary time. They are evaluated by the direct (i.e., non-Markov, non-Metropolis) Monte Carlo (MC) integration accelerated by the redundant-walker and control-variate algorithms. The resulting MC-MP4 method is efficiently parallelized and is shown to display O(n 5.3 ) size-dependence of cost, which is nearly two ranks lower than the O(n 7 ) dependence of the deterministic MP4 algorithm. Furthermore, it evaluates the MP4/aug-cc-pVDZ energy for benzene, naphthalene, phenanthrene, and corannulene with the statistical uncertainty of 10 mE h (1.1% of the total basis-set correlation energy), 38 mE h (2.6%), 110 mE h (5.5%), and 280 mE h (9.0%), respectively, after about 10 9 MC steps.

74 ATOMIC AND MOLECULAR PHYSICS↗

GPU acceleration of rank-reduced coupled-cluster singles and doubles

Here, we have developed a graphical processing unit (GPU) accelerated implementation of our recently introduced rank-reduced coupled-cluster singles and doubles (RR-CCSD) method. RR-CCSD introduces a low-rank approximation of the doubles amplitudes. This is combined with a low-rank approximation of the electron repulsion integrals via Cholesky decomposition. The result of these two low-rank approximations is the replacement of the usual fourth-order CCSD tensors with products of second- and third-order tensors. In our implementation, only a single fourth-order tensor must be constructed as an intermediate during the solution of the amplitude equations. Owing in large part to the compression of the doubles amplitudes, the GPU-accelerated implementation shows excellent parallel efficiency (95% on eight GPUs). Our implementation can solve the RR-CCSD equations for up to 400 electrons and 1550 basis functions—roughly 50% larger than the largest canonical CCSD computations that have been performed on any hardware. In addition to increased scalability, the RR-CCSD computations are faster than the corresponding CCSD computations for all but the smallest molecules. We test the accuracy of RR-CCSD for a variety of chemical systems including up to 1000 basis functions and determine that accuracy to better than 0.1% error in the correlation energy can be achieved with roughly 95% compression of the ov space for the largest systems considered. We also demonstrate that conformational energies can be predicted to be within 0.1 kcal mol -1 with efficient compression applied to the wavefunction. Finally, we find that low-rank approximations of the CCSD doubles amplitudes used in the similarity transformation of the Hamiltonian prior to a conventional equation-of-motion CCSD computation will not introduce significant errors (on the order of a few hundredths of an electronvolt) into the resulting excitation energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗