Team Arénaire

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
N. Brisebarre, J.-M. Muller, A. Tisserand.
Computing machine-efficient polynomial approximations, in: ACM Transactions on Mathematical Software, June 2006, vol. 32, no 2, p. 236–256.
[2]
F. de Dinechin, A. Tisserand.
Multipartite table methods, in: IEEE Transactions on Computers, 2005, vol. 54, no 3, p. 319-330.
[3]
C.-P. Jeannerod, G. Villard.
Essentially optimal computation of the inverse of generic polynomial matrices, in: Journal of Complexity, 2005, vol. 21, no 1, p. 72–86.
[4]
E. Kaltofen, G. Villard.
On the complexity of computing determinants, in: Computational Complexity, 2004, vol. 13, p. 91–130.
[5]
J.-M. Muller.
Elementary Functions, Algorithms and Implementation, Birkhäuser Boston, 2nd Edition, 2006.
[6]
N. Revol, K. Makino, M. Berz.
Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY, in: Journal of Logic and Algebraic Programming, 2005, vol. 64, p. 135–154.

Publications of the year

Books and Monographs

[7]
M. Daumas, N. Revol (editors)
Special issue on Real Numbers and Computers, Theoretical Computer Science, 2006, vol. 351, no 1.
[8]
P. Hertling, C. M. Hoffmann, W. Luther, N. Revol (editors)
Special issue on Reliable Implementation of Real Number Algorithms: Theory and Practice, Lecture Notes in Computer Science, to appear, 2006.
[9]
J.-M. Muller.
Elementary Functions, Algorithms and Implementation, Birkhäuser Boston, 2nd Edition, 2006.

Doctoral dissertations and Habilitation theses

[10]
G. Melquiond.
De l'arithmétique d'intervalles à la certification de programmes, Ph. D. Thesis, École Normale Supérieure de Lyon, Lyon, France, 2006.
[11]
S. K. Raina.
FLIP: a floating-point library for integer processors, Ph. D. Thesis, École Normale Supérieure de Lyon, Lyon, France, September 2006.

Articles in refereed journals and book chapters

[12]
B. Beckermann, G. Labahn, G. Villard.
Normal forms for general polynomial matrices, in: Journal of Symbolic Computation, 2006, vol. 41, no 6, p. 708–737.
[13]
N. Brisebarre, J.-M. Muller.
Correct Rounding of Algebraic Functions, in: Theoretical Informatics and Applications, to appear, 2006.
[14]
N. Brisebarre, J.-M. Muller, A. Tisserand.
Computing machine-efficient polynomial approximations, in: ACM Transactions on Mathematical Software, June 2006, vol. 32, no 2, p. 236–256
http://doi.acm.org/10.1145/1141885.1141890.
[15]
N. Brisebarre, J.-M. Muller, A. Tisserand, S. Torres.
Hardware Operators for Function Evaluation Using Sparse-Coefficient Polynomials, in: Electronic Letters, to appear, 2006.
[16]
H. Brönnimann, G. Melquiond, S. Pion.
The design of the Boost interval arithmetic library, in: Theoretical Computer Science, 2006, vol. 351, p. 111–118
http://perso.ens-lyon.fr/guillaume.melquiond/doc/06-tcs-rnc5.pdf.
[17]
F. de Dinechin, C. Q. Lauter, J.-M. Muller.
Fast and Correctly Rounded Logarithms in Double-Precision, in: Theoretical Informatics and Applications, to appear, 2007.
[18]
F. de Dinechin, G. Villard.
High precision numerical accuracy in physics research, in: Nuclear Inst. and Methods in Physics Research, A, 2006, vol. 559, no 1, p. 207–210.
[19]
J. Detrey, F. de Dinechin.
A tool for unbiased comparison between logarithmic and floating-point arithmetic, in: Journal of VLSI Signal Processing, to appear, 2007.
[20]
J. Detrey, F. de Dinechin.
Parameterized floating-point logarithm and exponential functions for FPGAs, in: Microprocessors and Microsystems, to appear, Elsevier, 2007
http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/DetDin2006_micpro.pdf.
[21]
M. Ercegovac, J.-M. Muller.
Complex Square Root with Operand Prescaling, in: Journal of VLSI Signal Processing, to appear, 2006.
[22]
R. Glabb, L. Imbert, G. Jullien, A. Tisserand, N. Veyrat-Charvillon.
Multi-mode Operator for SHA-2 Hash Functions, in: Journal of Systems Architecture, Special issue on "Embedded Cryptographic Hardware", to appear, 2006.
[23]
C.-P. Jeannerod, G. Villard.
Asymptotically fast polynomial matrix algorithms for multivariable systems, in: International Journal of Control, 2006, vol. 79, no 11, p. 1359–1367.
[24]
P. Kornerup, J.-M. Muller.
Choosing Starting Values for certain Newton-Raphson Iterations, in: Theoretical Computer Science, February 2006, vol. 351, no 1, p. 101-110.
[25]
P. Kornerup, J.-M. Muller.
Leading Guard Digits in Finite-Precision Redundant Representations, in: IEEE Transactions on Computers, May 2006, vol. 55, no 5, p. 541–548.
[26]
G. Melquiond, S. Pion.
Formally certified floating-point filters for homogeneous geometric predicates, in: Theoretical Informatics and Applications, to appear, 2006.

