Evaluation of functions on microcomputers: square root
DOI10.1016/0898-1221(78)90016-0zbMATH Open0416.65013OpenAlexW2037288508MaRDI QIDQ754596FDOQ754596
Authors: D. Kharzeev
Publication date: 1978
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(78)90016-0
elementary functionsNewton-Raphson iterationcomputation of elementary functionsprogramming a microcomputer
Computation of special functions and constants, construction of tables (65D20) Analysis of algorithms and problem complexity (68Q25) Algorithms for approximation of functions (65D15) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Optimal starting approximations for Newton's method
- Uniform rational approximation of functions of several variables
- More Efficient Radix-2 Algorithms for Some Elementary Functions
- Optimal Partitioning of Newton's Method for Calculating Roots
- A statistical study of the accuracy of floating point number systems
- A Survey of Some Recent Contributions to Computer Arithmetic
- Software Engineering
- Optimal starting approximations for generating square root for slow or no divide
- Static and Dynamic Numerical Characteristics of Floating-Point Arithmetic
- On the Precision Attainable with Various Floating-Point Number Systems
Cited In (3)
This page was built for publication: Evaluation of functions on microcomputers: square root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754596)