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

1.2K
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...
1.2K
Discrete Fourier Transform01:15

Discrete Fourier Transform

1.2K
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...
1.2K
Properties of DTFT I01:24

Properties of DTFT I

914
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...
914
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

882
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]...
882
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

1.4K
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...
1.4K
Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

938
The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the...
938

You might also read

Related Articles

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

Sort by
Same author

Planar structures of medium-sized gold clusters become ground states upon ionization.

Nanoscale advances·2026
Same author

The transformation mechanisms among cuboctahedra, Ino's decahedra and icosahedra structures of magic-size gold nanoclusters.

Nanoscale advances·2026
Same author

Influence of Hydrogen-Incorporation on the Bulk Electronic Structure and Chemical Bonding in Palladium.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

Simulation of radiation damage on [M(COD)Cl]<sub>2</sub> using density functional theory.

Physical chemistry chemical physics : PCCP·2025
Same author

Combining the maximum overlap method with multiwavelets for core-ionisation energy calculations.

Physical chemistry chemical physics : PCCP·2025
Same author

Accelerating Variable Cell Shape Molecular Dynamics with a Position-Dependent Mass Matrix.

Journal of chemical theory and computation·2025

Related Experiment Video

Updated: Apr 12, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

785

Accurate and efficient linear scaling DFT calculations with universal applicability.

Stephan Mohr1, Laura E Ratcliff2, Luigi Genovese1

  • 1Université Grenoble Alpes, CEA, INAC-SP2M, F-38000 Grenoble, France. luigi.genovese@cea.fr.

Physical Chemistry Chemical Physics : PCCP
|May 12, 2015
PubMed
Summary

Density functional theory (DFT) calculations are now feasible for large systems. Our new linear scaling approach in BigDFT achieves high accuracy and broad applicability, reducing computational cost for complex simulations.

More Related Videos

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
06:37

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

4.3K
Dithranol as a Matrix for Matrix Assisted Laser Desorption/Ionization Imaging on a Fourier Transform Ion Cyclotron Resonance Mass Spectrometer
09:38

Dithranol as a Matrix for Matrix Assisted Laser Desorption/Ionization Imaging on a Fourier Transform Ion Cyclotron Resonance Mass Spectrometer

Published on: November 26, 2013

14.7K

Related Experiment Videos

Last Updated: Apr 12, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

785
Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
06:37

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

4.3K
Dithranol as a Matrix for Matrix Assisted Laser Desorption/Ionization Imaging on a Fourier Transform Ion Cyclotron Resonance Mass Spectrometer
09:38

Dithranol as a Matrix for Matrix Assisted Laser Desorption/Ionization Imaging on a Fourier Transform Ion Cyclotron Resonance Mass Spectrometer

Published on: November 26, 2013

14.7K

Area of Science:

  • Computational Chemistry
  • Materials Science
  • Quantum Mechanics

Background:

  • Density functional theory (DFT) calculations face significant computational expense due to cubic scaling with system size.
  • Linear scaling algorithms have been developed to enable ab initio calculations for larger systems, but often compromise accuracy or require extensive parameter tuning.
  • Existing linear scaling methods may introduce small errors or demand complex fine-tuning, limiting their universal applicability.

Purpose of the Study:

  • To develop a highly accurate and broadly applicable linear scaling approach for ab initio calculations.
  • To overcome the accuracy limitations and parameter tuning issues associated with traditional linear scaling algorithms.
  • To enable efficient simulation of large systems using DFT within reasonable computational resources.

Main Methods:

  • Implementation of a novel linear scaling approach within the BigDFT package.
  • Utilizing an ansatz based on localized support functions.
  • Employing an underlying Daubechies wavelet basis for accurate linear scaling calculations.

Main Results:

  • Achieved high accuracy in linear scaling calculations, overcoming previous limitations.
  • Demonstrated universal applicability across diverse systems and boundary conditions.
  • Enabled efficient simulations of large systems with linear scaling computational time and moderate resource demands.

Conclusions:

  • The developed linear scaling method offers a significant advancement for large-scale ab initio simulations.
  • The approach provides a balance between computational efficiency, accuracy, and ease of use.
  • Validated effectiveness for single-point calculations, geometry optimizations, and molecular dynamics.