000 03816nam a22006495i 4500
001 978-3-540-85521-7
003 DE-He213
005 20240423125201.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540855217
_9978-3-540-85521-7
024 7 _a10.1007/978-3-540-85521-7
_2doi
050 4 _aQA76.9.C62
072 7 _aUK
_2bicssc
072 7 _aCOM036000
_2bisacsh
072 7 _aUK
_2thema
082 0 4 _a004.01513
_223
245 1 0 _aReliable Implementation of Real Number Algorithms: Theory and Practice
_h[electronic resource] :
_bInternational Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers /
_cedited by Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXI, 239 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5045
505 0 _aValidated Modeling of Mechanical Systems with SmartMOBILE: Improvement of Performance by ValEncIA-IVP -- Interval Subroutine Library Mission -- Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations -- Real Algebraic Numbers: Complexity Analysis and Experimentation -- Verified Methods in Stochastic Traffic Modelling -- Interval Arithmetic Using SSE-2 -- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format -- Robustness and Randomness -- Topological Neighborhoods for Spline Curves: Practice & Theory -- Homotopy Conditions for Tolerant Geometric Queries -- Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling -- Theory of Real Computation According to EGC.
520 _aThis book constitutes the revised papers of the International Seminar on Reliable Implementation of Real Number Algorithms, held at Dagstuhl Castle, Germany, in January 2006. The Seminar was inteded to stimulate an exchange of ideas between the different communities that deal with the problem of reliable implementation of real number algorithms. Topics included formal proofs, software libraries, systems and platforms, as well as computational geometry and solid modelling.
650 0 _aComputer arithmetic and logic units.
650 0 _aComputer programming.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aArithmetic and Logic Structures.
650 2 4 _aProgramming Techniques.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aHertling, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHoffmann, Christoph M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLuther, Wolfram.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRevol, Nathalie.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540855200
776 0 8 _iPrinted edition:
_z9783540855262
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5045
856 4 0 _uhttps://doi.org/10.1007/978-3-540-85521-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c175176
_d175176