AngouriMath

Symbolics for .NET


Table of contents

AngouriMath

Navigation
Home Quick start Wiki Almanac Research What's new Try Use Angouri.org GitHub Report a bug Donate Contacts

Polynomials

← Back to list of classes

Description

Summary

The polynomial layer: factorisation over the rationals, multivariate greatest
common divisors, resultants and discriminants.

Remarks

These are the operations Simplify(System.Int32),
Solve(AngouriMath.Entity.Variable) and Integrate(AngouriMath.Entity.Variable) already run internally, offered here directly. A caller who wants the factors, the
common divisor or the eliminant — rather than whatever a simplification decides to
do with them — had no way to ask for one, and no way to find out that the request
was outside what the layer can do.
Every one of these answers null rather than guessing.null means "I could not settle this" — the input is not a
polynomial of the shape the operation needs, or it is one but past a bound the
implementation carries. It never means "the answer is the input": a polynomial
that does not factor comes back as itself from Factor(AngouriMath.Entity,AngouriMath.Entity.Variable), which is a
statement that it is irreducible over the rationals, and is a different thing from
a refusal. The bounds are stated on each member.
 Part of the polynomial layer of
#746, item 43.

Members

























Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online