Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | New DMNSN_HOT macro. | Tavian Barnes | 2011-03-08 | 1 | -2/+2 |
| | |||||
* | A couple polynomial.c improvements. | Tavian Barnes | 2010-11-18 | 1 | -13/+5 |
| | |||||
* | Compare the cubic discriminant to 0 rather than dmnsn_epsilon. | Tavian Barnes | 2010-11-18 | 1 | -2/+2 |
| | |||||
* | Handle all special cases in dmnsn_solve_cubic(). | Tavian Barnes | 2010-11-17 | 1 | -24/+24 |
| | |||||
* | Fix det/disc variable naming thinko. | Tavian Barnes | 2010-11-17 | 1 | -6/+6 |
| | |||||
* | Add algebraic cubic solver. | Tavian Barnes | 2010-11-17 | 1 | -6/+73 |
| | |||||
* | Document libdimension with Doxygen. | Tavian Barnes | 2010-11-14 | 1 | -13/+22 |
| | |||||
* | Standard compliance. | Tavian Barnes | 2010-11-10 | 1 | -5/+5 |
| | | | | Apparently ssize_t isn't a standard type... | ||||
* | Use Newton's method when the root bound is degenerate. | Tavian Barnes | 2010-11-10 | 1 | -5/+27 |
| | |||||
* | Stability fix for dmnsn_bisect_root(). | Tavian Barnes | 2010-11-09 | 1 | -4/+9 |
| | | | | | | | When one of the bounds is close to a different root, make sure the result is more accurate than that bound. Otherwise we find the wrong root, and eventually hang. This could be seen with a 1920x1080 render of demo.pov, for example. | ||||
* | Be more lenient about the root bracketing in dmnsn_bisect_root(). | Tavian Barnes | 2010-11-04 | 1 | -1/+14 |
| | |||||
* | Fix ++i/--i thinko. | Tavian Barnes | 2010-11-03 | 1 | -1/+1 |
| | |||||
* | Pull < DMNSN_NBINOM test outside of loop. | Tavian Barnes | 2010-11-03 | 1 | -20/+29 |
| | |||||
* | Small polynomial.c cleanup. | Tavian Barnes | 2010-11-01 | 1 | -4/+8 |
| | |||||
* | Slight polynomial base case optimizations. | Tavian Barnes | 2010-11-01 | 1 | -24/+25 |
| | |||||
* | More numerical tweaks. | Tavian Barnes | 2010-11-01 | 1 | -0/+11 |
| | |||||
* | Numerical fixes for polynomial.c. | Tavian Barnes | 2010-10-31 | 1 | -89/+109 |
| | |||||
* | Be const-correct in polynomial.{c,h}. | Tavian Barnes | 2010-10-30 | 1 | -8/+8 |
| | |||||
* | Remove debug print from polynomial.c. | Tavian Barnes | 2010-10-30 | 1 | -2/+0 |
| | |||||
* | Fix dmnsn_print_polynomial again. | Tavian Barnes | 2010-10-29 | 1 | -1/+3 |
| | |||||
* | Only return non-zero roots of polynomials. | Tavian Barnes | 2010-10-29 | 1 | -15/+14 |
| | |||||
* | Handle narrow ranges in dmnsn_bisect_root(). | Tavian Barnes | 2010-10-28 | 1 | -0/+3 |
| | |||||
* | Fix dmnsn_print_polynomial(). | Tavian Barnes | 2010-10-28 | 1 | -20/+9 |
| | |||||
* | Precalculate some binomial coefficients. | Tavian Barnes | 2010-10-28 | 1 | -9/+28 |
| | |||||
* | Use the false position method to bisect isolating intervals. | Tavian Barnes | 2010-10-28 | 1 | -30/+20 |
| | |||||
* | Use Uspensky's method to find multiple roots at once. | Tavian Barnes | 2010-10-28 | 1 | -57/+63 |
| | |||||
* | Add polynomial test. | Tavian Barnes | 2010-10-27 | 1 | -4/+3 |
| | |||||
* | Fix typo in comment. | Tavian Barnes | 2010-10-26 | 1 | -1/+1 |
| | |||||
* | Add numerical polynomial solver based on Uspensky's algorithm. | Tavian Barnes | 2010-10-26 | 1 | -0/+313 |