Computations with infinite Toeplitz matrices and polynomials

Linear Algebra and Its Applications

Volumn 343, Issue , 2002, Pages 21-61

  Bini, D A ^a   Gemignani, L ^a   Meini, B ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Cyclic reduction; Graeffe's method; Matrix polynomials; Nonlinear matrix equations; Polynomial computations; Spectral factorization; Toeplitz matrices

Indexed keywords

FACTORIZATION; ITERATIVE METHODS; MARKOV PROCESSES; NONLINEAR EQUATIONS; POLYNOMIALS;

CYCLIC REDUCTION; GRAEFFE'S METHOD; MATRIX POLYNOMIALS; NONLINEAR MATRIX EQUATION; SPECTRAL FACTORIZATIONS; TOEPLITZ MATRICES;

MATRIX ALGEBRA;

EID: 31244432772     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(01)00341-X     Document Type: Article

References (97)

1. G.S. Ammar, and B. Gragg Numerical experience with superfast real Toeplitz solver Linear Algebra Appl. 121 1989 185 206
2. G. Anastasi, L. Lenzini, and B. Meini Performance evaluation of a worst case model of the MetaRing MAC protocol with global fairness Performance Evaluation 29 1997 127 151
3. ∗ Linear Algebra Appl. 134 1990 53 62
4. K.J. Åström, E.I. Jury, and R.G. Agniel A numerical method for the evaluation of complex integrals IEEE Trans. Automat. Control 15 1970 468 471
5. S. Barnett, Polynomials and Linear Control Systems, in: Textbooks in Pure and Applied Mathematics, vol. 77, Marcel Dekker, New York, 1983
6. F.L. Bauer Ein direktes iterations Verfahren zur Hurwitz-zerlegung eines Polynoms Arch. Elektr. Uebertragung 9 1955 285 290
7. G. Baxter, and I.I. Hirschman An explicit inversion formula for finite-section Wiener-Hopf operators Bull. Amer. Math. Soc. 70 1964 820 823
8. D.A. Bini, S. Chakravarthy, B. Meini, A new algorithm for the design of finite capacity service units, in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, 3rd International Workshop, Saragoza (Spain), September 1999, Prensas Unversitarias de Zaragoza, 1999, pp. 247-260
9. D.A. Bini, G.M. Del Corso, G. Manzini, L. Margara, Inversion of circulant matrices over Z m, Math. Comp. (to appear)
10. D.A. Bini, A. Farusi, G. Fiorentino, B. Meini, On the regularized solution of block banded block Toeplitz systems, in: F.T. Luk (Ed.), Advanced Signal Processing Algorithms, Architectures, and Implementations IX, vol. 4116, Proceedings of SPIE, 2000, pp. 135-146
11. D.A. Bini, and L. Gemignani Fast parallel computation of the polynomial remainder sequence via Bezout and Hankel matrices SIAM J. Comput. 24 1995 63 77
12. D.A. Bini, L. Gemignani, B. Meini, Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations, Numer. Math., 2001 (Published on line, DOI 10.1007/s002110000227)
13. D.A. Bini, G. Latouche, B. Meini, Quadratically convergent algorithms for solving matrix polynomial equations, 2000 (submitted for publication)
14. D.A. Bini, B. Meini, Approximate displacement rank and applications, in: V. Olshevsky (Ed.), Proceedings AMS Conference on "Structured Matrices in Operator Theory, Numerical Analysis, Control, Signal and Image Processing", Boulder, 1999, AMS, Providence, RI (to appear)
15. D.A. Bini, and B. Meini On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems W.J. Stewart, Computations with Markov Chains 1995 Kluwer Academic Publisher Dordrecht 21 38
16. D.A. Bini, and B. Meini On the solution of a nonlinear matrix equation arising in queueing problems SIAM J. Matrix Anal. Appl. 17 1996 906 926
17. D.A. Bini, and B. Meini Improved cyclic reduction for solving queueing problems Numer. Algorithms 15 1997 57 74
18. D.A. Bini, B. Meini, Using displacement structure for solving non-skip-free M/G/1 type Markov chains, in: A. Alfa, S. Chakravarthy (Eds.), Advances in Matrix Analytic Methods for Stochastic Models - Proceedings of the 2nd International Conference on Matrix Analytic Methods, Notable Publications, NJ, 1998, pp. 17-37
19. D.A. Bini, and B. Meini Effective methods for solving banded Toeplitz systems SIAM J. Matrix Anal. Appl. 20 1999 700 719
20. D.A. Bini, and B. Meini Fast algorithms for structured problems with applications to Markov chains and queueing models T. Kailath, A.H. Sayed, Fast Reliable Methods for Matrices with Structure 1999 SIAM Philadelphia, PA 211 243 Chapter 8
21. D.A. Bini, B. Meini, Solving block banded block Toeplitz systems with banded Toeplitz blocks, in: F.T. Luk (Ed.), Advanced Signal Processing Algorithms, Architectures, and Implementations IX, vol. 3807, Proceedings of SPIE, 1999, pp. 300-311
22. D.A. Bini, B. Meini, Solving block banded block Toeplitz systems with structured blocks: algorithms and applications, in: D.A. Bini, E. Tyrtyshnikov, P. Yalamov (Eds.), Structured Matrices: Recent Developments in Theory and Computation, NOVA Science Publishers, New York, 2001, pp. 21-42
23. D.A. Bini, B. Meini, V. Ramaswami, Analyzing M/G/1 paradigms through QBDs: the role of the block structure in computing the matrix G, in: G. Latouche, P. Taylor (Eds.), Advances in Algorithmic Methods for Stochastic Models, Proceedings of the Third Conference on Matrix Analytic Methods, Notable Publications, New Jersey, USA, 2000, pp. 73-86
24. D.A. Bini, and V. Pan Polynomial division and its computational complexity J. Complexity 2 1986 179 203
25. D.A. Bini, V. Pan, Matrix and Polynomial Computations, vol. 1, Fundamental Algorithms, Birkhäuser, Boston, 1994
26. D.A. Bini, V.Y. Pan, Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors, J. Complexity 12 (4) (1996) 492-511, Foundations of Computational Mathematics Conference (Special issue), Rio de Janeiro, 1997
27. A. Böttcher, S. Grudsky, Twenty old and new asymptotic results on Toeplitz band matrices, in: D.A. Bini, E. Tyrtyshnikov, P. Yalamov (Eds.), Structured Matrices: Recent Developments in Theory and Computation, NOVA Science Publishers, New York, 2001, pp. 1-10
28. A. Böttcher, S. Grudsky, A. Kozak, and B. Silbermann Convergence speed estimates for the norms of the inverses of large truncated Toeplitz matrices Calcolo 36 2 1999 103 122
29. A. Böttcher, and B. Silbermann Introduction to Large Truncated Toeplitz Matrices 1999 Springer New York
30. G.E.P. Box, and G.M. Jenkins Time series analysis forecasting and control 1970 Holden-Day San Francisco, CA
31. L. Brugnano, and D. Trigiante Solving Differential Problems by Multistep Initial and Boundary Value Methods 1998 Gordon and Breach Amsterdam
32. A. Bultheel, Zeros of a rational function defined by its Laurent expansion, in: Padé Approximation and its Applications, Lecture Notes in Mathematics, vol. 1071, Springer, Berlin, 1984, pp. 34-48
33. B.L. Buzbee, G.H. Golub, and C.W. Nielson On direct methods for solving Poisson's equation SIAM J. Num. Anal. 7 1970 627 656
34. J.-P. Cardinal, On two iterative methods for approximating the roots of a polynomial, in: The Mathematics of Numerical Analysis, Park City, UT, 1995, AMS, Providence, RI, 1996, pp. 165-188
35. R.H. Chan, and M.K. Ng Conjugate gradient methods for Toeplitz systems SIAM Rev. 38 1996 427 482
36. P. Davis Circulant Matrices 1974 Wiley New York
37. C.J. Demeure, and C.T. Mullis The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences IEEE Trans. Acoust. Speech and Signal Process. 37 1989 545 552
38. C.J. Demeure, and C.T. Mullis A Newton-Raphson method for moving-average spectral factorization using Euclid algorithm IEEE Trans. Acoust. Speech and Signal Process. 38 1990 1697 1709
39. P.A.V. Dooren, Some numerical challenges in control theory, in: Linear Algebra for Control Theory, IMA volumes in Mathematics and Applications, vol. 62, Springer, Berlin, 1994
40. I. Emiris, V.Y. Pan, The structure of sparse resultant matrices, in: Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation (ISSAC97), ACM Press, New York, 1997, pp. 189-196
41. -1A=I Linear Algebra Appl. 194 1993 91 108
42. -1A=Q Linear Algebra Appl. 186 1993 255 275
43. ∗ Linear Algebra Appl. 247 1996 359 373
44. M. Fiedler Über das Gräffesche Verfahren Czechoslovak Math. J. 5 80 1955 506 516
45. L. Fox, and L. Hayes Polynomial factorization and the Q-D algorithm Linear Algebra Appl. 1 1968 445 468
46. P.A. Fuhrmann A Polynomial Approach to Linear Algebra 1996 Springer New York
47. H.R. Gail, S.L. Hantler, and B.A. Taylor Non-skip-free M/G/1 and G/M/1 type Markov chains Adv. Appl. Probab. 29 1997 733 758
48. H.R. Gail, S.L. Hantler, and B.A. Taylor Use of characteristics roots for solving infinite state Markov chains W.K. Grassmann, Computational Probability 2000 Kluwer Academic Publishers Dordrecht 205 255
49. L. Gemignani, On a generalization of Poincaré's theorem for matrix difference equations arising from root-finding problems, in: V. Olshevsky (Ed.), Proceedings AMS Conference on "Structured Matrices in Operator Theory, Numerical Analysis, Control, Signal and Image Processing", Boulder, 1999, AMS, Providence, RI (to appear)
50. L. Gemignani Computing a Hurwitz factorization of a polynomial J. Comput. Appl. Math. 126 2000 369 380
51. L. Gemignani Efficient and stable solution of structured Hessenberg linear systems arising from difference equations Numer. Linear Algebra Appl. 7 2000 319 335
52. L. Gemignani, Polynomial factors, lemniscates and structured matrix technology, in: D.A. Bini, P. Yalamov, E. Tyrtyshnikov (Eds.), Structured Matrices: Recent Developments in Theory and Computation, NOVA Science Publishers, New York, 2001, pp. 117-136
53. L. Gemignani, G. Lotti, A recursive block Gaussian elimination algorithm for solving block Hessenberg systems (submitted)
54. I. Gohberg, and I.A. Fel'dman Convolution Equations and Projection Methods for their Solution 1974 AMS Providence, RI
55. I. Gohberg, P. Lancaster, L. Rodman, Matrix Polynomials, Academic Press (Harcourt Brace Jovanovich Publishers), New York, 1982, Computer Science and Applied Mathematics
56. G. Golub, and C.V. Loan Matrix Computations 1989 The Johns Hopkins University Press Baltimore, MD
57. T.N.T. Goodman, C.A. Micchelli, G. Rodriguez, and S. Seatzu Spectral factorization of Laurent polynomials Adv. Comput. Math. 7 1997 429 454
58. W.B. Gragg, and L. Reichel On singular values of Hankel operator of finite rank Linear Algebra Appl. 121 1989 53 70
59. C.-H. Guo Newtons's method for discrete algebraic Riccati equations when the closed-loop matrix has eigenvalues on the unit circle SIAM J. Matrix Anal. Appl. 20 1999 279 294
60. C.-H. Guo, and P. Lancaster Iterative solution of two matrix equations Math. Comp. 68 1999 1589 1603
61. G. Heinig, and K. Rost Algebraic Methods for Toeplitz-like Matrices and Operators 1984 Akademie Berlin; Birkhäuser, Boston
62. D. Heller Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems SIAM J. Num. Anal. 13 1976 484 496
63. P. Henrici, Applied and Computational Complex Analysis, vol. 1, Wiley, New York, 1974
64. N.J. Higham, and H.-M. Kim Numerical analysis of a quadratic matrix equation IMA J. Numer. Anal. 20 2000 499 519
65. A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation, International Series in Pure and Applied Mathematics, McGraw-Hill, New York, NY, 1970
66. I.S. Iohvidov Hankel and Toeplitz Matrices and Forms 1982 Birkhäuser Boston
67. J. Jezek Conjugated and symmetric polynomial equations Kybernetika 19 1983
68. T. Kailath, and A.H. Sayed Displacement structure: theory and applications SIAM Rev. 37 1995 297 386
69. T. Kailath, and A.H. Sayed Fast Reliable Algorithms for Matrices with Structure 1999 SIAM Philadelphia
70. L.V. Kantorovich, and G.P. Akilov Functional Analysis in Normed Spaces 1964 Pergamon Press Oxford
71. D. Kershaw An analysis of the method of L. Fox and L. Hayes for the factorization of a polynomial Linear Algebra Appl. 86 1987 179 187
72. V.E. Kondrashov Extracting the roots of a polynomial in the order of increase of their moduli Soviet. Math. Dokl. 35 1987 77 81
73. P. Kravanja, M.V. Barel, Computing the Zeros of Analytic Functions, Lectures Notes in Mathematics, vol. 1727, Springer, Berlin, 2000
74. G. Latouche, and V. Ramaswami A logarithmic reduction algorithm for quasi-birth-death processes J. Appl. Probab. 30 1993 650 674
75. G. Latouche, V. Ramaswami, Introduction to matrix analytic methods in stochastic modeling, ASA-SIAM Series on Statistics and Applied Probability 5, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1999
76. L. Lenzini, B. Meini, and E. Mingozzi An efficient numerical method for performance analysis of contention MAC prostocols: a case study (PRMA++) IEEE J. Selected Areas Commun. 16 1998 653 667
77. G. Malajovich, J.P. Zubelli, Tangent Graeffe iteration, Numer. Math., 2001 (published on line DOI 10.1007/5002110100278)
78. B. Meini An improved FFT-based version of Ramaswami's formula Commun. Statist. Stochastic Models 13 1997 223 238
79. B. Meini Solving M/G/1 type Markov chains: recent advances and applications Commun. Statist. Stochastic Models 14 1998 479 496
80. -1A=Q, Math. Comp., 2001 (to appear)
81. B. Mourrain, and V.Y. Pan Multivariate polynomials, duality and structured matrices J. Complexity 16 2000 110 180
82. V. Naoumov, U.R. Krieger, D. Wagner, Analysis of a multiserver delay-loss system with a general Markovian arrival process, in: A.S. Alfa, S. Chakravarthy (Eds.), Matrix-Analytic Methods in Stochastic Models (Flint, MI), Marcel Dekker, New York, 1997, pp. 43-66
83. M.F. Neuts Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approch 1981 The Johns Hopkins University Press Baltimore, MD
84. M.F. Neuts Structured Stochastic Matrices of M/G/1 Type and Their Applications 1989 Marcel Dekker New York
85. M.A. Ostrowski Recherches sur la methode de Graeffe et les zeros des polynomes et des series de Laurent Acta Math. 72 1940 99 257
86. V.Y. Pan Solving a polynomial equation: Some history and recent progress SIAM Rev. 39 2 1997 187 220
87. V. Ramaswami A stable recursion for the steady state vector in Markov chains of M/G/1 type Commun. Statist. Stochastic Models 4 1988 183 188
88. A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Math. Dept., University of Tübingen, Tübingen, Germany, 1982
89. A. Schönhage Variations on computing reciprocals of power series Inform. Process. Lett. 74 1-2 2000 41 46
90. A.A. Semencul, Inversion of finite Toeplitz matrices and their continual analoga, chapter Appendix II, in: I.C. Gohberg, I.A. Fel'dman, R.I.O. Akad (Eds.), Projection Methods in the Solution of Wiener-Hopf Equations, Nauk, MSSR, 1967 (in Russian)
91. H.J. Stetter, Analysis of zero cluster in multivariate polynomial systems, in: R. Caviness (Ed.), Proceedings of ISSAC 96, 1996, pp. 127-136
92. G.W. Stewart On the solution of block Hessenberg systems Numer. Linear Algebra Appl. 2 1995 287 296
93. G.T. Wilson Factorization of the covariance generating function of a pure moving-average process SIAM J. Numer. Anal. 6 1969 1 7
94. P. Yalamov, and V. Pavlov Stability of the block cyclic reduction Linear Algebra Appl. 249 1996 341 358
95. D.C. Youla, and N.N. Kazanjian Bauer-type factorization of positive matrices and the theory of matrix polynomials orthogonal on the unit circle IEEE Trans. Circuits Syst. 25 1978 57 69
96. X. Zhan Computing the extremal positive definite solutions of a matrix equation SIAM J. Sci. Comput. 17 1996 1167 1174
97. -1A=I Linear Algebra Appl. 247 1996 337 345