b-prem-sequence-subresultant
▸ function bPremSequenceSubresultant
(f
: bigint[], g
: bigint[], sturm?
: boolean): bigint[][]
Defined in euclidean-division-related/bigint/b-prem-sequence-subresultant.ts:24
Returns the subresultant pseudo remainder sequence of a/b.
precondition: g !== [], i.e. unequal to the zero polynomial.
see The subresultant polynomial remainder sequence algorithm by Ruiyuan (Ronnie) Chen, p.10
Parameters:
Name | Type | Default value | Description |
---|---|---|---|
f | bigint[] | - | the polynomial a in the formula a = bq + r; the polynomial is given with coefficients as a dense array of bigints from highest to lowest power, e.g. [5n,-3n,0n] represents the polynomial 5x^2 - 3x |
g | bigint[] | - | the polynomial b in the formula a = bq + r; |
sturm | boolean | false | if set to true then calculate a Sturm sequence instead |
Returns: bigint[][]