Publications in Conferences and Workshops

[27]
S. Boldo, M. Daumas, W. Kahan, G. Melquiond.
Proof and certification for an accurate discriminant, in: SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, 2006.
[28]
H. Brönnimann, G. Melquiond, S. Pion.
Proposing Interval Arithmetic for the C++ Standard, in: SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, 2006.
[29]
F. Cháves, M. Daumas.
A Library to Taylor models for PVS automatic proof checker, in: Proceedings of the NSF workshop on reliable engineering computing, Savannah, Georgia, 2006, p. 39-52
http://www.gtsav.gatech.edu/workshop/rec06/papers/Chaves_paper.pdf.
[30]
S. Chevillard, C. Q. Lauter.
Certified infinite norm using interval arithmetic, in: SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, 2006.
[31]
S. Chevillard, N. Revol.
Computation of the error functions erf and erfc in arbitrary precision with correct rounding, in: International Conference on Mathematical Software, Spain, 2006.
[32]
S. Collange, J. Detrey, F. de Dinechin.
Floating point or LNS: choosing the right arithmetic on an application basis, in: 9th Euromicro Conference on Digital System Design: Architectures, Methods and Tools (DSD'2006), Dubrovnik, Croatia, IEEE Computer Society, August 2006, p. 197-203
http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/ColDetDin2006_dsd.pdf.
[33]
F. de Dinechin.
Elementary functions for double-precision interval arithmetic, in: SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, 2006.
[34]
F. de Dinechin, C. Q. Lauter, G. Melquiond.
Assisted verification of elementary functions using Gappa, in: Proceedings of the 2006 ACM Symposium on Applied Computing, 2006, p. 1318–1322.
[35]
F. de Dinechin, S. Maidanov.
Software techniques for perfect elementary functions in floating-point interval arithmetic, in: Real Numbers and Computers, July 2006.
[36]
F. de Dinechin, E. McIntosh, F. Schmidt.
Massive Tracking on Heterogeneous Platforms, in: 9th International Computational Accelerator Physics Conference (ICAP), October 2006.
[37]
J. Detrey, F. de Dinechin.
Opérateurs trigonométriques en virgule flottante sur FPGA, in: RenPar'17, SympA'2006, CFSE'5 et JC'2006, Perpignan, France, October 2006, p. 96-105
http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/DetDin2006_sympa.pdf.
[38]
J. Detrey.
TutoRISC : un RISC dans mon FPGA, in: 9èmes Journées Pédagogiques du CNFM, Saint-Malo, France, November 2006, p. 153-158
http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/Det2006_jpcnfm.pdf.
[39]
W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, G. Villard.
Solving sparse integer linear systems, in: Proc. International Symposium on Symbolic and Algebraic Computation, Genova, Italy, ACM Press, July 2006, p. 63–70.
[40]
M. Ercegovac, J.-M. Muller.
Arithmetic Processor for Solving Tri-Diagonal Systems of Linear Equations, in: proc. 40th Conference on Signals, Systems and Computers, Pacific Grove, CA, November 2006.
[41]
R. Glabb, L. Imbert, G. Jullien, A. Tisserand, N. Veyrat-Charvillon.
Multi-mode Operator for SHA-2 Hash Functions, in: Proc. International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA), Las Vegas, Nevada, U.S.A., June 2006, p. 207–210.
[42]
C. Q. Lauter.
A survey of multiple precision computation using floating-point arithmetic, in: Taylor Models 2006, Florida, 2006.
[43]
R. Michard, A. Tisserand, N. Veyrat-Charvillon.
New Identities and Transformations for Hardware Power Operators, in: Proc. Advanced Signal Processing Algorithms, Architectures and Implementations XVI, San Diego, California, U.S.A., F. T. Luk (editor), SPIE, August 2006.
[44]
R. Michard, A. Tisserand, N. Veyrat-Charvillon.
Optimisation d'opérateurs arithmétiques matériels à base d'approximations polynomiales, in: 11e SYMPosium en Architectures nouvelles de machines (SYMPA), Perpignan, October 2006.
[45]
J.-M. Muller.
Generating Functions at Compile-Time, in: proc. 40th Conference on Signals, Systems and Computers, Pacific Grove, CA, November 2006.
[46]
N. Revol.
Design choices and their limits for an interval arithmetic library. The example of MPFI., in: SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, 2006.
[47]
N. Revol.
Implementing Taylor models arithmetic with floating-point arithmetic: bounding roundoff errors, in: Taylor Models 2006, Florida, 2006.

