It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in [1]. This approach is extended to obtain the quotients and the remainders appearing in the Euclidean algorithm applied to two polynomials u(x) and v(x) of degree n and m, respectively, whith m <
AbstractThe structure of the kernel of block Toeplitz-plus-Hankel matrices R=[aj−k+bj+k], where aj a...
AbstractWe study to which extent well-known facts concerning Vandermonde factorization or canonical ...
We give a new algorithm for the blocs diagonalization of Hankel matrices. When the matrix correspond...
It is shown that a real Hankel matrix admits an approximate block diagonalization in which...
We introduce a new algorithm for the approximate block factorization of real Hankel matrices. We the...
This paper gives displacement structure algorithms for the factorization positive definite and indef...
We describe how the Euclidean algorithm can be interpreted as a method to solve Pade approximation p...
AbstractThe inversion problem for square matrices having the structure of a block Hankel-like matrix...
In this paper, we present several high performance variants of the classical Schur algorithm to fact...
AbstractThe basic results of N.I. Achiezer and M.G. Krein from the classical polynomial moment theor...
The inversion problem for square matrices having the structure of a block Hankel-like matrix is stud...
AbstractWe introduce some generalized concepts of displacement structure for structured matrices obt...
AbstractIn this paper, we present several high performance variants of the classical Schur algorithm...
Fast algorithms to factor Toeplitz matrices have existed since the beginning of this century. The tw...
AbstractThe paper gives a self-contained survey of fast algorithms for solving linear systems of equ...
AbstractThe structure of the kernel of block Toeplitz-plus-Hankel matrices R=[aj−k+bj+k], where aj a...
AbstractWe study to which extent well-known facts concerning Vandermonde factorization or canonical ...
We give a new algorithm for the blocs diagonalization of Hankel matrices. When the matrix correspond...
It is shown that a real Hankel matrix admits an approximate block diagonalization in which...
We introduce a new algorithm for the approximate block factorization of real Hankel matrices. We the...
This paper gives displacement structure algorithms for the factorization positive definite and indef...
We describe how the Euclidean algorithm can be interpreted as a method to solve Pade approximation p...
AbstractThe inversion problem for square matrices having the structure of a block Hankel-like matrix...
In this paper, we present several high performance variants of the classical Schur algorithm to fact...
AbstractThe basic results of N.I. Achiezer and M.G. Krein from the classical polynomial moment theor...
The inversion problem for square matrices having the structure of a block Hankel-like matrix is stud...
AbstractWe introduce some generalized concepts of displacement structure for structured matrices obt...
AbstractIn this paper, we present several high performance variants of the classical Schur algorithm...
Fast algorithms to factor Toeplitz matrices have existed since the beginning of this century. The tw...
AbstractThe paper gives a self-contained survey of fast algorithms for solving linear systems of equ...
AbstractThe structure of the kernel of block Toeplitz-plus-Hankel matrices R=[aj−k+bj+k], where aj a...
AbstractWe study to which extent well-known facts concerning Vandermonde factorization or canonical ...
We give a new algorithm for the blocs diagonalization of Hankel matrices. When the matrix correspond...
DOI
Add to ORKG