AngouriMath
TopReduce(AngouriMath.Functions.MultivariatePolynomial,System.Collections.Generic.List{AngouriMath.Functions.MultivariatePolynomial},AngouriMath.Functions.MonomialOrder,AngouriMath.Functions.Algebra.Groebner.GroebnerBudget)
Method (no overloads)
Summary
Reduces only while the leading monomial is divisible. Enough for Buchberger — a
remainder that is nonzero and no longer top-reducible is a correct thing to add —
and cheaper than reducing the tail nobody looks at. FullyReduce(AngouriMath.Functions.MultivariatePolynomial,System.Collections.Generic.IReadOnlyList{AngouriMath.Functions.MultivariatePolynomial},AngouriMath.Functions.MonomialOrder,AngouriMath.Functions.Algebra.Groebner.GroebnerBudget) is
the one for callers who need every term standard.
remainder that is nonzero and no longer top-reducible is a correct thing to add —
and cheaper than reducing the tail nobody looks at. FullyReduce(AngouriMath.Functions.MultivariatePolynomial,System.Collections.Generic.IReadOnlyList{AngouriMath.Functions.MultivariatePolynomial},AngouriMath.Functions.MonomialOrder,AngouriMath.Functions.Algebra.Groebner.GroebnerBudget) is
the one for callers who need every term standard.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online