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
Univariate and multivariate polynomials play a fundamental role in pure and applied mathematics. In ...
A resultant is a purely algebraic criterion for determining when a finite collection of polynomials...
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...
AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...
Available from British Library Document Supply Centre- DSC:7673.7004(86/35) / BLDSC - British Librar...
We present new algorithms using structured matrix methods for manipulating polynomials expresse...
AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given...
This paper continues on from work presented in a previous one, concerning polynomials expressed in t...
This work is intended to be a continuation of previous studies about a set of rational functions, k...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
Gröbner bases can be used to answer fundamental questions concerning certain sets of polynomials. Fo...
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of...
AbstractWe present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary a...
AbstractWork on Padé or Padé-type approximants ultimately involves the explicitdetermination of the ...
Univariate and multivariate polynomials play a fundamental role in pure and applied mathematics. In ...
A resultant is a purely algebraic criterion for determining when a finite collection of polynomials...
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...
AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...
Available from British Library Document Supply Centre- DSC:7673.7004(86/35) / BLDSC - British Librar...
We present new algorithms using structured matrix methods for manipulating polynomials expresse...
AbstractLet a(λ) and b(λ) be two polynomials expressed in generalized form, i.e. relative to a given...
This paper continues on from work presented in a previous one, concerning polynomials expressed in t...
This work is intended to be a continuation of previous studies about a set of rational functions, k...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
Gröbner bases can be used to answer fundamental questions concerning certain sets of polynomials. Fo...
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of...
AbstractWe present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary a...
AbstractWork on Padé or Padé-type approximants ultimately involves the explicitdetermination of the ...
Univariate and multivariate polynomials play a fundamental role in pure and applied mathematics. In ...
A resultant is a purely algebraic criterion for determining when a finite collection of polynomials...
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...