AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given orthogonal basis. It is shown how their greatest common divisor d(λ), the quotient a(λ)/d(λ), and the quotient and remainder on division of a(λ) by b(λ) can be determined simultaneously, without any conversion into standard power form. This is done by applying elementary row operations to the matrix b(A), where A is the comrade matrix associated with a(λ)
This paper considers the application of the Sylvester resultant matrix to the computation of the deg...
AbstractWe present an algorithm for the computation of a shifted Popov normal form of a rectangular ...
This paper considers the computation of the degree t of an approximate greatest common divisor d(y)...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...
AbstractFor a given polynomial in the usual power form, its associated companion matrix can be appli...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix ...
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
This paper continues on from work presented in a previous one, concerning polynomials expressed in t...
We present new algorithms using structured matrix methods for manipulating polynomials expresse...
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
The bachelor thesis describes the relationship between the roots of the polynomial and the eigenvalu...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
This paper considers the application of the Sylvester resultant matrix to the computation of the deg...
AbstractWe present an algorithm for the computation of a shifted Popov normal form of a rectangular ...
This paper considers the computation of the degree t of an approximate greatest common divisor d(y)...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...
AbstractFor a given polynomial in the usual power form, its associated companion matrix can be appli...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix ...
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
This paper continues on from work presented in a previous one, concerning polynomials expressed in t...
We present new algorithms using structured matrix methods for manipulating polynomials expresse...
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
The bachelor thesis describes the relationship between the roots of the polynomial and the eigenvalu...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
This paper considers the application of the Sylvester resultant matrix to the computation of the deg...
AbstractWe present an algorithm for the computation of a shifted Popov normal form of a rectangular ...
This paper considers the computation of the degree t of an approximate greatest common divisor d(y)...