Fast Computation of the n-th Root in Quad-double Arithmetic Using a Fourth-order Iterative Scheme (Preprint)

スポンサーリンク

概要

• 論文の詳細を見る

• 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 double-precision 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.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.21(2013) No.2 (online)------------------------------

• 2013-03-15

著者

• Tsubasa Saito

  Graduate School of Science, Tokyo University of Science

関連論文

• Fast Computation of the n-th Root in Quad-double Arithmetic Using a Fourth-order Iterative Scheme (Preprint)

スポンサーリンク