Deterministic/Fragmented-Stochastic Exchange for Large-Scale Hybrid DFT Calculations.

Nadine C Bradbury1, Tucker Allen1, Minh Nguyen1

  • 1Department of Chemistry and Biochemistry, University of California, Los Angeles, California 90095, United States.

Summary

We present an efficient method for calculating exact exchange in large molecular systems using generalized Kohn-Sham-density functional theory (GKS-DFT). This approach enables accurate computation of long-range exchange, crucial for understanding electronic properties.

Related Concept Videos

Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

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]...
277
Discrete Fourier Transform01:15

Discrete Fourier Transform

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...
295
Fast Fourier Transform01:10

Fast Fourier Transform

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
340
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
333
Hybridization of Atomic Orbitals I03:24

Hybridization of Atomic Orbitals I

The mathematical expression known as the wave function, ψ, contains information about each orbital and the wavelike properties of electrons in an isolated atom. When atoms are bound together in a molecule, the wave functions combine to produce new mathematical descriptions that have different shapes. This process of combining the wave functions for atomic orbitals is called hybridization and is mathematically accomplished by the linear combination of atomic orbitals. The new orbitals that...
47.1K
Valence Bond Theory and Hybridized Orbitals02:38

Valence Bond Theory and Hybridized Orbitals

According to valence bond theory, a covalent bond results when: (1) an orbital on one atom overlaps an orbital on a second atom, and (2) the single electrons in each orbital combine to form an electron pair. The strength of a covalent bond depends on the extent of overlap of the orbitals involved. Maximum overlap is possible when the orbitals overlap on a direct line between the two nuclei.
A σ bond (single bond in a Lewis structure) is a covalent bond in which the electron density is...
19.4K