/MultivariatePolynomial

A symbolic, multivariate integer polynomial arithmetic library.

Primary LanguageC#MIT LicenseMIT

MultivariatePolynomial

A symbolic, multivariate integer polynomial arithmetic library.

An example of a multivariate polynomial would be:

16*x*y^2 +  12*x*y -  4*y - z
  • Supports symbolic multivariate polynomial arithmetic, including:
    • Addition
    • Subtraction
    • Multiplication
    • Division
    • Exponentiation
    • Derivatives
    • Functional composition
    • Polynomial evaluation by assigning values to the indeterminates
    • Numeric values are of type BigInteger, so it support polynomials that evaluate to arbitrarily large numbers
    • While all coefficients must be integers, it does support evaluating the polynomial with real and complex indeterminates, returning a real or complex result

Other polynomial projects & numeric types

I've written a number of other polynomial implementations and numeric types catering to various specific scenarios. Depending on what you're trying to do, another implementation of this same library might be more appropriate. All of my polynomial projects should have feature parity, where appropriate1.

  • GenericArithmetic - A core math library. Its a class of static methods that allows you to perform arithmetic on an arbitrary numeric type, represented by the generic type T, who's concrete type is decided by the caller. This is implemented using System.Linq.Expressions and reflection to resolve the type's static overloadable operator methods at runtime, so it works on all the .NET numeric types automagically, as well as any custom numeric type, provided it overloads the numeric operators and standard method names for other common functions (Min, Max, Abs, Sqrt, Parse, Sign, Log, Round, etc.). Every generic arithmetic class listed below takes a dependency on this class.

  • Polynomial - The original. A univariate polynomial that uses System.Numerics.BigInteger as the indeterminate type.

  • GenericPolynomial - A univariate polynomial library that allows the indeterminate to be of an arbitrary type, as long as said type implements operator overloading. This is implemented dynamically, at run time, calling the operator overload methods using Linq.Expressions and reflection.

  • CSharp11Preview.GenericMath.Polynomial - A univariate polynomial library that allows the indeterminate to be of an arbitrary type, but this version is implemented using C# 11's new Generic Math via static virtual members in interfaces.

  • MultivariatePolynomial - A multivariate polynomial (meaning more than one indeterminate, e.g. 2XY^2) which uses BigInteger as the type for the indeterminates.
  • GenericMultivariatePolynomial - A multivariate polynomial that allows the indeterminates to be of [the same] arbitrary type. GenericMultivariatePolynomial is to MultivariatePolynomial what GenericPolynomial is to Polynomial, and indeed is implemented using the same strategy as GenericPolynomial (i.e. dynamic calling of the operator overload methods at runtime using Linq.Expressions and reflection).
  • BigDecimal - An arbitrary precision, base-10 floating point number class.
  • BigRational - Encodes a numeric value as an Integer + Fraction
  • BigComplex - Essentially the same thing as System.Numerics.Complex but uses a System.Numerics.BigInteger type for the real and imaginary parts instead of a double.
  • IntervalArithmetic. Instead of representing a value as a single number, interval arithmetic represents each value as a mathematical interval, or range of possibilities, [a,b], and allows the standard arithmetic operations to be performed upon them too, adjusting or scaling the underlying interval range as appropriate. See Wikipedia's article on Interval Arithmetic for further information.
  • GNFS - A C# reference implementation of the General Number Field Sieve algorithm for the purpose of better understanding the General Number Field Sieve algorithm.

Footnotes

  1. For example, the ComplexPolynomial implementation may be missing certain operations (namely: Irreducibility), because such a notion does not make sense or is ill defined in the context of complex numbers). ↩