S. Sans and ·. , Avec SVD) pour une matrice de Hankel d'ordre 400

S. Sans and ·. , Avec SVD) pour une matrice de Hankel d'ordre 448

. Comme-c-'est-le-cas-pour-la-valeur-absolue, une norme sertàsert`sertà mesurer la distance x ? y entre deuxélémentsdeuxéléments Sur un espace vectoriel, il se peut que l'on puisse définir plusieurs normes. Cependant, si l'espace est de dimension finie, toutes les normes sontéquivalentessontéquivalentes c'est-` a-dire qu'il existera des inégalités entre elles. Par conséquent si deuxélémentsdeuxéléments sont voisins au sens d'une certaine norme, il en sera de même pour une autre norme

. De-zéro, Ce genre de mécanisme est utilisé dans les standards JPEG et MPEG

A. , A. , L. , and S. Bini, 3 Réduction de la matrice de Hankel réelle via Schur function, A, vol.3, p.11

K. E. Atkinson, An Introduction to Numerical Analysis, 1989.

N. I. Akhiezer and M. Krein, Some questions in the theory of moments, 1962.

Z. Bai, J. Demmel, J. Dongarra, and A. , Ruhe and H. van der Vorst, editors, Templates for the solution of Algebraic Eigenvalue Problems : A Practical Guide, 2000.

S. Basu, R. Pollack, and M. F. Roy, Algorithms in real algebraic geometry, 2003.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

S. Belhaj, A fast method to block-diagonalize a Hankel matrix, Numerical Algorithms, vol.27, issue.1, pp.15-34, 2008.
DOI : 10.1007/s11075-007-9144-9

S. Belhaj, Block factorization of a Hankel matrix and Euclidean Algorithm, Math. Model. Nat. Phenom, vol.5, issue.7, pp.38-44, 2010.

S. Belhaj, Computing the block factorization of complex Hankel matrices, Computing, vol.27, issue.3-4, pp.169-186, 2010.
DOI : 10.1007/s00607-010-0080-5

S. Belhaj, Computing the block factorization of complex Hankel matrices, 16th ILAS Conference, 2010.
DOI : 10.1007/s00607-010-0080-5

S. Belhaj, Block diagonalization of Hankel and Bézout matrices : connection with the Euclidean Algorithm, Numerical Analysis and Scientific Computing with Applications, 2009.

S. Belhaj, Factorisation des matrices de Hankel et de Bézout : connexion avec l'algorithme d'Euclide, TAM TAM'09 4` eme Colloque sur les Tendances dans les Applications Mathématiques en Tunisie, pp.4-8, 2009.

S. Belhaj, Factorisation par blocs des matrices de Hankel et l'algorithme d'Euclide , JANO'09, pp.60-63, 2008.

S. Belhaj, Sur le calcul de la suite des restes et des quotients via la matrice de Hankel, CFMCF'01, 2008.

S. Belhaj, Block factorization of a Hankel matrix and Euclidean Algorithm, IMACS'09, 2008.

S. Belhaj, Factorisation approchée des matrices de Hankel, 2007.

S. Belhaj, Factorisation de la matrice de Hankel, 2007.

S. Belhaj, Une méthode rapide de diagonalisation par blocs approchée de la matrice de Hankel, TAM-TAM'07, 2007.

S. Belhaj, Sur une méthode de diagonalisation par blocs approchée de la matrice de Hankel, EJCMI'07, 2007.

N. and B. Atti, Calcul rapide sur les matrices structurées : les matrices de Hankel, 2008.

N. B. Atti and G. M. Diaz-toca, Block diagonalization and LU-equivalence of Hankel matrices, Linear Algebra and its Applications, vol.412, issue.2-3, pp.247-269, 2006.
DOI : 10.1016/j.laa.2005.06.029

