Superfast and stable structured solvers for Toeplitz least squares via randomized sampling

SIAM Journal on Matrix Analysis and Applications

Volumn 35, Issue 1, 2014, Pages 44-72

  Xi, Yuanzhe ^a   Xia, Jianlin ^a   Cauley, Stephen ^b   Balakrishnan, Venkataramanan ^c  

^a PURDUE UNIVERSITY   (United States)

^b HARVARD MEDICAL SCHOOL   (United States)

^c Purdue University   (United States)

Author keywords

HSS error and stability analysis; Randomized sampling; Rectangular HSS matrix; Superfast and stable solvers; Toeplitz least squares; URV factorization

Indexed keywords

ERROR ANALYSIS; MATRIX ALGEBRA;

ILL CONDITIONED PROBLEMS; LEAST SQUARE; LEAST SQUARES SOLUTIONS; NORMAL EQUATION METHODS; RANDOMIZED SAMPLING; STABILITY ANALYSIS; STRUCTURED DIRECT SOLVERS; SUPERFAST AND STABLE SOLVERS;

FACTORIZATION;

EID: 84897528667     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/120895755     Document Type: Article

References (39)

1. T. Bella, V. Olshevsky, and M. Stewart, Nested product decomposition of quasiseparable matrices, SIAM J. Matrix Anal. Appl., 34 (2013), pp. 1520-1555.
2. D. A. Bini, G. Codevico, and M. Van Barel, Solving Toeplitz least squares problems by means of Newton's iteration, Numer. Algorithms, 33, (2003), pp. 93-103.
3. A. W. Bojanczyk, R. P. Brent, F. R. de Hoog, and D. R. Sweet, On the stability of the Bareiss and related Toeplitz factorization algorithms, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 40-57.
4. R. H. Chan, J. G. Nagy, and R. J. Plemmons, Displacement preconditioners for Toeplitz least squares iterations, Electron. Trans. Numer. Anal., 2 (1994), pp. 44-56.
5. R. H.-F Chan and X.-Q. Jin, An Introduction to Iterative Toeplitz Solvers, SIAM, Philadelphia, 2007.
6. 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.
7. S. Chandrasekaran, P. Dewilde, M. Gu, T. Pals, X. Sun, A. J. van der Veen, and D. White, Some fast algorithms for sequentially semiseparable representations, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 341-364.
8. S. Chandrasekaran, M. Gu, X. Sun, J. Xia, and J. Zhu, A superfast algorithm for Toeplitz systems of linear equations, SIAM J. Matrix Anal. Appl., 29 (2007), pp. 1247-1266.
9. J. Chun, T. Kailath, and H. Lev-Ari, Fast parallel algorithms for QR and triangular factorization, SIAM J. Sci. Stat. Comput., 8 (1987), pp. 899-913.
10. I. Gohberg, T. Kailath, and V. Olshevsky, Fast Gaussian elimination with partial pivoting for matrices with displacement structure, Math. Comp., 64 (1995), pp. 1557-1576.
11. G. H. Golub and C. V. Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
12. M. Gu, Stable and efficient algorithms for structured systems of linear equations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 279-306.
13. M. Gu, New fast algorithms for structured linear least squares problems, SIAM J.Matrix Anal. Appl., 20 (1998), pp. 244-269.
14. M. Gu and S. C. Eisenstat, Efficient algorithms for computing a strong rank-revealing QR factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
15. M. Gu and J. Xia, A numerically stable and superfast algorithm for solving Toeplitz systems of linear equations, SIAM Conference on Applied Linear Algebra, Monterey, 2009.
16. N. Halko, P. G. Martinsson, and J. Tropp, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev., 53 (2011), pp. 217-288.
17. G. Heinig, Inversion of generalized Cauchy matrices and other classes of structured matrices, in Linear Algebra for Signal Processing, IMA Vol. Math. Appl. 69, Springer, New York, 1995, pp. 63-81.
18. G. Heinig and K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Oper. Theory Adv. Appl. 13, Birkh?auser Verlag, Basel, 1984, pp. 109-127.
19. N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, PA, 2002.
20. T. Kailath, S. Kung, and M. Morf, Displacement ranks of matrices and linear equations, J. Math. Anal. Appl., 68 (1979), pp. 395-407.
21. E. Liberty, F. Woolfe, P. G. Martinsson, V. Rokhlin, and M. Tygert, Randomized algorithms for the low-rank approximation of matrices, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 20167-20172.
22. L. Lin, J. Lu, and L. Ying, Fast construction of hierarchical matrix representation from matrix-vector multiplication, J. Comput. Phys., 230 (2011), pp. 4071-4087.
23. W. Lyons, Fast Algorithms with Applications to PDEs, Ph.D. thesis, University of California Santa Barbara, Santa Barbara, CA, 2005.
24. P. G. Martinsson, A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix, SIAM. J. Matrix Anal. Appl., 32 (2011), pp. 1251-1274.
25. P. G. Martinsson, V. Rokhlin, and M. Tygert, A fast algorithm for the inversion of general Toeplitz matrices, Comput. Math. Appl. 50 (2005), pp. 741-752.
26. M. K. Ng, Iterative Methods for Toeplitz Systems, Numer. Math. Sci. Comput., Oxford University Press, New York, 2004.
27. V. Y. Pan, On computations with dense structured matrices, Math. Comp., 55 (1990), pp. 179- 190.
28. V. Y. Pan, Parallel least-squares solution of general and Toeplitz-like linear systems, in Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architecture, ACM, New York, 1990, pp. 244-253.
29. V. Y. Pan, Transformations of Matrix Structures Work Again, preprint, arXiv:1303.0353, 2013.
30. S. Qiao, Hybrid algorithm for fast Toeplitz orthogonalization, Numer. Math., 53 (1988), pp. 351-366.
31. G. Rodriguez, Fast solution of Toeplitz- and Cauchy-like least-squares problems, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 724-748.
32. D. R. Sweet, Numerical Methods for Toeplitz Matrices, Ph.D. thesis, University of Adelaide, Adelaide, Australia, 1982.
33. F. W. Trench, Numerical solution of the eigenvalue problem for Hermitian Toeplitz matrices, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 135-146.
34. M. Van Barel, G. Heinig, and P. Kravanja, A superfast method for solving Toeplitz linear least squares problems, Linear Algbera Appl., 366 (2003), pp. 441-457.
35. J. Xia, On the complexity of some hierarchical structured matrix algorithms, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 388-410.
36. J. Xia, Randomized sparse direct solvers, SIAM J. Matrix Anal. Appl., 34 (2013), pp. 197-227.
37. J. Xia, Efficient structured multifrontal factorization for general large sparse matrices, SIAM J. Sci. Comput., 35 (2013), pp. A832-A860.
38. J. Xia, Y. Xi, and M. Gu, A superfast structured solver for Toeplitz linear systems via randomized sampling, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 837-858.
39. J. Xia, S. Chandrasekaran, M. Gu, and X. S. Li, Fast algorithms for hierarchically semiseparable matrices, Numer. Linear Algebra Appl., 17 (2010), pp. 953-976.