AbstractWe first review the basic properties of the well known classes of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations with univariate polynomials. Then we define some natural extensions of such classes of matrices based on their correlation to multivariate polynomials. We describe the correlation in terms of the associated operators of multiplication in the polynomial ring and its dual space, which allows us to generalize these structures to the multivariate case. Multivariate Toeplitz, Hankel, and Vandermonde matrices, Bezoutians, algebraic residues, and relations between them are studied. Finally, we show some applications of this study to rootfinding problems for a sy...
Abstract. In this paper, we re-investigate the resolution of Toeplitz systems T u = g, from a new po...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
We first review the basic properties of the well known classes of Toeplitz, Hankel, Vandermonde, and...
AbstractWe first review the basic properties of the well known classes of Toeplitz, Hankel, Vandermo...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
Abstract. Univariate polynomials with only real roots – while special – do occur often enough that t...
Abstract. Univariate polynomials with only real roots – while special – do occur often enough that t...
International audienceIn this paper, we re-investigate the resolution of Toeplitz systems $T\, u =g$...
International audienceIn this paper, we re-investigate the resolution of Toeplitz systems $T\, u =g$...
International audienceIn this paper, we re-investigate the resolution of Toeplitz systems $T\, u =g$...
AbstractWe present applications of matrix methods to the analytic theory of polynomials. We first sh...
Abstract. In this paper, we re-investigate the resolution of Toeplitz systems T u = g, from a new po...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
We first review the basic properties of the well known classes of Toeplitz, Hankel, Vandermonde, and...
AbstractWe first review the basic properties of the well known classes of Toeplitz, Hankel, Vandermo...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
Abstract. Univariate polynomials with only real roots – while special – do occur often enough that t...
Abstract. Univariate polynomials with only real roots – while special – do occur often enough that t...
International audienceIn this paper, we re-investigate the resolution of Toeplitz systems $T\, u =g$...
International audienceIn this paper, we re-investigate the resolution of Toeplitz systems $T\, u =g$...
International audienceIn this paper, we re-investigate the resolution of Toeplitz systems $T\, u =g$...
AbstractWe present applications of matrix methods to the analytic theory of polynomials. We first sh...
Abstract. In this paper, we re-investigate the resolution of Toeplitz systems T u = g, from a new po...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...