First Page | Document Content | |
---|---|---|
Date: 2014-11-25 03:18:02Computer arithmetic Mathematics Numerical analysis Arithmetic Theoretical computer science Numerical linear algebra Matrices Kahan summation algorithm Condition number Iterative refinement Division algorithm Rounding | 1 Solving Triangular Systems More Accurately and Efficiently Ph. Langlois, N. Louvet DALI-LP2A Laboratory. Universit´e de Perpignan. 52, avenue Paul Alduy. FPerpignan cedex.Add to Reading ListSource URL: perso.ens-lyon.frDownload Document from Source WebsiteFile Size: 158,08 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |