A superfast structured solver for Toeplitz linear systems via randomized sampling

SIAM Journal on Matrix Analysis and Applications

Volumn 33, Issue 3, 2012, Pages 837-858

  Xia, Jianlin ^a   Xi, Yuanzhe ^a   Gu, Ming ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Hierarchically semiseparable matrix; Precomputation; Randomized sampling; Structure preserving rank revealing factorization; Superfast Toeplitz solver

Indexed keywords

PRE-COMPUTATION; RANDOMIZED SAMPLING; RANK-REVEALING; SEMISEPARABLE MATRICES; TOEPLITZ;

FACTORIZATION; LINEAR SYSTEMS; MATRIX ALGEBRA;

NUMERICAL METHODS;

EID: 84867319581     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/110831982     Document Type: Article

References (46)

1. G. S. Ammar and W. B. Gragg, Superfast solution of real positive definite Toeplitz systems, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 61-76.
2. A. Aricò, and G. Rodriguez, A fast solver for linear systems with displacement structure, Numer. Algorithms, 55 (2010), pp. 529-556.
3. T. Bella, V. Olshevsky, and M. Stewart, A nested product decomposition of a quasiseparable matrix, submitted.
4. A. W. Bojańczyk, 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.
5. J. P. Boyd and K. W. Gildersleeve, Numerical experiments on the condition number of the interpolation matrices for radial basis functions, Appl. Numer. Math., 61 (2011), pp. 443-459.
6. J. R. Bunch, Stability of methods for solving Toeplitz systems of equations, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 349-364.
7. R. H. Chan, J. G. Nagy, and R. J. Plemmons, Displacement preconditioners for Toeplitz least squares iterations, Electron. Trans. Numer. Anal., 2 (1994), pp. 1-13.
8. T. F. Chan and P. C. Hansen, A look-ahead Levinson algorithm for general Toeplitz systems, IEEE Trans. Signal Process., 40 (1992), pp. 1079-1090.
9. R. H. Chan and M. K. Ng, Conjugate gradient methods for Toeplitz systems, SIAM Rev., 38 (1996) pp. 427-482.
10. 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.
11. 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.
12. 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.
13. S. Chandrasekaran and A. H. Sayed, Stabilizing the fast generalized Schur algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 950-983.
14. G. Cybenko, The numerical stability of the Levinson-Durbin algorithm for Toeplitz systems of equations, SIAM J. Sci. Statist. Comput., 1 (1980), pp. 303-319.
15. 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.
16. G. H. Golub and C. V. Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
17. M. Gu, Stable and efficient algorithms for structured systems of linear equations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 279-306.
18. 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.
19. M. Gu and J. Xia, A numerically stable and superfast algorithm for solving Toeplitz systems of linear equations, Presentation in the SIAM Conference on Applied Linear Algebra, Monterey, CA, 2009.
20. N. Halko, P. G. Martinsson, and J. A. Tropp, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev., 53 (2011), pp. 217-288.
21. 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. 95-114.
22. G. Heinig, Solving Toeplitz systems after extension and transformation, Calcolo, 33 (1996), pp. 115-129.
23. G. Heinig and F. Hellinger, Displacement structure of pseudoinverses, Linear Algebra Appl., 197/198 (1994), pp. 623-649.
24. 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.
25. I. C. F. Ipsen, C. T. Kelley, and S. R. Pope, Rank-deficient nonlinear least squares problems and subset selection, SIAM J. Numer. Anal., 49 (2011), pp. 1244-1266.
26. T. Kailath, S. Y. Kung, and M. Morf, Displacement ranks of matrices and linear equations, J. Math. Anal. Appl., 68 (1979), pp. 395-407.
27. T. Kailath and A. H. Sayed, Fast algorithms for generalized displacement structures, in Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Pro cessing, Vol. II, H. Kimura and S. Kodama, eds., Mita Press, Tokyo, 1992, pp. 27-32.
28. T. Kailath and A. H. Sayed, eds., Fast Reliable Algorithms for Matrices with Structure, SIAM, Philadelphia, 1999.
29. 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.
30. 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.
31. 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.
32. P. G. Martinsson, V. Rokhlin, and M. Tygert, A Randomized Algorithm for the Approximation of Matrices, Technical Report 1361, Department of Computer Science, Yale University, New Haven, CT, 2006.
33. 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.
34. M. K. Ng and R. H. Chan, Scientific applications of iterative Toeplitz solvers, Calcolo, 33 (1996), pp. 249-267.
35. J. Olkin, Linear and Nonlinear Deconvolution Problems, Ph.D. Thesis, Rice University, Houston, TX, 1986.
36. V. Olshevski, ed., Fast Algorithms for Structured Matrices: Theory and Applications, Contemp. Math. 323, Amer. Math. Soc., Providence, RI, 2003.
37. V. Y. Pan and G. Qian, Randomized preprocessing of homogeneous linear systems of equations, Linear Algebra Appl., 432 (2010), pp. 3272-3318.
38. V. Y. Pan, On computations with dense structured matrices, Math. Comp., 55 (1990), pp. 179-190.
39. G. Strang, A proposal for Toeplitz matrix calculations, Stud. Appl. Math., 74 (1986), pp. 171-176.
40. M. Stewart, A superfast Toeplitz solver with improved numerical stability, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 669-693.
41. D. R. Sweet, The use of pivoting to improve the numerical performance of algorithms for Toeplitz matrices, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 468-493.
42. W. F. Trench, Numerical solution of the eigenvalue problem for Hermitian Toeplitz matrices, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 135-146.
43. E. E. Tyrtyshnikov, Incomplete cross approximation in the mosaic-skeleton method, Computing, 64 (2000), pp. 367-380.
44. M. Van Barel, G. Heinig, and P. Kravanja, A stabilized superfast solver for nonsymmetric Toeplitz systems, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 494-510.
45. J. Xia, On the complexity of some hierarchical structured matrix algorithms, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 388-410.
46. 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.