default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaude-Pierre Jeannerod
Person information
- affiliation: INRIA, ENS de Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Tom Hubrecht, Claude-Pierre Jeannerod, Jean-Michel Muller:
Useful applications of correctly-rounded operators of the form ab + cd + e. ARITH 2024: 32-39- 2023
- [j23]Sylvie Boldo, Claude-Pierre Jeannerod, Guillaume Melquiond, Jean-Michel Muller
:
Floating-point arithmetic. Acta Numer. 32: 203-290 (2023) - [c21]Tom Hubrecht, Claude-Pierre Jeannerod, Paul Zimmermann:
Towards a correctly-rounded and fast power function in binary64 arithmetic. ARITH 2023: 111-118 - 2022
- [c20]Carlos F. Borges, Claude-Pierre Jeannerod, Jean-Michel Muller:
High-level algorithms for correctly-rounded reciprocal square roots. ARITH 2022: 18-25 - 2020
- [j22]Claude-Pierre Jeannerod:
The relative accuracy of (x+y)*(x-y). J. Comput. Appl. Math. 369 (2020) - [j21]Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard:
Fast computation of approximant bases in canonical form. J. Symb. Comput. 98: 192-224 (2020)
2010 – 2019
- 2019
- [j20]Claude-Pierre Jeannerod, Théo Mary, Clément Pernet, Daniel S. Roche:
Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. SIAM J. Matrix Anal. Appl. 40(4): 1478-1496 (2019) - 2018
- [b3]Jean-Michel Muller, Nicolas Brunie, Florent de Dinechin, Claude-Pierre Jeannerod, Mioara Joldes, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Serge Torres:
Handbook of Floating-Point Arithmetic (2nd Ed.). Springer 2018, ISBN 978-3-319-76525-9 - [j19]Claude-Pierre Jeannerod, Siegfried M. Rump:
On relative errors of floating-point operations: Optimal bounds and applications. Math. Comput. 87(310): 803-819 (2018) - [c19]Claude-Pierre Jeannerod, Jean-Michel Muller, Paul Zimmermann:
On Various Ways to Split a Floating-Point Number. ARITH 2018: 53-60 - [i8]Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard:
Fast computation of approximant bases in canonical form. CoRR abs/1801.04553 (2018) - 2017
- [j18]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. J. Symb. Comput. 83: 272-314 (2017) - [j17]Claude-Pierre Jeannerod, Peter Kornerup, Nicolas Louvet, Jean-Michel Muller:
Error bounds on complex floating-point multiplication with an FMA. Math. Comput. 86(304): 881-898 (2017) - [j16]Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost:
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms. SIAM J. Matrix Anal. Appl. 38(3): 733-775 (2017) - [c18]Claude-Pierre Jeannerod, Jean-Michel Muller:
On the relative error of computing complex square roots in floating-point arithmetic. ACSSC 2017: 737-740 - [c17]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: 66-73 - [c16]Claude-Pierre Jeannerod, Christophe Monat, Laurent Thévenoux:
More accurate complex multiplication for embedded processors. SIES 2017: 1-4 - [i7]Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost:
On matrices with displacement structure: generalized operators and faster algorithms. CoRR abs/1703.03734 (2017) - 2016
- [j15]Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Antoine Plet:
Sharp error bounds for complex floating-point inversion. Numer. Algorithms 73(3): 735-760 (2016) - [j14]Claude-Pierre Jeannerod:
A Radix-Independent Error Analysis of the Cornea-Harrison-Tang Method. ACM Trans. Math. Softw. 42(3): 19:1-19:20 (2016) - [c15]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. ISSAC 2016: 295-302 - [i6]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast computation of minimal interpolation bases in Popov form for arbitrary shifts. CoRR abs/1602.00651 (2016) - 2015
- [j13]Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations. IEEE Trans. Inf. Theory 61(5): 2370-2387 (2015) - [c14]Claude-Pierre Jeannerod:
Exploiting Structure in Floating-Point Arithmetic. MACIS 2015: 25-34 - [i5]Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Computing minimal interpolation bases. CoRR abs/1512.03503 (2015) - 2014
- [j12]Siegfried M. Rump, Claude-Pierre Jeannerod:
Improved Backward Error Bounds for LU and Cholesky Factorizations. SIAM J. Matrix Anal. Appl. 35(2): 684-698 (2014) - [i4]Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations. CoRR abs/1402.0643 (2014) - 2013
- [j11]Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann:
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. J. Symb. Comput. 56: 46-68 (2013) - [j10]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): 2245-2264 (2013) - [j9]Claude-Pierre Jeannerod, Siegfried M. Rump:
Improved Error Bounds for Inner Products in Floating-Point Arithmetic. SIAM J. Matrix Anal. Appl. 34(2): 338-344 (2013) - [c13]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: 83-90 - 2012
- [c12]Claude-Pierre Jeannerod, Jingyan Jourdan-Lu:
Simultaneous Floating-Point Sine and Cosine for VLIW Integer Processors. ASAP 2012: 69-76 - [c11]Claude-Pierre Jeannerod, Jingyan Jourdan-Lu, Christophe Monat:
Non-generic floating-point software support for embedded media processing. SIES 2012: 283-286 - 2011
- [j8]Claude-Pierre Jeannerod, Herve Knochel, Christophe Monat, Guillaume Revy:
Computing Floating-Point Square Roots via Bivariate Polynomial Evaluation. IEEE Trans. Computers 60(2): 214-227 (2011) - [j7]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): 228-241 (2011) - [c10]Claude-Pierre Jeannerod, Jingyan Jourdan-Lu, Christophe Monat, Guillaume Revy:
How to Square Floats Accurately and Efficiently on the ST231 Integer Processor. IEEE Symposium on Computer Arithmetic 2011: 77-81 - [i3]Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann:
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. CoRR abs/1112.5717 (2011) - 2010
- [b2]Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres:
Handbook of Floating-Point Arithmetic. Birkhäuser 2010, ISBN 978-0-8176-4704-9, pp. I-XXIII, 1-572 - [j6]Vincent Lefèvre, Philippe Théveny, Florent de Dinechin, Claude-Pierre Jeannerod, Christophe Mouilleron, David Pfannholzer, Nathalie Revol:
LEMA: towards a language for reliable arithmetic. ACM Commun. Comput. Algebra 44(1/2): 41-52 (2010) - [c9]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: 1-9 - [c8]Claude-Pierre Jeannerod, Christophe Mouilleron:
Computing specified generators of structured matrix inverses. ISSAC 2010: 281-288
2000 – 2009
- 2009
- [j5]Claude-Pierre Jeannerod, Christophe Mouilleron, Gilles Villard:
Extending Cardinal's algorithm to a broader class of structured matrices. ACM Commun. Comput. Algebra 43(3/4): 84-85 (2009) - [c7]Claude-Pierre Jeannerod, Herve Knochel, Christophe Monat, Guillaume Revy, Gilles Villard:
A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor. IEEE Symposium on Computer Arithmetic 2009: 95-103 - 2008
- [j4]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems with large displacement rank. Theor. Comput. Sci. 407(1-3): 155-181 (2008) - 2007
- [c6]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving toeplitz- and vandermonde-like linear systems with large displacement rank. ISSAC 2007: 33-40 - [c5]Claude-Pierre Jeannerod, Herve Knochel, Christophe Monat, Guillaume Revy:
Faster floating-point square root for integer processors. SIES 2007: 324-327 - 2006
- [j3]Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems of large displacement rank. ACM Commun. Comput. Algebra 40(2): 42-44 (2006) - [i2]Éric Schost, Alin Bostan, Claude-Pierre Jeannerod:
Using fast matrix multiplication to solve structured linear systems. Challenges in Symbolic Computation Software 2006 - 2005
- [j2]Claude-Pierre Jeannerod, Gilles Villard:
Essentially optimal computation of the inverse of generic polynomial matrices. J. Complex. 21(1): 72-86 (2005) - [i1]Claude-Pierre Jeannerod, Gilles Villard:
Asymptotically fast polynomial matrix algorithms for multivariable systems. CoRR abs/cs/0508113 (2005) - 2003
- [c4]Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard:
On the complexity of polynomial matrix computations. ISSAC 2003: 135-142 - 2002
- [c3]Claude-Pierre Jeannerod:
A reduced form for perturbed matrix polynomials. ISSAC 2002: 131-137 - 2000
- [b1]Claude-Pierre Jeannerod:
Formes normales de perturbations de matrices : étude et calcul exact. (Studies in matrix perturbations : algebraic computation of normal forms). Grenoble Institute of Technology, France, 2000 - [c2]Claude-Pierre Jeannerod:
An algorithm for the eigenvalue perturbation problem: reduction of a -matrix to a Lidskii matrix. ISSAC 2000: 184-191
1990 – 1999
- 1999
- [c1]Claude-Pierre Jeannerod, Eckhard Pflügel:
A Reduction Algorithm for Matrices Depending on a Parameter. ISSAC 1999: 121-128 - 1998
- [j1]Claude-Pierre Jeannerod, J. Visconti:
Global error estimation for index-1 and -2 DAEs. Numer. Algorithms 19(1-4): 111-125 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
