Related Experiment Videos
Neuberger's double-pass algorithm
Ting-Wai Chiu1, Tung-Han Hsieh
1Department of Physics, National Taiwan University Taipei, Taiwan 106, Taiwan.
Abstract:
We analyze Neuberger's double-pass algorithm for the matrix-vector multiplication R(H) x Y [where R(H) is (n-1,n)th degree rational polynomial of positive definite operator H], and show that the number of floating-point operations is independent of the degree n, provided that the number of sites is much larger than the number of iterations in the conjugate gradient. This implies that the matrix-vector product (H)(-1/2)Y approximately R((n-1,n))(H).Y can be approximated to very high precision with sufficiently large n, without noticeably extra costs. Further, we show that there exists a threshold n(T) such that the double-pass is faster than the single pass for n>n(T), where n(T) approximately 12-25 for most platforms.
Related Concept Videos
Bernoulli's Equation: Problem Solving
The first step is to compute the cross-sectional areas of the pipe and the Venturi throat to analyze the pressure difference indicated by the pressure gauge. Next, the continuity equation is...
Bernoulli's Equation
Binomial Expansion Using Pascal's Triangle
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and 0s. In...
Gaussian Elimination: Problem Solving