<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">463202961</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180405153117.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170326e20071201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00200-007-0052-y</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00200-007-0052-y</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Testing elementary function identities using CAD</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[James Beaumont, Russell Bradford, James Davenport, Nalina Phisanbut]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">One of the problems with manipulating function identities in computer algebra systems is that they often involve functions which are multivalued, whilst most users tend to work with single-valued functions. The problem is that many well-known identities may no longer be true everywhere in the complex plane when working with their single-valued counterparts. Conversely, we cannot ignore them, since in particular contexts they may be valid. We investigate the practicality of a method to verify such identities by means of an experiment; this is based on a set of test examples which one might realistically meet in practice. Essentially, the method works as follows. We decompose the complex plane via means of cylindrical algebraic decomposition into regions with respect to the branch cuts of the functions. We then test the identity numerically at a sample point in each region. The latter step is facilitated by the notion of the adherence of a branch cut, which was previously introduced by the authors. In addition to presenting the results of the experiment, we explain how adherence relates to the proposal of signed zeroes by W. Kahan, and develop this idea further in order to allow us to cover previously untreatable cases. Finally, we discuss other ways to improve upon our general methodology as well as topics for future research.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2007</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Elementary functions</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Branch cuts</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">CAD</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Beaumont</subfield>
   <subfield code="D">James</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Bradford</subfield>
   <subfield code="D">Russell</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Davenport</subfield>
   <subfield code="D">James</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Phisanbut</subfield>
   <subfield code="D">Nalina</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Applicable Algebra in Engineering, Communication and Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">18/6(2007-12-01), 513-543</subfield>
   <subfield code="x">0938-1279</subfield>
   <subfield code="q">18:6&lt;513</subfield>
   <subfield code="1">2007</subfield>
   <subfield code="2">18</subfield>
   <subfield code="o">200</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00200-007-0052-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00200-007-0052-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Beaumont</subfield>
   <subfield code="D">James</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Bradford</subfield>
   <subfield code="D">Russell</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Davenport</subfield>
   <subfield code="D">James</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Phisanbut</subfield>
   <subfield code="D">Nalina</subfield>
   <subfield code="u">Department of Computer Science, University of Bath, BA2 7AY, Bath, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Applicable Algebra in Engineering, Communication and Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">18/6(2007-12-01), 513-543</subfield>
   <subfield code="x">0938-1279</subfield>
   <subfield code="q">18:6&lt;513</subfield>
   <subfield code="1">2007</subfield>
   <subfield code="2">18</subfield>
   <subfield code="o">200</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
