next up previous contents index
Next: 2. Random Number Generation Up: csahtml Previous: 1.2 Algorithms

References

1
Bodily, C.H. (2002). Numerical Differentiation Using Statistical Design. Ph.D. Thesis, NC State University.

2
Chan, T.F., Golub, G.H. and LeVeque, R.J. (1983). Algorithms for computing the sample variance, American Statistician, 37:242-7.

3
Dennis, J.E. Jr. and Schnabel, R.B. (1983). Numerical Methods for Unconstrained Optimization. Englewood Cliffs, NJ, Prentice-Hall.

4
Gill, P.E., Murray, W. and Wright, M.H. (1981). Practical Optimisation, London, Academic Press.

5
Hayes, B. (2003). A lucid interval, American Scientist, 91:484-488.

6
Institute of Electrical and Electronics Engineers (1985). A Proposed IEEE-CS Standard for Binary Floating Point Arithmetic, Standard, 754-1985, IEEE, New York.

7
Kearfott, R.B. and Kreinovich, V. (eds) (1996). Applications of Interval Computations, Boston, Kluwer.

8
Knuth, D.E. (1997). The Art of Computer Programming, (Vol. 2: Seminumerical Algorithms), Third Edition, Reading MA, Addison-Wesley.

9
Monahan, J.F. (2001). Numerical Methods of Statistics. Cambridge University Press.

10
Overton, M.L. (2001). Numerical Computing with IEEE Floating Point Arithmetic. Philadelphia, SIAM.



Subsections