Jean-Michel Muller

Author Info

Name	Affiliation	Papers
JEAN-MICHEL MULLER	CNRS, Laboratoire TIM3, Institut National Polytechnique de Grenoble, 46 Avenue Felix Viallet, 38031 Grenoble Cedex, France	99
Collaborators	Citations	PageRank
109	466	66.61
Referers	Referees	References
726	608	663

Search Limit

100726

Publications (99 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”	0	0.34	2022
Computer Arithmetic: Continuing a Long and Steady Emergence	0	0.34	2022
Emulating round-to-nearest-ties-to-zero "augmented" floating-point operations using round-to-nearest-ties-to-even arithmetic	0	0.34	2021
Alternative Split Functions and Dekker’s Product	0	0.34	2020
Algorithms for Manipulating Quaternions in Floating-Point Arithmetic	0	0.34	2020
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform	1	0.37	2020
Elementary Functions and Approximate Computing	1	0.38	2020
Semi-Automatic Implementation of the Complementary Error Function	0	0.34	2019
Algorithms for Triple-Word Arithmetic	0	0.34	2019
Accurate Complex Multiplication in Floating-Point Arithmetic	0	0.34	2019
On Various Ways to Split a Floating-Point Number	2	0.45	2018
A High Throughput Polynomial and Rational Function Approximations Evaluator	0	0.34	2018
The Classical Relative Error Bounds for Computing Sqrt(a^2 + b^2) and c / sqrt(a^2 + b^2) in Binary Floating-Point Arithmetic are Asymptotically Optimal	0	0.34	2017
On the Robustness of the 2Sum and Fast2Sum Algorithms.	2	0.37	2017
Introduction to the Special Issue on Computer Arithmetic.	0	0.34	2017
Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic.	3	0.42	2017
Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers.	0	0.34	2017
ERROR BOUNDS ON COMPLEX FLOATING-POINT MULTIPLICATION WITH AN FMA	2	0.44	2017
Implementation and Performance Evaluation of an Extended Precision Floating-Point Arithmetic Library for High-Accuracy Semidefinite Programming	1	0.35	2017
Formal Verification Of A Floating-Point Expansion Renormalization Algorithm	1	0.35	2017
Computing floating-point logarithms with fixed-point operations	2	0.37	2016
Sharp error bounds for complex floating-point inversion	2	0.42	2016
CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications.	6	0.46	2016
Parallel floating-point expansions for extended-precision GPU computations	0	0.34	2016
Modern Computer Arithmetic.	1	0.37	2016
A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions	2	0.41	2016
On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic	2	0.38	2015
On the Error of Computing ab+cd using Cornea, Harrison and Tang's Method	3	0.63	2015
On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration	2	0.43	2014
On the maximum relative error when computing x^n in floating-point arithmetic.	0	0.34	2014
Preface to the special issue on Numerical Software: Design, Analysis and Verification.	0	0.34	2014
(M, P, K)-Friendly Points: A Table-Based Method To Evaluate Trigonometric Function	1	0.36	2014
-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function	5	0.46	2014
On the Componentwise Accuracy of Complex Floating-Point Division with an FMA	0	0.34	2013
On Ziv's rounding test	3	0.50	2013
Comparison between Binary64 and Decimal64 Floating-Point Numbers	1	0.43	2013
Avoiding double roundings in scaled Newton-Raphson division	2	0.47	2013
Further analysis of Kahan's algorithm for the accurate computation of 2×2 determinants.	3	0.97	2013
Radix conversion for IEEE754-2008 mixed radix floating-point arithmetic	0	0.34	2013
Rigorous polynomial approximation using taylor models in Coq	8	0.57	2012
(M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation	4	0.47	2012
Floating-Point Arithmetic on Round-to-Nearest Representations	1	0.50	2012
Exact and Approximated Error of the FMA	4	0.76	2011
Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2)	0	0.34	2011
Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic	4	0.57	2011
Newton-Raphson algorithms for floating-point division using an FMA	1	0.38	2010
Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors	5	0.62	2010
An Efficient Method for Evaluating Complex Polynomials	1	0.41	2010
Implementing decimal floating-point arithmetic through binary: Some suggestions	0	0.34	2010
Computing correctly rounded integer powers in floating-point arithmetic	3	0.45	2010

1
2
50 / page