use-polynomial
Install
[]
= "0.0.5"
What belongs here
use-polynomial owns concrete polynomial representation and direct polynomial
operations over f64 coefficients. It provides construction, degree handling,
evaluation, derivatives, integrals, arithmetic, and small real-root helpers for
degree 1 and 2 workflows.
Coefficient ordering is explicit: coefficients[i] is the coefficient for
x^i, so 3 + 2x + x^2 is stored as vec![3.0, 2.0, 1.0].
The zero polynomial is represented as an empty coefficient vector. That keeps
degree() and leading_coefficient() explicit by returning None for the zero
polynomial.
Neighboring crates
| Crate | Responsibility |
|---|---|
use-polynomial |
Polynomial representation and direct polynomial operations |
use-equation |
Equation-solving workflows built on polynomial expressions |
use-numerical |
Iterative numerical methods and higher-degree root finding |
use-calculus |
Calculus concepts and function-based derivative workflows |
use-complex |
Complex numbers and complex roots |
use-algebra |
Algebraic structures and law checking |
use-real |
Real-number wrappers and real-specific policy |
use-optimization |
Optimization routines that may consume polynomial models |
use-polynomial intentionally does not define symbolic algebra,
interpolation frameworks, arbitrary-precision arithmetic, or complex roots in
v1.
Examples
Construct, inspect, and evaluate
use Polynomial;
let p = new;
assert_eq!;
assert_eq!;
Differentiate a polynomial
use Polynomial;
let p = new;
let derivative = p.derivative;
assert_eq!;
Solve a quadratic with real roots
use quadratic_roots;
let roots = quadratic_roots;
assert_eq!;
Status
use-polynomial is a concrete pre-1.0 crate in the RustUse math workspace.
The API stays small and explicit so adjacent equation, numerical, calculus,
algebra, complex, geometry, real-number, and optimization crates can build on a
single focused polynomial surface.