A quasi-separable approach to solve the symmetric definite tridiagonal generalized eigenvalue problem

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 1, 2009, Pages 154-174

  Vandebril, Raf ^a   Golub, Gene ^b   Van Barel, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b Stanford University   (United States)

Author keywords

Generalized eigenvalue problem; Quasi separable; Tridiagonal matrices

Indexed keywords

CHOLESKY; CHOLESKY FACTORIZATIONS; EIGENSOLVERS; EIGENVALUE PROBLEM; EIGENVALUES; FAST ALGORITHMS; GENERALIZED EIGENVALUE PROBLEMS; MATRIX; NUMERICAL EXPERIMENTS; POSITIVE DEFINITE; QR METHOD; SEPARABLE MATRICES; STANDARD METHOD; SUB-MATRICES; TRIDIAGONAL; TRIDIAGONAL MATRICES;

COMPUTATIONAL EFFICIENCY; MATRIX ALGEBRA; PROBLEM SOLVING; SWITCHING SYSTEMS; THERMOLUMINESCENCE;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 73649124272     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/070679491     Document Type: Conference Paper

References (58)

1. D. A. BINI, F. DADDI, AND L. GEMIGNANI, On the shifted QR iteration applied to companion matrices, Electron. Trans. Numer. Anal., 18 (2004), pp. 137-152.
2. D. A. BINI, Y. EIDELMAN, L. GEMIGNANI, AND I. GOHBERG, Fast QR eigenvalue algorithms for Hessenberg matrices which are rank-one perturbations of unitary matrices, SIAM J. Matrix Anal. Appl., 29 (2007), pp. 566-585.
3. D. A. BINI, L. GEMIGNANI, AND V. Y. PAN, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Numer. Math., 100 (2005), pp. 373-408.
4. R. F. BOISVERT, Families of high order accurate discretizations of some elliptic problems, SIAM J. Sci. Stat. Comput., 2 (1981), pp. 268-284.
5. C. F. BORGES AND W. B. GRAGG, Divide and conquer for generalized real symmetric definite tridiagonal eigenproblems, in Proceedings of the '92 Shanghai International Numerical Algebra and Its Applications Conference, E.-X. Jiang, ed., China Science and Technology Press, Beijing, China, 1992, pp. 70-76.
6. C. F. BORGES AND W. B. GRAGG, A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem, in Numerical Linear Algebra and Scientific Computing, L. Reichel, A. Ruttan, and R. S. Varga, eds., De Gruyter, Berlin, Germany, 1993, pp. 11-29.
7. A. BÖTTCHER AND S. M. GRUDSKY, Spectral Properties of Banded Toeplitz Matrices, SIAM, Philadelphia, PA, 2005.
8. J. R. BUNCH, C. P. NIELSEN, AND D. C. SORENSEN, Rank-one modification of the symmetric eigenvalue problem, Numer. Math., 31 (1978), pp. 31-48.
9. J. CARRIER, L. GREENGARD, AND V. ROKHLIN, A fast adaptive multipole algorithm for particle simulations, SIAM J. Sci. Stat. Comput., 9 (1988), pp. 669-686.
10. S. CHANDRASEKARAN AND M. GU, A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices, Numer. Math., 96 (2004), pp. 723-731.
11. J. J. M. CUPPEN, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numer. Math., 36 (1981), pp. 177-195.
12. P. I. DAVIES, N. J. HIGHAM, AND F. TISSEUR, Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 472-493.
13. J.-M. DELOSME AND I. C. F. IPSEN, From Bareiss' algorithm to the stable computation of partial correlations, J. Comput. Appl. Math., 27 (1989), pp. 53-91.
14. S. DELVAUX AND M. VAN BAREL, The Explicit QR-algorithm for Rank Structured Matrices, Technical Report TW459, Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium, 2006.
15. S. DELVAUX AND M. VAN BAREL, A Hessenberg reduction algorithm for rank structured matrices, SIAM J. Matrix Anal. Appl., 29 (2007), pp. 895-926.
16. S. DELVAUX AND M. VAN BAREL, A Givens-weight representation for rank structured matrices, SIAM J. Matrix Anal. Appl., 29 (2007), pp. 1147-1170.
17. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
18. J. W. DEMMEL, O. A. MARQUES, B. N. PARLETT, AND C. VÖMEL, Performance and accuracy of LAPACK's symmetric tridiagonal eigensolvers, SIAM J. Sci. Comput., 30 (2008), pp. 1508-1526.
19. P. DEWILDE AND A.-J. VAN DER VEEN, Time-Varying Systems and Computations, Kluwer Academic Publishers, Boston, MA, 1998.
20. I. S. DHILLON, A New O(n2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem, Ph.D. thesis, Department of Computer Science, University of California, Berkeley, 1989.
21. I. S. DHILLON AND B. N. PARLETT, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Linear Algebra Appl., 387 (2004), pp. 1-28.
22. I. S. DHILLON AND B. N. PARLETT, Orthogonal eigenvectors and relative gaps, SIAMJ.Matrix Anal. Appl., 25 (2004), pp. 858-899.
23. I. S. DHILLON, B. N. PARLETT, AND C. VÖMEL, The design and implementation of the MRRR algorithm, ACM Trans. Math. Software, 32 (2006), pp. 533-560.
24. Y. EIDELMAN, Fast recursive algorithm for a class of structured matrices, Appl. Math. Lett., 13 (2000), pp. 57-62.
25. Y. EIDELMAN, L. GEMIGNANI, AND I. C. GOHBERG, On the fast reduction of a quasi-separable matrix to Hessenberg and tridiagonal forms, Linear Algebra Appl., 420 (2007), pp. 86-101.
26. Y. EIDELMAN AND I. C. GOHBERG, On a new class of structured matrices, Integral Equations Operator Theory, 34 (1999), pp. 293-324.
27. Y. EIDELMAN, I. C. GOHBERG, AND V. OLSHEVSKY, Eigenstructure of order-one-quasi-separable matrices. Three-term and two-term recurrence relations, Linear Algebra Appl., 405 (2005), pp. 1-40.
28. Y. EIDELMAN, I. C. GOHBERG, AND V. OLSHEVSKY, The QR iteration method for Hermitian quasi-separable matrices of an arbitrary order, Linear Algebra Appl., 404 (2005), pp. 305-324.
29. L. ELSNER, A. FASSE, AND E. LANGMANN, A divide-and-conquer method for the tridiagonal generalized eigenvalue problem, J. Comput. Appl. Math., 86 (1997), pp. 141-148.
30. D. FASINO, N. MASTRONARDI, AND M. VAN BAREL, Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form, in Fast Algorithms for Structured Matrices: Theory and Applications, Contemp. Math. 323, American Mathematical Society, Providence, RI, 2003, pp. 105-118.
31. M. FIEDLER AND T. L. MARKHAM, Completing a matrix when certain entries of its inverse are specified, Linear Algebra Appl., 74 (1986), pp. 225-237.
32. M. FIEDLER AND Z. VAVŘÍN, Generalized Hessenberg matrices, Linear Algebra Appl., 380 (2004), pp. 95-105.
33. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
34. L. GREENGARD AND V. ROKHLIN, A fast algorithm for particle simulations, J. Comput. Phys., 73 (1987), pp. 325-348.
35. M. GU AND S. C. EISENSTAT, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 172-191.
36. L. KAUFMAN, An algorithm for the banded symmetric generalized matrix eigenvalue problem, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 372-389.
37. S.-L. LEI AND X.-Q. JIN, BCCB preconditioners for systems of BVM-based numerical integrators, Numer. Linear Algebra Appl., 11 (2004), pp. 25-40.
38. K. LI, T.-Y. LI, AND Z. ZENG, An algorithm for the generalized symmetric tridiagonal eigenvalue problem, Numer. Algorithms, 8 (1994), pp. 269-291.
39. N. MASTRONARDI, S. CHANDRASEKARAN, AND S. VAN HUFFEL, Fast and stable two-way algorithm for diagonal plus semi-separable systems of linear equations, Numer. Linear Algebra Appl., 8 (2001), pp. 7-12.
40. N. MASTRONARDI, S. CHANDRASEKARAN, AND S. VAN HUFFEL, Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form, BIT, 41 (2003), pp. 149-157.
41. N. MASTRONARDI, M. VAN BAREL, AND E. VAN CAMP, Divide-and-conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices, Numer. Algorithms, 39 (2005), pp. 379-398.
42. N. MASTRONARDI, M. VAN BAREL, E. VAN CAMP, AND R. VANDEBRIL, On computing the eigenvectors of a class of structured matrices, J. Comput. Appl. Math., 189 (2006), pp. 580-591.
43. G. MEURANT, A review of the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 707-728.
44. B. N. PARLETT, The Symmetric Eigenvalue Problem, Classics in Appl. Math. 20, SIAM, Philadelphia, PA, 1998.
45. B. N. PARLETT AND I. S. DHILLON, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl., 309 (2000), pp. 121-151.
46. S. PRÖSSDORF AND B. SILBERMANN, Numerical Analysis for Integral and Related Operator Equations, Akademie-Verlag, Berlin, Germany, 1991.
47. Y. M. RAM AND G. M. L. GLADWELL, Constructing a finite element model of a vibratory rod from eigendata, J. Sound Vibration, 169 (1994), pp. 229-237.
48. E. E. TYRTYSHNIKOV, Incomplete cross approximation in the mosaic-skeleton method, Computing, 64 (2000), pp. 367-380.
49. E. E. TYRTYSHNIKOV, Mosaic ranks for weakly semiseparable matrices, in Large-Scale Scientific Computations of Engineering and Environmental Problems II, M. Griebel, S. Margenov, and P. Y. Yalamov, eds., Notes on Numer. Fluid Mech. 73, Vieweg, Braunschweig, Germany, 2000, pp. 36-41.
50. M. VAN BAREL, R. VANDEBRIL, AND N. MASTRONARDI, An orthogonal similarity reduction of a matrix into semiseparable form, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 176-197.
51. E. VAN CAMP, M. VAN BAREL, R. VANDEBRIL, AND N. MASTRONARDI, An Implicit QR-Algorithm for Symmetric Diagonal-Plus-Semiseparable Matrices, Technical Report TW419, Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium, 2005.
52. R. VANDEBRIL, Semiseparable Matrices and the Symmetric Eigenvalue Problem, Ph.D. thesis, Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium, 2004.
53. R. VANDEBRIL, M. VAN BAREL, G. H. GOLUB, AND N. MASTRONARDI, A bibliography on semiseparable matrices, Calcolo, 42 (2005), pp. 249-270.
54. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, An implicit QR-algorithm for symmetric semiseparable matrices, Numer. Linear Algebra Appl., 12 (2005), pp. 625-658.
55. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, A note on the representation and definition of semiseparable matrices, Numer. Linear Algebra Appl., 12 (2005), pp. 839-858.
56. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, A New Iteration for Computing the Eigenvalues of Semiseparable (Plus Diagonal) Matrices, Technical Report TW507, Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium, 2007.
57. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, Matrix Computations and Semiseparable Matrices, Volume I: Linear Systems, Johns Hopkins University Press, Baltimore, MD, 2008.
58. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, New York, 1965.