An implicit Q theorem for Hessenberg-like matrices

Mediterranean Journal of Mathematics

Volumn 2, Issue 3, 2005, Pages 259-275

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

^a UNIVERSITY OF LEUVEN   (Belgium)

^b National Council of Italy   (Italy)

Author keywords

Hessenberg like matrices; Implicit Q theorem; Inverse of Hessenberg matrices; Semiseparable matrices

Indexed keywords

EID: 27844453929     PISSN: 16605446     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00009-005-0043-9     Document Type: Article

References (17)

1. ij = 0 for j > i + p, Math. Scand., 7 (1959), 57-60.
2. S. O. Asplund, Finite boundary value problems solved by Green's matrix, Math. Scand., 7 (1959), 49-56.
3. R. Bevilacqua and G. M. Del Corso, Existence, uniqueness and algorithms for matrix unitary reduction to semiseparable form, report TR-03-12, University of Pisa, July 2003.
4. D. A. Bini, F. Daddi and L. Gemignani, On the shifted QR-iteration applied to Frobenius matrices, Electron. Trans. Numer. Anal., 18 (2004), 137-152.
5. D. A. Bini, L. Gemignani and V. Y. Pan, QR-like algorithms for generalized semi-separable matrices, Technical Report 1470, Department of Mathematics, University of Pisa, 2004.
6. S. Chandrasekaran and M. Gu, Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices, Linear Algebra Appl., 313 (2000), 107-114.
7. S. Chandrasekaran and M. Gu, A divide and conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semi-separable matrices, Numer. Math., 96 (no. 4) (2004), 723-731.
8. D. Fasino and L. Gemignani, Structural and computational properties of possibly singular semiseparable matrices, Linear Algebra Appl., 340 (2001), 183-198.
9. D. Fasino, N. Mastronardi and M. Van Barel, Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form, Contemp. Math., 323 (2003), 105-118.
10. M. Fiedler and T. L. Markham, Completing a matrix when certain entries of its inverse are specified, Linear Algebra Appl., 74 (1986), 225-237.
11. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins Univ. Press, third edition, 1996.
12. 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 (no. 4) (2005), 379-398.
13. G. Strang and T. Nguyen, The interplay of ranks of submatrices, SIAM Rev., 46 (no.4) (2004), 637-646.
14. M. Van Barel, R. Vandebril and N. Mastronardi, An orthogonal similarity reduction of a matrix into semiseparable form, SIAM J. Matrix Anal. Appl., (to appear).
15. E. Van Camp, N. Mastronardi and M. Van Barel, Two fast algorithms for solving diagonal-plus-semiseparable linear systems, J. Comput. Appl. Math., 164-165 (2004), 731-747.
16. R. Vandebril, M. Van Barel and N. Mastronardi, An implicit QR algorithm for semiseparable matrices to compute the eigendecomposition of symmetric matrices, report TW 367, Department of Computer Science, K.U.Leuven, Leuven, Belgium, August 2003, (to appear in Numer. Linear Algebra Appl.).
17. R. Vandebril, M. Van Barel and N. Mastronardi, A note on the representation and definition of semiseparable matrices, report TW 393, Department of Computer Science, K.U.Leuven, Leuven, Belgium, May 2004, (to appear in Numer. Linear Algebra Appl.).