Evaluation of functions on microcomputers: square root

DOI10.1016/0898-1221(78)90016-0zbMath0416.65013OpenAlexW2037288508MaRDI QIDQ754596

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

zbMATH Keywords

Newton-Raphson iterationelementary functionscomputation of elementary functionsprogramming a microcomputer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation of special functions and constants, construction of tables (65D20) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms for approximation of functions (65D15)

Related Items (3)

Evaluation of functions on microcomputers: rational approximation of kth roots ⋮ Evaluation of functions on microcomputers: exp(x) ⋮ Evaluation of functions on microcomputers: ln (X)

Cites Work

• Unnamed Item
• Optimal starting approximations for Newton's method
• A statistical study of the accuracy of floating point number systems
• Optimal Partitioning of Newton's Method for Calculating Roots
• Uniform rational approximation of functions of several variables
• More Efficient Radix-2 Algorithms for Some Elementary Functions
• 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

This page was built for publication: Evaluation of functions on microcomputers: square root