*0011570615
*008090812s2009    xx#           000 0 eng
*019  $bk
*08230$a519.7
*100  $aRump, Siegfried M.$uHamburg University of Technology, Institute for Reliable Computing, Hamburg, Germany : rump@tu-harburg.de ; Waseda University, Faculty of Science and Engineering, Tokyo, Japan$_159406600
*245  $aComputing predecessor and successor in rounding to nearest
*300  $aS. [419]-431
*500  $aVitenskapelig artikkel
*5208 $aInneholder sammendrag
*650  $aMatematisk programmering$2norart$_37796100
*653  $adirected rounding$9eng$_166224800
*653  $afloating-point arithmetic$9eng$_166224900
*653  $apredecessor$9eng$_166225000
*653  $arounding to nearest$9eng$_166225100
*653  $asuccessor$9eng$_166225200
*700  $aBoldo, Sylvie;$uINRIA Saclay-Île-de-France, Parc Orsay Université-ZAC des Vignes, Orsay Cedex, France : Sylvie.Boldo@inria.fr$_166225300
*700  $aMelquiond, Guillaume$uCentre de recherche commun INRIA-Microsoft Research, Orsay Cedex, France : Guillaume.Melquiond@inria.fr$_166225400
*700  $aZimmermann, Paul;$uINRIA, Centre de Recherche, France : Paul.Zimmermann@loria.fr$_166225500
*773  $tBIT : numerical mathematics$gVol. 49, nr. 2 (2009)$x0006-3835$w(NO-LaBS)655878(tnr)
*8564 $uhttps://doi.org/10.1007/s10543-009-0218-z
*999  $z900455185$anorart:900455185
^