Description
Let S be a symmetric matrix, and G = G(i,j,θ) be a Givens rotation matrix. Then:
is symmetric and similar to S.
Furthermore, S′ has entries:
where s = sin(θ) and c = cos(θ).
Since G is orthogonal, S and S′ have the same Frobenius norm ||·||F (the square-root sum of squares of all components), however we can choose θ such that S′ij = 0, in which case S′ has a larger sum of squares on the diagonal:
Set this equal to 0, and rearrange:
if
In order to optimize this effect, Sij should be the largest off-diagonal component, called the pivot.
The Jacobi eigenvalue method repeatedly performs rotations until the matrix becomes almost diagonal. Then the elements in the diagonal are approximations of the (real) eigenvalues of S.
Read more about this topic: Jacobi Eigenvalue Algorithm
Famous quotes containing the word description:
“It is possibleindeed possible even according to the old conception of logicto give in advance a description of all true logical propositions. Hence there can never be surprises in logic.”
—Ludwig Wittgenstein (18891951)
“The great object in life is Sensationto feel that we exist, even though in pain; it is this craving void which drives us to gaming, to battle, to travel, to intemperate but keenly felt pursuits of every description whose principal attraction is the agitation inseparable from their accomplishment.”
—George Gordon Noel Byron (17881824)
“Do not require a description of the countries towards which you sail. The description does not describe them to you, and to- morrow you arrive there, and know them by inhabiting them.”
—Ralph Waldo Emerson (18031882)
