% À faire: % * supprimer de toutes les références « to appear », % * compléter les références effectivement parues en 2006, avec tous % les détails réglementaires prouvant la parution effective, % * vérifier le fichier avec le script verif_bib. % Pour info: Cette modification n'aura pas d'effet sur l'affichage du % RA 2006. Le fichier consolidé arenaire2006.bib, une fois traduit en % XML, sera inclu dans la base de données Ralyx, ce qui permettra son % exploitation automatisée par la direction. % Cf http://www.inria.fr/interne/disc/publier/raweb.html @inproceedings{ChaDau06, author = {Francisco Ch\'aves and Marc Daumas}, address = {Savannah, Georgia}, booktitle = {Proceedings of the NSF workshop on reliable engineering computing}, title = {A Library to {T}aylor models for {PVS} automatic proof checker}, pages = {39-52}, year = 2006, url = {http://www.gtsav.gatech.edu/workshop/rec06/papers/Chaves_paper.pdf}, url.alt = {http://hal.ccsd.cnrs.fr/ccsd-00018529} } @InProceedings{ColDetDin2006:dsd, author = {Sylvain Collange and J\'er\'emie Detrey and Florent de Dinechin}, title = {Floating point or {LNS}: choosing the right arithmetic on an application basis}, booktitle = {9th Euromicro Conference on Digital System Design: Architectures, Methods and Tools (DSD'2006)}, pages = {197-203}, address = {Dubrovnik, Croatia}, publisher = {IEEE Computer Society}, month = aug, year = 2006, doi = {10.1109/DSD.2006.54}, url = {http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/ColDetDin2006_dsd.pdf} } @techreport{DetDinPuj2006:LIP, author = {J\'er\'emie Detrey and Florent de Dinechin and Xavier Pujol}, title = {Return of the hardware floating-point elementary function}, institution = {Laboratoire de l'Informatique du Parall\'elisme}, number = {2006-45}, year = {2006}, url = {http://prunel.ccsd.cnrs.fr/ensl-00117386} } @InProceedings{DetDin2006:sympa, author = {J\'er\'emie Detrey and Florent de Dinechin}, title = {Op\'erateurs trigonom\'etriques en virgule flottante sur {FPGA}}, booktitle = {RenPar'17, SympA'2006, CFSE'5 et JC'2006}, pages = {96-105}, address = {Perpignan, France}, month = oct, year = 2006, url = {http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/DetDin2006_sympa.pdf} } @InProceedings{Det2006:jpcnfm, author = {J\'er\'emie Detrey}, title = {{TutoRISC} : un {RISC} dans mon {FPGA}}, booktitle = {9\`emes Journ\'ees P\'edagogiques du CNFM}, pages = {153-158}, address = {Saint-Malo, France}, month = nov, year = 2006, url = {http://perso.ens-lyon.fr/jeremie.detrey/publications/pub/Det2006_jpcnfm.pdf} } @InProceedings{Din2006Scan, author = {Florent de Dinechin}, title = {Elementary functions for double-precision interval arithmetic}, booktitle = {SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics}, address = {Duisburg, Germany}, year = 2006, } @article{JeVi06, author = "Claude-Pierre Jeannerod and Gilles Villard", title = "Asymptotically fast polynomial matrix algorithms for multivariable systems", journal = "International Journal of Control", volume = 79, number = 11, pages = "1359--1367", year = 2006 } @article{BroMelPio06a, author = {Herv{\'e} Br{\"o}nnimann and Guillaume Melquiond and Sylvain Pion}, title = {The design of the {B}oost interval arithmetic library}, journal = {Theoretical Computer Science}, editor = {Marc Daumas and Nathalie Revol}, pages = {111--118}, volume = {351}, year = {2006}, url = {http://perso.ens-lyon.fr/guillaume.melquiond/doc/06-tcs-rnc5.pdf} } @inproceedings{DinLauMel06, author = {Florent de Dinechin and Christoph Quirin Lauter and Guillaume Melquiond}, title = {Assisted verification of elementary functions using {G}appa}, booktitle = {Proceedings of the 2006 ACM Symposium on Applied Computing}, pages = {1318--1322}, adress = {Dijon, France}, year = {2006} } @techreport{BroMelPio06b, author = {Herv{\'e} Br{\"o}nnimann and Guillaume Melquiond and Sylvain Pion}, title = {Bool\_set: multi-valued logic}, institution = {C++ standardization committee}, number = {2136}, year = {2006}, url = {http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2136.pdf} } @techreport{BroMelPio06c, author = {Herv{\'e} Br{\"o}nnimann and Guillaume Melquiond and Sylvain Pion}, title = {A Proposal to add Interval Arithmetic to the {C}++ Standard Library}, institution = {C++ standardization committee}, number = {2137}, year = {2006}, url = {http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2137.pdf} } @inproceedings{BroMelPio06d, author = {Herv{\'e} Br{\"o}nnimann and Guillaume Melquiond and Sylvain Pion}, title = {Proposing Interval Arithmetic for the C++ Standard}, booktitle = {SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics}, address = {Duisburg, Germany}, year = {2006} } @inproceedings{BolDauKahMel06, author = {Sylvie Boldo and Marc Daumas and William Kahan and Guillaume Melquiond}, title = {Proof and certification for an accurate discriminant}, booktitle = {SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics}, address = {Duisburg, Germany}, year = {2006} } @techreport{BolMel06, author = {Sylvie Boldo and Guillaume Melquiond}, title = {Emulation of a FMA and correctly-rounded sums: proved algorithms using rounding to odd}, institution = {HAL}, number = {inria-00080427}, year = {2006}, note = {Submitted to IEEE-TC} } % TODO: pb avec cette entree (voir pdf). @INPROCEEDINGS{MicTisVey06:spie, AUTHOR = {R. Michard and A. Tisserand and N. Veyrat-Charvillon}, BOOKTITLE = {Proc. Advanced Signal Processing Algorithms, Architectures and Implementations XVI}, TITLE = {New Identities and Transformations for Hardware Power Operators}, YEAR = {2006}, ADDRESS = {San Diego, California, U.S.A.}, EDITOR = {F. T. Luk}, MONTH = aug, PUBLISHER = {SPIE} } @INPROCEEDINGS{MicTisVey06:sympa, AUTHOR = {R. Michard and A. Tisserand and N. Veyrat-Charvillon}, BOOKTITLE = {11e SYMPosium en Architectures nouvelles de machines (SYMPA)}, TITLE = {Optimisation d'opérateurs arithmétiques matériels à base d'approximations polynomiales}, YEAR = {2006}, ADDRESS = {Perpignan}, MONTH = oct } @article{KornerupMuller2006, author={Peter Kornerup and Jean-Michel Muller}, title={Choosing Starting Values for certain Newton-Raphson Iterations}, abstract={ We aim at finding the best possible seed values when computing $a^{1/p}$ using the Newton-Raphson iteration in a given interval. A natural choice of the seed value would be the one that best approximates the expected result. It turns out that in most cases, the best seed value can be quite far from this natural choice. When we evaluate a monotone function f(a) in the interval [amin, amax], by building the sequence xn defined by the Newton-Raphson iteration, the natural choice consists in choosing x0 equal to the arithmetic mean of the endpoint values. This minimizes the maximum possible distance between x0 and f(a). And yet, if we perform n iterations, what matters is to minimize the maximum possible distance between xn and f(a). In several examples, the value of the best starting point varies rather significantly with the number of iterations.}, journal={Theoretical Computer Science}, volume={351}, year={2006}, pages={101-110}, month= feb, number={1} } @article{BrisebarreMullerTisserand2006, author={Nicolas Brisebarre and Jean-Michel Muller and Arnaud Tisserand}, title={Computing machine-efficient polynomial approximations}, abstract={Polynomial approximations are almost always used when implementing functions on a computing system. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite---and sometimes small---number of bits. This is due to the finiteness of the floating-point representations (for software implementations), and to the need to have small, hence fast and/or inexpensive, multipliers (for hardware implementations). We then have to consider polynomial approximations for which the degree-i coefficient has at most mi fractional bits; in other words, it is a rational number with denominator $2^{mi}$. We provide a general and efficient method for finding the best polynomial approximation under this constraint. Moreover, our method also applies if some other constraints (such as requiring some coefficients to be equal to some predefined constants or minimizing relative error instead of absolute error) are required.}, journal={{ACM} Transactions on Mathematical Software}, volume={32}, year={2006}, pages={236--256}, month= jun, number={2}, doi={http://doi.acm.org/10.1145/1141885.1141890} } @article{KornerupMuller2006a, author={Peter Kornerup and Jean-Michel Muller}, title={Leading Guard Digits in Finite-Precision Redundant Representations}, abstract={Redundant number representations are generally used to allow constant time additions, based on the fact that only bounded carry-ripples take place. But, carries may ripple out into positions which may not be needed to represent the final value of the result and, thus, a certain amount of leading guard digits are needed to correctly determine the result. Also, when cancellation during subtractions occurs, there may be nonzero digits in positions not needed to represent the result of the calculation. It is shown here that, for normal redundant digit sets with radix greater than two, a single guard digit is sufficient to determine the value of such an arbitrary length prefix of leading nonzero digits. This is also the case for the unsigned carry-save representation, whereas two guard digits are sufficient, and may be necessary, for additions in the binary signed-digit and 2's complement carry-save representations. Thus, only the guard digits need to be retained during sequences of additions and subtractions. At suitable points, the guard digits may then be converted into a single digit, representing the complete prefix.}, journal={{IEEE} Transactions on Computers}, volume={55}, year={2006}, pages={541--548}, month= may, number={5}, doi={http://dx.doi.org/10.1109/TC.2006.79} } @book{Muller2006, author={Jean-Michel Muller}, title={Elementary Functions, Algorithms and Implementation}, publisher={Birkh\"{a}user Boston, 2nd Edition}, year={2006}, isbn={0-8176-4372-9 } } @inproceedings{Muller2006a, author={Jean-Michel Muller}, title={Generating Functions at Compile-Time}, booktitle={proc. 40th Conference on Signals, Systems and Computers}, year={2006}, month= nov, address={Pacific Grove, CA} } @inproceedings{ErcegovacMuller2006, author={Milos Ercegovac and Jean-Michel Muller}, title={Arithmetic Processor for Solving Tri-Diagonal Systems of Linear Equations}, booktitle={proc. 40th Conference on Signals, Systems and Computers}, year={2006}, month= nov, address={Pacific Grove, CA} } @article{BriMulTisTor2006, author = {Nicolas Brisebarre and Jean-Michel Muller and Arnaud Tisserand and Serge Torres}, title = {Hardware Operators for Function Evaluation Using Sparse-Coefficient Polynomials}, journal = {IEE Electronics Letters}, volume={42}, year={2006}, pages={1441--1442}, month= Dec, number={25}, doi={http://dx.doi.org/10.1049/el:20062373} } @PhdThesis{Raina06, author = {Saurabh Kumar Raina}, title = { FLIP: a floating-point library for integer processors}, school = {{\'E}cole {N}ormale {S}up{\'e}rieure de {Lyon}, Lyon, France}, year = "2006", month = sep } @PROCEEDINGS{DR06, EDITOR = {Marc Daumas and Nathalie Revol}, SERIES = {Theoretical Computer Science}, NUMBER = {1}, TITLE = {Special issue on Real Numbers and Computers}, VOLUME = {351}, YEAR = {2006} } @INPROCEEDINGS{ICMS06, AUTHOR = {Sylvain Chevillard and Nathalie Revol}, BOOKTITLE = {International Conference on Mathematical Software}, ADDRESS = {Spain}, TITLE = {Computation of the error functions erf and erfc in arbitrary precision with correct rounding}, YEAR = {2006} } @INPROCEEDINGS{Revol-SCAN06, AUTHOR = {Nathalie Revol}, booktitle = {SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics}, ADDRESS = {Duisburg, Germany}, TITLE = {Design choices and their limits for an interval arithmetic library. {T}he example of {MPFI}.}, YEAR = {2006} } @INPROCEEDINGS{Revol-TM06, AUTHOR = {Nathalie Revol}, BOOKTITLE = {Taylor Models 2006}, ADDRESS = {Florida}, TITLE = {Implementing Taylor models arithmetic with floating-point arithmetic: bounding roundoff errors}, YEAR = {2006} } @inproceedings{EGGSV06-1, author = "W. Eberly and M. Giesbrecht and P. Giorgi and A. Storjohann and G. Villard", title = "Solving sparse integer linear systems", month = jul, booktitle = {Proc. International Symposium on Symbolic and Algebraic Computation, Genova, Italy}, publisher = {ACM Press}, pages = {63--70}, year = 2006 } @article{DinVil06, author = "Florent de Dinechin and Gilles Villard", title = "High precision numerical accuracy in physics research", journal = "Nuclear Inst. and Methods in Physics Research, A", volume = 559, number = 1, pages = {207--210}, year = 2006 } @article{BLV06, author ={B. Beckermann and G. Labahn and G. Villard}, title = {Normal forms for general polynomial matrices}, journal = "Journal of Symbolic Computation", volume = 41, number = 6, pages = {708--737}, year = 2006 } @InProceedings{DinMcInSchm2006, author = {Florent de Dinechin and Eric McIntosh and Franck Schmidt}, title = {Massive Tracking on Heterogeneous Platforms}, booktitle = {9th International Computational Accelerator Physics Conference (ICAP)}, month = oct, year = 2006 } @InProceedings{DinMaid2006, author = {Florent de Dinechin and Sergey Maidanov}, title = {Software techniques for perfect elementary functions in floating-point interval arithmetic}, booktitle = {Real Numbers and Computers}, year = 2006, month = jul } @InProceedings{GlaJulImbTisVey06:ersa, author = {R. Glabb and L. Imbert and G. Jullien and A. Tisserand and N. Veyrat-Charvillon}, title = {Multi-mode Operator for {SHA}-2 Hash Functions}, booktitle = {Proc. International Conference on Engineering of Reconfigurable Systems and Algorithms ({ERSA})}, year = 2006, pages = {207--210}, address = {Las Vegas, Nevada, U.S.A.}, month = jun } @Misc{BoJeSc06, author = {A. Bostan and C.-P. Jeannerod and E. Schost}, title = {Solving structured linear systems of large displacement rank}, howpublished = {ISSAC 2006 poster}, month = jul, year = {2006} } @TechReport{Jea06, author = {Claude-Pierre Jeannerod}, title = {{LSP} Matrix Decomposition Revisited}, institution = {Laboratoire de l'Informatique du Parall\'elisme}, year = {2006}, type = {Research report}, number = {RR2006-28}, address = {ENS Lyon}, month = sep, url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-28.pdf} } @techreport{Lauter2006Pow:LIP, author = {Christoph Quirin Lauter}, title = {Exact and mid-point rounding cases of power(x,y)}, institution = {Laboratoire de l'Informatique du Parall\'elisme}, number = {2006-46}, year = {2006}, url = {http://prunel.ccsd.cnrs.fr/ensl-00117433} } @InProceedings{ChevillLauter2006, author = {Sylvain Chevillard and Christoph Quirin Lauter}, title = {Certified infinite norm using interval arithmetic}, booktitle = {SCAN 2006 - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics}, year = 2006, address = {Duisburg, Germany} } @INPROCEEDINGS{Lauter2006TM, AUTHOR = {Christoph Quirin Lauter}, BOOKTITLE = {Taylor Models 2006}, ADDRESS = {Florida}, TITLE = {A survey of multiple precision computation using floating-point arithmetic}, YEAR = {2006} } @techreport{BriChe2006, author = {Nicolas Brisebarre and Sylvain Chevillard}, title = {Efficient polynomial $L^{\infty}$-approximations}, institution = {HAL}, number = {inria-00119513}, year = {2006}, url = {https://hal.inria.fr/inria-00119513}, note = {Submitted to ARITH 18} } @techreport{BriHan2006, author = {Nicolas Brisebarre and Guillaume Hanrot}, title = {Floating-point $L^2$ approximations}, institution = {HAL}, number = {inria-00119254}, year = {2006}, url = {https://hal.inria.fr/inria-00119254}, note = {Submitted to ARITH 18} } @phdthesis{Mel06, author = {Guillaume Melquiond}, title = {De l'arithm{\'e}tique d'intervalles {\`a} la certification de programmes}, school = {{\'E}cole {N}ormale {S}up{\'e}rieure de {L}yon}, address = {Lyon, France}, year = {2006} } @TechReport{CheLau2006, AUTHOR = {Christoph Quirin Lauter and Sylvain Chevillard}, TITLE = {A certified infinite norm for the validation of numerical algorithms}, ADDRESS = {Lyon, France}, INSTITUTION = {Laboratoire de l'Informatique du Parallélisme}, TYPE = {Research report}, NUMBER = {RR2006-49}, YEAR = {2006}, KEYWORDS = {infinite norm, optimization, interval arithmetic, certified algorithm, error analysis, approximation error}, ABSTRACT-URL = {http://prunel.ccsd.cnrs.fr/ensl-00119810}, URL ={http://prunel.ccsd.cnrs.fr/ensl-00119810} } @TechReport{Revy06, author = {Guillaume Revy}, title = {Analyse et implantation d'algorithmes rapides pour l'évaluation polynomiale sur les nombres flottants}, institution = {Laboratoire de l'Informatique du Parallélisme - ENS Lyon}, year = {2006}, URL = {http://prunel.ccsd.cnrs.fr/ensl-00119498} }