A fast method to block-diagonalize a Hankel matrix-Reference-Cited by-同舟云学术

A fast method to block-diagonalize a Hankel matrix

Published:2007-12-12 Issue:1 Volume:47 Page:15-34
ISSN:1017-1398
Container-title:Numerical Algorithms
language:en
Short-container-title:Numer Algor

Author:

Belhaj Skander

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11075-007-9144-9.pdf

Reference19 articles.

1. Akhiezer, N.I., Krein, M.: Some questions in the theory of moments. Amer. Math. Soc. (1962)

2. Ben Atti, N., Diaz-Toca, G.M.: Block diagonalization and LU-equivalence of Hankel matrices. Linear Algebra Appl. 412, 247–269 (2006)

3. Bini, D.: Parallel solution of certain Toeplitz linear systems. SIAM J. Comput. 13, 268–276 (1984)

4. Bultheel, A., Van Barel, M.: Linear algebra, rational approximation and orthogonal polynomials. In: Studies in Computational Mathematics, vol. 6. Elsevier/North-Holland, Amsterdam (1997)

5. Bini, D., Pan, V.: Polynomial and matrix computations. Fundamental Algorithms, vol. 1. Birkhäuser (1994)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Blind image deconvolution via Hankel based method for computing the GCD of polynomials;Mathematics and Computers in Simulation;2018-02

2. Computing the polynomial remainder sequence via Bézout matrices;Journal of Computational and Applied Mathematics;2013-10

3. On the complexity of computing the GCD of two polynomials via Hankel matrices;ACM Communications in Computer Algebra;2013-01-15

4. Computing the block factorization of complex Hankel matrices;Computing;2010-02-03

5. Block Factorization of Hankel Matrices and Euclidean Algorithm;Mathematical Modelling of Natural Phenomena;2010