System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Levinson-type algorithms for polynomial fitting and for Cholesky and Q factors of Hankel and Vandermonde matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Porsani, M.J. ; Programa de Pesquisa e Pos-Graduacao em Geofisica, Univ. Federal da Bahia, Salvador, Brazil ; Ulrych, T.J.

This paper presents Levinson (1947)-type algorithms for (i) polynomial fitting (ii) obtaining a Q decomposition of Vandermonde matrices and a Cholesky factorization of Hankel matrices (iii) obtaining the inverse of Hankel matrices. The algorithm for the least-squares solution of Hankel systems of equations requires 3n2+9n+3 multiply and divide operation (MDO). The algorithm for obtaining an orthogonal representation of an (m×n) Vandermonde matrix X and computing the Cholesky factors F of Hankel matrices requires 5mn+n2 +2n-3m MDO, and the algorithm for generating the inverse of Hankel matrices requires 3(n2+n-2)/2 MDO. Our algorithms have been tested by means of fitting of polynomials of various orders and Fortran versions of all subroutines are provided in the Appendix

Published in:

Signal Processing, IEEE Transactions on  (Volume:43 ,  Issue: 1 )