A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Fast Computation of the n-th Root in Quad-double Arithmetic Using a Fourth-order Iterative Scheme
2013
Journal of Information Processing
We propose new algorithms for computing the n-th root of a quad-double number. We construct an iterative scheme that has quartic convergence and propose algorithms that require only about 50% to 60% of the doubleprecision arithmetic operations of the existing algorithms. The proposed algorithms perform about 1.7 times faster than the existing algorithms, yet maintain the same accuracy. They are sufficiently effective and efficient to replace the existing algorithms.
doi:10.2197/ipsjjip.21.315
fatcat:j46pyepgnfdwdkx2hksoljc3bq