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

663
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...
663
Parallel Processing01:20

Parallel Processing

454
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
454
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

493
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
493
Acceleration Vectors01:30

Acceleration Vectors

19.8K
In everyday conversation, accelerating means speeding up. Acceleration is a vector in the same direction as the change in velocity, Δv, therefore the greater the acceleration, the greater the change in velocity over a given time. Since velocity is a vector, it can change in magnitude, direction, or both. Thus acceleration is a change in speed or direction, or both. For example, if a runner traveling at 10 km/h due east slows to a stop, reverses direction, and continues their run at 10 km/h...
19.8K
Accelerating Fluids01:17

Accelerating Fluids

1.8K
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.8K

You might also read

Related Articles

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

Sort by
Same author

NN-xTB: density functional accuracy at semi empirical speed with neural network extended tight binding.

Nature communications·2026
Same author

Double-Hybrid, but Not Double-Cost: GPU-Accelerated DHDFT for the COMPAS-3 Data Set of Polybenzenoid Hydrocarbons.

Journal of chemical theory and computation·2026
Same author

Speeding Up Hartree-Fock in JuliaChem with Density Fitting.

Journal of chemical theory and computation·2026
Same author

Multiscale Modeling of Transport-Mediated Catalytic Reactions in Linear Nanopores: PNB Conversion in MSN.

Journal of chemical theory and computation·2026
Same author

Solvent Effects on Nonadiabatic Coupling: Interfacing Time-Dependent Density Functional Theory with the Effective Fragment Potential Method.

Journal of chemical theory and computation·2026
Same author

Atoms and Bonds as Synergisms of Interacting Electrons and Nuclei. The Origin of Chemical Bonds in Polyatomic Molecules.

Journal of the American Chemical Society·2025

Related Experiment Video

Updated: Nov 29, 2025

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.4K

High-Performance, Graphics Processing Unit-Accelerated Fock Build Algorithm.

Giuseppe M J Barca1, Jorge L Galvez-Vallejo2, David L Poole2

  • 1Research School of Computer Science, Australian National University, Canberra, Australian Capital Territory 2601, Australia.

Journal of Chemical Theory and Computation
|November 18, 2020
PubMed
Summary
This summary is machine-generated.

We developed a fast, graphics processing unit (GPU)-accelerated algorithm for Fock matrix construction in large molecular systems. This computational chemistry method significantly speeds up calculations, offering substantial performance gains.

More Related Videos

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy ATOM
07:19

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy ATOM

Published on: June 28, 2017

10.6K
Computer-Generated Animal Model Stimuli
26:43

Computer-Generated Animal Model Stimuli

Published on: July 29, 2007

11.2K

Related Experiment Videos

Last Updated: Nov 29, 2025

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.4K
Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy ATOM
07:19

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy ATOM

Published on: June 28, 2017

10.6K
Computer-Generated Animal Model Stimuli
26:43

Computer-Generated Animal Model Stimuli

Published on: July 29, 2007

11.2K

Area of Science:

  • Computational Chemistry
  • High-Performance Computing
  • Quantum Chemistry

Background:

  • Accurate electronic structure calculations are crucial for understanding molecular properties.
  • Efficient computation of the Fock matrix is a bottleneck in quantum chemistry.
  • Existing methods face challenges with large molecular systems and computational efficiency.

Purpose of the Study:

  • To present a high-performance, GPU-accelerated algorithm for Fock matrix construction.
  • To enable efficient quantum chemistry calculations for large molecular systems.
  • To improve computational speed and scalability.

Main Methods:

  • Developed a novel dynamic load balancing scheme to maximize GPU throughput.
  • Implemented an ERI (electron repulsion integral) digestion algorithm exploiting permutational symmetry.
  • Combined Coulomb and exchange term evaluation efficiently.
  • Eliminated explicit thread synchronization requirements.

Main Results:

  • Achieved significant speedups for large molecular systems.
  • Demonstrated speedups up to 24.4× compared to the QUICK GPU code.
  • Showed speedups up to 237× compared to the GAMESS CPU parallel code.

Conclusions:

  • The developed GPU-accelerated algorithm offers substantial performance improvements for Fock matrix construction.
  • The novel algorithmic approaches enhance computational efficiency and scalability for large molecules.
  • This method represents a significant advancement in high-performance computational chemistry.