AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix b(A) has rank δ(a)− k, where kis the degree of the greatest common divisor of a(λ) and b(λ). It is shown that, if the first k columns of b(A) are expressed as linear combinations of the remaining δ(a) − k columns (which are linearly independent), then the greatest common divisor is given by the coefficients of column k + 1 in these expressions
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
AbstractThis paper presents a new numerical algorithm for the computation of the greatest common div...
We show that if two monic polynomials with integer coefficients have a square-free resultant, then a...
AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix ...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given...
AbstractThis articule provides a new proof of Barnett's theorem giving the degree of the greatest co...
AbstractThis article provides a new presentation of Barnett’s theorems giving the degree (resp. coef...
This paper considers the computation of the degree t of an approximate greatest common divisor d(y)...
© 2018, Pleiades Publishing, Ltd. In this article we present a new algebraic approach to the greates...
This paper considers the application of the Sylvester resultant matrix to the computation of the deg...
AbstractFor a given polynomial in the usual power form, its associated companion matrix can be appli...
summary:The computation of the greatest common divisor (GCD) has many applications in several discip...
One of the Euclidean Domain is the ring of polynomials over reals . Since the notion of greatest com...
We investigate the row and column structure of solutions of the matrix polynomial equation A(λ)X(λ) ...
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
AbstractThis paper presents a new numerical algorithm for the computation of the greatest common div...
We show that if two monic polynomials with integer coefficients have a square-free resultant, then a...
AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix ...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given...
AbstractThis articule provides a new proof of Barnett's theorem giving the degree of the greatest co...
AbstractThis article provides a new presentation of Barnett’s theorems giving the degree (resp. coef...
This paper considers the computation of the degree t of an approximate greatest common divisor d(y)...
© 2018, Pleiades Publishing, Ltd. In this article we present a new algebraic approach to the greates...
This paper considers the application of the Sylvester resultant matrix to the computation of the deg...
AbstractFor a given polynomial in the usual power form, its associated companion matrix can be appli...
summary:The computation of the greatest common divisor (GCD) has many applications in several discip...
One of the Euclidean Domain is the ring of polynomials over reals . Since the notion of greatest com...
We investigate the row and column structure of solutions of the matrix polynomial equation A(λ)X(λ) ...
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
AbstractThis paper presents a new numerical algorithm for the computation of the greatest common div...
We show that if two monic polynomials with integer coefficients have a square-free resultant, then a...