| M. T. C'amara, D. Gim'enez, On the Semiclassical Jacobi Algorithm, In John G. Lewis, editor, Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, p. 285 (1994). |
....value. That produces a reduction on the number of nullifications to reach the convergence, but can produce or not (depending on the characteristics of the machine and the matrix) a reduction on the execution time. Two of these methods are the Karp Greenstadt [10] and the semiclassical method [3]. In the Karp Greenstadt method a set of non conflicting rotations that includes the largest nondiagonal elements (in absolute value) is obtained before each step. To obtain this set, the maxima of each column are obtained and sorted. After that, the elements to be nullified are chosen from ....
M. T. C'amara, D. Gim'enez, On the Semiclassical Jacobi Algorithm, In John G. Lewis, editor, Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, p. 285 (1994).
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