summaryrefslogtreecommitdiffstats
path: root/libdimension/polynomial.c
Commit message (Expand)AuthorAgeFilesLines
* Standard compliance.Tavian Barnes2010-11-101-5/+5
* Use Newton's method when the root bound is degenerate.Tavian Barnes2010-11-101-5/+27
* Stability fix for dmnsn_bisect_root().Tavian Barnes2010-11-091-4/+9
* Be more lenient about the root bracketing in dmnsn_bisect_root().Tavian Barnes2010-11-041-1/+14
* Fix ++i/--i thinko.Tavian Barnes2010-11-031-1/+1
* Pull < DMNSN_NBINOM test outside of loop.Tavian Barnes2010-11-031-20/+29
* Small polynomial.c cleanup.Tavian Barnes2010-11-011-4/+8
* Slight polynomial base case optimizations.Tavian Barnes2010-11-011-24/+25
* More numerical tweaks.Tavian Barnes2010-11-011-0/+11
* Numerical fixes for polynomial.c.Tavian Barnes2010-10-311-89/+109
* Be const-correct in polynomial.{c,h}.Tavian Barnes2010-10-301-8/+8
* Remove debug print from polynomial.c.Tavian Barnes2010-10-301-2/+0
* Fix dmnsn_print_polynomial again.Tavian Barnes2010-10-291-1/+3
* Only return non-zero roots of polynomials.Tavian Barnes2010-10-291-15/+14
* Handle narrow ranges in dmnsn_bisect_root().Tavian Barnes2010-10-281-0/+3
* Fix dmnsn_print_polynomial().Tavian Barnes2010-10-281-20/+9
* Precalculate some binomial coefficients.Tavian Barnes2010-10-281-9/+28
* Use the false position method to bisect isolating intervals.Tavian Barnes2010-10-281-30/+20
* Use Uspensky's method to find multiple roots at once.Tavian Barnes2010-10-281-57/+63
* Add polynomial test.Tavian Barnes2010-10-271-4/+3
* Fix typo in comment.Tavian Barnes2010-10-261-1/+1
* Add numerical polynomial solver based on Uspensky's algorithm.Tavian Barnes2010-10-261-0/+313