Report Number: CS-TR-68-96
Institution: Stanford University, Department of Computer Science
Title: Interval arithmetic determinant evaluation and its use in
testing for a Chebyshev system
Author: Smith, Lyle B.
Date: April 1968
Abstract: Two recent papers by Hansen and by Hansen and R. R. Smith
have shown how interval arithmetic (I.A.) can be used
effectively to bound errors in matrix computations. This
paper compares a method proposed by Hansen and R. R. Smith to
straight-forward use of I.A. in determinant evaluation.
Computational results show what accuracy and running times
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