Number of documents

134


Directeur de Recherche au CNRS

Laboratoire LIP, Equipe AriC (commune au CNRS, à l'ENS de Lyon, à l'Inria et à l'Université Claude bernard Lyon 1)

Adresse postale: ENS Lyon, 46 allée d'Italie, 69364 Lyon Cédex 07


Journal articles41 documents

  • Nicolas Fabiano, Jean-Michel Muller, Joris Picot. Algorithms for triple-word arithmetic. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, In press, pp.1-11. ⟨10.1109/TC.2019.2918451⟩. ⟨hal-01869009v2⟩
  • Mioara Joldes, Jean-Michel Muller, Valentina Popescu. Tight and rigourous error bounds for basic building blocks of double-word arithmetic. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2017, 44 (2), pp.1 - 27. ⟨10.1145/3121432⟩. ⟨hal-01351529v3⟩
  • Claude-Pierre Jeannerod, Peter Kornerup, Nicolas Louvet, Jean-Michel Muller. Error bounds on complex floating-point multiplication with an FMA. Mathematics of Computation, American Mathematical Society, 2017, 86 (304), pp. 881-898. ⟨10.1090/mcom/3123⟩. ⟨hal-00867040v5⟩
  • Paolo Montuschi, Jean-Michel Muller. Modern Computer Arithmetic. Computer, IEEE Computer Society, 2016, 49 (9), pp.12. ⟨hal-01394408⟩
  • Mioara Joldes, Olivier Marty, Jean-Michel Muller, Valentina Popescu. Arithmetic algorithms for extended precision using floating-point expansions. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (4), pp.1197 - 1210. ⟨10.1109/TC.2015.2441714⟩. ⟨hal-01111551v2⟩
  • Nicolas Brisebarre, Christoph Lauter, Marc Mezzarobba, Jean-Michel Muller. Comparison between binary and decimal floating-point numbers. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (7), pp.2032-2044. ⟨10.1109/TC.2015.2479602⟩. ⟨hal-01021928v2⟩
  • Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Antoine Plet. Sharp error bounds for complex floating-point inversion. Numerical Algorithms, Springer Verlag, 2016, 73 (3), pp.735-760. ⟨10.1007/s11075-016-0115-x⟩. ⟨ensl-01195625v2⟩
  • Jean-Michel Muller. On the error of Computing ab + cd using Cornea, Harrison and Tang's method. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2015, 41 (2), pp.8. ⟨ensl-00862910v2⟩
  • Stef Graillat, Vincent Lefèvre, Jean-Michel Muller. On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic. Numerical Algorithms, Springer Verlag, 2015, 70 (3), pp.653-667. ⟨10.1007/s11075-015-9967-8⟩. ⟨ensl-00945033v2⟩
  • Dong Wang, Jean-Michel Muller, Nicolas Brisebarre, Milos Ercegovac. (M, p, k)-Friendly Points: A Table-based Method to Evaluate Trigonometric Function. IEEE Transactions on Circuits and Systems Part 2 Analog and Digital Signal Processing, Institute of Electrical and Electronics Engineers (IEEE), 2014, 61 (9), pp.711-715. ⟨10.1109/TCSII.2014.2331094⟩. ⟨ensl-01001673⟩
  • Jean-Michel Muller, Sylvie Boldo. Des ordinateurs capables de calculer plus juste. La Recherche : l'actualité des sciences, société d'éditions scientifiques, 2014, pp.46-53. ⟨ensl-01069744⟩
  • Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller. Further analysis of Kahan's algorithm for the accurate computation of 2 x 2 determinants. Mathematics of Computation, American Mathematical Society, 2013, 82 (284), pp.2245-2264. ⟨10.1090/S0025-5718-2013-02679-8⟩. ⟨ensl-00649347v4⟩
  • Érik Martin-Dorel, Guillaume Melquiond, Jean-Michel Muller. Some issues related to double roundings. BIT Numerical Mathematics, Springer Verlag, 2013, 53 (4), pp.897-924. ⟨10.1007/s10543-013-0436-2⟩. ⟨ensl-00644408v3⟩
  • Bel Dumé, Jean-Michel Muller. Les calculs sur ordinateurs de plus en plus fiables et sûrs. Collection "20 ans d'avancées et de perspectives en sciences du numérique", INRIA, 2012, 2 p. ⟨hal-00813205⟩
  • Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the computation of correctly-rounded sums. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2012, 61 (3), p. 289-298. ⟨10.1109/TC.2011.27⟩. ⟨ensl-00331519v2⟩
  • Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux. Midpoints and exact points of some algebraic functions in floating-point arithmetic. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.228-241. ⟨10.1109/TC.2010.144⟩. ⟨ensl-00409366v3⟩
  • Sylvie Boldo, Jean-Michel Muller. Exact and Approximated error of the FMA. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.157-164. ⟨10.1109/TC.2010.139⟩. ⟨inria-00429617⟩
  • Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux. Performing Arithmetic Operations on Round-to-Nearest Representations. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.282-291. ⟨10.1109/TC.2010.134⟩. ⟨ensl-00548988v2⟩
  • Milos Ercegovac, Jean-Michel Muller. An Efficient Method for Evaluating Complex Polynomials. Journal of Signal Processing Systems, Springer, 2010, 58 (1), pp.17-27. ⟨10.1007/s11265-008-0265-8⟩. ⟨ensl-00446889⟩
  • Peter Kornerup, Christoph Lauter, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. Computing Correctly Rounded Integer Powers in Floating-Point Arithmetic. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2010, 37 (1), pp.4:1-4:23. ⟨10.1145/1644001.1644005⟩. ⟨inria-00388501⟩
  • Vincent Lefèvre, Jean-Michel Muller. Erreurs en arithmétique des ordinateurs. Images des Mathématiques, CNRS, 2009. ⟨hal-00598554⟩
  • Peter Kornerup, Paolo Montuschi, Jean-Michel Muller, Eric Schwarz. Guest Editors' Introduction: Special Section on Computer Arithmetic. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2009, 58 (2), pp.145-147. ⟨ensl-00383561⟩
  • Jean-Michel Muller, Jean-Luc Beuchat. Automatic Generation of Modular Multipliers for FPGA Applications. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2008, 57 (12), pp.1600-1613. ⟨10.1109/TC.2008.102⟩. ⟨ensl-00122716v3⟩
  • Jean-Michel Muller, Jean-Luc Beuchat, Takanori Miyoshi, Eiji Okamoto. Horner's Rule-Based Multiplication over Fp and Fp^n: A Survey. International Journal of Electronics, Taylor & Francis, 2008, 95 (7), pp.669-685. ⟨ensl-00148210⟩
  • Jean-Michel Muller, Florent de Dinechin, Christoph Lauter. Fast and correctly rounded logarithms in double precision. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2007, 41 (1), pp.85-102. ⟨10.1051/ita:2007003⟩. ⟨ensl-00000007v2⟩
  • Jean-Michel Muller, Nicolas Brisebarre. Correct rounding of algebraic functions. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2007, 41 (1), pp.71-83. ⟨10.1051/ita:2007002⟩. ⟨ensl-00143230⟩
  • Jean-Michel Muller, Nicolas Brisebarre, Arnaud Tisserand. Computing machine-efficient polynomial approximations. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2006, 32 (2), pp.236-256. ⟨10.1145/1141885.1141890⟩. ⟨ensl-00086826⟩
  • Jean-Michel Muller, Peter Kornerup. Choosing Starting Values for certain Newton-Raphson Iterations. Theoretical Computer Science, Elsevier, 2006, 351 (1), pp.101-110. ⟨10.1016/j.tcs.2005.09.056⟩. ⟨ensl-00000009⟩
  • Jean-Michel Muller, Peter Kornerup. Leading Guard Digits in Finite-Precision Redundant Representations. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2006, 55 (5), pp.541-548. ⟨10.1109/TC.2006.79⟩. ⟨ensl-00000001⟩
  • Jean-Michel Muller, Arnaud Tisserand, Serge Torres, Nicolas Brisebarre. Hardware operators for function evaluation using sparse-coefficient polynomials. Electronics Letters, IET, 2006, 42 (25), pp.1441-1442. ⟨lirmm-00125483v2⟩
  • Jean-Michel Muller, Stuart Oberman, Jose-Alejandro Pineiro, Javier Bruguera. High-Speed Function Approximation using a Minimax Quadratic Interpolator. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2005, 54 (3), pp.304-318. ⟨10.1109/TC.2005.52⟩. ⟨ensl-00000002⟩
  • Jean-Michel Muller, Nicolas Brisebarre, Peter Kornerup, David Defour, Nathalie Revol. A new range-reduction algorithm. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2005, 54 (3), pp.331- 339. ⟨10.1109/TC.2005.36⟩. ⟨ensl-00086904⟩
  • Jean-Michel Muller. Les leçons d’un algorithme délinquant. Interstices, INRIA, 2004. ⟨hal-01350243⟩
  • Jean-Michel Muller, Jean-Louis Nicolas, Xavier-François Roblot. Nombre de solutions dans une binade de l'équation A^2+B^2=C^2+C. L'Enseignement Mathématiques, 2004, 50 (1-2), pp.147-182. ⟨hal-00863116⟩
  • Jean-Michel Muller, Nicolas Brisebarre, Saurabh Raina. Accelerating Correctly Rounded Floating-PointDivision when the Divisor is Known in Advance. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2004, 53 (8), pp.1069- 1072. ⟨10.1109/TC.2004.37⟩. ⟨ensl-00087465⟩
  • David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, et al.. Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. Numerical Algorithms, Springer Verlag, 2004, 37 (1-4), pp.367-375. ⟨inria-00099967⟩
  • Vincent Lefèvre, Jean-Michel Muller. On-the-Fly Range Reduction. Journal of VLSI Signal Processing / J VLSI Sign Process Syst Sign Image Video Technol, Kluwer Academic Publishers, 2003, Special Issue on Computer Arithmetic and Applications, 33 (1-2), pp.31-35. ⟨10.1023/A:1021137717282⟩. ⟨inria-00099524⟩
  • A. Skaf, Jean-Claude Bajard, A. Guyot, Jean-Michel Muller. A VLSI circuit for on-line polynomial computing: application to exponential, trigonometric and hyperbolic functions. IFIP-Transactions-A-Computer-Science-and-Technology, 1994, A-42, pp.93-100. ⟨hal-00014954⟩
  • Jean-Michel Muller, Jean-Claude Bajard, Sylvanus Kla. BKM: a new hardware algorithm for complex elementary functions. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 1994, 43 (8), pp.955-963. ⟨10.1109/12.295857⟩. ⟨ensl-00086894⟩
  • A. Guyot, B. Hochet, Jean-Michel Muller. A way to build efficient carry-skip adders. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 1987, Oct. ; C-36(10), pp.1144-52. ⟨hal-00014976⟩
  • Michel Cosnard, Jean-Michel Muller, Yves Robert. Parallel QR decomposition of a rectangular matrix. Numerische Mathematik, Springer Verlag, 1986, 48, pp.239-249. ⟨hal-00857127⟩

Conference papers43 documents

  • Florent de Dinechin, Luc Forget, Jean-Michel Muller, Yohann Uguen. Posits: the good, the bad and the ugly. CoNGA'19 - Conference for Next Generation Arithmetic, Mar 2019, Singapore, Singapore. pp.1-10, ⟨10.1145/3316279.3316285⟩. ⟨hal-01959581v4⟩
  • Vincent Lefèvre, Jean-Michel Muller. Accurate Complex Multiplication in Floating-Point Arithmetic. ARITH 2019 - 26th IEEE Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.1-7. ⟨hal-02001080v2⟩
  • Anastasia Volkova, Jean-Michel Muller. Semi-automatic implementation of the complementary error function. ARITH 2019 - 26th IEEE Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.1-8. ⟨hal-02002315v2⟩
  • Claude-Pierre Jeannerod, Jean-Michel Muller, Paul Zimmermann. On various ways to split a floating-point number. ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst (MA), United States. pp.53-60, ⟨10.1109/ARITH.2018.8464793⟩. ⟨hal-01774587v2⟩
  • Nicolas Brisebarre, George Constantinides, Miloš Ercegovac, Silviu-Ioan Filip, Matei Istoan, et al.. A High Throughput Polynomial and Rational Function Approximations Evaluator. ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst, MA, United States. pp.99-106, ⟨10.1109/ARITH.2018.8464778⟩. ⟨hal-01774364⟩
  • Claude-Pierre Jeannerod, Jean-Michel Muller, Antoine Plet. The Classical Relative Error Bounds for Computing √a2 + b2 and c/ √a2 + b2 in Binary Floating-Point Arithmetic are Asymptotically Optimal. ARITH-24 2017 - 24th IEEE Symposium on Computer Arithmetic, Jul 2017, London, United Kingdom. pp.8. ⟨ensl-01527202⟩
  • Arthur Blot, Jean-Michel Muller, Laurent Théry. Formal correctness of comparison algorithms between binary64 and decimal64 floating-point numbers. Numerical Software Verification, Jul 2017, Heidelberg, Germany. ⟨hal-01512294⟩
  • Mioara Joldes, Jean-Michel Muller, Valentina Popescu. Implementation and performance evaluation of an extended precision floating-point arithmetic library for high-accuracy semidefinite programming. IEEE Symposium on Computer Arithmetic (Arith24), Jul 2017, London, United Kingdom. ⟨hal-01491255v2⟩
  • Claude-Pierre Jeannerod, Jean-Michel Muller. On the relative error of computing complex square roots in floating-point arithmetic. ACSSC 2017 - 51st Asilomar Conference on Signals, Systems, and Computers, Oct 2017, Pacific Grove, United States. pp.737-740, ⟨10.1109/ACSSC.2017.8335442⟩. ⟨ensl-01780265⟩
  • Jean-Michel Muller, Valentina Popescu, Ping Tak Peter Tang. A new multiplication algorithm for extended precision using floating-point expansions. ARITH23, Jul 2016, Santa Clara, United States. ⟨hal-01298195⟩
  • Julien Le Maire, Nicolas Brunie, Florent de Dinechin, Jean-Michel Muller. Computing floating-point logarithms with fixed-point operations. 23rd IEEE Symposium on Computer Arithmetic, IEEE, Jul 2016, Santa Clara, United States. ⟨hal-01227877⟩
  • Sylvain Collange, Mioara Joldes, Jean-Michel Muller, Valentina Popescu. Parallel floating-point expansions for extended-precision GPU computations. The 27th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP), Jul 2016, London, United Kingdom. ⟨hal-01298206v2⟩
  • Mioara Joldes, Jean-Michel Muller, Valentina Popescu. On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration. 25th IEEE International Conference on Application-specific Systems, Architectures and Processors, ASAP, Jun 2014, Zurich, Switzerland. pp.8. ⟨hal-00957379⟩
  • Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Lauter. Comparison between binary64 and decimal64 floating-point numbers. 21st IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.145-152, ⟨10.1109/ARITH.2013.23⟩. ⟨ensl-00737881v4⟩
  • Jean-Michel Muller. Avoiding double roundings in scaled Newton-Raphson division. Asilomar Conference on Signals, Systems, and Computers, Nov 2013, Pacific Grove, CA, United States. 4 p. ⟨ensl-00875366⟩
  • Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller. On the componentwise accuracy of complex floating-point division with an FMA. 21st IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.83--90. ⟨ensl-00734339v2⟩
  • Nicolas Brisebarre, Mioara Maria Joldes, Érik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, et al.. Rigorous Polynomial Approximation using Taylor Models in Coq. Alwyn Goodloe and Suzette Person. Fourth NASA Formal Methods Symposium, Apr 2012, Norfolk, Virginia, United States. Springer, pp.15, 2012, Lecture Notes in Computer Science. 〈ensl-00653460v2〉
  • Nicolas Brisebarre, Milos Ercegovac, Jean-Michel Muller. (M,p,k)-friendly points: a table-based method for trigonometric function evaluation. 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors, Jul 2012, Delft, Netherlands. p. 46-52, ISBN: 978-1-4673-2243-0, ⟨10.1109/ASAP.2012.17⟩. ⟨ensl-00759912⟩
  • Jean-Michel Muller. Exact computations with an arithmetic known to be approximate (invited talk). MaGiX@LiX 2011, Sep 2011, Palaiseau, France. ⟨ensl-00789015⟩
  • Florent de Dinechin, Jean-Michel Muller, Bogdan Pasca, Alexandru Plesco. An FPGA architecture for solving the Table Maker's Dilemma. Application-Specific Systems, Architectures and Processors (ASAP), 2011 IEEE International Conference on, Sep 2011, Santa Monica, United States. pp.187-194, ⟨10.1109/ASAP.2011.6043267⟩. ⟨ensl-00640063⟩
  • Nicolas Brisebarre, Mioara Maria Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller. Augmented precision square roots, 2-D norms, and discussion on correctly rounding {x^2+y^2}. 20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tübingen, Germany. pp.23-30, ⟨10.1109/ARITH.2011.13⟩. ⟨ensl-00545591v2⟩
  • Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux. Newton-Raphson Algorithms for Floating-Point Division Using an FMA. 21st IEEE International Conference on Application-specific Systems Architectures and Processors (ASAP), 2010, Jul 2010, Rennes, France. IEEE, pp.200-207, 2010. 〈ensl-00549027〉
  • Christian Bertin, Claude-Pierre Jeannerod, Jingyan Jourdan-Lu, Hervé Knochel, Christophe Monat, et al.. Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors. 4th International Workshop on Parallel and Symbolic Computation (PASCO'10), Jul 2010, Grenoble, France. ACM, pp.1-9, 2010, 〈10.1145/1837210.1837212〉. 〈ensl-00549467〉
  • Nicolas Brisebarre, Milos Ercegovac, Nicolas Louvet, Erik Martin-Dorel, Jean-Michel Muller, et al.. Implementing decimal floating-point arithmetic through binary: some suggestions. 21st IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP'2010), Jul 2010, Rennes, France. pp.317-320. ⟨ensl-00463353v2⟩
  • Jean-Michel Muller, Pouya Dormiani, Milos Ercegovac. Low Precision Table Based Complex Reciprocal Approximation. 43rd Asilomar Conference on signals, systems and computers, Nov 2009, Pacific Grove, California, United States. ⟨ensl-00436329v2⟩
  • Pouya Dormiani, Milos Ercegovac, Jean-Michel Muller. Design and Implementation of a Radix-4 Complex Division Unit with Prescaling. 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP'09), Jul 2009, Boston, United States. ⟨ensl-00379147v2⟩
  • Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the Computation of Correctly-Rounded Sums. 19th IEEE Symposium on Computer Arithmetic - Arith'19, Jun 2009, Portland, Oregon, United States. ⟨inria-00367584v2⟩
  • Nicolas Brisebarre, Florent de Dinechin, Jean-Michel Muller. Integer and Floating-Point Constant Multipliers for FPGAs. International Conference on Application-Specific Systems, Architectures and Processors, 2008, IMEC, Jul 2008, Leuven, Belgium. pp.239-244, ⟨10.1109/ASAP.2008.4580184⟩. ⟨ensl-00269219⟩
  • Nicolas Brisebarre, Sylvain Chevillard, Milos Ercegovac, Jean-Michel Muller, Serge Torres. An Efficient Method for Evaluating Polynomial and Rational Function Approximations. ASAP 08, Jul 2008, Leuven, Belgium. pp.233 -- 238. ⟨hal-00761652⟩
  • Milos Ercegovac, Jean-Michel Muller. Complex Multiply-Add and Other Related Operators. SPIE Conf. Advanced Signal Processing Algorithms, Architectures and Implementation XVII, 6697, SPIE, Aug 2007, San Diego, United States. ⟨ensl-00167372⟩
  • Jean-Michel Muller. Generating function approximations at compile time. 40th Asilomar Conference on signals, systems and computers, USA, Oct 2006, Pacific Grove, California, France. pp.328-331. ⟨ensl-00397749⟩
  • Jean-Michel Muller, Nicolas Brisebarre. Correctly rounded multiplication by arbitrary precision constants. ARITH'17, 17th IEEE Symposium on Computer Arithmetic, EEE Computer Society Technical Committee on VLSI, Jun 2005, Cape Cod, United States. ⟨10.1109/ARITH.2005.13⟩. ⟨ensl-00000010⟩
  • Jean-Michel Muller, Arnaud Tisserand, Milos Ercegovac. Simple Seed Architectures for Reciprocal and Square-Root Reciprocal. 39th Asilomar Conference on Signals, Systems and Computers, Oct 2005, Pacific Grove, California, United States. pp.1167-1171. ⟨ensl-00087002⟩
  • Sylvie Boldo, Jean-Michel Muller. Some Functions Computable with a Fused-mac. 17th IEEE Symposium on Computer Arithmetic, Jun 2005, Cape Cod, Massachusetts, USA, pp.52-58. ⟨inria-00000895⟩
  • Jean-Michel Muller, Milos Ercegovac. Complex Square Root with Operand Prescaling. Application-Specific Systems, Architectures and Processors, 2004., Joseph Cavallaro and Lothar Thiele (general chairs), Sep 2004, Galveston, Texas, United States. pp.52-62, ⟨10.1109/ASAP.2004.1342458⟩. ⟨ensl-00086852⟩
  • Jean-Michel Muller, Milos Ercegovac. Complex division with prescaling of operands. Application-specific Systems, Architectures and Processors, 2003, Jun 2003, Delft, Netherlands. ⟨ensl-00086896⟩
  • Vincent Lefèvre, Jean-Michel Muller. Worst Cases for Correct Rounding of the Elementary Functions in Double Precision. 15th IEEE Symposium on Computer Arithmetic - ARITH 2001, 2001, Vail, Colorado, pp.111-118. ⟨inria-00100547⟩
  • Jean-Claude Bajard, A. Guyot, Jean-Michel Muller, A. Skaf. Design of a VLSI circuit for on-line evaluation of several elementary functions using their Taylor expansions. Proceedings.-International-Conference-on-Application-Specific-Array-Processors-Cat.-No.93TH0572-8. 1993:, 1993, Venice, Italy. pp.526-35, ⟨10.1109/ASAP.1993.397172⟩. ⟨hal-00014928⟩
  • A. Guyot, Yvan Herreros, Jean-Michel Muller. JANUS, an on-line multiplier/divider for manipulating large numbers. Proceedings-of-9th-Symposium-on-Computer-Arithmetic-Cat.-No.89CH2757-3., 1989, Santa Monica, CA, United States. pp.106-11, ⟨10.1109/ARITH.1989.72815⟩. ⟨hal-00014975⟩
  • Michel Cosnard, A. Guyot, B. Hochet, Jean-Michel Muller, H. Ouaouicha, et al.. The FELIN arithmetic coprocessor chip. Proceedings-of-the-8th-Symposium-on-Computer-Arithmetic-Cat.-No.87CH2419-0, 1987, Como, Italy. pp.107-12. ⟨hal-00014979⟩
  • Alain Guyot, Bertrand Hochet, Christophe Mauras, Jean-Michel Muller, Yves Robert. SCALA: une cellule systolique programmable pour l'algèbre linéaire. Deuxième Colloque C3, 1987, Unknown, pp.183-204. ⟨hal-00857114⟩
  • Michel Cosnard, El Mostafa Daoudi, Jean-Michel Muller, Yves Robert. On parallel and systolic Givens factorization of dense matrices. Parallel Algorithms and architectures, 1986, Unknown, pp.245-258. ⟨hal-00857131⟩
  • Michel Cosnard, Jean-Michel Muller, Yves Robert, Denis Trystram. Computation costs versus communication costs in parallel Gaussian elimination. Parallel Algorithms and architectures, 1986, Unknown, pp.19-29. ⟨hal-00857132⟩

Books5 documents

Book sections2 documents

  • Florent de Dinechin, Jean-Michel Muller. Evaluating Elementary Functions. Nicholas Higham. Princeton Companion to Applied Mathematics, Princeton University Press, pp.2, 2014. ⟨ensl-00989001⟩
  • Florent de Dinechin, Milos Ercegovac, Jean-Michel Muller, Nathalie Revol. Digital Arithmetic. Benjamin Wah. Wiley Encyclopedia of Computer Science and Engineering, Wiley, pp.935-948, 2009. ⟨ensl-00542215⟩

Directions of work or proceedings3 documents

Preprints, Working Papers, ...11 documents

  • Sylvie Boldo, Christoph Lauter, Jean-Michel Muller. Emulating round-to-nearest-ties-to-zero "augmented" floating-point operations using round-to-nearest-ties-to-even arithmetic. 2019. ⟨hal-02137968⟩
  • Nicolas Brisebarre, Mioara Joldes, Jean-Michel Muller, Ana-Maria Naneş, Joris Picot. Error analysis of some operations involved in the Fast Fourier Transform. 2018. ⟨hal-01949458⟩
  • Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Antoine Plet. A Library for Symbolic Floating-Point Arithmetic. 2016. ⟨hal-01232159v2⟩
  • Jean-Michel Muller. Scaling Newton-Raphson division iterations to avoid double rounding. 2010. ⟨ensl-00496368⟩
  • Jean-Michel Muller. Représentation des nombres et calcul sur ordinateur. 2009. ⟨ensl-00391070⟩
  • Adrien Panhaleux, Peter Kornerup, Jean-Michel Muller. Performing Arithmetic Operations on Round-to-Nearest Representations. 2009. ⟨ensl-00441933⟩
  • Jean-Michel Muller, Peter Kornerup, Christoph Lauter, Vincent Lefèvre, Nicolas Louvet. Computing Correctly Rounded Integer Powers in Floating-Point Arithmetic. 2008. ⟨ensl-00278430⟩
  • Jean-Michel Muller, Vincent Lefèvre. Some notes on the possible under/overflow of the most common elementary functions. 2007. ⟨ensl-00149414⟩
  • Milos Ercegovac, Jean-Michel Muller. Solving Systems of Linear Equations in Complex Domain : Complex E-Method. 2007. ⟨ensl-00125369v2⟩
  • Peter Kornerup, Vincent Lefèvre, Jean-Michel Muller. Computing Integer Powers in Floating-Point Arithmetic. 2007. ⟨ensl-00150406⟩
  • Jean-Michel Muller, Paul Zimmermann. Some arguments concerning correct rounding of the elementary functions. 2006. ⟨ensl-00086516⟩

Reports28 documents

  • Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the Computation of Correctly-Rounded Sums. [Research Report] RR-7262, INRIA. 2010, pp.24. ⟨inria-00475279⟩
  • Catherine Daramy-Loirat, David Defour, Florent de Dinechin, Matthieu Gallet, Nicolas Gast, et al.. CR-LIBM A library of correctly rounded elementary functions in double-precision. [Research Report] LIP,. 2006. ⟨ensl-01529804⟩
  • Florent de Dinechin, Christoph Lauter, Jean-Michel Muller. Fast and correctly rounded logarithms in double-precision. [Research Report] RR-5682, LIP RR-2005-37, INRIA, LIP. 2005, pp.15. ⟨inria-00070331⟩
  • Milos Ercegovac, Jean-Michel Muller, Arnaud Tisserand. Simple Seed Architectures for Reciprocal and Square Root Reciprocal. RR-5720, INRIA. 2005, pp.25. ⟨inria-00070298⟩
  • Jean-Luc Beuchat, Jean-Michel Muller. Multiplication Algorithms for Radix-$2$ RN-Codings and Two's Complement Numbers. [Research Report] RR-5511, LIP RR-2005-05, INRIA, LIP. 2005, pp.13. ⟨inria-00070495⟩
  • Jean-Michel Muller. On the definition of ulp(x). [Research Report] RR-5504, LIP RR-2005-09, INRIA, LIP. 2005, pp.16. ⟨inria-00070503⟩
  • Milos Ercegovac, Jean-Michel Muller. Complex Square Root with Operand Prescaling. [Research Report] RR-5319, LIP RR-2004-42, INRIA, LIP. 2004, pp.18. ⟨inria-00070681⟩
  • Nicolas Brisebarre, Jean-Michel Muller. Correctly rounded multiplication by arbitrary precision constants. [Research Report] RR-5354, LIP RR-2004-44, INRIA, LIP. 2004, pp.14. ⟨inria-00070649⟩
  • Jean-Michel Muller, Jean-Luc Beuchat. RN-codes : algorithmes d'addition, de multiplication et d'élévation au carré. [Rapport de recherche] RR-5438, LIP RR-2004-60, INRIA, LIP. 2004, pp.17. ⟨inria-00070569⟩
  • C. Bertin, Nicolas Brisebarre, Benoît de Dinechin, Claude-Pierre Jeannerod, C. Monat, et al.. A floating-point library for integer processors. [Research Report] RR-5268, INRIA. 2004, pp.17. ⟨inria-00070730⟩
  • David Defour, Guillaume Hanrot, Vincent Lefèvre, Jean-Michel Muller, Nathalie Revol, et al.. Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. [Research Report] RR-5406, INRIA. 2004. ⟨inria-00071249⟩
  • Jean-Michel Muller, Arnaud Tisserand, Benoît de Dinechin, Christophe Monat. Division by Constant for the ST100 DSP Microprocessor. [Research Report] RR-5340, LIP RR-2004-45, INRIA, LIP. 2004, pp.14. ⟨inria-00070661⟩
  • Jean-Michel Muller, Jean-Louis Nicolas, Xavier-François Roblot. Number of solutions to (A^2+B^2=C^2+C) in a binade. [Research Report] RR-4945, LIP RR-2003-45, INRIA, LIPP. 2003. ⟨inria-00071634⟩
  • Milos Ercegovac, Jean-Michel Muller. Complex Division with Prescaling of Operands. [Research Report] RR-4731, LIP RR 2003-10, INRIA, LIP. 2003. ⟨inria-00071856⟩
  • Peter Kornerup, Jean-Michel Muller. Choosing Starting Values for Newton-Raphson Computation of Reciprocals, Square-Roots and Square-Root Reciprocals. [Research Report] RR-4687, LIP RR-2002-48, INRIA,LIP. 2003. ⟨inria-00071899⟩
  • Jean-Luc Beuchat, Jean-Michel Muller. Opérateurs itératifs de multiplication-addition modulaire pour FPGA. [Rapport de recherche] RR-4937, LIP RR-2003-40, INRIA, LIP. 2003. ⟨inria-00071642⟩
  • Nicolas Brisebarre, Jean-Michel Muller. Finding the «truncated» polynomial that is closest to a function. [Research Report] RR-4787, LIP RR-2003-21, INRIA, LIP. 2003. ⟨inria-00071799⟩
  • Jean-Michel Muller. «Partially rounded» Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods. [Research Report] RR-4593, LIP RR-2002-39, INRIA, LIP. 2002. ⟨inria-00071992⟩
  • David Defour, Florent de Dinechin, Jean-Michel Muller. A new scheme for table-based evaluation of functions. [Research Report] RR-4637, LIP RR-2002-45, INRIA, LIP. 2002. ⟨inria-00071948⟩
  • Jean-Michel Muller. Accelerating Floating-Point Division When the Divisor is Known in Advance. [Research Report] RR-4532, LIP RR-2002-30, INRIA, LIP. 2002. ⟨inria-00072056⟩
  • David Defour, Florent de Dinechin, Jean-Michel Muller. Correctly Rounded Exponential Function in Double Precision Arithmetic. [Research Report] RR-4231, INRIA. 2001. ⟨inria-00072387⟩
  • David Defour, Peter Kornerup, Jean-Michel Muller, Nathalie Revol. A New Range Reduction Algorithm. [Research Report] RR-4267, LIP RR-2001-33, INRIA, LIP. 2001. ⟨inria-00072320⟩
  • Vincent Lefèvre, Jean-Michel Muller. Worst Cases for Correct Rounding of the Elementary Functions in Double Precision. [Research Report] RR-4044, LIP RR-2000-35, INRIA,LIP. 2000. ⟨inria-00072594⟩
  • Tomas Lang, Jean-Michel Muller. Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions. [Research Report] RR-4045, LIP RR-2000-33, INRIA, LIP. 2000. ⟨inria-00072593⟩
  • Vincent Lefèvre, Jean-Michel Muller. On-The-Fly Range Reduction. [Research Report] RR-4043, LIP RR-2000-34, INRIA, LIP. 2000. ⟨inria-00072595⟩
  • Jean-Michel Muller. Vers des primitives propres en arithmétique des ordinateurs. RR-3755, INRIA. 1999. ⟨inria-00072907⟩
  • Laurent Imbert, Jean-Michel Muller, Fabien Rico. Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers. [Research Report] RR-3754, LIP RR-1999-43, INRIA, LIP. 1999. ⟨inria-00072908⟩
  • Milos Ercegovac, Laurent Imbert, David Matula, Jean-Michel Muller, Guoheng Wei. Improving Goldschmidt Division, Square Root and Square Root Reciprocal. [Research Report] RR-3753, LIP RR-1999-41, INRIA, LIP. 1999. ⟨inria-00072909⟩

Theses1 document

  • Jean-Michel Muller. Une méthodologie du calcul des fonctions élémentaires. Modélisation et simulation. Institut National Polytechnique de Grenoble - INPG, 1985. Français. ⟨tel-00315301⟩