Accelerating seminumerical Fock-exchange calculations using mixed single- and double-precision arithmethic

Henryk Laqua1, Jörg Kussmann1, Christian Ochsenfeld1

  • 1Department of Chemistry, Chair of Theoretical Chemistry, University of Munich (LMU), D-81377 München, Germany.

Related Concept Videos

Numerical Calculations01:24

Numerical Calculations

In engineering applications, the representation of the numerical value is critical. Presenting or reporting the answer is one of the essential parts of engineering practices. Numerical calculations are performed using handheld calculators or computers since numerically accurate answers are always preferred.
The solution to a problem is obtained using different methods. While manually solving algebraic symbols is one of the most common methods, the graphical method is often preferred. Computers...
932
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...
136
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
1.3K
Fast Fourier Transform01:10

Fast Fourier Transform

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...
569
Significant Figures in Calculations00:58

Significant Figures in Calculations

Uncertainty in measurements can be avoided by reporting the results of a calculation with the correct number of significant figures. This can be determined by the following rules for rounding numbers:
15.4K
Real Number Operations01:27

Real Number Operations

The concept of real numbers includes all the values that can be represented on a continuous number line. The system began with basic counting values used for enumeration. It later expanded to include values that represent the absence of quantity and opposites of the counting values. When situations required expressing parts of a whole or dividing quantities evenly, values capable of representing such proportions were developed. When written using decimal notation, these values can end or repeat...
23