论文信息 - ERROR ANALYSIS OF COMPLEX ARITHMETIC

ERROR ANALYSIS OF COMPLEX ARITHMETIC

This lecture begins with a brief account of recent work on unrestricted algorithms for computing mathematical functions, especially the development of error analysis based on a nontraditional definition of relative error. The main part of the talk describes the application of this analysis to real and complex arithmetic, and concludes with some new extensions that have been made in complex arithmetic.

F. W. J. Olver | F. Olver

[1] James Hardy Wilkinson,et al. A Posteriori Error Bounds for Gaussian Elimination , 1982 .

[2] David A. H. Jacobs,et al. The State of the Art in Numerical Analysis. , 1978 .

[3] F. Stummel,et al. Rounding Error Analysis of Elementary Numerical Algorithms , 1980 .

[4] F. W. J. Olver,et al. A New Approach to Error Arithmetic , 1978 .

[5] Richard P. Brent,et al. Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1] , 1978, TOMS.

[6] Richard P. Brent,et al. Recent technical reports , 1977, SIGA.

[7] F. Stummel. Perturbation theory for evaluation algorithms of arithmetic expressions , 1981 .

[8] James Hardy Wilkinson,et al. Rounding errors in algebraic processes , 1964, IFIP Congress.

[9] F. Olver. Further Developments of Rp and Ap Error Analysis , 1982 .