对于DFT计算的最佳小基准集和几何对称性校正
Bun Chan1,2
1Graduate School of Engineering, Nagasaki University, Bunkyo 1-14, Nagasaki 852-8521, Japan.
Journal of chemical theory and computation
|June 8, 2023
概括
我们评估了DFT的基础集和几何对称 (gCP) 校正. 6-31+G(2d) 基数组提供最佳的准确性和效率,需要最小的gCP校正.
科学领域:
- 计算化学的计算化学
- 量子化学 是一个量子化学.
- 理论化学 理论化学
背景情况:
- 密度函数理论 (DFT) 的计算依赖于基础集和诸如几何对称 (gCP) 之类的校正以获得准确性.
- 评估各种基础集和gCP方案的性能对于可靠的计算化学结果至关重要.
研究的目的:
- 评估DFT中具有几何对称 (gCP) 校正的小基准集的性能.
- 引入和验证一个简化的gCP计划,称为统一gCP.
- 为了确定最佳的基础,设置平衡精度和计算成本.
主要方法:
- 系统检查中小规模基础集.
- 原始gCP校正方案和简化单位-gCP方案的应用和评估.
- 开发和测试一个修改的基础集,vDZ+(2d),从vDZP.
主要成果:
- 6-31+G(2d) 基础集显示了精度和计算效率之间的最佳平衡.
- 单位-gCP方案为任意基础集提供了合理的校正.
- 不太平衡的基准集,甚至更大的基准集,可以导致gCP的重大不准确性和过度校正.
- 6-31+G(2d) 基础集显示了小的gCP大小,即使没有修正,也产生了足够的结果.
- 新开发的vDZ+(2d) 基础集通常是对vDZP基础集的改进.
结论:
- 对于需要精度和效率平衡的DFT计算,建议使用6-31+G(2d) 基数组.
- 单位-gCP方案提供了一个基本设置校正的实用方法.
- 对于特定的基准集,需要对gCP进行仔细的验证,以避免过度校正.
- vDZP和vDZ+(2d) 基础集为DFT提供了更大的基础集的高效替代方案.
更多相关视频
08:04Excitonic Hamiltonians for Calculating Optical Absorption Spectra and Optoelectronic Properties of Molecular Aggregates and Solids
Published on: May 27, 2020
8.5K
08:44Measurements of Long-range Electronic Correlations During Femtosecond Diffraction Experiments Performed on Nanocrystals of Buckminsterfullerene
Published on: August 22, 2017
7.8K
相关概念视频
Fast Fourier Transform
404
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
404
Discrete Fourier Transform
337
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
337
Discrete-Time Fourier Series
314
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
314
Crystal Field Theory - Tetrahedral and Square Planar Complexes
43.2K
Tetrahedral Complexes
Crystal field theory (CFT) is applicable to molecules in geometries other than octahedral. In octahedral complexes, the lobes of the dx2−y2 and dz2 orbitals point directly at the ligands. For tetrahedral complexes, the d orbitals remain in place, but with only four ligands located between the axes. None of the orbitals points directly at the tetrahedral ligands. However, the dx2−y2 and dz2 orbitals (along the Cartesian axes) overlap with the ligands less than the dxy,...
Crystal field theory (CFT) is applicable to molecules in geometries other than octahedral. In octahedral complexes, the lobes of the dx2−y2 and dz2 orbitals point directly at the ligands. For tetrahedral complexes, the d orbitals remain in place, but with only four ligands located between the axes. None of the orbitals points directly at the tetrahedral ligands. However, the dx2−y2 and dz2 orbitals (along the Cartesian axes) overlap with the ligands less than the dxy,...
43.2K
Properties of Fourier series II
198
Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
A function f(t) is...
198
NMR Spectrometers: Resolution and Error Correction
740
When magnetic nuclei in a sample achieve resonance and undergo relaxation, the signal detected in NMR is an approximately exponential free induction decay. Fourier transform of an exponential decay yields a Lorentzian peak in the frequency domain. Lorentzian peaks in an NMR spectrum are defined by their amplitude, full width at half maximum, and position, where the peak width is governed by the spin-spin relaxation time alone. In real experiments, however, the applied magnetic field is rendered...
740
