2022-08-14T09:36:14Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:000596972017-03-31T05:36:57Z05471:05480:05482
A Fast O(n^2) Division Algorithm for Multiple-Precision Floating-Point NumbersA Fast O(n^2) Division Algorithm for Multiple-Precision Floating-Point Numbersenghttp://id.nii.ac.jp/1001/00059697/Articlehttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=59697&item_no=1&attribute_id=1&file_no=1Copyright (c) 1991 by the Information Processing Society of JapanDepartment of Computer Science College of General Education Tohoku UniversityKazufumi, OzawaA 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.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.AA00700121Journal of Information Processing 1433543561991-12-311882-66522009-06-30