Avoiding double roundings in scaled Newton-Raphson division
暂无分享,去创建一个
[1] Peter W. Markstein,et al. IA-64 and elementary functions - speed and precision , 2000 .
[2] John Harrison,et al. Scientific Computing on Itanium-Based Systems , 2002 .
[3] Sylvie Boldo,et al. Representable correcting terms for possibly underflowing floating point operations , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.
[4] M. Ercegovac,et al. Division and Square Root: Digit-Recurrence Algorithms and Implementations , 1994 .
[5] Jean-Michel Muller,et al. Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .
[6] James Demmel,et al. IEEE Standard for Floating-Point Arithmetic , 2008 .
[7] Peter W. Markstein,et al. Correctness proofs outline for Newton-Raphson based floating-point divide and square root algorithms , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).
[8] Peter W. Markstein. Computation of Elementary Functions on the IBM RISC System/6000 Processors , 1990, IBM J. Res. Dev..
[9] John Harrison,et al. Formal Verification of IA-64 Division Algorithms , 2000, TPHOLs.