Internal Reports

[48]
S. Boldo, G. Melquiond.
Emulation of a FMA and correctly-rounded sums: proved algorithms using rounding to odd, Submitted to IEEE-TC, HAL, 2006, no inria-00080427
http://hal.inria.fr/inria-00080427.
[49]
N. Brisebarre, S. Chevillard.
Efficient polynomial Im1 $L^\#8734 $ -approximations, Submitted to ARITH 18, HAL, 2006, no RR-6060
https://hal.inria.fr/inria-00119513.
[50]
N. Brisebarre, G. Hanrot.
Floating-point L2 approximations, Submitted to ARITH 18, HAL, 2006, no RR-6058
https://hal.inria.fr/inria-00119254.
[51]
H. Brönnimann, G. Melquiond, S. Pion.
A Proposal to add Interval Arithmetic to the C++ Standard Library, Technical report, C++ standardization committee, 2006, no 2137
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2137.pdf.
[52]
H. Brönnimann, G. Melquiond, S. Pion.
Bool_set: multi-valued logic, Technical report, C++ standardization committee, 2006, no 2136
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2136.pdf.
[53]
J. Detrey, F. de Dinechin, X. Pujol.
Return of the hardware floating-point elementary function, Technical report, Laboratoire de l'Informatique du Parallélisme, 2006, no 2006-45
http://prunel.ccsd.cnrs.fr/ensl-00117386.
[54]
C.-P. Jeannerod.
LSP Matrix Decomposition Revisited, Research report, Laboratoire de l'Informatique du Parallélisme, ENS Lyon, September 2006, no RR2006-28
http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-28.pdf.
[55]
C. Q. Lauter, S. Chevillard.
A certified infinite norm for the validation of numerical algorithms, Research report, Laboratoire de l'Informatique du Parallélisme, Lyon, France, 2006, no RR2006-49
http://prunel.ccsd.cnrs.fr/ensl-00119810.
[56]
C. Q. Lauter.
Exact and mid-point rounding cases of power(x,y), Technical report, Laboratoire de l'Informatique du Parallélisme, 2006, no 2006-46
http://prunel.ccsd.cnrs.fr/ensl-00117433.
[57]
G. Revy.
Analyse et implantation d'algorithmes rapides pour l'évaluation polynomiale sur les nombres flottants, Technical report, Laboratoire de l'Informatique du Parallélisme - ENS Lyon, 2006
http://prunel.ccsd.cnrs.fr/ensl-00119498.

Miscellaneous

[58]
A. Bostan, C.-P. Jeannerod, E. Schost.
Solving structured linear systems of large displacement rank, July 2006, ISSAC 2006 poster.

previous
next