Matrix computations and semiseparable matrices

Matrix Computations and Semiseparable Matrices

Volumn 2, Issue , 2008, Pages 1-498

  Vandebril, Raf ^a   Van Barel, Marc ^a   Mastronardi, Nicola ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b M Picone Institute for Applied Mathematics   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84896247887     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (191)

1. A. Abdallah and Y. Hu, Parallel VLSI computing array implementation for signal subspace updating algorithm, IEEE Transactions on Acoustics, Speech and Signal Processing 37(1989), 742-748. {64, 471}
2. G. S. Ammar, D. Calvetti, W. B. Gragg, and L. Reichel, Polynomial zerofinders based on Szego polynomials, Journal of Computational and Applied Mathematics 127(2001), 1-16. {353, 471}
3. G. S. Ammar, D. Calvetti, and L. Reichel, Continuation methods for the computation of zeros of Szego polynomials, Linear Algebra and its Applications 249(1996), 125-155. {354, 471}
4. 2) reduction algorithms for the construction of a band matrix from spectral data, SIAM Journal on Matrix Analysis and Applications 12(1991), no. 3, 426-432. {435, 471}
5. -, Schur flows for orthogonal Hessenberg matrices, Hamiltonian and Gradient Flows, Algorithms and Control (A. M. Bloch, ed.), vol. 3, American Mathematical Society, Providence, Rhode Island, 1994, pp. 27-34. {353, 471}
6. G. S. Ammar, W. B. Gragg, and C. He, An efficient QR algorithm for a Hessenberg submatrix of a unitary matrix, New Directions and Applications in Control Theory (W. Dayawansa, A. Lindquist, and Y. Zhou, eds.), Lecture Notes in Control and Information Sciences, vol. 321, Springer-Verlag, Berlin, Germany, 2005, pp. 1-14. {354, 471}
7. G. S. Ammar, W. B. Gragg, and L. Reichel, On the eigenproblem for orthogonal matrices, Proceedings of the 25th IEEE Conference on Decision & Control, IEEE, New York, USA, 1986, pp. 1963-1966. {353, 471}
8. -, Constructing a unitary Hessenberg matrix from spectral data, Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms (G. H. Golub and P. Van Dooren, eds.), Computer and Systems Sciences, vol. 70, Springer-Verlag, Berlin, Germany, 1991, pp. 385-395. {419, 424, 426, 471}
9. -, Downdating of Szego polynomials and data-fitting applications, Linear Algebra and its Applications 172(1992), 315-336. {424, 427, 471}
10. G. S. Ammar and C. He, On an inverse eigenvalue problem for unitary Hessenberg matrices, Linear Algebra and its Applications 218(1995), 263-271. {426, 472}
11. G. S. Ammar, L. Reichel, and D. C. Sorensen, An implementation of a divide and conquer algorithm for the unitary eigenproblem, ACM Transactions on Mathematical Software 18(1992), no. 3, 292-307. {353, 472}
12. S. O. Asplund, Finite boundary value problems solved by Green's matrix, Mathematica Scandinavica 7(1959), 49-56. {13, 472}
13. S. Barnett, Polynomials and Linear Control Systems, Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, Inc., New York, USA, 1983. {327, 352, 472}
14. W. W. Barrett, A theorem on inverses of tridiagonal matrices, Linear Algebra and its Applications 27(1979), 211-217. {6, 9, 472}
15. W. W. Barrett and P. J. Feinsilver, Inverses of banded matrices, Linear Algebra and its Applications 41(1981), 111-130. {6, 9, 472}
16. R. Bevilacqua, E. Bozzo, and G. M. Del Corso, Transformations to rank structures by unitary similarity, Linear Algebra and its Applications 402(2005), 126-134. {360, 472}
17. R. Bevilacqua, B. Codenotti, and F. Romani, Parallel solution of block tridiagonal linear systems, Linear Algebra and its Applications 104(1988), 39-57. {465, 472}
18. R. Bevilacqua and G. M. Del Corso, Structural properties of matrix unitary reduction to semiseparable form, Calcolo 41(2004), no. 4, 177-202. {40, 182, 188, 193, 194, 217, 472}
19. D. Bindel, S. Chandrasekaran, J. W. Demmel, D. Garmire, and M. Gu, A fast and stable nonsymmetric eigensolver for certain structured matrices, Tech. report, Department of Computer Science, University of California, Berkeley, California, USA, May 2005. {349, 472}
20. D. Bindel, J. W. Demmel, W. Kahan, and O. A. Marques, On computing Givens rotations reliably and efficiently, ACM Transactions on Mathematical Software 28(2002), no. 2, 206-238. {22, 24, 279, 280, 472}
21. D. A. Bini, F. Daddi, and L. Gemignani, On the shifted QR iteration applied to companion matrices, Electronic Transactions on Numerical Analysis 18(2004), 137-152. {289, 349, 472}
22. D. A. Bini, Y. Eidelman, L. Gemignani, and I. C. Gohberg, Fast QR eigenvalue algorithms for Hessenberg matrices which are rank-one perturbations of unitary matrices, SIAM Journal on Matrix Analysis and Applications 29(2007), no. 2, 566-585. {289, 350, 472}
23. D. A. Bini, L. Gemignani, and V. Y. Pan, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Numerische Mathematik 100(2005), no. 3, 373-408. {176, 182, 201, 289, 352, 473}
24. D. A. Bini and V. Y. Pan, Practical improvement of the divide-and-conquer eigenvalue algorithms, Computing 48(1992), no. 1, 109-123. {378, 473}
25. D. L. Boley and G. H. Golub, A survey of matrix inverse eigenvalue problems, Inverse Problems 3(1987), 595-622. {370, 424, 425, 435, 473}
26. C. F. Borges, R. Frezza, and W. B. Gragg, Some inverse eigenproblems for Jacobi and arrow matrices, Numerical Linear Algebra with Applications 2(1995), no. 3, 195-203. {378, 387, 388, 473}
27. C. F. Borges and W. B. Gragg, Divide and conquer for generalized real symmetric definite tridiagonal eigenproblems, Proceedings of '92 Shanghai International Numerical Algebra and its Applications Conference (E.-X. Jiang, ed.), China Science and Technology Press, Beijing, China, October 1992, pp. 70-76. {130, 370, 372, 375, 473}
28. -, A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem, Numerical Linear Algebra and Scientific Computing (L. Reichel, A. Ruttan, and R. S. Varga, eds.), de Gruyter, Berlin, Germany, 1993, pp. 11-29. {367, 370, 372, 375, 378, 387, 473}
29. M. Braun, S. A. Sofianos, D. G. Papageorgiou, and I. E. Lagaris, An efficient Chebyshev Lanczos method for obtaining eigensolutions of the Schrodinger equation on a grid, Journal of Computational Physics 126(1996), no. 2, 315-327. {85, 473}
30. A. Bultheel, Quadrature and orthogonal rational functions, Journal of Computational and Applied Mathematics 127(2001), 67-91. {465, 473}
31. A. Bultheel, A. M. Cuyt, W. Van Assche, M. Van Barel, and B. Verdonk, Generalizations of orthogonal polynomials, Journal of Computational and Applied Mathematics 179(2005), no. 1-2, 57-95. {425, 473}
32. A. Bultheel and B. L. R. De Moor, Rational approximation in linear systems and control, Journal of Computational and Applied Mathematics 121(2000), 355-378. {464, 473}
33. A. Bultheel, P. González-Vera, E. Hendriksen, and O. Njåstad, Orthogonal rational functions with poles on the unit circle, Journal of Mathematical Analysis and Applications 182(1994), no. 1, 221-243. {465, 473}
34. -, Orthogonal Rational Functions, Cambridge Monographs on Applied and Computational Mathematics, vol. 5, Cambridge University Press, Cambridge, United Kingdom, 1999. {465, 473}
35. A. Bultheel and M. Van Barel, Padé techniques for model reduction in linear system theory: a survey, Journal of Computational and Applied Mathematics 14(1986), 401-438. {464, 474}
36. -, Vector orthogonal polynomials and least squares approximation, SIAM Journal on Matrix Analysis and Applications 16(1995), no. 3, 863-885. {425, 445, 474}
37. -, Linear Algebra, Rational Approximation and Orthogonal Polynomials, Studies in computational mathematics, vol. 6, North-Holland, Elsevier Science B. V., Amsterdam, Netherlands, 1997. {425, 474}
38. S. Chandrasekaran and M. Gu, Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices, Linear Algebra and its Applications 313(2000), 107-114. {3, 32, 63, 65, 122, 474}
39. -, A fast and stable solver for recursively semi-separable systems of equations, Structured Matrices in Mathematics, Computer Science and Engineering, II (V. Olshevsky, ed.), Contemporary Mathematics, vol. 281, American Mathematical Society, Providence, Rhode Island, USA, 2001, pp. 39-53. {464, 474}
40. -, A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices, Numerische Mathematik 96(2004), no. 4, 723-731. {32, 131, 367, 379, 387, 388, 474}
41. S. Chandrasekaran, M. Gu, J. Xia, and J. Zhu, A fast QR algorithm for companion matrices, Operator Theory: Advances and Applications 179(2007), 111-143. {351, 474}
42. M. T. Chu and G. H. Golub, Inverse Eigenvalue Problems: Theory, Algorithms and Applications, Numerical Mathematics & Scientific Computations, Oxford University Press, New York, USA, 2005. {425, 427, 474}
43. J. K. Cullum and R. A. Willoughby, Lanczos algorithms for large symmetric eigenvalue computations, Birkhäuser, Boston, Massachusetts, USA, 1985. {68, 80, 474}
44. J. J. M. Cuppen, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numerische Mathematik 36(1981), 177-195. {130, 370, 374, 378, 474}
45. R. J. A. David and D. S. Watkins, Efficient implementation of the multishift QR algorithm for the unitary eigenvalue problem, SIAM Journal on Matrix Analysis and Applications 28(2006), no. 3, 623-633. {353, 474}
46. Ph. Delsarte, Y. V. Genin, and Y. Kamp, On the role of the Nevanlinna-Pick problem in circuit and system theory, International Journal of Circuit Theory and Applications 9(1981), 177-187. {464, 474}
47. S. Delvaux, Rank Structured Matrices, PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, June 2007. {361, 475}
48. S. Delvaux and M. Van Barel, Orthonormal rational function vectors, Numerische Mathematik 100(2005), no. 3, 409-440. {466, 475}
49. -, The explicit QR-algorithm for rank structured matrices, Tech. Report TW459, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, May 2006. {198, 259, 289, 361, 475}
50. -, Rank structures preserved by the QR-algorithm: the singular case, Journal of Computational and Applied Mathematics 189(2006), 157-178. {182, 195, 197, 361, 475}
51. -, Structures preserved by matrix inversion, SIAM Journal on Matrix Analysis and Applications 28(2006), no. 1, 213-228. {7, 10, 475}
52. -, Structures preserved by the QR-algorithm, Journal of Computational and Applied Mathematics 187(2006), no. 1, 29-40. {182, 195, 197, 361, 475}
53. -, A Givens-weight representation for rank structured matrices, SIAM Journal on Matrix Analysis and Applications 29(2007), no. 4, 1147-1170. {12, 13, 111, 122, 259, 361, 475}
54. -, A Hessenberg reduction algorithm for rank structured matrices, SIAM Journal on Matrix Analysis and Applications 29(2007), no. 3, 895-926. {65, 122, 361, 475}
55. -, Eigenvalue computation for unitary rank structured matrices, Journal of Computational and Applied Mathematics 213(2008), no. 1, 268-287. {222, 259, 289, 353, 475}
56. -, A QR-based solver for rank structured matrices, SIAM Journal on Matrix Analysis and Applications 30(2008), no. 2, 464-490. {158, 175, 181, 361, 475}
57. -, Unitary rank structured matrices, Journal of Computational and Applied Mathematics 215(2008), no. 1, 268-287. {122, 175, 353, 475}
58. J. W. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, Pennsylvania, USA, 1997. {24, 68, 70, 80, 157, 160, 475}
59. P. Dewilde and A.-J. van der Veen, Time-Varying Systems and Computations, Kluwer Academic Publishers, Boston, Massachusetts, USA, 1998. {181, 298, 475}
60. -, Inner-outer factorization and the inversion of locally finite systems of equations, Linear Algebra and its Applications 313(2000), 53-100. {298, 476}
61. I. S. Dhillon, Current inverse iteration software can fail, BIT 38(1998), 685-704. {270, 476}
62. I. S. Dhillon and A. N. Malyshev, Inner deflation for symmetric tridiagonal matrices, Linear Algebra and its Applications 358(2003), 139-144. {267, 268, 476}
63. F. Diele, N. Mastronardi, M. Van Barel, and E. Van Camp, On computing the spectral decomposition of symmetric arrowhead matrices, Lecture Notes in Computer Science 3044(2004), 932-941. {370, 374, 476}
64. J. J. Dongarra and D. C. Sorensen, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM Journal on Scientific and Statistical Computation 3(1987), no. 2, 139-154. {369, 370, 374, 378, 476}
65. Y. Eidelman, L. Gemignani, and I. C. Gohberg, On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms, Linear Algebra and its Applications 420(2007), no. 1, 86-101. {65, 122, 476}
66. Y. Eidelman and I. C. Gohberg, A look-ahead block Schur algorithm for diagonal plus semiseparable matrices, Computers & Mathematics with Applications 35(1997), no. 10, 25-34. {464, 476}
67. -, On a new class of structured matrices, Integral Equations and Operator Theory 34(1999), 293-324. {14, 298, 476}
68. -, A modification of the Dewilde-van der Veen method for inversion of finite structured matrices, Linear Algebra and its Applications 343-344(2002), 419-450. {298, 476}
69. Y. Eidelman, I. C. Gohberg, and V. Olshevsky, Eigenstructure of order-onequasiseparable matrices. Three-term and two-term recurrence relations, Linear Algebra and its Applications 405(2005), 1-40. {360, 476}
70. -, The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order, Linear Algebra and its Applications 404(2005), 305-324. {65, 198, 289, 292, 299, 476}
71. S. Elhay, G. H. Golub, and J. Kautsky, Updating and downdating of orthogonal polynomials with data fitting applications, SIAM Journal on Matrix Analysis and Applications 12(1991), no. 2, 327-353. {424, 426, 476}
72. D. Fasino, Rational Krylov matrices and QR-steps on hermitian diagonalplus-semiseparable matrices, Numerical Linear Algebra with Applications 12(2005), no. 8, 743-754. {222, 354-356, 476}
73. D. Fasino and L. Gemignani, Structural and computational properties of possibly singular semiseparable matrices, Linear Algebra and its Applications 340(2001), 183-198. {3, 477}
74. -, A Lanczos type algorithm for the QR-factorization of regular Cauchy matrices, Numerical Linear Algebra with Applications 9(2002), 305-319. {447, 450, 451, 477}
75. -, Direct and inverse eigenvalue problems, for diagonal-plussemiseparable matrices, Numerical Algorithms 34(2003), 313-324. {387, 450, 464, 477}
76. -, A Lanczos-type algorithm for the QR factorization of Cauchy-like matrices, Fast Algorithms for Structured Matrices: Theory and Applications (V. Olshevsky, ed.), Contemporary Mathematics, vol. 323, American Mathematical Society, Providence, Rhode Island, USA, 2003, pp. 91-104. {447, 450, 477}
77. D. Fasino, N. Mastronardi, and M. Van Barel, Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form, Fast Algorithms for Structured Matrices: Theory and Applications, Contemporary Mathematics, vol. 323, American Mathematical Society, Providence, Rhode Island, USA, 2003, pp. 105-118. {32, 64, 122, 477}
78. M. Fiedler, Basic matrices, Linear Algebra and its Applications 373(2003), 143-151. {13, 477}
79. M. Fiedler and T. L. Markham, Completing a matrix when certain entries of its inverse are specified, Linear Algebra and its Applications 74(1986), 225-237. {5, 6, 9, 477}
80. M. Fiedler and Z. Vavřín, Generalized Hessenberg matrices, Linear Algebra and its Applications 380(2004), 95-105. {13, 477}
81. R. D. Fierro and P. Chr. Hansen, Truncated VSV solutions to symmetric rank-deficient problems, BIT 42(2002), no. 3, 531-540. {404, 407, 409, 477}
82. -, UTV expansion pack: special-purpose rank-revealing algorithms, Numerical Algorithms 40(2005), 47-66. {407, 409, 477}
83. R. D. Fierro, P. Chr. Hansen, and P. S. K. Hansen, UTV tools, Matlab templates for rank-revealing UTV decompositions, Numerical Algorithms 20(1999), 165-194. {407, 409, 477}
84. F. R. Gantmacher and M. G. Kreǐn, Sur les matrices oscillatoires et complètement non négatives, Compositio Mathematica 4(1937), 445-476, (In French). {452, 477}
85. -, Oscillation Matrices and Kernels and Small Vibrations of Mechanical Systems, revised ed., AMS Chelsea Publishing, Providence, Rhode Island, USA, 2002. {5, 478}
86. W. Gautschi, On generating orthogonal polynomials, SIAM Journal on Scientific and Statistical Computation 3(1982), 289-317. {426, 478}
87. -, Computational problems and applications of orthogonal polynomials, Orthogonal Polynomials and Their Applications (C. Brezinski, L. Gori, and A. Ronveaux, eds.), IMACS Annals on Computing and Applied Mathematics, vol. 9, Baltzer Science Publishers, Basel, Switzerland, 1991, pp. 61-71. {426, 478}
88. -, The use of rational functions in numerical quadrature, Journal of Computational and Applied Mathematics 133(2001), 111-126. {465, 478}
89. -, Orthogonal Polynomials: Computation and Approximation, Oxford University Press, New York, USA, 2004. {425, 478}
90. L. Gemignani, A unitary Hessenberg QR-based algorithm via semiseparable matrices, Journal of Computational and Applied Mathematics 184(2005), 505-517. {352, 478}
91. I. C. Gohberg and V. Olshevsky, Complexity of multiplication with vectors for structured matrices, Linear Algebra and its Applications 202(1994), 163-192. {388, 478}
92. -, Fast algorithms with preprocessing for matrix-vector multiplication problems, Journal of Complexity 10(1994), no. 4, 411-427. {388, 478}
93. G. H. Golub and W. Kahan, Calculating the singular values and pseudoinverse of a matrix., SIAM Journal on Numerical Analysis 2(1965), 205-224. {44, 55, 170, 478}
94. G. H. Golub and C. F. Van Loan, Matrix Computations, third ed., Johns Hopkins University Press, Baltimore, Maryland, USA, 1996. {22-24, 40, 52, 68, 70, 81, 103, 157, 160, 163, 167, 168, 170, 183, 184, 186, 205, 223, 263, 300, 312, 320, 357, 360, 368, 395, 403, 478}
95. G. H. Golub and J. H. Welsch, Calculation of gauss quadrature rules, Mathematics of Computation 23(1969), 221-230. {427, 478}
96. W. B. Gragg, The QR algorithm for unitary Hessenberg matrices, Journal of Computational and Applied Mathematics 16(1986), 1-8. {353, 424, 478}
97. W. B. Gragg and W. J. Harrod, The numerically stable reconstruction of Jacobi matrices from spectral data, Numerische Mathematik 44(1984), 317-335. {419, 424, 425, 465, 478}
98. W. B. Gragg and A. Lindquist, On the partial realization problem, Linear Algebra and its Applications 50(1983), 277-319. {464, 478}
99. W. B. Gragg and L. Reichel, A divide and conquer algorithm for the unitary eigenproblem, Hypercube Multiprocessors 1987 (M. T. Heath, ed.), SIAM, Philadelphia, Pennsylvania, USA, 1987, pp. 639-647. {353, 479}
100. -, A divide and conquer method for unitary and orthogonal eigenproblems, Numerische Mathematik 57(1990), 695-718. {424, 479}
101. M. Gu and S. C. Eisenstat, A stable and efficient algorithm, for the rankone modification of the symmetric eigenproblem, SIAM Journal on Matrix Analysis and Applications 15(1994), no. 4, 1266-1276. {372, 375, 479}
102. -, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM Journal on Matrix Analysis and Applications 16(1995), no. 1, 172-191. {375, 378, 479}
103. W. H. Gustafson, A note on matrix inversion, Linear Algebra and its Applications 57(1984), 71-73. {5, 9, 479}
104. P. Chr. Hansen and P. Y. Yalamov, Computing symmetric rank-revealing decompositions via triangular factorization, SIAM Journal on Matrix Analysis and Applications 23(2001), no. 2, 443-458. {404, 405, 407, 479}
105. S. Helsen, A. B. J. Kuijlaars, and M. Van Barel, Convergence of the isometric Arnoldi process, SIAM Journal on Matrix Analysis and Applications 26(2005), no. 3, 782-809. {80, 479}
106. P. Henrici, Applied and Computational Complex Analysis, Wiley, West Sussex, United Kingdom, 1974. {459, 479}
107. I. C. F. Ipsen, Computing an eigenvector with inverse iteration, SIAM Review 39(1997), no. 2, 254-291. {270, 479}
108. I. T. Joliffe, Principal Component Analysis, Springer-Verlag, Berlin, Germany, 1986. {85, 479}
109. O. D. Kellogg, The oscillation of functions of an orthogonal set, American Journal of Mathematics 38(1916), 1-5. {4, 479}
110. -, Orthogonal functions sets arising from integral equations, American Journal of Mathematics 40(1918), 145-154. {4, 479}
111. I. Koltracht, Linear complexity algorithm for semiseparable matrices, Integral Equations and Operator Theory 29(1997), no. 3, 313-319. {464, 479}
112. A. B. J. Kuijlaars, Which eigenvalues are found by the Lanczos method?, SIAM Journal on Matrix Analysis and Applications 22(2000), no. 1, 306-321. {80, 133, 479}
113. R.-C. Li, Solving secular equations stably and efficiently, LAPACK Working Note 89, April 1993. {370, 374, 479}
114. F. T. Luk and S. Qiao, A symmetric rank-revealing Toeplitz matrix decomposition, Journal of VLSI Signal Processing 14(1996), no. 1, 19-28. {405, 480}
115. 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), no. 1, 149-157. {3, 57, 59, 64, 65, 122, 480}
116. N. Mastronardi, M. Schuermans, M. Van Barel, R. Vandebril, and S. Van Huffel, A Lanczos-like reduction of symmetric structured matrices into semiseparable ones, Calcolo 42(2005), no. 3-4, 227-241. {404, 480}
117. N. Mastronardi, M. Van Barel, and E. Van Camp, Divide-and-conquer algorithms for computing the eigendecomposition of symmetric diagonal-plussemiseparable matrices, Numerical Algorithms 39(2005), no. 4, 379-398. {32, 131, 367, 387, 480}
118. N. Mastronardi, M. Van Barel, E. Van Camp, and R. Vandebril, On computing the eigenvectors of a class of structured matrices, Journal of Computational and Applied Mathematics 189(2006), 580-591. {270, 480}
119. N. Mastronardi, M. Van Barel, and R. Vandebril, Computing the rank revealing factorization by the semiseparable reduction, Tech. Report TW418, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, May 2005. {409, 480}
120. A. Melman, Numerical solution of a secular equation, Numerische Mathematik 69(1995), 483-493. {374, 480}
121. -, A numerical comparison of methods for solving secular equations, Journal of Computational and Applied Mathematics 86(1997), 237-249. {374, 480}
122. -, A unifying convergence analysis of second-order methods for secular equations, Mathematics of Computation 66(1997), no. 217, 333-344. {374, 480}
123. -, Analysis of third-order methods for secular equations, Mathematics of Computation 67(1998), no. 221, 271-286. {374, 480}
124. G. Meurant, A review of the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM Journal on Matrix Analysis and Applications 13(1992), 707-728. {10, 480}
125. B. Ninness and F. Gustafsson, A unifying construction of orthonormal bases for system identification, IEEE Transactions on Automatic Control 42(1997), 515-521. {464, 480}
126. D. P. O'Leary and G. W. Stewart, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, Journal of Computational Physics 90(1990), no. 2, 497-505. {374, 480}
127. C. C. Paige, The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, PhD thesis, University of London, London, United Kingdom, 1971. {395, 481}
128. V. Y. Pan, A reduction of the matrix eigenproblem to polynomial rootfinding via similarity transforms into arrow-head matrices, Tech. Report TR-2004009, Department of Computer Science, City University of New York, New York, USA, July 2004. {65, 360, 481}
129. B. N. Parlett, The Symmetric Eigenvalue Problem, Classics in Applied Mathematics, vol. 20, SIAM, Philadelphia, Pennsylvania, USA, 1998. {24, 40, 68, 160, 183, 267, 271, 320, 357, 368, 481}
130. B. N. Parlett and D. S. Scott, The Lanczos algorithm with selective reorthogonalization, Mathematics of Computation 33(1979), no. 145, 217-238. {395, 481}
131. B. Plestenjak, M. Van Barel, and E. Van Camp, A cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem, Linear Algebra and its Applications 428(2008), 586-599. {360, 481}
132. L. Reichel, Fast QR-decomposition of Vandermonde-like matrices and polynomial least squares approximation, SIAM Journal on Matrix Analysis and Applications 12(1991), 552-564. {419, 424, 426, 447, 465, 481}
133. -, Construction of polynomials that are orthogonal with respect to a discrete bilinear form, Advances in Computational Mathematics 1(1993), 241-258. {465, 481}
134. L. Reichel, G. S. Ammar, and W. B. Gragg, Discrete least squares approximation by trigonometric polynomials, Mathematics of Computation 57(1991), 273-289. {424, 426, 481}
135. H. Rutishauser, On Jacobi rotation patterns, Experimental Arithmetics, High Speed Computing and Mathematics, Proceedings of Symposia in Applied Mathematics (N. C. Metropolis, A. H. Taub, J. Todd, and C. B. Tompkins, eds.), vol. 15, American Mathematical Society, Providence, Rhode Island, 1963, pp. 219-239. {424, 426, 481}
136. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, United Kingdom, 1992. {68, 80, 481}
137. B. Simon, Analysis of the symmetric lanczos algorithm with reorthogonalization methods, Linear Algebra and its Applications 61(1984), 101-131. {395, 481}
138. -, Orthogonal Polynomials on the Unit Circle: Part 1: Classical Theory; Part 2: Spectral Theory, Colloquium Publications, vol. 54, American Mathematical Society, Providence, Rhode Island, USA, 2004. {425, 481}
139. H. D. Simon, The lanczos algorithm, with partial reorthogonalization, Mathematics of Computation 42(1984), no. 165, 115-142. {395, 482}
140. G. W. Stewart, Matrix Algorithms, Volume I: Basic Decompositions, SIAM, Philadelphia, Pennsylvania, USA, 1998. {157, 160, 482}
141. -, The QLP approximation to the singular value decomposition, SIAM Journal on Scientific and Statistical Computation 20(1999), no. 4, 1336-1348. {138, 482}
142. -, Matrix Algorithms, Volume II: Eigensystems, SIAM, Philadelphia, Pennsylvania, USA, 2001. {40, 160, 265, 482}
143. M. Stewart, Stability properties of several variants of the unitary Hessenberg QR-algorithm in structured matrices in mathematics, Structured Matrices in Mathematics, Computer Science and Engineering, II (V. Olshevsky, ed.), Contemporary Mathematics, vol. 281, American Mathematical Society, Providence, Rhode Island, USA, 2001, pp. 57-72. {353, 482}
144. G. Szego, Orthogonal Polynomials, fourth ed., American Mathematical Society, Providence, Rhode Island, USA, 1975. {332, 425, 482}
145. L. N. Trefethen and D. Bau, Numerical Linear Algebra, SIAM, Philadelphia, Pennsylvania, USA, 1997. {24, 40, 68, 157, 160, 170, 482}
146. E. E. Tyrtyshnikov, Mosaic ranks for weakly semiseparable matrices, Large-Scale Scientific Computations of Engineering and Environmental Problems II (M. Griebel, S. Margenov, and P. Y. Yalamov, eds.), Notes on Numerical Fluid Mechanics, vol. 73, Vieweg, Braunschweig, Germany, 2000, pp. 36-41. {14, 298, 482}
147. M. Van Barel and A. Bultheel, A parallel algorithm for discrete least squares rational approximation, Numerische Mathematik 63(1992), 99-121. {426, 431, 434, 435, 482}
148. -, Discrete linearized least squares approximation on the unit circle, Journal of Computational and Applied Mathematics 50(1994), 545-563. {426, 431, 434, 435, 465, 482}
149. -, Orthonormal polynomial vectors and least squares approximation for a discrete inner product, Electronic Transactions on Numerical Analysis 3(1995), 1-23. {436, 482}
150. -, Updating and downdating of orthonormal polynomial vectors and some applications, Structured Matrices in Mathematics, Computer Science, and Engineering II (V. Olshevsky, ed.), Contemporary Mathematics, vol. 281, American Mathematical Society, Providence, Rhode Island, USA, 2001, pp. 145-162. {445, 482}
151. M. Van Barel, D. Fasino, L. Gemignani, and N. Mastronardi, Orthogonal rational functions and diagonal plus semiseparable matrices, Advanced Signal Processing Algorithms, Architectures, and Implementations XII (F. T. Luk, ed.), Proceedings of SPIE, Bellingham, Washington, USA, vol. 4791, 2002, pp. 167-170. {464, 483}
152. -, Orthogonal rational functions and structured matrices, SIAM Journal on Matrix Analysis and Applications 26(2005), no. 3, 810-829. {464, 483}
153. M. Van Barel, E. Van Camp, and N. Mastronardi, Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rank k, Numerical Linear Algebra with Applications 12(2005), 981-1000. {40, 407, 483}
154. M. Van Barel, R. Vandebril, and N. Mastronardi, An orthogonal similarity reduction of a matrix into semiseparable form, SIAM Journal on Matrix Analysis and Applications 27(2005), no. 1, 176-197. {27, 40, 78, 88, 98, 132, 483}
155. E. Van Camp, Diagonal-Plus-Semiseparable Matrices and Their Use in Numerical Linear Algebra, PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, May 2005. {40, 88, 95, 98, 387, 483}
156. E. Van Camp, N. Mastronardi, and M. Van Barel, Two fast algorithms for solving diagonal-plus-semiseparable linear systems, Journal of Computational and Applied Mathematics 164-165(2004), 731-747. {3, 171, 174, 175, 181, 280, 298, 464, 483}
157. E. Van Camp, M. Van Barel, R. Vandebril, and N. Mastronardi, An implicit QR-algorithm for symmetric diagonal-plus-semiseparable matrices, Tech. Report TW419, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, March 2005. {130, 197, 219, 222, 250, 259, 483}
158. S. Van Huffel and H. Park, Efficient reduction algorithms for bordered band matrices, Journal of Numerical Linear Algebra and Applications 2(1995), no. 2, 95-113. {64, 483}
159. R. Vandebril, Semiseparable Matrices and the Symmetric Eigenvalue Problem, PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, May 2004. {44, 132, 229, 483}
160. R. Vandebril and M. Van Barel, Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoldi (Lanczos)-Ritz values, Linear Algebra and its Applications 414(2006), 435-444. {80, 483}
161. -, A note on the nullity theorem, Journal of Computational and Applied Mathematics 189(2006), 179-190. {181, 483}
162. R. Vandebril, M. Van Barel, and N. Mastronardi, A QR-methodfor computing the singular values via semiseparable matrices, Numerische Mathematik 99(2004), 163-195. {55, 98, 237, 484}
163. -, An implicit Q theorem for Hessenberg-like matrices, Mediterranean Journal of Mathematics 2(2005), 59-275. {194, 484}
164. -, An implicit QR-algorithm for symmetric semiseparable matrices, Numerical Linear Algebra with Applications 12(2005), no. 7, 625-658. {130, 194, 217, 287, 320, 484}
165. -, A note on the representation and definition of semiseparable matrices, Numerical Linear Algebra with Applications 12(2005), no. 8, 839-858. {5, 10, 13, 144, 361, 484}
166. -, A multiple shift QR-step for structured rank matrices, Tech. Report TW489, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, April 2007. {312, 325, 484}
167. -, A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices, Tech. Report TW507, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, October 2007. {316, 325, 484}
168. -, A rational QR-iteration, Tech. Report TW405, Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3000 Leuven (Heverlee), Belgium, September 2007. {316, 318, 319, 484}
169. -, Matrix Computations and Semiseparable Matrices, Volume I: Linear Systems, Johns Hopkins University Press, Baltimore, Maryland, USA, 2008. {1, 5, 7, 8, 10, 171, 174, 175, 181, 280, 283, 289, 298, 484}
170. -, A parallel QR-factorization/solver of structured rank matrices, Electronic Transactions on Numerical Analysis 30(2008), 144-167. {290, 484}
171. R. Vandebril, E. Van Camp, M. Van Barel, and N. Mastronardi, On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form, Numerische Mathematik 104(2006), 205-239. {98, 107, 132, 484}
172. -, Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal, Numerische Mathematik 102(2006), 709-726. {33, 40, 95, 125, 484}
173. M. E. Wall, P. A. Dyck, and T. S. Brettin, SVDMAN - singular value decomposition analysis of microarray data, Bioinformatics 17(2001), no. 6, 566-568. {85, 484}
174. M. E. Wall, A. Rechtsteiner, and L. M. Rocha, Singular value decomposition and principal component analysis, A Practical Approach to Microarray Data Analysis (D. P. Berrar, W. Dubitzky, and M. Granzow, eds.), Kluwer Academic Publishers, Boston, Massachusetts, USA, 2003, pp. 1-20. {85, 485}
175. T. L. Wang, Z. J. and W. B. Gragg, Convergence of the shifted QR algorithm, for unitary Hessenberg matrices, Mathematics of Computation 71(2002), no. 240, 1473-1496. {353, 485}
176. -, Convergence of the unitary QR algorithm with unimodular Wilkinson shift, Mathematics of Computation 72(2003), no. 241, 375-385. {353, 485}
177. D. S. Watkins, Understanding the QR algorithm, SIAM Review 24(1982), no. 4, 427-440. {81, 98, 159, 316, 485}
178. -, Some perspectives on the eigenvalue problem, SIAM Review 35(1993), no. 3, 430-471. {81, 98, 159, 485}
179. -, QR-like algorithms-an overview of convergence theory and practice, The Mathematics of Numerical Analysis (J. Renegar, M. Shub, and S. Smale, eds.), Lectures in Applied Mathematics, vol. 32, American Mathematical Society, Providence, Rhode Island, USA, 1996, pp. 879-893. {81, 88, 96, 98, 103, 159, 316, 360, 485}
180. -, The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods, SIAM, Philadelphia, Pennsylvania, USA, 2007. {160, 485}
181. D. S. Watkins and L. Elsner, Chasing algorithms for the eigenvalue problem, SIAM Journal on Matrix Analysis and Applications 12(1991), no. 2, 374-384. {58, 206, 300, 485}
182. -, Convergence of algorithms of decomposition type for the eigenvalue problem, Linear Algebra and its Applications 143(1991), 19-47. {81, 84, 88, 93, 96 98, 103, 104, 106, 159, 316, 318, 485}
183. -, Theory of decomposition and bulge-chasing algorithms for the generalized eigenvalue problem, SIAM Journal on Matrix Analysis and Applications 15(1994), no. 3, 943-967. {58, 206, 485}
184. J. H. Wilkinson, Global convergence of tridiagonal QR-algorithm with origin shifts, Linear Algebra and its Applications 1(1968), 409-420. {205, 485}
185. -, The Algebraic Eigenvalue Problem, Numerical Mathematics and Scientific Computation, Oxford University Press, New York, USA, 1999. {160, 268, 359, 485}
186. H. J. Woerdeman, Matrix and Operator Extensions, CWI Tract, vol. 68, Centre for Mathematics and Computer Science, Amsterdam, Netherlands, 1989. {10, 485}
187. -, A matrix and its inverse: revisiting minimal rank completions, Operator Theory: Advances and Applications 179(2008), 329-338. {10, 486}
188. K. S. Yeung, J. Tegner, and J. J. Collins, Reverse engineering gene networks using singular value decomposition and robust regression, Proceedings of the National Academy of Sciences of the United States of America 99(2002), 6163-6168. {85, 486}
189. M.-C. K. S. Yeung and W. L. Ruzzo, Principal component analysis for clustering gene expression data, Bioinformatics 17(2001), no. 9, 763-774. {85, 486}
190. H. Zha, A two-way chasing scheme for reducing a symmetric arrowhead matrix to tridiagonal form, Numerical Linear Algebra with Applications 1(1992), no. 1, 49-57. {64, 486}
191. T. Zhang, G. H. Golub, and K. H. Law, Subspace iterative methods for eigenvalue problems, Linear Algebra and its Applications 294(1999), no. 1-3, 239-258. {81, 98, 159, 486}