polycool
| Crates.io | polycool |
| lib.rs | polycool |
| version | 0.4.0 |
| created_at | 2025-10-09 03:01:57.456798+00 |
| updated_at | 2025-10-23 22:48:11.442086+00 |
| description | Polynomial root-finding |
| homepage | |
| repository | https://github.com/linebender/kurbo |
| max_upload_size | |
| id | 1874921 |
| size | 79,199 |
Raph Levien (raphlinus)
documentation
README
polycool
Polynomial root-finding in Rust
A small rust crate for numerically finding roots of low-degree polynomials.
use polycool::Poly;
// The polynomial x^3 - 6x^2 + 11x - 6
let p = Poly::new([-6.0, 11.0, -6.0, 1.0]);
dbg!(p.roots_between(-10.0, 10.0, 1e-6));
// [0.9999999999999996, 2.0000000000000018, 2.9999999999999982]
Currently, we implement Yuksel's iterative solver for finding roots within a given interval to a specified target accuracy.