Summary
The set of all Hankel (or Toeplitz) matrices of dimensionn, is shown to possess tensorial bases: bases made ofn rank one matrices. Four families of such tensorial bases are possible. From this result, we deduce that the following computations can be performed with a number of multiplications of ordern instead of ordern 2: evaluation of the 2n+1 coefficients of the polynomial product of two polynomials of degreen, evaluation of the inverse of a lower triangular toeplitz matrix, evaluation of the quotient and of the remainder in the division of a polynomial of degree 2n by a polynomial of degreen.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bareiss, E. N.: Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices, Numerische Mathematik.13, 404–424 (1969)
Gastinel, N.: Le rang tensoriel d'un ensemble de matrices.Séminaire d'Analyse Numérique. Grenoble, octobre 1972
Lafon, J. C.: Quelques applications de l'étude du rang tensoriel d'un ensemble de matrices. Séminaire d'Analyse Numérique. Grenoble, janvier 1973
Sieveking: An algorithm for division of powerseries. Computing10, 153–156 (1972)
Strassen: Vermeidung von Divisionen. Crelle Journal für die reine und angew. Mathematik. 1973
Winograd, S.: Some remarks on fast multiplication of polynomials. In complexity of sequential and parallel numerical algorithm. Symposium held at pittsburgh. May 1973. Edited by Traub. Academic Press, 1973
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lafon, JC. Base tensorielle des matrices de Hankel (ou de Toeplitz) Applications. Numer. Math. 23, 349–361 (1974). https://doi.org/10.1007/BF01438261
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01438261