A generic arithmetic library. Allows you to perform arithmetic on any numeric type. All .NET numeric value types are supported, as is any custom numeric type--just implement the numeric operator overloads.
$ dotnet add package ExtendedArithmetic.GenericArithmeticThis generic implementation has been tested and supports performing arithmetic on numeric types such as BigInteger, Complex, Decimal, Double, Float, BigDecimal, BigRational, BigComplex, Fraction, Int16, Int32, Int64, UInt16, UInt32, UInt64, Short, Long, Byte, or any class that has arithmetic operator overloads.
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.
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). ↩