Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Fast Fourier Transform01:10

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

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 Series01:20

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]...
314
Crystal Field Theory - Tetrahedral and Square Planar Complexes02:46

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,...
43.2K
Properties of Fourier series II01:21

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...
198
NMR Spectrometers: Resolution and Error Correction01:14

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

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Melt-sintering of MOF glass-2D nanosheet composites for enhanced processability and gas separation performance.

Chemical science·2026
Same author

Filling the Gap of the Heats of Formation for Organophosphorus Species in the NIST Chemistry WebBook with Reliable Quantum-Chemistry Computations.

The journal of physical chemistry. A·2026
Same author

Oxygen Attachment Dissociation of Protonated Reserpine and Its Analogs.

Rapid communications in mass spectrometry : RCM·2026
Same author

XTB Nano-Reactor for Essential Organic Reactions.

Journal of computational chemistry·2025
Same author

Cavity formation energy drives the accumulation of amphiphiles at the air-water interface.

Chemical communications (Cambridge, England)·2025
Same author

Structural Elucidation of Nucleophilic Compounds through Synergistic Coordination and Hydrogen Bonding in a Metal-Organic Framework.

Journal of the American Chemical Society·2025

Related Experiment Video

Updated: Jul 27, 2025

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.2K

Optimal Small Basis Set and Geometric Counterpoise Correction for DFT Computations.

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
PubMed
Summary

We evaluated basis sets and geometric counterpoise (gCP) corrections for DFT. The 6-31+G(2d) basis set offers optimal accuracy and efficiency, with minimal need for gCP corrections.

More Related Videos

Excitonic Hamiltonians for Calculating Optical Absorption Spectra and Optoelectronic Properties of Molecular Aggregates and Solids
08:04

Excitonic Hamiltonians for Calculating Optical Absorption Spectra and Optoelectronic Properties of Molecular Aggregates and Solids

Published on: May 27, 2020

8.5K
Measurements of Long-range Electronic Correlations During Femtosecond Diffraction Experiments Performed on Nanocrystals of Buckminsterfullerene
08:44

Measurements of Long-range Electronic Correlations During Femtosecond Diffraction Experiments Performed on Nanocrystals of Buckminsterfullerene

Published on: August 22, 2017

7.8K

Related Experiment Videos

Last Updated: Jul 27, 2025

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.2K
Excitonic Hamiltonians for Calculating Optical Absorption Spectra and Optoelectronic Properties of Molecular Aggregates and Solids
08:04

Excitonic Hamiltonians for Calculating Optical Absorption Spectra and Optoelectronic Properties of Molecular Aggregates and Solids

Published on: May 27, 2020

8.5K
Measurements of Long-range Electronic Correlations During Femtosecond Diffraction Experiments Performed on Nanocrystals of Buckminsterfullerene
08:44

Measurements of Long-range Electronic Correlations During Femtosecond Diffraction Experiments Performed on Nanocrystals of Buckminsterfullerene

Published on: August 22, 2017

7.8K

Area of Science:

  • Computational Chemistry
  • Quantum Chemistry
  • Theoretical Chemistry

Background:

  • Density Functional Theory (DFT) calculations rely on basis sets and corrections like geometric counterpoise (gCP) for accuracy.
  • Evaluating the performance of various basis sets and gCP schemes is crucial for reliable computational chemistry results.

Purpose of the Study:

  • To assess the performance of small basis sets with geometric counterpoise (gCP) corrections in DFT.
  • To introduce and validate a simplified gCP scheme termed unity-gCP.
  • To identify optimal basis sets balancing accuracy and computational cost.

Main Methods:

  • Systematic examination of small and medium-sized basis sets.
  • Application and evaluation of the original gCP correction scheme and a simplified unity-gCP scheme.
  • Development and testing of a modified basis set, vDZ+(2d), derived from vDZP.

Main Results:

  • The 6-31+G(2d) basis set demonstrates an optimal balance between accuracy and computational efficiency.
  • The unity-gCP scheme provides a reasonable correction for arbitrary basis sets.
  • Less balanced basis sets, even larger ones, can lead to significant inaccuracies and overcorrections with gCP.
  • The 6-31+G(2d) basis set shows small gCP magnitudes, yielding adequate results even without correction.
  • The newly developed vDZ+(2d) basis set generally improves upon the vDZP basis set.

Conclusions:

  • The 6-31+G(2d) basis set is recommended for DFT calculations requiring a balance of accuracy and efficiency.
  • The unity-gCP scheme offers a practical approach for basis set correction.
  • Careful validation of gCP is necessary for specific basis sets to avoid overcorrection.
  • The vDZP and vDZ+(2d) basis sets provide efficient alternatives to larger basis sets for DFT.