Source

statistics / Statistics / Math / RootFinding.hs

Author Commit Message Labels Comments Date
Bryan O'Sullivan
Add Binary instances
Bryan O'Sullivan
Add GHC generics support everywhere
Aleksey Khudyakov
More robust ridders 1. Following code is incorrect for approximate comparison to zero. > x ~= 0 ≡ abs (x - 0) <= abs (tol * x) ≡ abs x <= abs (tol * x) > x ~= 0 ≡ True if tol > 1 So direct comparison to 0 is used. 2. Add safeguards. If root is bracketed within 1 ulp return root regardless of requested accuracy. 3. If Ridder's approximation coincide with with one of old bounds revert to bisection 4. Document t…
Bryan O'Sullivan
Make the result of root finding more satisfactory.
Bryan O'Sullivan
Minor doc comment.
Bryan O'Sullivan
Change API per Alaexey's request.
Bryan O'Sullivan
Fix some robustness bugs in the implementation of Ritters's method.
Bryan O'Sullivan
Oops.
Bryan O'Sullivan
More doc updates.
Bryan O'Sullivan
Rearrange modules a little, and update release notes.