Cost
Each Jacobi rotation can be done in n steps when the pivot element p is known. However the search for p requires inspection of all N ≈ ½ n2 off-diag elements. We can reduce this to n steps too if we introduce an additional index array with the property that is the index of the largest element in row i, (i = 1, …, n − 1) of the current S. Then (k, l) must be one of the pairs . Since only columns k and l change, only must be updated, which again can be done in n steps. Thus each rotation has O(n) cost and one sweep has O(n3) cost which is equivalent to one matrix multiplication. Additionally the must be initialized before the process starts, this can be done in n2 steps.
Typically the Jacobi method converges within numerical precision after a small number of sweeps. Note that multiple eigenvalues reduce the number of iterations since .
Read more about this topic: Jacobi Eigenvalue Algorithm
Famous quotes containing the word cost:
“To call a posit a posit is not to patronize it. A posit can be unavoidable except at the cost of other no less artificial expedients. Everything to which we concede existence is a posit from the standpoint of a description of the theory-building process, and simultaneously real from the standpoint of the theory that is being built.”
—Willard Van Orman Quine (b. 1908)
“In the early days of the world, the Almighty said to the first of our race “In the sweat of thy face shalt thou eat bread”; and since then, if we except the light and the air of heaven, no good thing has been, or can be enjoyed by us, without having first cost labour.”
—Abraham Lincoln (1809–1865)
“History is strewn with the wrecks of nations which have gained a little progressiveness at the cost of a great deal of hard manliness, and have thus prepared themselves for destruction as soon as the the movements of the world gave a chance for it.”
—Walter Bagehot (1826–1877)