Abstract
While Gaussian elimination is well known to require O(n 3) operations to invert an arbitrary matrix, Vandermonde matrices may be inverted using O(n 2) operations by a method of Traub [24]. While this original version of the Traub algorithm was noticed to be unstable, it was shown in [12] that with a minor modification, the Traub algorithm can typically yield a very high accuracy. This approach has been extended from classical Vandermonde matrices to polynomial-Vandermonde matrices involving real orthogonal polynomials [3], [10], and Szegő polynomials [19]. In this paper we present an algorithm for inversion of a class of polynomial-Vandermonde matrices with special structure related to order one quasiseparable matrices, generalizing monomials, real orthogonal polynomials, and Szegő polynomials. We derive a fast O(n 2) inversion algorithm applicable in this general setting, and explore its reduction in the previous special cases. Some very preliminary numerical experiments are presented, demonstrating that, as observed by our colleagues in previous work, good forward accuracy is possible in some circumstances, which is consistent with previous work of this type.
Mathematics Subject Classification (2010). 5A09; 65F05.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
T. Bella, Y. Eidelman, I. Gohberg, I. Koltracht and V. Olshevsky,A Björck–Pereyratype algorithm for Szegő–Vandermonde matrices based on properties of unitary Hessenbergmatrices, Linear Algebra and Applications, Volume 420, Issues 2-3 pp. 634–647, 2007.
D. Calvetti and L. Reichel, Fast inversion of Vandermonde-like matrices involving orthogonal polynomials, BIT, 1993.
Y. Eidelman and I. Gohberg, On a new class of structured matrices, Integral Equationsand Operator Theory, 34 (1999), 293–324.
Y. Eidelman and I. Gohberg, Linear complexity inversion algorithms for a class of structured matrices, Integral Equations and Operator Theory, 35 (1999), 28–52.
Y. Eidelman and I. Gohberg, A modification of the Dewilde–van der Veen method for inversion of finitestructured matrices, Linear Algebra Appl., 343-344 (2002), 419–450.
Y. Eidelman, I. Gohberg and V. Olshevsky, Eigenstructure of Order-One-Quasiseparable Matrices. Three-term and Two-term Recurrence Relations, Linear Algebra and its Applications, Volume 405, 1 August 2005, pages 1–40.
G. Forney, Concatenated codes, The M.I.T. Press, 1966, Cambridge.
L.Y. Geronimus, Polynomials orthogonal on a circle and their applications, Amer. Math. Translations, 3 pp. 1–78, 1954 (Russian original 1948).
I. Gohberg and V. Olshevsky, Fast inversion of Chebyshev–Vandermonde matrices, Numerische Mathematik, 67, No. 1 (1994), 71–92.
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 pp. 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.
I. Gohberg and V. Olshevsky, The fast generalized Parker–Traub algorithm for inversion of Vandermonde and related matrices, J. of Complexity, 13(2) (1997), 208–234.
U. Grenader and G. Szegő, Toeplitz forms and Applications, University of California Press, 1958.
W.G. Horner, A new method of solving numerical equations of all orders by continuous approximation, Philos. Trans. Roy. Soc. London, (1819), 308–335.
N. Higham, Stability analysis of algorithms for solving confluent Vandermonde-like systems, SIAM J. Matrix Anal. Appl., 11(1) (1990), 23–41.
T. Kailath and V. Olshevsky, Displacement structure approach to polynomial Vandermonde and related matrices, Linear Algebra and Its Applications, 261 (1997), 49–90.
J. Maroulas and S. Barnett, Polynomials with respect to a general basis. I. Theory, J. of Math. Analysis and Appl., 72 (1979), 177–194.
V. Olshevsky, Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegő–Vandermonde matrices via Discrete Transmission lines. Linear Algebra and Its Applications, 285 (1998), 37–67.
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.
V. Olshevsky, Pivoting for structured matrices and rational tangential interpolation, in Fast Algorithms for Structured Matrices: Theory and Applications, CONM/323, pp. 1–75, AMS publications, May 2003.
F. Parker, Inverses of Vandermonde matrices, Amer. Math. Monthly, 71 (1964), 410–411.
L. Reichel and G. Opfer, Chebyshev–Vandermonde systems, Math. of Comp., 57 (1991), 703–721.
J. Stoer, R. Bulirsch, Introduction to Numerical Analysis, Springer-Verlag, 1992, 277–301.
J. Traub, Associated polynomials and uniform methods for the solution of linear problems, SIAM Review, 8, No. 3 (1966), 277–301.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Additional information
Dedicated to Leonia Lerer on the occasion of his seventieth birthday
Rights and permissions
Copyright information
© 2013 Springer Basel
About this chapter
Cite this chapter
Bella, T., Eidelman, Y., GohbergZ”L, I., Olshevsky, V., Tyrtyshnikov, E. (2013). Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices. In: Kaashoek, M., Rodman, L., Woerdeman, H. (eds) Advances in Structured Operator Theory and Related Areas. Operator Theory: Advances and Applications, vol 237. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0639-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0639-8_8
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0638-1
Online ISBN: 978-3-0348-0639-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)