Nested product decomposition of quasiseparable matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 34, Issue 4, 2013, Pages 1520-1555

  Bella, Tom ^a   Olshevsky, Vadim ^b   Stewart, Michael ^c  

^a University of Rhode Island   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Fast algorithms; Quasiseparable matrix

Indexed keywords

FAST ALGORITHMS; HOUSEHOLDER TRANSFORMATION; MATRIX-VECTOR PRODUCTS; QUASISEPARABLE MATRICES; SPARSE MATRICES;

ALGORITHMS; LINEAR SYSTEMS;

LINEAR TRANSFORMATIONS;

EID: 84892402909     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/12086354X     Document Type: Article

References (22)

1. T. F. Chan, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
2. S. Chandrasekaran, P. Dewilde, M. Gu, T. Pals, and A.-J. van der Veen, Fast stable solver for sequentially semi-separable linear systems of equations, in Lecture Notes in Comput. Sci. 2552, Springer, New York, 2002, pp. 545-554.
3. S. Chandrasekaran and M. Gu, Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices, Linear Algebra Appl., 313 (2000), pp. 107-114.
4. S. Chandrasekaran, M. Gu, and T. Pals, A fast ULV decomposition solver for hierarchically semiseparable representations, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 603-622.
5. G. Dahlquist and A. Bjorck, Numerical Methods in Scientific Computing, Vol. I, SIAM, Philadelphia, 2008.
6. P. Dewilde and A.-J. van der Veen, Time-Varying Systems and Computations, Kluwer Academic, New York, 1998.
7. P. Dewilde and A.-J. van der Veen, Inner-outer factorization and the inversion of locally finite systems of equations, Linear Algebra Appl., 313 (2000), pp. 53-100.
8. Y. Eidelman and I. Gohberg, Fast inversion algorithms for diagonal plus semiseparable matrices, Integral Equations Operator Theory, 27 (1997), pp. 165-183.
9. Y. Eidelman and I. Gohberg, A modification of the Dewilde-van der Veen method for inversion of finite structured matrices, Linear Algebra Appl., 343-344 (2002), pp. 419-450.
10. M. Fiedler and T. L. Markham, Completing a matrix when certain entries of its inverse are specified, Linear Algebra Appl., 75 (1986), pp. 225-237.
11. I. Gohberg, T. Kailath, and I. Koltracht, Linear complexity algorithms for semiseparable matrices, Integral Equations Operator Theory, 8 (1985), pp. 780-804.
12. M. Gu and S. C. Eisenstat, An efficient algorithm for computing a strong rank-revealing QR-factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
13. W. Hackbusch and B. Khoromskij, A sparse H-matrix arithmetic, part I: General complexity estimates, J. Comput. Appl. Math., 125 (2000), pp. 479-501.
14. W. Hackbusch and B. Khoromskij, A sparse H-matrix arithmetic, part II: Application to multi-dimensional problems, Computing, 64 (2000), pp. 21-47.
15. N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
16. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.
17. N. Mastronardi, S. Chandrasekaran, and S. V. Huffel, Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form, BIT, 41 (2001), pp. 149-157.
18. S. Borm, L. Grasedyck, and W. Hackbusch, Introduction to hierarchical matrices with applications, Engrg. Anal. Boundary Elements, 27 (2003), pp. 405-422.
19. G. W. Stewart, An updating algorithm for subspace tracking, IEEE Trans. Signal Process., 40 (1992), pp. 1535-1541.
20. G. W. Stewart and J.-G. Sun, Matrix Perturbation Theory, Academic Press, New York, 1990.
21. R. Vandebril, M. V. Barel, and N. Mastronardi, Matrix Computations and Semiseparable Matrices, Volume 1, Linear Systems, The Johns Hopkins University Press, Baltimore, MD 2008.
22. F. Woolfe, E. Liberty, V. Rokhlin, and M. Tygert, A fast randomized algorithm for the approximation of matrices, Appl. Comput. Harmon. Anal., 25 (2008), pp. 335-366.