The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the Eigenvalues of some Class of Pseudo-linear Transformations”

Three New Methods for Computing Subresultant Polynomial Remainder Sequences (PRS’S)

Akritas, Alkiviadis (2015)

Serdica Journal of Computing

Similarity:

Given the polynomials f, g ∈ Z[x] of degrees n, m, respectively, with n > m, three new, and easy to understand methods — along with the more efficient variants of the last two of them — are presented for the computation of their subresultant polynomial remainder sequence (prs). All three methods evaluate a single determinant (subresultant) of an appropriate sub-matrix of sylvester1, Sylvester’s widely known and used matrix of 1840 of dimension (m + n) × (m + n), in order to compute...

Subresultant Polynomial Remainder Sequences Obtained by Polynomial Divisions in Q[x] or in Z[x]

Akritas, Alkiviadis G., Malaschonok, Gennadi I., Vigklas, Panagiotis S. (2016)

Serdica Journal of Computing

Similarity:

In this paper we present two new methods for computing the subresultant polynomial remainder sequence (prs) of two polynomials f, g ∈ Z[x]. We are now able to also correctly compute the Euclidean and modified Euclidean prs of f, g by using either of the functions employed by our methods to compute the remainder polynomials. Another innovation is that we are able to obtain subresultant prs’s in Z[x] by employing the function rem(f, g, x) to compute the remainder polynomials in [x]. This...