dc.creator | Porsani, Milton José | |
dc.creator | Ulrych, Tadeusz J. | |
dc.creator | Porsani, Milton José | |
dc.creator | Ulrych, Tadeusz J. | |
dc.date.accessioned | 2022-10-07T16:20:28Z | |
dc.date.available | 2022-10-07T16:20:28Z | |
dc.date.issued | 1995 | |
dc.identifier | 1053-587X | |
dc.identifier | http://www.repositorio.ufba.br/ri/handle/ri/8612 | |
dc.identifier | v. 43, n. 1 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/4007215 | |
dc.description.abstract | 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. | |
dc.language | en | |
dc.source | http://dx.doi.org/10.1109/78.365286 | |
dc.subject | Algorithms | |
dc.subject | Equations | |
dc.subject | Error correction | |
dc.subject | Geophysics | |
dc.subject | Matrix decomposition | |
dc.subject | Polynomials | |
dc.subject | Q factor | |
dc.subject | Reflectivity | |
dc.subject | Testing | |
dc.subject | Wiener filter | |
dc.title | Levinson-type algorithms for polynomial fitting and for Cholesky and Q factors of Hankel and Vandermonde matrices | |
dc.type | Artigo de Periódico | |