SLEEF

SLEEF - SIMD Library for Evaluating Elementary Functions Most of today’s processors have capabilities to execute SIMD instructions, and we can expect significant speed-ups in various kinds of computation if these instructions are properly used. But, this is technically hard because many popular programming techniques like table look-ups, conditional branches, scattering/gathering operations can easily slow down the computation. With this library, the trigonometric functions(sin, cos, tan, sincos), inverse trigonometric functions(asin, acos, atan, atan2), exponential and logarithmic functions(exp, log, pow, exp2, exp10, expm1, log10, log1p), hyperbolic/inverse hyperbolic functions(sinh, cosh, tanh, asinh, acosh, atanh), and some other functions(cbrt, ilogb, ldexp) can be evaluated in both double precision and single precision without table look-ups, scattering from, or gathering into SIMD registers, or conditional branches using SSE2, AVX, AVX2, FMA4, or ARM NEON instruction sets. (Source: http://freecode.com/)


References in zbMATH (referenced in 31 articles , 1 standard article )

Showing results 1 to 20 of 31.
Sorted by year (citations)

1 2 next

  1. Banjac, Bojan; Makragić, Milica; Malešević, Branko: Some notes on a method for proving inequalities by computer (2016)
  2. Auslender, A.; Ferrer, A.; Goberna, M.A.; López, M.A.: Comparative study of RPSALG algorithm for convex semi-infinite programming (2015)
  3. Dwarakanath, Nagarjun C.; Galbraith, Steven D.: Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (2014)
  4. Sanchez-Romero, Jose-Luis; Jimeno-Morenilla, Antonio; Molina-Carmona, Rafael; Perez-Martinez, Jose: An approach to the application of shift-and-add algorithms on engineering and industrial processes (2013)
  5. Sergeyev, Yaroslav D.: Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically (2013)
  6. Berthé, V.: Numeration and discrete dynamical systems (2012)
  7. Chen, Dongdong; Ko, Seok-Bum: A novel decimal logarithmic converter based on first-order polynomial approximation (2012)
  8. Melquiond, Guillaume: Floating-point arithmetic in the Coq system (2012)
  9. Butler, Jon T.; Frenzen, C.L.; Macaria, Njuguna; Sasao, Tsutomu: A fast segmentation algorithm for piecewise polynomial numeric function generators (2011)
  10. Sergeyev, Yaroslav D.: Higher order numerical differentiation on the infinity computer (2011)
  11. Akbarpour, Behzad; Paulson, Lawrence Charles: MetiTarski: An automatic theorem prover for real-valued special functions (2010)
  12. Frenzen, C.L.; Sasao, Tsutomu; Butler, Jon T.: On the number of segments needed in a piecewise linear approximation (2010)
  13. Lakshmi, B.; Dhar, A.S.: CORDIC architectures: A survey (2010)
  14. Roh, Hyun-Gul; Jeon, Myeongjae; Seo, Euiseong; Kim, Jinsoo; Lee, Joonwon: $\operatornameLog^\prime$ version vector: logging version vectors concisely in dynamic replication (2010)
  15. Stehlé, Damien: Floating-point LLL: Theoretical and practical aspects (2010)
  16. Yu, Jihun; Yap, Chee; Du, Zilin; Pion, Sylvain; Brönnimann, Hervé: The design of Core 2: a library for exact numeric computation in geometry and algebra (2010)
  17. Gutierrez, R.; Valls, J.: Low-power FPGA-implementation of $atan(Y/X)$ using look-up table methods for communication applications (2009)
  18. Sanchez, Jose-Luis; Mora, Higinio; Mora, Jeronimo; Ferrandez, Fco.Javier; Jimeno, Antonio: An iterative method for improving decimal calculations on computers (2009)
  19. Backeljauw, Franky; Becuwe, Stefan; Cuyt, Annie: Validated evaluation of special mathematical functions (2008)
  20. Gautschi, Walter: On Euler’s attempt to compute logarithms by interpolation: a commentary to his letter of February 16, 1734 to Daniel Bernoulli (2008)

1 2 next