Table 4: Effectiveness of the Hessenberg-Schur method and WBR algorithm with 3 iterations for randomly generated matrices.
Matrix Hessenberg-Schur WBR method
ErrorCPU-timeErrorCPU-time
A = gallery (“wathen”, 736, 736) 2 . 1 9 𝐸 − 0 6 66.24 1 . 0 1 𝐸 − 0 1 6 49.95
A = gallery (“toeppd”, 800, 800, r and (1,800) 6 . 0 1 𝐸 − 0 5 72.19 4 . 9 8 𝐸 − 0 1 6 54.81
A = gallery (“dorr”, 1200, 0.01) 7 . 9 3 𝐸 − 0 1 137.113 6 . 1 2 𝐸 − 0 1 4 101.02
A = gallery (“neumann”, 1156) 3 . 2 4 𝐸 − 0 1 122.71 9 . 2 1 𝐸 − 0 1 5 94.29