Fast and Efficient Parallel Inversion of Toeplitz and Block Toeplitz Matrices

  • Victor Pan
Part of the Operator Theory: Advances and Applications book series (OT, volume 40)


We call an n×n matrix A well-conditioned if log(cond A) = O(log n). We compute the inverse of any n×n well-conditioned and diagonally dominant Hermitian Toeplitz matrix A (with errors 1/2N, N = nc for a constant c) by a numerically stable algorithm using O(log2 log log n) parallel arithmetic steps and n log2n/log log n processors. This dramatically improves the previous results. We also compute the inverse and all the coefficients of the characteristic polynomial of any n×n nonsingular Toeplitz matrix A filled with integers (and possibly ill-conditioned) by a distinct algorithm using O(log2n) parallel arithmetic steps, O(n2) processors, and the precision of O(n log(n∥A∥1) binary digits. The results have several modifications, extensions, and further applications.


Characteristic Polynomial Toeplitz Matrix Toeplitz Matrice Displacement Generator Pade Approximation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    K.E. Atkinson, An Introduction to Numerical Analysis, Wiley, 1978.Google Scholar
  2. [B-AS85]
    A. Ben-Artzi and T. Shalom, “On Inversion of Block Toeplitz Matrices,” Integral Equations and Operator Theory, vol. 8, pp. 751–779, 1985.CrossRefGoogle Scholar
  3. [B-AS86]
    A. Ben-Artzi and T. Shalom, “On Inversion of Toeplitz and Close to Toeplitz Matrices,” Linear Algebra and Its Applications, vol. 75, pp. 173–192, 1986.CrossRefGoogle Scholar
  4. [Be]
    A. Ben-Israel, “A Note on Iterative Method for Generalized Inversion of Matrices,” Math. Computation, vol. 20, pp. 439–440, 1966.CrossRefGoogle Scholar
  5. [BA]
    R.R. Bitmead and B.D.O. Anderson, “Asymptotically Fast Solution of Toeplitz and Related Systems of Linear Equations,” Linear Algebra and Its Applics., vol. 34, pp. 103–116, 1980.CrossRefGoogle Scholar
  6. [BKAK]
    R.R. Bitmead, S.-Y. Kung, B.D.O. Anderson, and T. Kailath, “Greatest Common Divisors via Generalized Sylvester and Bezout Matrices,” IEEE Trans. on Automatic Control, vol. AC-23,6, pp. 1043–1047, 1978.CrossRefGoogle Scholar
  7. [BGH]
    A. Borodin, J. von zur Gathen, and J. Hopcroft, “Fast Parallel Matrix and GCD Computation,” Information and Control, vol. 52,3, pp. 241–256, 1982.CrossRefGoogle Scholar
  8. [BGY]
    R.P. Brent, F.G. Gustavson, and D.Y.Y. Yun, “Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximations,” J. of Algorithms, vol. 1, pp. 259–295, 1980.CrossRefGoogle Scholar
  9. [Bun]
    J.R. Bunch, “Stability of Methods for Solving Toeplitz Systems of Equations,” SIAM J. on Scientific and Statistical Computing, vol. 6,2, pp. 349–364, 1985.CrossRefGoogle Scholar
  10. [CKL-A]
    J. Chun, T. Kailath, and H. Lev-Ari, “Fast Parallel Algorithm for QR-factorization of Structured Matrices,” SIAM J. on Scientific and Statistical Computing, vol. 8,6, pp. 899–913, 1987.CrossRefGoogle Scholar
  11. [Cs]
    L. Csanky, “Fast Parallel Matrix Inversion Algorithm,” SIAM J. Computing, vol. 5,4, pp. 618–623, 1976.CrossRefGoogle Scholar
  12. [dH]
    F.R. deHoog, “On the Solution of Toeplitz Systems,” Linear Algebra and Its Applies., vol. 88/89, pp. 123–138, 1987.CrossRefGoogle Scholar
  13. [FF]
    D.K. Faddeev and V.N. Faddeeva, Computational Methods of Linear Algebra, W.H. Freeman, San Francisco, 1963.Google Scholar
  14. [FKML]
    B. Friedlander, T. Kailath, M. Morf, and L. Ljung, “Extended Levinson and Chandrasekar Equations for General Discrete-Time Linear Estimation Problems,” IEEE Trans. Automatic Control, vol. AC-23,4, pp. 653–659, 1978.CrossRefGoogle Scholar
  15. [GS]
    W. Gentleman and G. Sande, “Fast Fourier Transform for Fun and Profit,” Proc. Fall Joint Comput. Conf., vol. 29, pp. 563–578, 1966.Google Scholar
  16. [GF]
    I.C. Gohberg and I.A. Feldman, “Convolution Equations and Projection Methods for Their Solutions,” Translations of Math. Monographs, vol. 41, Amer. Math. Soc., Providence, RI, 1974.Google Scholar
  17. [GH74]
    I.C. Gohberg and G. Heinig, “Inversion of Finite Toeplitz Matrices with Entries Being Elements from a Noncommutative Algebra,” Rev. Roumaine Math. Pures Appl., vol. XIX,5, pp. 623–665, 1974.Google Scholar
  18. [GSe]
    I.C. Gohberg and A.A. Semencul, “On the Inversion of Finite Toeplitz Matrices and Their Continuous Analogs,” Mat. Issled., vol. 2, pp. 201–233 (in Russian), 1972.Google Scholar
  19. [GL]
    G.H. Golub and C.F. van Loan, Matrix Computations, Johns Hopkins Univ. Press, Baltimore, Maryland, 1983.Google Scholar
  20. [G]
    W.B. Gragg, “The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis,” SIAM Review, vol. 14,1, pp. 1–62, 1972.CrossRefGoogle Scholar
  21. [GY]
    F.G. Gustavson and D.Y.Y. Yun, “Fast Algorithms for Rational Hermite Approximation and Solution of Toeplitz Systems,” IEEE Trans. Circuits and Systems, vol. CAS-26,9, pp. 750–755, 1979.CrossRefGoogle Scholar
  22. [Heinig]
    G. Heinig, “Beitrage zur spektraltheorie von Operatorbuschen und zur algebraischen Theorei von Toeplitzmatrizen, Diss. B,” TH Karl-Marx-Stadt, 1979.Google Scholar
  23. [HR]
    G. Heining and K. Rost, “Algebraic Methods for Toeplitz-like Matrices and Operators,” Operator Theory, vol. 13, Birkhauser, 1984.Google Scholar
  24. [Kai]
    T. Kailath, “Signal Processing Applications of Some Moment Problems,” Proc. AMS Symp. in Applied Math., vol. 37, pp. 71–100, 1987.Google Scholar
  25. [KC]
    T. Kailath and J. Chun, “Generalized Gohberg-Semencul Formulas for Matrix Inversion,” manuscript, 1988.Google Scholar
  26. [KKM]
    T. Kailath, S.-Y. Kung, and M. Morf, “Displacement Ranks of Matrices and Linear Equations,” J. Math. Anal. Appl., vol. 68,2, pp. 395–407, 1979.CrossRefGoogle Scholar
  27. [KVM]
    T. Kailath, A. Viera, and M. Morf, “Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials,” SIAM Review, vol. 20,1, pp. 106–119, 1978.CrossRefGoogle Scholar
  28. [KK]
    S. Kung and T. Kailath, “Fast Projection Methods for Minimal Design Problems in Linear System Theory,” Automatica, vol. 16, pp. 399–403, 1980.CrossRefGoogle Scholar
  29. [M]
    B.R. Musicus, “Levinson and Fast Choleski Algorithms for Toeplitz and Almost Toeplitz Matrices,” Internal Report, Lab. of Electronics, M.I.T., 1981.Google Scholar
  30. [P85]
    V. Pan, “Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices,” Proc. Fifth Conference FST & TCS, Lecture Notes in Computer Science, 206, pp. 504–521, Springer Verlag, 1985.Google Scholar
  31. [P87a]
    V. Pan, “Complexity of Parallel Matrix Computations,” Theoretical Computer Science, vol. 54, pp. 65–85, 1987.CrossRefGoogle Scholar
  32. [P87b]
    V. Pan, “Sequential and Parallel Complexity of Approximate Evaluation of Polynomial Zeros,” Computers and Mathematics (with Applications), vol. 14,8, pp. 591–622, 1987.CrossRefGoogle Scholar
  33. [P88a]
    V. Pan, “Fast and Efficient Parallel Evaluation of the Zeros of a Polynomial Having Only Real Zeros,” Technical Report 88-13, Computer Science Dept., SUNY Albany, 1988.Google Scholar
  34. [P88c]
    V. Pan, “A New Acceleration of the Hilbert-Vandermonde Matrix Computations by Their Reduction to Hankel-Toeplitz Computations,” Tech. Rep. TR 88-34, Computer Science Dept., SUNY Albany, Albany, NY, 1988.Google Scholar
  35. [P88b]
    V. Pan, “New Effective Methods for Computations with Structured Matrices,” Technical Report 88-28, Computer Science Dept., SUNY Albany, 1988.Google Scholar
  36. [PR]
    V. Pan and J. Reif, “Efficient Parallel Solution of Linear Systems,” Proc. 17-th Ann. ACM Symp. on Theory of Computing, pp. 143–152, 1985.Google Scholar
  37. [PS88]
    V. Pan and R. Schreiber, “An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications,” Technical Report 88-35, Computer Science Dept., SUNYA, 1988.Google Scholar
  38. [Par]
    B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, 1980.Google Scholar
  39. [Quinn]
    M.J. Quinn, Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, New York, 1987.Google Scholar
  40. [Sc]
    A. Schönhage, “The Fundamental Theorem of Algebra in Terms of Computational Complexity,” manuscript, Dept. of Math., University of Tübingen, Tübingen, West Germany, 1982.Google Scholar
  41. [Tism]
    M. Tismenetsky, “Besoutians, Toeplitz and Hankel Matrices in the Spectral Theory of Matrix Polynomials,” Ph.D. Thesis, Technion, Haifa, 1981.Google Scholar
  42. [T64]
    W.F. Trench, “An Algorithm for Inversion of Finite Toeplitz Matrices,” J. of SIAM, vol. 12,3, pp. 515–522, 1964.Google Scholar
  43. [T65]
    W.F. Trench, “An Algorithm for Inversion of Finite Hankel Matrices,” J. of SIAM, vol. 13,4, pp. 1102–1107, 1965.Google Scholar
  44. [vzG]
    J. von zur Gathen, “Parallel Algorithms for Algebraic Problems,” SIAM J. on Comp., vol. 13,4, pp. 802–824, 1984.CrossRefGoogle Scholar
  45. [vzG86]
    J. von zur Gathen, “Parallel Arithmetic Computations: A Survey,” Proc. Math. Foundation of Comp. Science, Lecture Notes in Computer Science, vol. 233, pp. 93–112, Springer, 1986.CrossRefGoogle Scholar
  46. [vzG86a]
    J. von zur Gathen, “Representations and Parallel Computations for Rational Functions,” SIAM J. on Computing, vol. 15,2, pp. 432–452, 1986.CrossRefGoogle Scholar
  47. [W]
    J.H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.Google Scholar

Copyright information

© Birkhäuser Verlag Basel 1989

Authors and Affiliations

  • Victor Pan
    • 1
    • 2
  1. 1.Dept. of Math., Lehman CollegeCUNYBronxUSA
  2. 2.Computer Science Dept.SUNY AlbanyAlbanyUSA

Personalised recommendations