|
 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
HANSEN, E. Interval arithmetic in matrix computations, Pt. I. SIAM J. Numer. Anal. P (1965), 308--320.
|
| |
2
|
AND SMITH, R.R. Interval arithmetic in matrix computations, Pt. II. SIAM J. Numer. Anal. 4 (1967), 1-9.
|
 |
3
|
|
| |
4
|
|
| |
5
|
RALSTON, A. A First Course in Numerical Analysis. McGraw- Hill, New York, 1965.
|
| |
6
|
LORD, A. B5500 ALGOL procedures for range arithmetic. CS239 Rep., Comput. Sci. Dep., Stanford U., Stanford, Calif., Aug. 1964.
|
| |
7
|
REMEZ, E.Y. General computational methods of Chebyshev approximation. In The Problems with Linear Real Parameters, AEC-tr-4491, Books 1 and 2, English trans, by US AEC, 1962.
|
| |
8
|
|
| |
9
|
KARLIN, S. J., AND STUDDEN, W.J. Tchebycheffsystems: With Applications in Analysis and Statistics. Interseience Publ., New York, 1966.
|
| |
10
|
RICE, J .R . The Approximation of Functions, Vol. 1. Addison- Wesley, Reading, Mass., 1964.
|
| |
11
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf