The iRRAM: Exact Arithmetic in C++
Identifieur interne : 000F56 ( Istex/Corpus ); précédent : 000F55; suivant : 000F57The iRRAM: Exact Arithmetic in C++
Auteurs : Norbert Th. MüllerSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
Abstract
Abstract: The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.
Url:
DOI: 10.1007/3-540-45335-0_14
Links to Exploration step
ISTEX:E3E8B93CD5410E5975F80662868DD8176DCBB66FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The iRRAM: Exact Arithmetic in C++</title><author><name sortKey="Muller, Norbert Th" sort="Muller, Norbert Th" uniqKey="Muller N" first="Norbert Th." last="Müller">Norbert Th. Müller</name><affiliation><mods:affiliation>Abteilung Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mueller@uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E3E8B93CD5410E5975F80662868DD8176DCBB66F</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-45335-0_14</idno><idno type="url">https://api.istex.fr/document/E3E8B93CD5410E5975F80662868DD8176DCBB66F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000F56</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000F56</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The iRRAM: Exact Arithmetic in C++</title><author><name sortKey="Muller, Norbert Th" sort="Muller, Norbert Th" uniqKey="Muller N" first="Norbert Th." last="Müller">Norbert Th. Müller</name><affiliation><mods:affiliation>Abteilung Informatik, Universität Trier, D-54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mueller@uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">E3E8B93CD5410E5975F80662868DD8176DCBB66F</idno><idno type="DOI">10.1007/3-540-45335-0_14</idno><idno type="ChapterID">14</idno><idno type="ChapterID">Chap14</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Norbert Th. Müller</name><affiliations><json:string>Abteilung Informatik, Universität Trier, D-54286, Trier, Germany</json:string><json:string>E-mail: mueller@uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.</abstract><qualityIndicators><score>5.552</score><pdfVersion>1.3</pdfVersion><pdfPageSize>431 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>307</abstractCharCount><pdfWordCount>14199</pdfWordCount><pdfCharCount>73447</pdfCharCount><pdfPageCount>31</pdfPageCount><abstractWordCount>46</abstractWordCount></qualityIndicators><title>The iRRAM: Exact Arithmetic in C++</title><chapterId><json:string>14</json:string><json:string>Chap14</json:string></chapterId><refBibs><json:item><author><json:item><name>D H Ba88</name></json:item><json:item><name> Bailey</name></json:item></author><host><pages><last>238</last><first>181</first></pages><author></author><title>000 Decimal Digits Using Borweins Quartically Convergent Algorithm Mathematics of Computation</title><publicationDate>1988</publicationDate></host><title>The computation of π to 29</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>J M Bo87</name></json:item><json:item><name>P,B Borwein</name></json:item><json:item><name> Borwein</name></json:item></author><host><author></author><title>Pi and the AGM, A study in analytic number theory</title><publicationDate>1987</publicationDate></host><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>H Boca90</name></json:item><json:item><name>R Boehm</name></json:item><json:item><name> Cartwright</name></json:item></author><host><pages><last>64</last><first>43</first></pages><author></author><title>Research Topics in Functional Programming</title><publicationDate>1990</publicationDate></host><title>Exact Real Arithmetic: Formulating real numbers as functions</title><publicationDate>1990</publicationDate></json:item><json:item><author><json:item><name>Bss89,L Blum</name></json:item><json:item><name>M Shub</name></json:item><json:item><name>S Smale</name></json:item></author><host><volume>21</volume><issue>1</issue><author></author><title>Bulletin of the AMS</title><publicationDate>1989-07</publicationDate></host><title>On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines</title><publicationDate>1989-07</publicationDate></json:item><json:item><author><json:item><name>R P Bt75</name></json:item><json:item><name> Brent</name></json:item></author><host><pages><last>165</last><first>126</first></pages><author></author><title>Proc. Seminar on Complexity of Computational Problem Solving</title><publicationDate>1975</publicationDate></host><title>The complexity of multiple precision arithmetic</title><publicationDate>1975</publicationDate></json:item><json:item><author><json:item><name>R P Bt76</name></json:item><json:item><name> Brent</name></json:item></author><host><volume>23</volume><pages><last>251</last><first>242</first></pages><author></author><title>J. ACM</title><publicationDate>1976</publicationDate></host><title>Fast multiple precision evaluation of elementary functions</title><publicationDate>1976</publicationDate></json:item><json:item><author><json:item><name>R P Bt78</name></json:item><json:item><name> Brent</name></json:item></author><host><volume>4</volume><pages><last>70</last><first>57</first></pages><author></author><title>ACM Trans. Math. Software</title><publicationDate>1978</publicationDate></host><title>A Fortran multiple precision package</title><publicationDate>1978</publicationDate></json:item><json:item><author><json:item><name>V Br96</name></json:item><json:item><name> Brattka</name></json:item></author><host><volume>162</volume><pages><last>77</last><first>47</first></pages><author></author><title>Theoret. Comput. Sci</title><publicationDate>1996</publicationDate></host><title>Recursive characterization of computable real-valued functions and relations</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>V Brhe95</name></json:item><json:item><name>P Brattka</name></json:item><json:item><name>V Hertling Brhe94</name></json:item><json:item><name>P Brattka</name></json:item><json:item><name> Hertling</name></json:item></author><host><pages><last>291</last><first>142</first></pages><author></author><title>Continuity and Computability of Relations Aanderaa, On the minimum computation time of functions</title><publicationDate>1969</publicationDate></host><title>Feasible Real Random Access Machines, Informatik Berichte 193 -12</title><publicationDate>1969</publicationDate></json:item><json:item><author><json:item><name>A Edpo97</name></json:item><json:item><name>P Edalat</name></json:item><json:item><name>M J Potts Fist74</name></json:item><json:item><name>L,J Fischer</name></json:item><json:item><name> Stockmeyer</name></json:item></author><host><volume>13</volume><pages><last>331</last><first>317</first></pages><issue>9</issue><author></author><title>Proc. of Mathematical Foundations of Programming Semantics Theoretical Computer Science J. Comput. System Scis</title><publicationDate>1974</publicationDate></host><title>A new representation for exact real numbers Electronic notes in Fast on-line integer multiplication</title><publicationDate>1974</publicationDate></json:item><json:item><host><pages><last>140</last><first>125</first></pages><author><json:item><name>T Gr00</name></json:item><json:item><name>D Gowland</name></json:item><json:item><name> Lester</name></json:item></author><title>The Correctness of an Implementation of Exact Arithmetic</title><publicationDate>2000</publicationDate></host></json:item><json:item><author><json:item><name>Hn00,S Heinrich</name></json:item><json:item><name>E Novak</name></json:item></author><host><author></author><title>The Inverse of the Star-Discrepancy depends linearly on the Dimension</title></host></json:item><json:item><host><author><json:item><name>R Kl93</name></json:item><json:item><name>U Klatte</name></json:item><json:item><name> Kulisch</name></json:item></author><title>C-XSC , a C++ Class Library for Extended Scientific Computing</title><publicationDate>1993</publicationDate></host></json:item><json:item><author><json:item><name>K Ko91</name></json:item><json:item><name> Ko</name></json:item></author><host><author></author><title>Complexity Theory of Real Functions</title><publicationDate>1991</publicationDate></host><publicationDate>1991</publicationDate></json:item><json:item><host><author><json:item><name>U Ku96</name></json:item><json:item><name> Kulisch</name></json:item></author></host></json:item><json:item><author><json:item><name>V Mm96</name></json:item><json:item><name> Ménissier-Morain</name></json:item></author><host><pages><first>11</first></pages><author></author><title>J. Symbolic Computation</title><publicationDate>1996</publicationDate></host><title>Arbitrary precision real arithmetic: design and algorithms</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>N Mu88</name></json:item><json:item><name> Th</name></json:item><json:item><name> Müller</name></json:item></author><host><author></author><title>Untersuchungen zur Komplexität reeller Funktionen</title><publicationDate>1988</publicationDate></host><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>N Mu93</name></json:item><json:item><name> Th</name></json:item><json:item><name> Müller</name></json:item></author><host><pages><last>281</last><first>259</first></pages><author></author><title>Proc. 22 JAIIO -PANEL '93</title><publicationDate>1993</publicationDate></host><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>N Mu96</name></json:item><json:item><name> Th</name></json:item></author><host><pages><last>44</last><first>96</first></pages><author></author><title>Second Workshop on Constructivity and Complexity in Analysis, Forschungsbericht Mathematik-Informatik</title><publicationDate>1996</publicationDate></host><title>Müller, Towards a real Real RAM: a Prototype using C++, (preliminary version )</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>N Mu97</name></json:item><json:item><name> Th</name></json:item></author><host><author></author><title>Proc. 6th International Conference on Numerical Analysis</title><publicationDate>1997</publicationDate></host><title>Müller, Towards a real RealRAM: a Prototype using C++</title><publicationDate>1997</publicationDate></json:item><json:item><author><json:item><name>N Mu98</name></json:item><json:item><name> Th</name></json:item><json:item><name> Müller</name></json:item></author><host><pages><last>26</last><first>13</first></pages><author></author><title>3rd Conference on Real Numbers and Computers</title><publicationDate>1998</publicationDate></host><title>Implementing limits in an interactive RealRAM</title><publicationDate>1998</publicationDate></json:item><json:item><author><json:item><name>M Rio94</name></json:item><json:item><name> Riordan</name></json:item></author><host><volume>92</volume><pages><last>20</last><first>1</first></pages><author></author><title>Jber. d. Dt. Math.- Verein</title><publicationDate>1990</publicationDate></host><publicationDate>1990</publicationDate></json:item><json:item><author><json:item><name>Tz99,J V Tucker</name></json:item><json:item><name>J,I Zucker</name></json:item></author><host><volume>219</volume><pages><last>420</last><first>379</first></pages><author></author><title>Theoretical Computer Science</title><publicationDate>1999</publicationDate></host><title>Computation by 'While' programs on topological partial algebras</title><publicationDate>1999</publicationDate></json:item><json:item><author><json:item><name>K We87</name></json:item><json:item><name>Computability Weihrauch</name></json:item></author><host><volume>9</volume><author></author><title>EATCS Monographs on Theoretical Computer Science</title><publicationDate>1987</publicationDate></host><publicationDate>1987</publicationDate></json:item><json:item><host><author><json:item><name>K We95</name></json:item><json:item><name> Weihrauch</name></json:item></author><title>A Simple Introduction to Computable Analysis, Informatik Berichte 171 - 2</title><publicationDate>1995</publicationDate></host></json:item><json:item><author><json:item><name>K We97</name></json:item><json:item><name> Weihrauch</name></json:item></author><host><pages><last>89</last><first>66</first></pages><author></author><title>Proc. DMTCS´96</title><publicationDate>1997</publicationDate></host><title>A Foundation for Computable Analysis</title><publicationDate>1997</publicationDate></json:item><json:item><author><json:item><name>P Zi00</name></json:item><json:item><name> Zimmermann</name></json:item></author><host><pages><last>90</last><first>89</first></pages><author></author><title>4th Conference on Real Numbers and Computers</title><publicationDate>2000</publicationDate></host><title>MPFR: A Library for Multiprecision Floating-Point Arithmetic with Exact Rounding</title><publicationDate>2000</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2001</copyrightDate></serie><host><editor><json:item><name>Jens Blanck</name><affiliations><json:string>University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, UK</json:string><json:string>E-mail: csjens@swan.ac.uk</json:string></affiliations></json:item><json:item><name>Vasco Brattka</name><affiliations><json:string>Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany</json:string><json:string>E-mail: Vasco.Brattka@FernUni-hagen.de</json:string></affiliations></json:item><json:item><name>Peter Hertling</name><affiliations><json:string>Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany</json:string><json:string>E-mail: Peter.Hertling@FernUni-hagen.de</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Mathematical Logic and Foundations</value></json:item><json:item><value>Analysis</value></json:item></subject><isbn><json:string>978-3-540-42197-9</json:string></isbn><language><json:string>unknown</json:string></language><title>Computability and Complexity in Analysis</title><bookId><json:string>3-540-45335-0</json:string></bookId><volume>2064</volume><pages><last>252</last><first>222</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-45335-2</json:string></eisbn><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45335-0</json:string></doi></host><publicationDate>2001</publicationDate><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45335-0_14</json:string></doi><id>E3E8B93CD5410E5975F80662868DD8176DCBB66F</id><score>0.62462574</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/E3E8B93CD5410E5975F80662868DD8176DCBB66F/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/E3E8B93CD5410E5975F80662868DD8176DCBB66F/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E3E8B93CD5410E5975F80662868DD8176DCBB66F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">The iRRAM: Exact Arithmetic in C++</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2001</p></availability><date>2001</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">The iRRAM: Exact Arithmetic in C++</title><author xml:id="author-1"><persName><forename type="first">Norbert</forename><surname>Müller</surname></persName><email>mueller@uni-trier.de</email><affiliation>Abteilung Informatik, Universität Trier, D-54286, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Computability and Complexity in Analysis</title><title level="m" type="sub">4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers</title><idno type="pISBN">978-3-540-42197-9</idno><idno type="eISBN">978-3-540-45335-2</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-45335-0</idno><idno type="book-ID">3-540-45335-0</idno><idno type="book-title-ID">66938</idno><idno type="book-sequence-number">2064</idno><idno type="book-volume-number">2064</idno><idno type="book-chapter-count">24</idno><editor><persName><forename type="first">Jens</forename><surname>Blanck</surname></persName><email>csjens@swan.ac.uk</email><affiliation>University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, UK</affiliation></editor><editor><persName><forename type="first">Vasco</forename><surname>Brattka</surname></persName><email>Vasco.Brattka@FernUni-hagen.de</email><affiliation>Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany</affiliation></editor><editor><persName><forename type="first">Peter</forename><surname>Hertling</surname></persName><email>Peter.Hertling@FernUni-hagen.de</email><affiliation>Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2001-05-22"></date><biblScope unit="volume">2064</biblScope><biblScope unit="page" from="222">222</biblScope><biblScope unit="page" to="252">252</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Utrecht University, The Netherlands</affiliation></editor><biblScope><date>2001</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="series-Id">558</idno></series><idno type="istex">E3E8B93CD5410E5975F80662868DD8176DCBB66F</idno><idno type="DOI">10.1007/3-540-45335-0_14</idno><idno type="ChapterID">14</idno><idno type="ChapterID">Chap14</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2001</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16013</label><label>I16021</label><label>I16048</label><label>M24005</label><label>M12007</label><item><term>Computer Science</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Mathematical Logic and Foundations</term></item><item><term>Analysis</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2001-05-22">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/E3E8B93CD5410E5975F80662868DD8176DCBB66F/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45335-0</BookID><BookTitle>Computability and Complexity in Analysis</BookTitle><BookSubTitle>4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers</BookSubTitle><BookVolumeNumber>2064</BookVolumeNumber><BookSequenceNumber>2064</BookSequenceNumber><BookDOI>10.1007/3-540-45335-0</BookDOI><BookTitleID>66938</BookTitleID><BookPrintISBN>978-3-540-42197-9</BookPrintISBN><BookElectronicISBN>978-3-540-45335-2</BookElectronicISBN><BookChapterCount>24</BookChapterCount><BookHistory><OnlineDate><Year>2001</Year><Month>5</Month><Day>22</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="M24005" Priority="4" Type="Secondary">Mathematical Logic and Foundations</BookSubject><BookSubject Code="M12007" Priority="5" Type="Secondary">Analysis</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jens</GivenName><FamilyName>Blanck</FamilyName></EditorName><Contact><Email>csjens@swan.ac.uk</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Vasco</GivenName><FamilyName>Brattka</FamilyName></EditorName><Contact><Email>Vasco.Brattka@FernUni-hagen.de</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Peter</GivenName><FamilyName>Hertling</FamilyName></EditorName><Contact><Email>Peter.Hertling@FernUni-hagen.de</Email></Contact></Editor><Affiliation ID="Aff4"><OrgName>University of Wales Swansea</OrgName><OrgAddress><Street>Singleton Park</Street><City>Swansea</City><Postcode>SA2 8PP</Postcode><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>Informatikzentrum</OrgDivision><OrgName>FernUniversität Hagen</OrgName><OrgAddress><Postcode>58084</Postcode><City>Hagen</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part1"><PartInfo TocLevels="0"><PartID>1</PartID><PartSequenceNumber>1</PartSequenceNumber><PartTitle>Computability and Complexity in Analysis</PartTitle><PartChapterCount>23</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-45335-0</BookID><BookTitle>Computability and Complexity in Analysis</BookTitle></PartContext></PartInfo><Chapter ID="Chap14" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>14</ChapterID><ChapterDOI>10.1007/3-540-45335-0_14</ChapterDOI><ChapterSequenceNumber>14</ChapterSequenceNumber><ChapterTitle Language="En">The iRRAM: Exact Arithmetic in C++</ChapterTitle><ChapterFirstPage>222</ChapterFirstPage><ChapterLastPage>252</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2001</Year><Month>5</Month><Day>21</Day></RegistrationDate><OnlineDate><Year>2001</Year><Month>5</Month><Day>22</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>1</PartID><BookID>3-540-45335-0</BookID><BookTitle>Computability and Complexity in Analysis</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Norbert</GivenName><GivenName>Th.</GivenName><FamilyName>Müller</FamilyName></AuthorName><Contact><Email>mueller@uni-trier.de</Email></Contact></Author><Affiliation ID="Aff6"><OrgDivision>Abteilung Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>D-54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords:</Heading><Keyword>Computable Real Analysis</Keyword><Keyword>Random Access Machines</Keyword><Keyword>Limits</Keyword><Keyword>Interval</Keyword><Keyword>Arithmetic</Keyword><Keyword>Multiple Precision Arithmetic</Keyword><Keyword>Multi-valued functions</Keyword><Keyword>C++</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>The iRRAM: Exact Arithmetic in C++</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>The iRRAM: Exact Arithmetic in C++</title></titleInfo><name type="personal"><namePart type="given">Norbert</namePart><namePart type="given">Th.</namePart><namePart type="family">Müller</namePart><affiliation>Abteilung Informatik, Universität Trier, D-54286, Trier, Germany</affiliation><affiliation>E-mail: mueller@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2001-05-22</dateIssued><copyrightDate encoding="w3cdtf">2001</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The iRRAM is a very efficient C++ package for error-free real arithmetic based on the concept of a Real-RAM. Its capabilities range from ordinary arithmetic over trigonometric functions to linear algebra even with sparse matrices. We discuss the concepts and some highlights of the implementation.</abstract><relatedItem type="host"><titleInfo><title>Computability and Complexity in Analysis</title><subTitle>4th International Workshop, CCA 2000 Swansea, UK, September 17–19, 2000 Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Jens</namePart><namePart type="family">Blanck</namePart><affiliation>University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, UK</affiliation><affiliation>E-mail: csjens@swan.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Vasco</namePart><namePart type="family">Brattka</namePart><affiliation>Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany</affiliation><affiliation>E-mail: Vasco.Brattka@FernUni-hagen.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Peter</namePart><namePart type="family">Hertling</namePart><affiliation>Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany</affiliation><affiliation>E-mail: Peter.Hertling@FernUni-hagen.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic><topic authority="SpringerSubjectCodes" authorityURI="M12007">Analysis</topic></subject><identifier type="DOI">10.1007/3-540-45335-0</identifier><identifier type="ISBN">978-3-540-42197-9</identifier><identifier type="eISBN">978-3-540-45335-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">66938</identifier><identifier type="BookID">3-540-45335-0</identifier><identifier type="BookChapterCount">24</identifier><identifier type="BookVolumeNumber">2064</identifier><identifier type="BookSequenceNumber">2064</identifier><identifier type="PartChapterCount">23</identifier><part><date>2001</date><detail type="part"><title>Computability and Complexity in Analysis</title></detail><detail type="volume"><number>2064</number><caption>vol.</caption></detail><extent unit="pages"><start>222</start><end>252</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><identifier type="istex">E3E8B93CD5410E5975F80662868DD8176DCBB66F</identifier><identifier type="DOI">10.1007/3-540-45335-0_14</identifier><identifier type="ChapterID">14</identifier><identifier type="ChapterID">Chap14</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F56 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000F56 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E3E8B93CD5410E5975F80662868DD8176DCBB66F
|texte= The iRRAM: Exact Arithmetic in C++
}}
| This area was generated with Dilib version V0.6.31. |  |