 09 Jan, 2016 1 commit


Raymond Toy authored

 19 Dec, 2015 3 commits


Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

 08 Nov, 2015 4 commits


Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

 21 Oct, 2015 3 commits


Raymond Toy authored

Raymond Toy authored
(Shouldn't need to do this once the runner is in a more isolated environment.)

Raymond Toy authored

 18 Oct, 2015 6 commits


Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

 17 Oct, 2015 1 commit


Raymond Toy authored

 24 Jun, 2015 2 commits


Raymond Toy authored

Raymond Toy authored
The values are very unlikely to be EQL when redefining so just use defparameter. This is for picky compilers that don't like redefining constants with values that aren't EQL.

 27 Nov, 2013 1 commit


Raymond Toy authored
Includes Lentz' algorithm for evaluating continued fractions and updates the timing test to include tan(x) using duplication. Tests show this is much slower than existing algorithms.

 26 Nov, 2013 5 commits


Raymond Toy authored

Raymond Toy authored
qdfun.lisp: o Use atanqd/taylor and atan2qd/taylor as the atanqd and atan2qd implementation. o Fix bug in atanqd/taylor. We need a special case for x small where we don't want to use the table. (Found by our rttest. Yay!) rttests.lisp: o Add comment for oct.atan.4 for why it works.

Raymond Toy authored
qdconst.lisp: o Update tables and generator to use tables with only half as many entries as before. This is because atanqd/taylor never needs to compute directly for x > 1. qdfun.lisp: o Use table length for binary search, so we're independent of other constants. o Remove FIXME.

Raymond Toy authored
qdfun.lisp: o Fix issue with atanqd/taylor for large args. We use the relationship atan(x) = pi/2atan(1/x) for x > 1. o Add atan2qd/taylor. This appears to be much faster than atan2qd/newton. timing.lisp: o Add timing test for atan2qd.

Raymond Toy authored
The new method uses a table and the taylor series for atan to compute atan for real args. qdconst.lisp: o Add the two tables used for the atan computation. o Include clisp code that generates the tables. qdfun.lisp: o Implement atan using a set of tables and a Taylor series. timing.lisp: o Add a simple timing program to evaluate how fast each atan method is.

 25 Nov, 2013 2 commits


Raymond Toy authored
o Remove old version o Update new version to skip reduction if the arg <= pi/4.

Raymond Toy authored

 24 Nov, 2013 1 commit


Raymond Toy authored
o Implement better pi reduction and also always do pi reduction. o Add test for sin(pi) and cos(2^120), to test pi reduction. o Accuracy for erfc is only 198 bits.

 26 Apr, 2013 1 commit


Raymond Toy authored
qdgamma.lisp:: Add continued fractions rttests.lisp:: Add a test for erfc

 17 Apr, 2012 5 commits



Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

Raymond Toy authored

 16 Apr, 2012 1 commit


 15 Apr, 2012 1 commit


Raymond Toy authored
* Simplify {{{suman}}} so we stop the sum when the terms no longer contribute to the sum. * Change {{{bign}}}. This still needs work.

 13 Apr, 2012 2 commits


Raymond Toy authored

Raymond Toy authored

 12 Apr, 2012 1 commit