D. Bini, Parallel Solution of Certain Toeplitz Linear Systems, SIAM Journal on Computing, vol.13, issue.2, pp.268-276, 1984.
DOI : 10.1137/0213019

D. Bini and L. Gemignani, Fast Parallel Computation of the Polynomial Remainder Sequence via B??zout and Hankel Matrices, SIAM Journal on Computing, vol.24, issue.1, pp.63-77, 1995.
DOI : 10.1137/S0097539791201903

D. A. Bini and L. Gemignani, Fast fraction-free triangularization of Bezoutians with applications to sub-resultant chain computation, Linear Algebra and its Applications, vol.284, issue.1-3, pp.19-39, 1998.
DOI : 10.1016/S0024-3795(98)10075-7

D. Bini and V. Pan, Polynomial division and its computational complexity, Journal of Complexity, vol.2, issue.3, pp.179-203, 1986.
DOI : 10.1016/0885-064X(86)90001-4
URL : http://doi.org/10.1016/0885-064x(86)90001-4

L. Brutman, Lebesgue functions for polynomial interpolation?a survey, Ann. Numer. Math, vol.4, pp.111-127, 1997.

A. Bultheel, M. Van, and . Barel, Linear algebra, rational approximation and orthogonal polynomials, Studies in computational Mathematics, vol.6, 1997.

P. Boito, A. Borodin, J. Zur-gathen, and J. Hopcroft, Structured Matrix Based Methods for Approximate Polynomial GCD Fast parallel matrix and gcd computation , information and control, pp.52-241, 1982.

W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM, vol.18, issue.4, pp.478-504, 1971.
DOI : 10.1145/321662.321664

W. S. Brown and J. F. Traub, On Euclid's Algorithm and the Theory of Subresultants, Journal of the ACM, vol.18, issue.4, pp.505-514, 1971.
DOI : 10.1145/321662.321665

W. Chen, C. H. Smith, and S. C. Fralick, A fast computational algorithm for the discrete cosine transform, IEEE Trans. Commun., COM-25, pp.1004-1009, 1977.

G. E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM, vol.14, issue.1, pp.128-142, 1967.
DOI : 10.1145/321371.321381
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.8488

E. W. Cheney, Introduction to Approximation Theory, 1982.

R. E. Cline, R. J. Plemmons, and G. Worm, Generalized inverses of certain Toeplitz matrices, Generalized Inverses of Certain Toeplitz Matrices, pp.25-33, 1974.
DOI : 10.1016/0024-3795(74)90004-4

D. Commenges and M. , Monsion, Fast inversion of triangular Toeplitz matrices, IEEE Trans. Automat. Control AC, pp.29-250, 1984.

R. Chan and M. K. Ng, Conjugate Gradient Methods for Toeplitz Systems, SIAM Review, vol.38, issue.3, pp.427-482, 1996.
DOI : 10.1137/S0036144594276474

G. M. Diaz-toca and N. B. Atti, Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm, International Journal of Computer Mathematics, vol.6, issue.1, pp.135-149, 2009.
DOI : 10.1006/jsco.2000.0427

G. M. Diaz, ?. Toca, L. Gonzalez, and ?. Vega, Barnett???s Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices, Journal of Symbolic Computation, vol.34, issue.1, pp.59-81, 2002.
DOI : 10.1006/jsco.2002.0542

I. Z. Emiris, A. Galligo, and H. Lombardi, Certified approximate univariate GCDs, Journal of Pure and Applied Algebra, vol.117, issue.118, pp.117-118, 1997.
DOI : 10.1016/S0022-4049(97)00013-3
URL : http://doi.org/10.1016/s0022-4049(97)00013-3

G. H. Golub, P. Milanfar, and J. Varah, A Stable Numerical Method for Inverting Shape from Moments, Sei. Comp. and Comp'l. Math. Pgm, 1997.
DOI : 10.1137/S1064827597328315

