Related Experiment Video
Updated: Feb 7, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
402
Efficient all-electron periodic Fourier-transformed Coulomb method.
Hieu Q Dinh1, Adam Rettig1, Xintian Feng2
1Department of Chemistry and Chemical Biology, Harvard University, Cambridge, Massachusetts 02138, USA.
The Journal of Chemical Physics
|February 6, 2026
Summary
We developed an efficient algorithm for all-electron periodic Coulomb matrix construction, significantly speeding up solid-state calculations. This method enhances density functional theory (DFT) for materials science research.
Area of Science:
- Computational Chemistry
- Materials Science
- Solid-State Physics
Background:
- Accurate calculation of Coulomb matrices is crucial for electronic structure methods.
- Existing methods for periodic systems face computational challenges, especially with all-electron basis sets.
- Efficient algorithms are needed to handle large-scale solid-state density functional theory (DFT) calculations.
Purpose of the Study:
- To develop an efficient algorithm for constructing all-electron periodic Coulomb matrices.
- To enable faster and more accurate DFT calculations for solid-state systems.
- To improve the computation of cohesive and adsorption energies.
Main Methods:
- Combined Ewald summation with the Fourier-transformed Coulomb method.
- Utilized Gaussian density fitting for short-range interactions.
- Introduced an integral-direct plane wave density fitting scheme for long-range interactions.
- Applied dispersion-corrected PBE functional with all-electron basis sets.
Main Results:
- Achieved orders-of-magnitude speedups compared to range-separated density fitting.
- Successfully computed cohesive energy of benzene crystal and CO adsorption on MgO(001).
- Obtained results in good agreement with existing literature.
Conclusions:
- The new algorithm enables efficient Gaussian-based semi-local DFT calculations.
- Facilitates the use of dense k-point meshes and traditional molecular Gaussian basis sets.
- Paves the way for more extensive computational studies in solid-state chemistry and physics.
Related Concept Videos
Fast Fourier Transform
952
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...
952
Properties of Fourier Transform I
671
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
671
Properties of Fourier Transform II
782
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
782
Discrete Fourier Transform
913
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...
913
Basic signals of Fourier Transform
955
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
955
Continuous -time Fourier Transform
918
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
918

