论文信息 - Computational Complexity of One-Point and Multipoint Iteration,

Computational Complexity of One-Point and Multipoint Iteration,

Abstract : Let phi be an iteration for approximating the solution of a problem f. A new efficiency measure e(phi,f) is defined. For a given problem f, the authors define the optimal efficiency E(f) and establish lower and upper bounds for E(f) with respect to different families of iterations. An upper bound on E(f) is conjectured for any iteration without memory. (Author)

H. T. Kung | Joseph F. Traub | J. Traub

[1] H. T. Kung,et al. Optimal Order of One-Point and Multipoint Iteration , 1974, JACM.

[2] A. Ostrowski. Solution of equations and systems of equations , 1967 .

[3] H. T. Kung. A bound on the multiplication efficiency of iteration , 1972, STOC '72.

[4] Michael S. Paterson,et al. Efficient Iterations for Algebraic Numbers , 1972, Complexity of Computer Computations.

[5] Joseph F. Traub,et al. Computational Complexity of Iterative Processes , 1972, SIAM J. Comput..

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .