Jove
Visualize
Contact Us

Related Concept Videos

Fermi Level Dynamics01:12

Fermi Level Dynamics

285
The vacuum level denotes the energy threshold required for an electron to escape from a material surface. It is usually positioned above the conduction band of a semiconductor and acts as a benchmark for comparing electron energies within various materials.
Electron affinity in semiconductors refers to the energy gap between the minimum of its conduction band and the vacuum level and it is a critical parameter in determining how easily a semiconductor can accept additional electrons.
The work...
285
Fast Fourier Transform01:10

Fast Fourier Transform

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

Discrete-Time Fourier Series

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

Discrete Fourier Transform

325
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...
325
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

81
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
81
Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

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

You might also read

Related Articles

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

Sort by
Same author

ChemXDyn: Dynamics-Informed Species and Reaction Detection Methodology from Atomistic Simulations.

Journal of chemical theory and computation·2026
Same author

Real-Space Methods for Ab Initio Modeling of Surfaces and Interfaces under External Potential Bias.

Journal of chemical theory and computation·2025
Same author

Robust Lightweight Graph Neural Network Framework for Accelerating Crystal Structure Prediction.

Journal of chemical information and modeling·2025
Same author

Chemical Bonding in Large Systems Using Projected Population Analysis from Real-Space Density Functional Theory Calculations.

Journal of chemical theory and computation·2023
Same author

Backbone charge transport in double-stranded DNA.

Nature nanotechnology·2020
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 Experiment Video

Updated: Jul 23, 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

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures.

Sameer Khadatkar1, Phani Motamarri1

  • 1Department of Computational and Data Sciences, Indian Institute of Science, Bengaluru 560012, India.

The Journal of Chemical Physics
|July 20, 2023
PubMed
Summary

This study introduces polynomial expansion methods to accelerate quantum mechanical calculations in material modeling. These new approaches offer a more efficient alternative to traditional diagonalization for large-scale density functional theory simulations.

More Related Videos

Probe Type II Band Alignment in One-Dimensional Van Der Waals Heterostructures Using First-Principles Calculations
13:56

Probe Type II Band Alignment in One-Dimensional Van Der Waals Heterostructures Using First-Principles Calculations

Published on: October 12, 2019

7.7K
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

Related Experiment Videos

Last Updated: Jul 23, 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
Probe Type II Band Alignment in One-Dimensional Van Der Waals Heterostructures Using First-Principles Calculations
13:56

Probe Type II Band Alignment in One-Dimensional Van Der Waals Heterostructures Using First-Principles Calculations

Published on: October 12, 2019

7.7K
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

Area of Science:

  • Computational Materials Science
  • Quantum Mechanics
  • Density Functional Theory

Background:

  • Kohn-Sham density functional theory (DFT) calculations are crucial for material modeling but are computationally intensive.
  • Traditional methods involve solving nonlinear eigenvalue problems with cubic scaling complexity.
  • Iterative projection methods are efficient but face bottlenecks in Rayleigh-Ritz projection and subspace diagonalization for large systems.

Purpose of the Study:

  • To explore polynomial expansion approaches, specifically recursive Fermi-operator expansion, as an alternative to subspace diagonalization.
  • To reduce the computational cost associated with large-scale DFT calculations.
  • To compare the performance of these novel methods against traditional diagonalization techniques.

Main Methods:

  • Implementation and testing of various recursive polynomial expansion algorithms.
  • Detailed comparison with explicit diagonalization methods.
  • Performance evaluation on both central processing unit (CPU) and graphics processing unit (GPU) architectures.
  • Assessment of accuracy, computational efficiency, scaling, and energy efficiency.

Main Results:

  • Polynomial expansion approaches show potential for reducing computational costs in DFT.
  • Comparative analysis reveals performance trade-offs between different expansion methods and traditional diagonalization.
  • Performance metrics include accuracy, speed, scalability, and energy consumption on various hardware.

Conclusions:

  • Recursive polynomial expansion offers a promising avenue for accelerating large-scale DFT simulations.
  • The choice of method depends on specific system sizes and hardware architectures.
  • This work contributes to more efficient and scalable quantum mechanical calculations for materials science.