Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 5 de 5
Filtrar
Mais filtros










Base de dados
Intervalo de ano de publicação
1.
J Chem Phys ; 148(2): 024103, 2018 Jan 14.
Artigo em Inglês | MEDLINE | ID: mdl-29331116

RESUMO

A new implementation of vibrational coupled-cluster (VCC) theory is presented, where all amplitude tensors are represented in the canonical polyadic (CP) format. The CP-VCC algorithm solves the non-linear VCC equations without ever constructing the amplitudes or error vectors in full dimension but still formally includes the full parameter space of the VCC[n] model in question resulting in the same vibrational energies as the conventional method. In a previous publication, we have described the non-linear-equation solver for CP-VCC calculations. In this work, we discuss the general algorithm for evaluating VCC error vectors in CP format including the rank-reduction methods used during the summation of the many terms in the VCC amplitude equations. Benchmark calculations for studying the computational scaling and memory usage of the CP-VCC algorithm are performed on a set of molecules including thiadiazole and an array of polycyclic aromatic hydrocarbons. The results show that the reduced scaling and memory requirements of the CP-VCC algorithm allows for performing high-order VCC calculations on systems with up to 66 vibrational modes (anthracene), which indeed are not possible using the conventional VCC method. This paves the way for obtaining highly accurate vibrational spectra and properties of larger molecules.

2.
J Chem Phys ; 146(8): 084102, 2017 Feb 28.
Artigo em Inglês | MEDLINE | ID: mdl-28249419

RESUMO

We present an integration scheme for optimizing the orbitals in numerical electronic structure calculations on general molecules. The orbital optimization is performed by integrating the Helmholtz kernel in the double bubble and cube basis, where bubbles represent the steep part of the functions in the vicinity of the nuclei, whereas the remaining cube part is expanded on an equidistant three-dimensional grid. The bubbles' part is treated by using one-center expansions of the Helmholtz kernel in spherical harmonics multiplied with modified spherical Bessel functions of the first and second kinds. The angular part of the bubble functions can be integrated analytically, whereas the radial part is integrated numerically. The cube part is integrated using a similar method as we previously implemented for numerically integrating two-electron potentials. The behavior of the integrand of the auxiliary dimension introduced by the integral transformation of the Helmholtz kernel has also been investigated. The correctness of the implementation has been checked by performing Hartree-Fock self-consistent-field calculations on H2, H2O, and CO. The obtained energies are compared with reference values in the literature showing that an accuracy of 10-4 to 10-7 Eh can be obtained with our approach.

3.
J Chem Theory Comput ; 13(2): 654-665, 2017 Feb 14.
Artigo em Inglês | MEDLINE | ID: mdl-28094984

RESUMO

A grid-based fast multipole method (GB-FMM) for optimizing three-dimensional (3D) numerical molecular orbitals in the bubbles and cube double basis has been developed and implemented. The present GB-FMM method is a generalization of our recently published GB-FMM approach for numerically calculating electrostatic potentials and two-electron interaction energies. The orbital optimization is performed by integrating the Helmholtz kernel in the double basis. The steep part of the functions in the vicinity of the nuclei is represented by one-center bubbles functions, whereas the remaining cube part is expanded on an equidistant 3D grid. The integration of the bubbles part is treated by using one-center expansions of the Helmholtz kernel in spherical harmonics multiplied with modified spherical Bessel functions of the first and second kind, analogously to the numerical inward and outward integration approach for calculating two-electron interaction potentials in atomic structure calculations. The expressions and algorithms for massively parallel calculations on general purpose graphics processing units (GPGPU) are described. The accuracy and the correctness of the implementation has been checked by performing Hartree-Fock self-consistent-field calculations (HF-SCF) on H2, H2O, and CO. Our calculations show that an accuracy of 10-4 to 10-7 Eh can be reached in HF-SCF calculations on general molecules.

4.
J Chem Theory Comput ; 11(5): 2053-62, 2015 May 12.
Artigo em Inglês | MEDLINE | ID: mdl-26574409

RESUMO

We present a GPGPU implementation of the construction of the Fock matrix in the molecular orbital basis using the fully numerical, grid-based bubbles representation. For a test set of molecules containing up to 90 electrons, the total Hartree-Fock energies obtained from reference GTO-based calculations are reproduced within 10(-4) Eh to 10(-8) Eh for most of the molecules studied. Despite the very large number of arithmetic operations involved, the high performance obtained made the calculations possible on a single Nvidia Tesla K40 GPGPU card.

5.
Phys Chem Chem Phys ; 17(47): 31480-90, 2015 Dec 21.
Artigo em Inglês | MEDLINE | ID: mdl-26006111

RESUMO

Algorithms and working expressions for a grid-based fast multipole method (GB-FMM) have been developed and implemented. The computational domain is divided into cubic subdomains, organized in a hierarchical tree. The contribution to the electrostatic interaction energies from pairs of neighboring subdomains is computed using numerical integration, whereas the contributions from further apart subdomains are obtained using multipole expansions. The multipole moments of the subdomains are obtained by numerical integration. Linear scaling is achieved by translating and summing the multipoles according to the tree structure, such that each subdomain interacts with a number of subdomains that are almost independent of the size of the system. To compute electrostatic interaction energies of neighboring subdomains, we employ an algorithm which performs efficiently on general purpose graphics processing units (GPGPU). Calculations using one CPU for the FMM part and 20 GPGPUs consisting of tens of thousands of execution threads for the numerical integration algorithm show the scalability and parallel performance of the scheme. For calculations on systems consisting of Gaussian functions (α = 1) distributed as fullerenes from C20 to C720, the total computation time and relative accuracy (ppb) are independent of the system size.

SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA
...