First Page | Document Content | |
---|---|---|
Date: 2010-12-09 10:22:15Numerical analysis Mathematics Applied mathematics Iterative refinement Iterative method Interval arithmetic Newton's method Condition number Residual Root-finding algorithm Affine arithmetic | Certification of a Numerical Result: Use of Interval Arithmetic and Multiple Precision Hong Diep Nguyen and Nathalie Revol INRIA Universit´e de Lyon Laboratoire LIP (UMR 5668 CNRS - ENS Lyon - INRIA - UCBL)Add to Reading ListSource URL: perso.ens-lyon.frDownload Document from Source WebsiteFile Size: 152,83 KBShare Document on Facebook |
An Efficient Digit-by-Digit Decimal Square Root Algorithm Using Non-restoring Pseudo-Division c by C. Bond, 2003 http://www.crbond.comDocID: 1puAC - View Document | |
Interval Methods for Kinetic Simulations Leonidas J. Guibas∗ Menelaos I. Karavelas∗ Graphics Lab., Computer Science Dept., Stanford UniversityDocID: 1osGs - View Document | |
The Parks-McClellan algorithm and Chebyshev-proxy root finding methods Silviu Filip N. Brisebarre and G. Hanrot (AriC, LIP, ENS Lyon)DocID: 1nMBw - View Document | |
Introduction to Algorithms Lecture 22 Piotr Indyk OutlineDocID: 1mj3v - View Document | |
Root FindingMinimization Parabola ..................... .............DocID: 1lzVs - View Document |