Thumbnail
Access Restriction
Subscribed

Author Smith, Lyle B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Mathematical proof by computer ♦ Chebyshev system ♦ Error bounds ♦ Range arithmetic ♦ Determinant evaluation ♦ Interval arithmetic
Abstract Two recent papers, one by Hansen and one by Hansen and R. R. Smith, have shown how Interval Arithmetic (I.A.) can be used effectively to bound errors in matrix computations. In the present paper a method proposed by Hansen and R. R. Smith is compared with straightforward use of I.A. in determinant evaluation. Computational results show the accuracy and running times that can be expected when using I.A. for determinant evaluation. An application using I.A. determinants in a program to test a set of functions to see if they form a Chebyshev system is then presented.
Description Affiliation: Stanford Univ., CA (Smith, Lyle B.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 12
Issue Number 2
Page Count 5
Starting Page 89
Ending Page 93


Open content in new tab

   Open content in new tab
Source: ACM Digital Library