K. Veseli'c and V. Hari. A note on a one-sided Jacobi algorithm. Numer. Math., 56:627--633, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Homotopy Method Applied to the Symmetric Eigenproblem - Oettli (1995) (1 citation) (Correct)
....grain size make it difficult to achieve a good speedup. An improvement represent one sided or implicit Jacobi methods. In one sided Jacobi methods, rotations are applied to the columns of the matrix only. They need some initial factorization but then involve less communication and synchronization [79]. Block Jacobi versions represent a further improvement. They work on blocks and apply the resulting orthogonal matrices to the rest of the matrix using more efficient matrix matrix multiplication. This results in a coarser grain size and reduced communication overhead [16, 9] Jacobi s method ....
K. Veseli'c and V. Hari. A note on a one-sided Jacobi algorithm. Numer. Math., 56:627--633, 1989.
Notes on Accuracy and Stability of Algorithms in Numerical Linear .. - Higham (1998) (Correct)
....a pair of rotations is applied from the left and the right to diagonalize the submatrix; this is known as the Kogbetliantz algorithm [8, Section 2.6. 6] 37] The one sided Jacobi algorithm can also be used to compute the eigensystem of a symmetric positive definite matrix A [19] 39] [50]. The idea is to compute a Cholesky factorization A = R R and then apply Algorithm 5.1 to . The SVD R = U Sigma V yields the eigendecomposition A = U Sigma . This approach has high accuracy, as we now show using error analysis for Cholesky factorization. The computed Cholesky ....
Kresimar Veseli'c and Vjeran Hari. A note on a one-sided Jacobi algorithm. Numer. Math., 56:627--633, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC