HAL (Le Centre pour la Communication Scientifique Directe) · 2005 · 30 citations · 7 references
Open access
ComputingComputer ScienceMathematicsAlgorithmsNumber TheoryTheory Of ComputationAlgorithm AnalysisArithmetic FunctionsNumerical AlgorithmsNumerical AnalysisComputational PrecisionFinite-precision Arithmetic CircuitsFloating-point ArithmeticOperatorsRenormalization TheoryRounding ModesRounding NumbersRounding Processes
The implementation of correctly rounded elementary functions needs high intermediate accuracy before final rounding. This accuracy can be provided by (pseudo-) expansions of size three, i.e. a triple-double format. The report presents all basic operators for such a format. Triple-double numbers can be redundant. A renormalization procedure is presented and proven. Elementary functions' implementations need addition and multiplication sequences. These operators must take operands in double, double-double and triple-double format. The results must be accordingly in one of the formats. Several procedures are presented. Proofs are given for their accuracy bounds. Intermediate triple-double results must finally be correctly rounded to double precision. Two effective rounding sequences are presented, one for round-to-nearest mode, one for the directed rounding modes. Their complete proofs constitute half of the report.
7
Elementary functions: algorithms and implementation
Choice Reviews Online · 1998 · 542 citations
Algorithms for arbitrary precision floating point arithmetic
Douglas M. Priest · 2002 · 176 citations