Title
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
Abstract
Advances in computer hardware often have little impact until they become accessible to programmers using high-level languages. For example, the IEEE floating-point arithmetic standard provides various rounding modes and exceptions, but it is difficult ...
Year
DOI
Venue
1999
10.1109/ARITH.1999.762834
IEEE Symposium on Computer Arithmetic
Keywords
Field
DocType
computer hardware,square root algorithms,correctness proofs outline,various rounding mode,ieee floating-point arithmetic standard,high-level language,throughput,iterative algorithm,newton raphson,formal verification,floating point arithmetic,newton raphson method,rigorous proof,divide,square root,floating point,emulation,iteration method,proof,iterative methods,availability
Fast inverse square root,Methods of computing square roots,Floating point,Iterative method,Computer science,Correctness,Algorithm,Theoretical computer science,Square root,Formal verification,Newton's method
Conference
ISSN
ISBN
Citations 
1063-6889
0-7695-0116-8
20
PageRank 
References 
Authors
2.04
1
3
Name
Order
Citations
PageRank
Marius A. Cornea-Hasegan1293.72
Roger A. Golliver27910.73
Peter Markstein3708.47