AbstractRecent work in the characterization of structured matrices in terms of characteristic polynomials of principal submatrices is furthered in this paper. Some classical classes of matrices with quasiseparable structure include tridiagonal (related to real orthogonal polynomials) and banded matrices, unitary Hessenberg matrices (related to Szegö polynomials), and semiseparable matrices, as well as others. Hence working with the class of quasiseparable matrices provides new results which generalize and unify classical results.Previous work has focused on characterizing (H,1)-quasiseparable matrices, matrices with order-one quasiseparable structure that are also upper Hessenberg. In this paper, the authors introduce the concept of a twist...
In this paper we will adapt a known method for diagonal scaling of symmetric positive definite tridi...
Currently there is a growing interest in semiseparable matrices and generalized semiseparable matric...
AbstractIn this paper we design a fast new algorithm for reducing an N×N quasiseparable matrix to up...
AbstractRecent work in the characterization of structured matrices in terms of characteristic polyno...
Abstract. Recent work in the characterization of structured matrices in terms of the systems of poly...
The interplay between structured matrices and corresponding systems of polynomials is a classical to...
Interplay between structured matrices and corresponding systems of polynomials is a classical topic,...
AbstractThis paper presents explicit formulas and algorithms to compute the eigenvalues and eigenvec...
AbstractOur goal is to identify and understand matrices A that share essential properties of the uni...
In this paper, we survey several recent results that highlight an interplay between a relatively new...
AbstractIn this paper, we survey several recent results that highlight an interplay between a relati...
The first and second Frobenius companion matrices appear frequently in numerical application, but i...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
International audienceThe class of quasiseparable matrices is defined by the property that any subma...
In this paper the definition of semiseparable matrices is invest- igated. Properties of the frequent...
In this paper we will adapt a known method for diagonal scaling of symmetric positive definite tridi...
Currently there is a growing interest in semiseparable matrices and generalized semiseparable matric...
AbstractIn this paper we design a fast new algorithm for reducing an N×N quasiseparable matrix to up...
AbstractRecent work in the characterization of structured matrices in terms of characteristic polyno...
Abstract. Recent work in the characterization of structured matrices in terms of the systems of poly...
The interplay between structured matrices and corresponding systems of polynomials is a classical to...
Interplay between structured matrices and corresponding systems of polynomials is a classical topic,...
AbstractThis paper presents explicit formulas and algorithms to compute the eigenvalues and eigenvec...
AbstractOur goal is to identify and understand matrices A that share essential properties of the uni...
In this paper, we survey several recent results that highlight an interplay between a relatively new...
AbstractIn this paper, we survey several recent results that highlight an interplay between a relati...
The first and second Frobenius companion matrices appear frequently in numerical application, but i...
We present a novel algorithm to perform the Hessenberg reduction of an $n imes n$ matrix $A$ of the...
International audienceThe class of quasiseparable matrices is defined by the property that any subma...
In this paper the definition of semiseparable matrices is invest- igated. Properties of the frequent...
In this paper we will adapt a known method for diagonal scaling of symmetric positive definite tridi...
Currently there is a growing interest in semiseparable matrices and generalized semiseparable matric...
AbstractIn this paper we design a fast new algorithm for reducing an N×N quasiseparable matrix to up...