shithub: mc

ref: 4aa0e6c6b8a1a23b144b0382d6156aaa55b2c7fd
dir: /lib/math/references/

View raw version
References

[KM06]
Peter Kornerup and Jean-Michel Muller. “Choosing starting values
for certain Newton–Raphson iterations”. In: Theoretical Computer
Science 351 (1 2006), pp. 101–110. doi:
https://doi.org/10.1016/j.tcs.2005.09.056.

[Mar00]
Peter Markstein. IA-64 and elementary functions : speed and precision.
Upper Saddle River, NJ: Prentice Hall, 2000. isbn: 9780130183484.

[Mul+10]
Jean-Michel Muller et al. Handbook of floating-point arithmetic.
Boston: Birkhäuser, 2010. isbn: 9780817647049.

[Mul16]
J. M. Muller. Elementary functions : algorithms and implementation.
Third edition. New York: Birkhäuser, 2016. isbn: 9781489979810.

[Tan89]
Ping-Tak Peter Tang. “Table-driven Implementation of the Exponential
Function in IEEE Floating-point Arithmetic”. In: ACM Trans. Math.
Softw. 15.2 (June 1989), pp. 144–157. issn: 0098-3500.  doi:
10.1145/63522.214389. url: http://doi.acm.org/10.1145/63522.214389.

[Tan90]
Ping-Tak Peter Tang. “Table-driven Implementation of the Logarithm
Function in IEEE Floating-point Arithmetic”. In: ACM Trans. Math.
Softw. 16.4 (Dec. 1990), pp. 378–400. issn: 0098-3500.  doi:
10.1145/98267.98294. url: http://doi.acm.org/10.1145/98267.98294.

[Tan92]
Ping Tak Peter Tang. “Table-driven Implementation of the Expm1
Function in IEEE Floating-point Arithmetic”. In: ACM Trans. Math.
Softw. 18.2 (June 1992), pp. 211–222. issn: 0098-3500.  doi:
10.1145/146847.146928. url: http://doi.acm.org/10.1145/146847.146928.