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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

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

Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional.

Journal of chemical theory and computation·2025
Same author

High-Performance, High-Angular-Momentum J Engine on Graphics Processing Units.

Journal of chemical theory and computation·2025
Same author

Acceleration of Self-Consistent Field Calculations Using Basis Set Projection and Many-Body Expansion as Initial Guess Methods.

Journal of chemical theory and computation·2025
Same author

An Efficient RI-MP2 Algorithm for Distributed Many-GPU Architectures.

Journal of chemical theory and computation·2024
Same journal

Nuclear Gradients from Auxiliary-Field Quantum Monte Carlo and Their Applications in ML-Driven Geometry Optimization and Transition State Search.

Journal of chemical theory and computation·2026
Same journal

Correction to "Cluster-in-Molecule Local Correlation Method with an Accurate Distant Pair Correction for Large Systems".

Journal of chemical theory and computation·2026
Same journal

Machine-Learned Force Fields for Lattice Dynamics at Coupled-Cluster Level Accuracy.

Journal of chemical theory and computation·2026
Same journal

Systematic Molecularity-Dependent Entropy Errors in Continuum/RRHO Solution Thermochemistry: Origin and Correction.

Journal of chemical theory and computation·2026
Same journal

After 100 Years of Quantum Mechanics: Toward a Constructive Observation-Centered Perspective.

Journal of chemical theory and computation·2026
Same journal

Sample-Based Quantum Diagonalization Methods for Modeling the Photochemistry of Diazirine and Diazo Compounds.

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

Related Experiment Video

Updated: Jun 6, 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.1K

Advanced Techniques for High-Performance Fock Matrix Construction on GPU Clusters.

Elise Palethorpe1, Ryan Stocks1, Giuseppe M J Barca2

  • 1School of Computing, Australian National University, Canberra, ACT 2601, Australia.

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

Two new multi-GPU algorithms, opt-UM and opt-Brc, accelerate Fock matrix construction for electronic structure calculations. These optimized methods significantly outperform existing GPU and CPU implementations, offering substantial speedups and improved power efficiency.

More Related Videos

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.1K
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.3K

Related Experiment Videos

Last Updated: Jun 6, 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.1K
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.1K
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.3K

Area of Science:

  • Computational Chemistry
  • Quantum Chemistry
  • High-Performance Computing

Background:

  • Fock matrix construction is a critical step in electronic structure calculations.
  • Existing algorithms face performance bottlenecks, especially for large systems and advanced basis sets.
  • Optimizing Fock matrix construction is essential for advancing computational chemistry capabilities.

Purpose of the Study:

  • To develop and present two novel, optimized multi-GPU algorithms for Fock matrix construction.
  • To enhance computational efficiency and scalability for Hartree-Fock calculations.
  • To provide significant speedups over existing CPU and GPU implementations.

Main Methods:

  • Implementation of two optimized multi-GPU algorithms: opt-UM and opt-Brc.
  • Incorporation of advanced techniques: improved integral screening, sparsity/symmetry exploitation, and linear scaling exchange matrix assembly.
  • Benchmarking on NVIDIA A100 GPUs using the EXtreme-scale Electronic Structure System (EXESS).
  • Testing with various system types (linear, globular) and basis sets (double-ζ, triple-ζ).

Main Results:

  • Algorithms demonstrate superior performance compared to TeraChem, QUICK, GPU4PySCF, LibIntX, ORCA, and Q-Chem.
  • Average speedups of 1.4×, 8.4×, and 9.4× observed against TeraChem, QUICK, and GPU4PySCF, respectively.
  • Up to 42× and 31× speedups achieved against ORCA and Q-Chem on single nodes.
  • Over 91% parallel efficiency for opt-Brc on four GPUs.
  • Power efficiency enhanced by up to 18×.

Conclusions:

  • The developed opt-UM and opt-Brc algorithms represent a significant advancement in Fock matrix construction.
  • These algorithms offer substantial performance gains and improved scalability for electronic structure calculations.
  • The optimized methods pave the way for more efficient and powerful computational chemistry research.