用乘积基函数和计算振动光谱而无需存储全维向量或矩阵
Calculating vibrational spectra with sum of product basis functions without storing full-dimensional vectors or matrices
摘要:
我们提出了一种迭代方法计算振动光谱,显着降低计算的内存成本。它使用直接乘积基元,但不需要存储具有与乘积基函数一样多的分量的向量。波函数表示在一个基础上,其功能是一个总和的产品(SOP)和可因式分解的结构的哈密尔顿被利用。如果SOP基函数的因子被适当地选择,波函数是少量SOP基函数的线性组合。SOP基函数是使用移位块幂方法生成的。这些因子使用秩缩减算法进行细化,以限制SOP基函数中的项数。的想法进行测试的20-D模型哈密顿量和现实CH $_3$ CN(12维)的潜力。对于20维问题,为了使用标准的直积迭代方法,需要存储具有大约$10^{20}$分量的向量,因此需要大约$8 \times 10^{11}$ GB。使用本文的方法,只需要1 GB的内存。CH $_3$ CN的计算结果与以前的计算结果一致。
英文摘要:
We propose an iterative method for computing vibrational spectra that significantly reduces the memory cost of calculations. It uses a direct product primitive basis, but does not require storing vectors with as many components as there are product basis functions. Wavefunctions are represented in a basis each of whose functions is a sum of products (SOP) and the factorizable structure of the Hamiltonian is exploited. If the factors of the SOP basis functions are properly chosen, wavefunctions are linear combinations of a small number of SOP basis functions. The SOP basis functions are generated using a shifted block power method. The factors are refined with a rank reduction algorithm to cap the number of terms in a SOP basis function. The ideas are tested on a 20-D model Hamiltonian and a realistic CH$_3$CN (12 dimensional) potential. For the 20-D problem, to use a standard direct product iterative approach one would need to store vectors with about $10^{20}$ components and would hence require about $8 \times 10^{11}$ GB. With the approach of this paper only 1 GB of memory is necessary. Results for CH$_3$CN agree well with those of a previous calculation on the same potential.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。