poly-cool 0.2.0

Polynomial root-finding

Coverage
100%
2 out of 2 items documented0 out of 0 items with examples
Size
Source code size: 80.48 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 2.1 MB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 15s Average build duration of successful builds.
all releases: 12s Average build duration of successful builds in releases after 2024-10-23.
Links
jneem/poly-cool
6 0 0
crates.io
Dependencies
Versions
Owners

poly-cool

A pre-alpha crate for finding roots of low-degree polynomials.

This crate's goal is to provide well-tested and decently-optimized methods for finding roots of polynomials. Currently, we have implemented Blinn's method for cubics and Yuksel's algorithm for polynomials of arbitrary degree. The "well-tested" and "decently-optimized" parts are still aspirational.