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

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

Discrete-Time Fourier Series

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

Discrete Fourier Transform

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

Discrete-time Fourier transform

267
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...
267
Accelerating Fluids01:17

Accelerating Fluids

1.0K
When a fluid is in constant acceleration, the pressure and buoyant force equations are modified. Suppose a beaker is placed in an elevator accelerating upward with a constant acceleration, a. In the beaker, assume there is a thin cylinder of height h with an infinitesimal cross-sectional area, ΔS.
The motion of the liquid within this infinitesimal cylinder is considered to obtain the pressure difference. Three vertical forces act on this liquid:
1.0K
Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

360
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...
360

You might also read

Related Articles

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

Sort by
Same author

GPU Accelerated Minimal Auxiliary Basis Approach TDDFT for Large Organic Molecules.

Journal of chemical theory and computation·2026
Same author

Anlotinib-containing regimens in HR+ advanced breast cancer after prior CDK4/6 inhibitor progression.

NPJ breast cancer·2026
Same author

Clinicopathological discordance and survival outcomes in 154 breast cancer patients with pulmonary metastasis in a real-world setting.

Discover oncology·2026
Same author

Temperature-Dependent Microstructure Evolution and Superplastic Deformation Behavior of Cold-Deformed Cr4Mo4Ni4V Martensitic Steel: From Continuous to Discontinuous Dynamic Recrystallization.

Materials (Basel, Switzerland)·2026
Same author

Real-World Study on the Efficacy and Safety of Incadronate Disodium in Treating Bone Metastases of Advanced Breast Cancer.

Current pharmaceutical design·2026
Same author

Targeting tumor-specific T cells with LAG3-directed interleukin-2 prevents T-cell exhaustion and reinvigorates antitumor immunity.

Signal transduction and targeted therapy·2026
Same journal

Continuous Information Descriptors for Electron Localization: Relativistic Spatial Responses, Nonadditivity, and Chemical Bonding.

Journal of chemical theory and computation·2026
Same journal

Determining Quantum Mechanical Methods Suitable for Quantitative Modeling of Hydrogen Atom Transfer by Halogen Atoms.

Journal of chemical theory and computation·2026
Same journal

Predicting Solvation Free Energies of Molecules and Ions via First-Principles and Machine-Learning Molecular Dynamics.

Journal of chemical theory and computation·2026
Same journal

Connection between <i>GW</i> and Extended Coupled Cluster.

Journal of chemical theory and computation·2026
Same journal

Resolving Local and Global Conformational Heterogeneity of the Human Intrinsically Disordered Proteome.

Journal of chemical theory and computation·2026
Same journal

Molecular Modeling of Surfactant Interaction on Phospholipid Bilayers Mimicking Corneal Epithelium.

Journal of chemical theory and computation·2026
See all related articles

Related Experiment Video

Updated: Jun 5, 2025

Knowledge Based Cloud FE Simulation of Sheet Metal Forming Processes
11:05

Knowledge Based Cloud FE Simulation of Sheet Metal Forming Processes

Published on: December 13, 2016

12.1K

Acceleration without Disruption: DFT Software as a Service.

Fusong Ju1, Xinran Wei1, Lin Huang1

  • 1Microsoft Research AI for Science, Beijing 100080, China.

Journal of Chemical Theory and Computation
|December 11, 2024
PubMed
Summary
This summary is machine-generated.

Accelerated DFT, a new cloud application, speeds up density functional theory (DFT) simulations significantly using cloud infrastructure and GPUs. This enhances computational chemistry and materials science research by providing faster, accurate, and scalable DFT calculations.

More Related Videos

Finite Element Modeling for the Simulation of the Quasi-Static Compression of Corrugated Tapered Tubes
06:34

Finite Element Modeling for the Simulation of the Quasi-Static Compression of Corrugated Tapered Tubes

Published on: January 6, 2023

1.6K
Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

1.1K

Related Experiment Videos

Last Updated: Jun 5, 2025

Knowledge Based Cloud FE Simulation of Sheet Metal Forming Processes
11:05

Knowledge Based Cloud FE Simulation of Sheet Metal Forming Processes

Published on: December 13, 2016

12.1K
Finite Element Modeling for the Simulation of the Quasi-Static Compression of Corrugated Tapered Tubes
06:34

Finite Element Modeling for the Simulation of the Quasi-Static Compression of Corrugated Tapered Tubes

Published on: January 6, 2023

1.6K
Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

1.1K

Area of Science:

  • Computational Chemistry
  • Materials Science
  • Computational Physics

Background:

  • Density functional theory (DFT) is a fundamental tool in scientific research.
  • Advancements in computing power and theory have improved DFT.
  • Increasing demand for DFT calculations requires more efficient methods.

Purpose of the Study:

  • Introduce Accelerated DFT, a novel cloud-native application.
  • Achieve significant acceleration in DFT simulations.
  • Provide a scalable and user-friendly solution for DFT calculations.

Main Methods:

  • Utilize state-of-the-art cloud infrastructure.
  • Redesign algorithms for graphic processing units (GPUs).
  • Implement a cloud-native application for DFT simulations.

Main Results:

  • Achieved an order of magnitude acceleration in DFT simulations.
  • Maintained accuracy in high-speed calculations.
  • Demonstrated high-speed calculations without sacrificing accuracy.

Conclusions:

  • Accelerated DFT offers a significant speedup for DFT simulations.
  • The application is user-friendly and scalable.
  • Accelerated DFT can expedite scientific discovery across various domains.