W. B. Gragg and A. Lindquist, On the partial realization problem, Linear Algebra and its Applications, vol.50, pp.277-319, 1983.
DOI : 10.1016/0024-3795(83)90059-9

W. Habicht, Eine Verallgemeinerung des Sturmschen Wurzelz??hlverfahrens, Commentarii Mathematici Helvetici, vol.21, issue.1, pp.99-116, 1948.
DOI : 10.1007/BF02568028
URL : http://www.digizeitschriften.de/download/PPN358147735_0021/PPN358147735_0021___log11.pdf

M. Heideman, C. Johnson, and . Burrus, Gauss and the history of the fast fourier transform, IEEE ASSP Magazine, issue.1, pp.14-21, 1984.

G. Heining and K. Rost, Algebraic methods for Toeplitz-like matrices and operators, 1984.

G. Heinig and U. , Hankel matrices generated by Markov Parameters, Hankel matrix extension, partial realization, and Pade approximation, in : Operator Theory : Advances and Applications, pp.19-231, 1986.

V. Hribernig, Sensitivity of Algebraic Algorithms, 1994.

V. Hribernig and H. J. Stetter, Detection and Validation of Clusters of Polynomial Zeros, Journal of Symbolic Computation, vol.24, issue.6, pp.667-681, 1997.
DOI : 10.1006/jsco.1997.0160

A. K. Jain, Fundamentals of Digital Image Processing, 1989.

R. E. Kalman, On partial realizations, transfer functions and canonical forms, Acta Polytech. Stand, pp.31-40, 1979.

S. Y. Kung, Multivariable and Multidimensional Systems, 1977.

P. Lancaster and M. Tismenetsky, The Theory of Matrices, Computer Science and Applied Mathematics, 1985.

M. Noda and T. Sasaki, Approximate GCD and its application to ill-conditioned equations, Journal of Computational and Applied Mathematics, vol.38, issue.1-3, pp.335-351, 1991.
DOI : 10.1016/0377-0427(91)90180-R

W. Fu-rong-lin, M. K. Ching, and . Ng, Fast inversion of triangular Toeplitz matrices, Theoretical computer Science, vol.315, pp.511-523, 2004.

Y. Victor and . Pan, Structured matrices and polynomials : Unified Superfast Algorithms Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices, Pan, Z. Q. Chen Applied Mathematics Letters, vol.12, pp.1-2, 1999.

D. Pal and T. Kailath, Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.2, pp.16-451, 1990.
DOI : 10.1137/S0895479889172643

V. Pan, E. Landowne, and A. Sadikou, Univariate polynomial division with a remainder by means of evaluation and interpolation, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp.212-217, 1991.
DOI : 10.1109/SPDP.1991.218277

V. Pan, A. Sadikou, and E. Landowne, Polynomial division with a remainder by means of evaluation and interpolation, Information Processing Letters, vol.44, issue.3, pp.149-153, 1992.
DOI : 10.1016/0020-0190(92)90055-Z

J. Phillips, The Triangular Decomposition of Hankel Matrices, Mathematics of Computation, vol.25, issue.115, pp.599-602, 1971.
DOI : 10.2307/2005223

J. Rissanen, Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials, Mathematics of Computation, vol.27, issue.121, pp.27-147, 1973.
DOI : 10.1090/S0025-5718-1973-0329235-5

T. J. Rivlin and H. C. Garnier, The lebesgue constants for polynomial interpolation, Functional Analysis and its Applications, pp.422-437, 1974.
DOI : 10.1007/BFb0063594

A. Schönhage, Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients, Proceedings, EURO- CAM, 1982.

A. Schönhage and Q. Computations, Quasi-GCD computations, Journal of Complexity, vol.1, issue.1, pp.118-137, 1985.
DOI : 10.1016/0885-064X(85)90024-X

C. Van and L. , Computational frameworks for the fast Fourier transform, Frontiers in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), vol.10, 1992.
DOI : 10.1137/1.9781611970999