default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Louvet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]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): 1:1-1:34 (2023)
2010 – 2019
- 2017
- [j6]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) - 2016
- [j5]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) - 2013
- [j4]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) - [c6]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
- [j3]Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller:
On the Computation of Correctly Rounded Sums. IEEE Trans. Computers 61(3): 289-298 (2012) - 2011
- [j2]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) - 2010
- [j1]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): 4:1-4:23 (2010) - [c5]Nicolas Louvet, Jean-Michel Muller, Adrien Panhaleux:
Newton-Raphson algorithms for floating-point division using an FMA. ASAP 2010: 200-207 - [c4]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: 317-320
2000 – 2009
- 2009
- [c3]Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller:
On the Computation of Correctly-Rounded Sums. IEEE Symposium on Computer Arithmetic 2009: 155-160 - 2007
- [b1]Nicolas Louvet:
Algorithmes compensés en arithmétique flottante : précision, validation, performances. (Compensated algorithms in floating point arithmetic : accuracy, validation, performances). University of Perpignan, France, 2007 - [c2]Philippe Langlois, Nicolas Louvet:
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm. IEEE Symposium on Computer Arithmetic 2007: 141-149 - 2006
- [c1]Stef Graillat, Philippe Langlois, Nicolas Louvet:
Improving the compensated Horner scheme with a fused multiply and add. SAC 2006: 1323-1327 - [i2]Philippe Langlois, Nicolas Louvet:
Faithful Polynomial Evaluation with Compensated Horner Algorithm. CoRR abs/cs/0610122 (2006) - 2005
- [i1]Philippe Langlois, Stef Graillat, Nicolas Louvet:
Compensated Horner Scheme. Algebraic and Numerical Algorithms and Computer-assisted Proofs 2005
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-04-24 22:48 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:
