A Fast O(n^2) Division Algorithm for Multiple-Precision Floating-Point Numbers

スポンサーリンク

概要

• 論文の詳細を見る

• A fast O(n^2) algorithm is derived for the division of multiple-precision floating-point numbers where n is the number of digits in each of the numbers. This algorithm, which is a modification of the Conventional pencil-and-paper technique, is as the conventional O (n^2) multiplication and 2.67 times faster than the algorithm based on the Newton method.

• 一般社団法人情報処理学会の論文
• 1991-12-31

著者

• Ozawa Kazufumi

  Department Of Computer Science College Of General Education Tohoku University

関連論文

• A Fast O(n^2) Division Algorithm for Multiple-Precision Floating-Point Numbers
• Super-quadratic Convergence in Aitken Δ^2 Process
• A Functional Fitting Runge-Kutta-Nystrom Method with Variable Coefficients

スポンサーリンク