New fast algorithms for structured linear least squares problems

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 1, 1999, Pages 244-269

  Gu, Ming ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Displacement equation; Error analysis; Fast algorithm; Iterative refinement; Toeplitz matrix

Indexed keywords

EID: 0032217349     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/s089547989529646x     Document Type: Article

References (52)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. Du CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, 2nd ed., SIAM, Philadelphia, PA, 1995.
2. A. BJÖRCK, Iterative refinement of linear least squares solutions I, BIT, 7 (1967), pp. 257-278.
3. A. BJÖRCK, personal communication, Dept. of Math., Linköping University, Linköping, Sweden, 1996.
4. A. BOJANCZYK AND R. P. BRENT, Parallel solution of certain Toeplitz least-squares problems, Linear Algebra Appl., 77 (1986), pp. 43-60.
5. A. W. BOJANCZYK, R. P. BRENT, AND F. DE HOOG, QR factorization of Toeplitz matrices, Numer. Math., 49 (1986), pp. 81-94.
6. 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.
7. R. P. BRENT, Parallel algorithms for Toeplitz systems, in Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, G. H. Golub and P. van Dooren, eds., Springer-Verlag, New York, 1990.
8. J. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comput., 31 (1977), pp. 163-179.
9. J. R. BUNCH, Stability of methods for solving Toeplitz systems of equations, SIAM J. Sci. Stat. Comput., 6 (1985), pp. 349-364.
10. T. F. CHAN, On the existence and computation of LU-factorizations with small pivots, Math. Comp., 42 (1984), pp. 535-547.
11. S. CHANDRASEKARAN AND A. H. SAYED, A fast stable solver for nonsymmetric Toeplitz and quasi-Toeplitz systems of linear equations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 107-139.
12. S. CHANDRASEKARAN AND A. H. SAYED, Stabilizing the generalized Schur algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 950-983.
13. J. CHUN AND T. KAILATH, Generalized displacement structure for block-Toeplitz, Toeplitz-block, and Toeplitz-derived matrices, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 114-128.
14. 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.
15. G. CYBENKO, The numerical stability of the Levinson-Durbin algorithm for Toeplitz systems of equations, SIAM J. Sci. Stat. Comput., 1 (1980), pp. 303-320.
16. G. CYBENKO, A general orthorgonalization technique with applications to time series analysis and signal processing, Math. Comp., 40 (1983), pp. 323-336.
17. G. CYBENKO, Fast Toeplitz orthorgonalization using inner products, SIAM J. Sci. Stat. Comput., 8 (1987), pp. 734-740.
18. J. DANIEL, W. B. GRAGG, L. KAUFMAN, AND G. W. STEWART, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
19. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
20. M. FIEDLER, Hankel and Loewner matrices, Linear Algebra Appl., 58 (1984), pp. 75-95.
21. 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.
22. I. GOHBERG AND V. OLSHEVSKY, Complexity of multiplication with vectors for structured matrices, Linear Algebra Appl., 202 (1994), pp. 163-192.
23. I. GOHBERG AND V. OLSHEVSKY, Fast algorithm for matrix Nehari problem, in Systems and Networks: Mathematical Theory and Applications, Proc. Internat. Symposium Mathematical Theory of Networks and Systems, (MTNS-93), U. Helmke, R. Mennicken, and J. Sauers, eds., Vol. 2, 1994, pp. 687-690.
24. I. GOHBERG AND V. OLSHEVSKY, Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems, Integral Equations Operator Theory, 20 (1994), pp. 44-83.
25. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
26. M. GU, Backward perturbation bounds for linear least squares problems, SIAM J. Matrix Anal. Appl., to appear.
27. M. GU, New Fast Algorithms for Structured Linear Least Squares Problems, LBL Report LBL-37878, Lawrence Berkeley National Laboratory, Berkeley, CA, 1995.
28. M. GU, Stable and efficient algorithms for structured systems of linear equations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 279-306.
29. 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.
30. 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-Verlag, New York, 1995, pp. 95-114.
31. G. HEINIG AND K. ROST, Algebraic methods for Toeplitz-like matrices and operators, Oper. Theory, 13 (1984), pp. 109-127.
32. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
33. T.-M. HWANG, W.-W. LIN, AND E. K. YANG, Rank revealing LU factorizations, Linear Algebra Appl., 175 (1992), pp. 115-141.
34. T. KAILATH, S. KUNG, AND M. MORF, Displacement ranks of matrices and linear equations, J. Math. Anal. Appl., 68 (1979), pp. 395-407.
35. T. KAILATH AND V. OLSHEVSKY, Symmetric and Bunch-Kaufman Pivoting for Cauchy-like Matrices with Applications to Toeplitz-like Matrices, manuscript.
36. T. KAILATH AND A. H. SAYED, Fast algorithms for generalized displacement structures, in Recent Advances in Mathematical Theory of Systems, Control, Networks and Signal Processing, Vol. II, H. Kimura and S. Kodama, eds., Mita Press, Osaka, Japan, 1992, pp. 27-32.
37. T. KAILATH AND A. H. SAVED, Displacement structure: Theory and applications, SIAM Rev., 37 (1995), pp. 297-386.
38. W. KOLBEL AND H. SCHAFER, Improvement and automation of the LPSVD algorithm by continuous regularization of the singular values, J. Magnetic Resonance, 100 (1992), pp. 598-603.
39. F. T. LUK AND S. QIAO, A fast but unstable orthogonal triangularization technique for Toeplitz matrices, Linear Algebra Appl., 88/89 (1987), pp. 495-506.
40. J. G. NAGY, Fast inverse QR factorization for Toeplitz matrices, SIAM J. Sci. Comput., 14 (1993), pp. 1174-1193.
41. J. G. NAGY, Applications of Toeplitz systems, SIAM News, October 1995.
42. B. NOBLE, Computing the Moore-Penrose generalized inverse, in Generalized Inverses and Applications, M. Z. Nashed, ed., Academic Press, New York, San Diego, 1976.
43. V. PAN, On computations with dense structured matrices, Math. Comp., 55 (1990), pp. 179-190.
44. H. PARK AND L. ELDÉN, Stability Analysis and Fast Algorithms for Triangularization of Toeplitz Matrices, Tech. Report Lith-Mat-R-95-16, Department of Mathematics, Linköping University, Linköping, Sweden, 1995.
45. S. QIAO, Hybrid algorithm for fast Toeplitz orthogonalization, Numer. Math., 53 (1988), pp. 351-366.
46. D. R. SWEET, Fast Toeplitz orthogonalization, Numer. Math., 43 (1984), pp. 1-21.
47. 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.
48. D. R. SWEET AND R. P. BRENT, Error analysis of a fast partial pivoting method for structured matrices, in Advanced Signal Processing Algorithms, Proc. of SPIE, T. Luk, ed., Vol. 2363, 1995, pp. 266-280.
49. J. M. VARAH, The Prolate matrix, Linear Algebra Appl., 187 (1993), pp. 269-278.
50. B. WALDÉN, R. KARLSON, AND J.-G. SUN, Optimal backward perturbation bounds for the linear least square problem, Numer. Linear Algebra Appl., 2 (1995), pp. 271-286.
51. J. H. WILKINSON, Error analysis of direct methods of matrix inversion, J. Assoc. Comput. Mach., 10 (1961), pp. 281-330.
52. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, 1965.