A Traub-like Algorithm for Hessenbergquasiseparable- Vandermonde Matrices of Arbitrary Order
Although Gaussian elimination uses O(n 3) operations to invert an arbitrary matrix, matrices with a special Vandermonde structure can be inverted in only O(n 2) operations by the fast Traub algorithm. The original version of Traub algorithm was numerically unstable although only a minor modification of it yields a high accuracy in practice. The Traub algorithm has been extended from Vandermonde matrices involving monomials to polynomial-Vandermonde matrices involving real orthogonal polynomials, and the Szegö polynomials.
In this paper we consider a new more general class of polynomials that we suggest to call Hessenberg order m quasisseparable polynomials, or (H, m)-quasiseparable polynomials. The new class is wide enough to include all of the above important special cases, e.g., monomials, real orthogonal polynomials and the Szcgö polynomials, as well as new subclasses. We derive a fast O(n 2) Traub-like algorithm to invert the associated (H, m)-quasisseparable-Vandermonde matrices.
The class of quasiseparable matrices is garnering a lot of attention recently; it has been found to be useful in designing a number fo fast algorithms. The derivation of our new Traub-like algorithm is also based on exploiting quasiseparable structure of the corresponding Hessenberg matrices. Preliminary numerical experiments are presented comparing the algorithm to standard structure ignoring methods.
This paper extends our recent results in  from the (H,0)-and (H,1)-quasiseparable cases to the more general (H, m)-quasiseparable case.
Mathematics Subject Classification (2000)15A09 15–04 15B05
KeywordsOrthogonal polynomials Szego polynomials quasiseparable matrices Vandermonde matrices Hessenberg matrices inversion fast algorithm
Unable to display preview. Download preview PDF.
- M. Bakonyi and T. Constantinescu, Schur’s algorithm and several applications, in Pitman Research Notes in Mathematics Series, vol. 61, Longman Scientific and Technical, Harlow, 1992.Google Scholar
- T. Bella, Y. Eidelman, I. Gohberg, I. Koltracht and V. Olshevsky A fast Bjorck-Pereyra like algorithm for solving Hessenberg-quasiseparable-Vandermonde systems, submitted to SIAM Journal of Matrix Analysis (SIMAX), 2007.Google Scholar
- T. Bella, Y. Eidelman, I. Gohberg, V. Olshevsky, Classifications of three-term and two-term recurrence relations and digital filter structures via subclasses of quasiseparable matrices, submitted to SIAM Journal of Matrix Analysis (SIMAX), 2007.Google Scholar
- T. Bella, Y. Eidelman, I. Gohberg, V. Olshevsky, E. Tyrtyshnikov Fast Traub-like inversion algorithm for Hessenberg order one quasiseparable Vandermonde matrices, submitted to Journal of Complexity, 2007.Google Scholar
- Calvetti, D. and Reichel, L., Fast inversion of Vandermonde-like matrices involving orthogonal polynomials, BIT, 1993.Google Scholar
- G. Forney, Concatenated codes, The M.I.T. Press, 1966, Cambridge.Google Scholar
- L.Y. Geronimus, Polynomials orthogonal on a circle and their applications, Amer. Math. Translations, 3 p. 1–78, 1954 (Russian original 1948).Google Scholar
- I. Gohberg and V. Olshevsky, A fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices, Journal of Complexity, 13(2) (1997), 208–234. A short version in Proceedings in Communications, Computation, Control and Signal Processing: A tribute to Thomas Kailath, Eds. A. Paulraj, V. Roychowdhury and C. Shaper, Kluwer Academic Publishing, 1996, 205-221.zbMATHCrossRefMathSciNetGoogle Scholar
- U. Grenader and G. Szegö, Toeplitz forms and Applications, University of California Press, 1958.Google Scholar
- W.G. Horner, A new method of solving numerical equations of all orders by continuous approximation, Philos. Trans. Roy. Soc. London, (1819), 308–335.Google Scholar
- V. Olshevsky, Associated polynomials, unitary Hessenberg matrices and fast generalized Parker-Traub and Bjorck-Pereyra algorithms for Szegö-Vandermonde matrices invited chapter in the book “Structured Matrices: Recent Developments in Theory and Computation,” 67–78, (D. Bini, E. Tyrtyshnikov, P. Yalamov., Eds.), 2001, NOVA Science Publ., USA.Google Scholar
- V. Olshevsky, Pivoting for structured matrices and rational tangential interpolation, in Fast Algorithms for Structured Matrices: Theory and Applications, CONM/323, 1–75, AMS publications, May 2003.Google Scholar
- J. Stoer, R. Bulirsch, Introduction to Numerical Analysis, Springer-Verlag, 1992. 277–301.Google Scholar