• # AggDef2

• Referenced in 3 articles [sw10244]
• LAPACK subroutine and is the preferred algorithm for this purpose. In this paper, we incorporate ... been applied successfully to the Hessenberg QR algorithm. Extensive numerical experiments show that aggressive early...
• # UDC

• Referenced in 19 articles [sw20233]
• spectral resolution of a unitary upper Hessenberg matrix H. Any such matrix H of order ... algorithm requires only O(n2) arithmetic operations. Experimental results presented indicate that the algorithm ... reliable and competitive with the general QR algorithm applied to this problem. Moreover, the algorithm...
• # Algorithm 800

• Referenced in 11 articles [sw04405]
• needed by the general QR algorithm. Routines are provided for computing the square-reduced form ... execution times compared to the general QR routine, DGEEVX, from the LAPACK library. The authors ... three scaling strategies mentioned (norm, symplectic, and Hessenberg), norm scaling was found...
• # Algorithm 826

• Referenced in 3 articles [sw04468]
• Algorithm 826: A parallel eigenvalue routine for complex Hessenberg matrices A code for computing ... Hessenberg matrix is presented. This code computes the Schur decomposition of a complex Hessenberg matrix ... directly computed using a parallel $QR$ algorithm.This parallel complex Schur decomposition routine was developed ... implement a complex multiple bulge $QR$ algorithm. This also required the development of new auxiliary...
• # Algorithm 730

• Referenced in 5 articles [sw14348]
• spectral resolution of a unitary upper Hessenberg matrix H. Any such matrix H of order ... algorithm requires only O(n2) arithmetic operations. Experimental results presented indicate that the algorithm ... reliable and competitive with the general QR algorithm applied to this problem. Moreover, the algorithm...