Related Experiment Video
Updated: May 25, 2026

06:01
Transcranial Direct Current Stimulation for Online Gamers
Published on: November 9, 2019
Recent performance improvements to the DFT and TDDFT in GAMESS
Michael E Lasinski1, Nichols A Romero, Shawn T Brown
1High Performance Technologies, Inc., Reston, Virginia 20190, USA. mlasinski@hpti.com
Journal of Computational Chemistry
|January 14, 2012
Summary
Optimizing the GAMESS quantum chemistry package for density functional theory (DFT) and time-dependent DFT (TDDFT) calculations significantly reduces computational time. These improvements enhance the efficiency of molecular modeling for the materials science community.
Area of Science:
- Computational Chemistry
- Materials Science
- Quantum Mechanics
Background:
- The General Atomic and Molecular Electronic Structure System (GAMESS) is a widely used quantum chemistry package.
- Density Functional Theory (DFT) and Time-Dependent DFT (TDDFT) are crucial for molecular modeling.
- High-performance computing resources are extensively utilized for GAMESS calculations, demanding efficient solutions.
Purpose of the Study:
- To identify and implement performance improvements in the GAMESS software.
- To reduce the time-to-solution for DFT and TDDFT calculations.
- To enhance the efficiency of complex molecular system modeling.
Main Methods:
- Optimization of the exchange-correlation (XC) integration grid.
- Profiling and optimization of the core DFT code.
- Parallelization of TDDFT calculations.
Main Results:
- Substantial reductions in computational time for DFT and TDDFT methods.
- Improved performance metrics for the GAMESS quantum chemistry package.
- Successful implementation of identified software enhancements.
Conclusions:
- The implemented software enhancements lead to significant performance gains in GAMESS.
- These optimizations contribute to considerable savings in CPU hours for computational chemistry tasks.
- The improved GAMESS versions are readily available for the materials modeling community.
Related Concept Videos
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
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...
Properties of DTFT I
In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
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]...
For a discrete-time periodic signal x[n]...
Properties of DTFT II
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
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...
One of the notable...

