<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T16:55:30Z</responseDate>
  <request identifier="748" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:748</identifier>
        <datestamp>2024-03-06T11:06:40Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format</dc:title>
          <dc:creator>Lefèvre, Vincent</dc:creator>
          <dc:creator>Stehlé, Damien</dc:creator>
          <dc:creator>Zimmermann, Paul</dc:creator>
          <dc:subject>Floating-point arithmetic</dc:subject>
          <dc:subject>decimal arithmetic</dc:subject>
          <dc:subject>table maker's dilemma</dc:subject>
          <dc:subject>correct rounding</dc:subject>
          <dc:subject>elementary functions</dc:subject>
          <dc:description>We searched for the worst cases for correct rounding of the exponential&#13;
function in the IEEE 754r decimal64 format, and computed all the bad cases&#13;
whose distance from a breakpoint (for all rounding modes) is less than&#13;
$10^{-15}$,ulp, and we give the worst ones. In particular, the worst case&#13;
for $|x| geq 3 	imes 10^{-11}$ is $exp(9.407822313572878 	imes 10^{-2})&#13;
= 1.098645682066338,5,0000000000000000,278ldots$. This work can be&#13;
extended to other elementary functions in the decimal64 format and allows&#13;
the design of reasonably fast routines that will evaluate these functions&#13;
with correct rounding, at least in some domains.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Vincent Lefèvre and Damien Stehlé and Paul Zimmermann</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6021, Reliable Implementation of Real Number Algorithms: Theory and Practice (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06021.11</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-7483</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06021.11</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
