Interval arithmetic determinant evaluation and its use in testing for a Chebyshev system
- 1 February 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (2) , 89-93
- https://doi.org/10.1145/362848.362864
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.Keywords
This publication has 4 references indexed in Scilit:
- Interval Arithmetic in Matrix Computations, Part IISIAM Journal on Numerical Analysis, 1967
- Algorithm 269: determinant evaluation [F3]Communications of the ACM, 1965
- Algorithm 178: direct searchCommunications of the ACM, 1963
- Algorithm 61: procedures for range arithmeticCommunications of the ACM, 1961