AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given orthogonal basis), it is shown how the complete set of euclidean remainders can be determined, also in generalized form. The computational scheme involves reducing the matrix b(A), where A is the comrade matrix associated with a(λ), by elementary row operations to a quasitriangular form. As a by-product, solutions to a set of linear congruences are also obtained
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
Since ancient times, for about 4000 years, many people have already solved polynomial equations in ...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...
AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given...
We present new algorithms using structured matrix methods for manipulating polynomials expresse...
Available from British Library Document Supply Centre- DSC:7673.7004(86/35) / BLDSC - British Librar...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
In this paper we present two new methods for computing the subresultant polynomial remainder sequenc...
Mención Internacional en el título de doctorMatrix polynomials arise frequently associated with Poly...
We present a framework for the construction of linearizations for scalar and matrix polynomials base...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...
Univariate and multivariate polynomials play a fundamental role in pure and applied mathematics. In ...
Gröbner bases can be used to answer fundamental questions concerning certain sets of polynomials. Fo...
We describe how the Euclidean algorithm can be interpreted as a method to solve Pade approximation p...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
Since ancient times, for about 4000 years, many people have already solved polynomial equations in ...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...
AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given...
We present new algorithms using structured matrix methods for manipulating polynomials expresse...
Available from British Library Document Supply Centre- DSC:7673.7004(86/35) / BLDSC - British Librar...
AbstractAs n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an ar...
In this paper we present two new methods for computing the subresultant polynomial remainder sequenc...
Mención Internacional en el título de doctorMatrix polynomials arise frequently associated with Poly...
We present a framework for the construction of linearizations for scalar and matrix polynomials base...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...
Univariate and multivariate polynomials play a fundamental role in pure and applied mathematics. In ...
Gröbner bases can be used to answer fundamental questions concerning certain sets of polynomials. Fo...
We describe how the Euclidean algorithm can be interpreted as a method to solve Pade approximation p...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
Since ancient times, for about 4000 years, many people have already solved polynomial equations in ...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...