Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: H. J. Godwin / rank | |||
Property / reviewed by | |||
Property / reviewed by: H. J. Godwin / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: REDUCE / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Subresultant PRS Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Euclid's Algorithm and the Theory of Subresultants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707405 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial Remainder Sequences and Determinants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4192968 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690211 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three new algorithms for multivariate polynomial GCD / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5766357 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The EEZ-GCD algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hensel factorization. I / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:44, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm |
scientific article |
Statements
Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (English)
0 references
29 September 1994
0 references
In calculating the GCD of multivariable polynomials one can simplify the calculation by truncating the higher powers of variables other than the main one. There is a theoretical bound for the powers to be used, but the author proposes a smaller ``practical'' bound, that speeds up the calculation. There are occasions when the practical bound is too small for the method to work, and it is described how to overcome this difficulty. Timings of various methods are given in tables.
0 references
polynomial GCD
0 references
polynomial remainder sequence
0 references
multivariable polynomials
0 references