Jean-Michel Muller

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 39

Top Venues

ARITH

ACM Trans. Math. Softw.

IEEE Trans. Computers

CoRR

Grenoble Institute of Technology, France (PHD)

Education History

Grenoble Institute of Technology, France

PHD

Publications

Jean-Michel Muller, Bruno Salvy
Effective Quadratic Error Bounds for Floating-Point Algorithms Computing the Hypotenuse Function. CoRR (2024)
Tom Hubrecht, Claude-Pierre Jeannerod, Jean-Michel Muller
Useful applications of correctly-rounded operators of the form ab + cd + e. ARITH (2024)
Nicolas Brisebarre, Jean-Michel Muller, Joris Picot
Error in Ulps of the Multiplication or Division by a Correctly-Rounded Function or Constant in Binary Floating-Point Arithmetic. IEEE Trans. Emerg. Top. Comput. 12 (2) (2024)
Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller, Joris Picot, Laurence Rideau
Accurate Calculation of Euclidean Norms Using Double-word Arithmetic. ACM Trans. Math. Softw. 49 (1) (2023)
Nicolas Brisebarre, Jean-Michel Muller, Joris Picot
Error in ulps of the multiplication or division by a correctly-rounded function or constant in binary floating-point arithmetic. ARITH (2023)
Nicolas Brisebarre, Jean-Michel Muller, Joris Picot
Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform. ARITH (2023)
Sylvie Boldo, Claude-Pierre Jeannerod, Guillaume Melquiond, Jean-Michel Muller
Floating-point arithmetic. Acta Numer. 32 (2023)
Jean-Michel Muller, Laurence Rideau
Formalization of Double-Word Arithmetic, and Comments on "Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic". ACM Trans. Math. Softw. 48 (1) (2022)
Carlos F. Borges, Claude-Pierre Jeannerod, Jean-Michel Muller
High-level algorithms for correctly-rounded reciprocal square roots. ARITH (2022)
Paolo Montuschi, Jean-Michel Muller, Florent de Dinechin
Computer Arithmetic: Continuing a Long and Steady Emergence. Computer 55 (10) (2022)
Jean-Michel Muller
$a \cdot(x\cdot\ x)$ or $(a\cdot x)\cdot x?$. ARITH (2021)
Sylvie Boldo, Christoph Quirin Lauter, Jean-Michel Muller
Emulating Round-to-Nearest Ties-to-Zero "Augmented" Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic. IEEE Trans. Computers 70 (7) (2021)
Mioara Joldes, Jean-Michel Muller
Algorithms for Manipulating Quaternions in Floating-Point Arithmetic. ARITH (2020)
Nicolas Brisebarre, Mioara Joldes, Jean-Michel Muller, Ana-Maria Nanes, Joris Picot
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform. ACM Trans. Math. Softw. 46 (2) (2020)
James E. Stine, Milos D. Ercegovac, Jean-Michel Muller
An Architecture for Improving Variable Radix Real and Complex Division Using Recurrence Division. ACSSC (2020)
Stef Graillat, Vincent Lefèvre, Jean-Michel Muller
Alternative Split Functions and Dekker's Product. ARITH (2020)
Jean-Michel Muller
Elementary Functions and Approximate Computing. Proc. IEEE 108 (12) (2020)
Nicolas Fabiano, Jean-Michel Muller, Joris Picot
Algorithms for Triple-Word Arithmetic. IEEE Trans. Computers 68 (11) (2019)
Anastasia Volkova, Jean-Michel Muller
Semi-Automatic Implementation of the Complementary Error Function. ARITH (2019)
Vincent Lefèvre, Jean-Michel Muller
Accurate Complex Multiplication in Floating-Point Arithmetic. ARITH (2019)
Claude-Pierre Jeannerod, Jean-Michel Muller, Paul Zimmermann
On Various Ways to Split a Floating-Point Number. ARITH (2018)
Nicolas Brisebarre, George A. Constantinides, Milos Ercezovac, Silviu-Ioan Filip, Matei Istoan, Jean-Michel Muller
A High Throughput Polynomial and Rational Function Approximations Evaluator. ARITH (2018)
Claude-Pierre Jeannerod, Jean-Michel Muller, Antoine Plet
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. ARITH (2017)
Sylvie Boldo, Stef Graillat, Jean-Michel Muller
On the Robustness of the 2Sum and Fast2Sum Algorithms. ACM Trans. Math. Softw. 44 (1) (2017)
Mioara Joldes, Jean-Michel Muller, Valentina Popescu
Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic. ACM Trans. Math. Softw. 44 (2) (2017)
Claude-Pierre Jeannerod, Jean-Michel Muller
On the relative error of computing complex square roots in floating-point arithmetic. ACSSC (2017)
Arthur Blot, Jean-Michel Muller, Laurent Théry
Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers. NSV@CAV (2017)
Claude-Pierre Jeannerod, Peter Kornerup, Nicolas Louvet, Jean-Michel Muller
Error bounds on complex floating-point multiplication with an FMA. Math. Comput. 86 (304) (2017)
Javier Hormigo, Jean-Michel Muller, Stuart F. Oberman, Nathalie Revol, Arnaud Tisserand, Julio Villalba-Moreno
Introduction to the Special Issue on Computer Arithmetic. IEEE Trans. Computers 66 (12) (2017)
Mioara Joldes, Jean-Michel Muller, Valentina Popescu
Implementation and Performance Evaluation of an Extended Precision Floating-Point Arithmetic Library for High-Accuracy Semidefinite Programming. ARITH (2017)
Sylvie Boldo, Mioara Joldes, Jean-Michel Muller, Valentina Popescu
Formal Verification of a Floating-Point Expansion Renormalization Algorithm. ITP (2017)
Mioara Joldes, Jean-Michel Muller, Valentina Popescu, Warwick Tucker
CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications. ICMS (2016)
Sylvain Collange, Mioara Joldes, Jean-Michel Muller, Valentina Popescu
Parallel floating-point expansions for extended-precision GPU computations. ASAP (2016)
Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Antoine Plet
Sharp error bounds for complex floating-point inversion. Numer. Algorithms 73 (3) (2016)
Mioara Joldes, Olivier Marty, Jean-Michel Muller, Valentina Popescu
Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions. IEEE Trans. Computers 65 (4) (2016)
Paolo Montuschi, Jean-Michel Muller
Modern Computer Arithmetic. Computer 49 (9) (2016)
Julien Le Maire, Nicolas Brunie, Florent de Dinechin, Jean-Michel Muller
Computing floating-point logarithms with fixed-point operations. ARITH (2016)
Nicolas Brisebarre, Christoph Quirin Lauter, Marc Mezzarobba, Jean-Michel Muller
Comparison between Binary and Decimal Floating-Point Numbers. IEEE Trans. Computers 65 (7) (2016)
Jean-Michel Muller, Valentina Popescu, Ping Tak Peter Tang
A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions. ARITH (2016)
Jean-Michel Muller
using Cornea, Harrison and Tang's Method. ACM Trans. Math. Softw. 41 (2) (2015)
Stef Graillat, Vincent Lefèvre, Jean-Michel Muller
On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic. Numer. Algorithms 70 (3) (2015)
Dong Wang, Jean-Michel Muller, Nicolas Brisebarre, Milos D. Ercegovac
(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function. IEEE Trans. Circuits Syst. II Express Briefs (9) (2014)
Mioara Joldes, Jean-Michel Muller, Valentina Popescu
On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration. ASAP (2014)
Stef Graillat, Vincent Lefèvre, Jean-Michel Muller
On the maximum relative error when computing x^n in floating-point arithmetic. CoRR (2014)
Amparo Gil, Jean-Michel Muller, Javier Segura
Preface to the special issue on Numerical Software: Design, Analysis and Verification. Sci. Comput. Program. 90 (2014)
Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller
On the Componentwise Accuracy of Complex Floating-Point Division with an FMA. IEEE Symposium on Computer Arithmetic (2013)
Olga Kupriianova, Christoph Quirin Lauter, Jean-Michel Muller
Radix Conversion for IEEE754-2008 Mixed Radix Floating-Point Arithmetic. CoRR (2013)
Jean-Michel Muller
Avoiding double roundings in scaled Newton-Raphson division. ACSSC (2013)
Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Quirin Lauter
Comparison between Binary64 and Decimal64 Floating-Point Numbers. IEEE Symposium on Computer Arithmetic (2013)
Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller
Further analysis of Kahan's algorithm for the accurate computation of 2×2 determinants. Math. Comput. 82 (284) (2013)
Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller, Serge Torres
On Ziv's rounding test. ACM Trans. Math. Softw. 39 (4) (2013)
Olga Kupriianova, Christoph Quirin Lauter, Jean-Michel Muller
Radix conversion for IEEE754-2008 mixed radix floating-point arithmetic. ACSSC (2013)
Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux
Floating-Point Arithmetic on Round-to-Nearest Representations CoRR (2012)
Nicolas Brisebarre, Mioara Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Ioana Pasca, Laurence Rideau, Laurent Théry
Rigorous Polynomial Approximation Using Taylor Models in Coq. NASA Formal Methods (2012)
Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
On the Computation of Correctly Rounded Sums. IEEE Trans. Computers 61 (3) (2012)
Nicolas Brisebarre, Milos D. Ercegovac, Jean-Michel Muller
(M, p, k)-Friendly Points: A Table-Based Method for Trigonometric Function Evaluation. ASAP (2012)
Nicolas Brisebarre, Mioara Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller
Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2). IEEE Symposium on Computer Arithmetic (2011)
Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux
Performing Arithmetic Operations on Round-to-Nearest Representations. IEEE Trans. Computers 60 (2) (2011)
Florent de Dinechin, Jean-Michel Muller, Bogdan Pasca, Alexandru Plesco
An FPGA architecture for solving the Table Maker's Dilemma. ASAP (2011)
Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux
Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic. IEEE Trans. Computers 60 (2) (2011)
Sylvie Boldo, Jean-Michel Muller
Exact and Approximated Error of the FMA. IEEE Trans. Computers 60 (2) (2011)
Claude-Pierre Jeannerod, Christophe Mouilleron, Jean-Michel Muller, Guillaume Revy, Christian Bertin, Jingyan Jourdan-Lu, Herve Knochel, Christophe Monat
Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors. PASCO (2010)
Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux
Newton-Raphson algorithms for floating-point division using an FMA. ASAP (2010)
Nicolas Brisebarre, Nicolas Louvet, Érik Martin-Dorel, Jean-Michel Muller, Adrien Panhaleux, Milos D. Ercegovac
Implementing decimal floating-point arithmetic through binary: Some suggestions. ASAP (2010)
Peter Kornerup, Christoph Quirin Lauter, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
Computing correctly rounded integer powers in floating-point arithmetic. ACM Trans. Math. Softw. 37 (1) (2010)
Milos D. Ercegovac, Jean-Michel Muller
An Efficient Method for Evaluating Complex Polynomials. J. Signal Process. Syst. 58 (1) (2010)
Peter Kornerup, Paolo Montuschi, Jean-Michel Muller, Eric Schwarz
Guest Editors' Introduction: Special Section on Computer Arithmetic. IEEE Trans. Computers 58 (2) (2009)
Pouya Dormiani, Milos D. Ercegovac, Jean-Michel Muller
Design and Implementation of a Radix-4 Complex Division Unit with Prescaling. ASAP (2009)
Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
On the Computation of Correctly-Rounded Sums. IEEE Symposium on Computer Arithmetic (2009)
Jean-Luc Beuchat, Jean-Michel Muller
Automatic Generation of Modular Multipliers for FPGA Applications. IEEE Trans. Computers 57 (12) (2008)
Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller
Integer and floating-point constant multipliers for FPGAs. ASAP (2008)
Nicolas Brisebarre, Jean-Michel Muller
Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Trans. Computers 57 (2) (2008)
Nicolas Brisebarre, Sylvain Chevillard, Milos D. Ercegovac, Jean-Michel Muller, Serge Torres
An efficient method for evaluating polynomial and rational function approximations. ASAP (2008)
Nicolas Brisebarre, Jean-Michel Muller
Correct rounding of algebraic functions. RAIRO Theor. Informatics Appl. 41 (1) (2007)
Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller
Fast and correctly rounded logarithms in double-precision. RAIRO Theor. Informatics Appl. 41 (1) (2007)
Peter Kornerup, Vincent Lefèvre, Jean-Michel Muller
Computing Integer Powers in Floating-Point Arithmetic CoRR (2007)
Milos D. Ercegovac, Jean-Michel Muller
A Hardware-Oriented Method for Evaluating Complex Polynomials. ASAP (2007)
Milos D. Ercegovac, Jean-Michel Muller
Complex Square Root with Operand Prescaling. J. VLSI Signal Process. 49 (1) (2007)
Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand
Computing machine-efficient polynomial approximations. ACM Trans. Math. Softw. 32 (2) (2006)
Peter Kornerup, Jean-Michel Muller
Leading Guard Digits in Finite Precision Redundant Representations. IEEE Trans. Computers 55 (5) (2006)
Peter Kornerup, Jean-Michel Muller
Choosing starting values for certain Newton-Raphson iterations. Theor. Comput. Sci. 351 (1) (2006)
Sylvie Boldo, Jean-Michel Muller
Some Functions Computable with a Fused-Mac. IEEE Symposium on Computer Arithmetic (2005)
José-Alejandro Piñeiro, Stuart F. Oberman, Jean-Michel Muller, Javier D. Bruguera
High-Speed Function Approximation Using a Minimax Quadratic Interpolator. IEEE Trans. Computers 54 (3) (2005)
Jean-Michel Muller, Arnaud Tisserand, Benoît Dupont de Dinechin, Christophe Monat
Division by Constant for the ST100 DSP Microprocessor. IEEE Symposium on Computer Arithmetic (2005)
Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller, Nathalie Revol
A New Range-Reduction Algorithm. IEEE Trans. Computers 54 (3) (2005)
Milos D. Ercegovac, Jean-Michel Muller
Variable Radix Real and Complex Digit-Recurrence Division. ASAP (2005)
Nicolas Brisebarre, Jean-Michel Muller
Correctly Rounded Multiplication by Arbitrary Precision Constants. IEEE Symposium on Computer Arithmetic (2005)
Jean-Luc Beuchat, Jean-Michel Muller
Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement. ASAP (2005)
Nicolas Brisebarre, Jean-Michel Muller, Saurabh Kumar Raina
Accelerating Correctly Rounded Floating-Point Division when the Divisor Is Known in Advance. IEEE Trans. Computers 53 (8) (2004)
Milos D. Ercegovac, Jean-Michel Muller
Complex Square Root with Operand Prescaling. ASAP (2004)
David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, Paul Zimmermann
Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numer. Algorithms 37 (1-4) (2004)
Vincent Lefèvre, Jean-Michel Muller
On-the-Fly Range Reduction. J. VLSI Signal Process. 33 (1-2) (2003)
Nicolas Brisebarre, Jean-Michel Muller
Finding the "truncated" polynomial that is closest to a function CoRR (2003)
Jean-Michel Muller
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods. IEEE Symposium on Computer Arithmetic (2003)
Jean-Michel Muller
Complex Division with Prescaling of Operands. ASAP (2003)
Peter Kornerup, Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller
Preface. Theor. Comput. Sci. 291 (2) (2003)
Jean Marie Chesneaux, Christiane Frougny, Jean-Michel Muller
Real Numbers - Foreword. Theor. Comput. Sci. 279 (1-2) (2002)
Vincent Lefèvre, Jean-Michel Muller
Worst Cases for Correct Rounding of the Elementary Functions in Double Precision. IEEE Symposium on Computer Arithmetic (2001)
José-Alejandro Piñeiro, Javier D. Bruguera, Jean-Michel Muller
FPGA Implementation of a Faithful Polynomial Approximation for Powering Function Computation. DSD (2001)
José-Alejandro Piñeiro, Javier D. Bruguera, Jean-Michel Muller
Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree. IEEE Symposium on Computer Arithmetic (2001)

Jean-Michel Muller.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean-Michel Muller