Some Complexity Results for Zero Finding for Univariate Functions

Journal of Complexity

Volumn 9, Issue 1, 1993, Pages 15-40

  Novak, Erich ^a   Ritter, Klaus ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249004329     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1006/jcom.1993.1003     Document Type: Article

References (72)

1. Adler, R. J. (1981), “The Geometry of Random Fields, Wiley, New York.
2. Billingsley, P. (1968), “Convergence of Probability Measures, ” Wiley, New York.
3. Blum, L., Shub, M., and Smale, S. (1989), On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21, 1-46.
4. Brent, R. P. (1973), “Algorithms for Minimization without Derivatives, Prentice-Hall, New York.
5. Brent, R. P., Winograd, S., and Wolfe, P. (1973), Optimal iterative processes for root-finding, Numer. Math. 20, 327-341.
6. Bus, J. C. P., and Dekker, T. J. (1975), Two efficient algorithms with guaranteed convergence for finding a zero of a function, ACM Trans. Math. Software 1, 330-345.
7. Friedman, J. (1989), On the convergence of Newton’s method, J. Complexity 5, 12-33.
8. Graf, S., Mauldin, R. D., and Williams, S. C. (1986), Random homeomorphisms, Adv. Math. 60, 239-359.
9. Graf, S., and Novak, E. (1990), The average error of quadrature formulas for functions of bounded variation. Rocky Mountain J. Math. 20, 707-716.
10. Graf, S., Novak, E., and Papageorgiou, A. (1989), Bisection is not optimal on the average, Numer. Math. 55, 481-491.
11. Heinrich, S. (1990), Invertibility of random Fredholm operators, Stochastic Anal. Appl. 8, 1-59.
12. Hida, T. (1980), “Brownian Motion, Springer-Verlag, New York.
13. Kahamer, D., Moler, C., and Nash S. (1989), “Numerical Methods and Software, ” Prentice-Hall, Englewood Cliffs.
14. Kantorovich, L. V. (1948), Functional analysis and applied mathematics, Vspehki Mat. Nauk 3, 89-185.
15. Kim, M., and Sutherland, S. (1991), Families of parallel root-finding algorithms, preprint.
16. King, R. F. (1973), An improved Pegasus method for root finding, BIT 13, 423-427.
17. Kung, H. T. (1976), The complexity of obtaining starting points for solving operator equations by Newton's method, in “Analytic Computational Complexity” (J. F. Traub, Ed.), pp. 35-57, Academic Press, New York.
18. Kung, H. T., and Traub, J. F. (1974), Optimal order of one-point and multipoint iterations, J. Assoc. Comput. Mach. 21, 643-651.
19. Kung, H. T., and Traub, J. F. (1976), Optimal order and efficiency for iterations with two evaluations, SIAM J. Numer. Anal. 13, 84-99.
20. Larkin, F. M. (1972), Gaussian measure in Hilbert space and applications in numerical analysis, Rocky Mountain J. Math. 2, 379-421.
21. Lee, D., and Wasilkowski, G. W. (1986), Approximation of linear functionals on a Banach space with a Gaussian measure, J. Complexity 2, 12-43.
22. Maistrowskii, G. D. (1972), On the optimality of Newton’s method, Soviet Math. Dokl. 13, 838-840.
23. McMullen, C. (1985), “Families of Rational Maps and Iterative Root-Finding Algorithms, ” Ph.D. thesis, Harvard University.
24. Micchelli, C. A., and Miranker, W. L. (1975), High order search methods for finding roots, J. Assoc. Comput. Mach. 22, 52-60.
25. Neff, A. C. (1991), Specified precision polynomial root isolation is NC, J. Comput. System Sci., to appear.
26. Novak, E. (1989), Average-case results for zero finding, J. Complexity 5, 489-501.
27. Novak, E. (1992), Quadrature formulas for monotone functions, Proc. Amer. Math. Soc. 115, 59-68.
28. Novak, E., and Ritter, K. (1992), Average errors for zero finding: lower bounds, Math. Z. 211, 671-686.
29. Novak, E., Ritter, K., and Woźniakowski, H. (1993), Average case optimality of a hybrid Newton-bisection method with a stopping rule, tentative title, in preparation.
30. Ostrowski, A. M. (1973), “Solution of Equations in Euclidean and Banach Spaces, " Academic Press, New York.
31. Pan, V. (1987), Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. Math. Appl. 14, 591-622.
32. Pan, V. (1992), Complexity of computations with matrices and polynomials, SIAM Rev. 34, 225-262.
33. Papageorgiou, A., and Wasilkowski, G. W. (1990), On the average complexity of multivariate problems, J. Complexity 6, 1-23.
34. Paskov, S. (1993), Average case complexity of multivariate integration for smooth functions, J. Complexity, to appear.
35. Renegar, J. (1987), On the worst-case arithmetic complexity of approximating zeros of polynomials, J. Complexity 3, 90-113.
36. Renegar, J. (1987a), On the efficiency of Newton’s method in approximating all zeros of a system of complex polynomials, Math. Oper. Res. 12, 121-148.
37. Renegar, J. (1989), On the worst-case arithmetic complexity of approximating zeros of systems of polynomials, SIAM J. Comput. 18, 350-370.
38. Renegar, J. (1991), Computational complexity of solving real algebraic formulae, in “Proc. Int. Congress of Math., Kyoto, 1990, ” Vol. II, pp. 1595-1606, Springer-Verlag, New York.
39. Ritter, K. (1990), Approximation and optimization on the Wiener space, J. Complexity 6, 337-364.
40. Ritter, K. (1992), “Average Errors for Zero Finding: Lower Bounds for Smooth or Monotone Functions, " Tech. Rep. No. 209-92, Department of Computer Science, Univ. Kentucky, Lexington.
41. Ritter, K., Wasilkowski, G. W, and Woźniakowski, H. (1993), On multivariate integration for stochastic processes, preprint.
42. Saari, D. G. (1987), Some informational requirements for convergence, J. Complexity 3, 302-311.
43. Sacks, J., and Ylvisaker, D. (1970), Statistical designs and integral approximation, in “Proc. 12th Bienn. Seminar Can. Math. Congr. 1969" (R. Pyke, Ed.), pp. 115-136, Can. Math. Soc., Montreal.
44. Schonhage, A. (1987), Equation solving in trems of computational complexity, in “Proc. Int. Congress of Math., Berkeley, 1986” (A. M. Gleason, Ed.), Vol. I, pp. 131-153, Amer. Math. Soc., Providence.
45. Shub, M., and Smale, S. (1985), Computational complexity: On the geometrie of polynomials and a theory of cost, I, Ann. Sci. Ecole Norm. Sup. 18, 107-142.
46. Shub, M., and Smale, S. (1986), Computational complexity: On the geometrie of polynomials and a theory of cost, II, SIAM J. Comput. 15, 145-161.
47. Shub, M., and Smale, S. (1986a), On the existence of generally convergent algorithms, J. Complexity 2, 2-11.
48. Shub, M., and Smale, S. (1992), Complexity of Bezout’s theorem, I, II, III, preprint.
49. Sikorski, K. (1982), Bisection is optimal, Numer. Math. 40, 111-117.
50. Sikorski, K. (1985), Optimal solution of nonlinear equations, J. Complexity 1, 197-209.
51. Sikorski, K. (1989), Study of linear information for classes of polynomial equations, Aequationes Math. 37, 1-14.
52. Sikorski, K., and Trojan, G. M. (1990), Asymptotic near optimality of the bisection method, Numer. Math. 57, 421-433.
53. Smale, S. (1981), The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. 4, 1-36.
54. Smale, S. (1985), On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. 13, 87-121.
55. Smale, S. (1987), Algorithms for solving equations, in “Proc. Int. Congress of Math., Berkeley, 1986” (A. M. Gleason, Ed.), Vol. I, pp. 172-195, Amer. Math. Soc., Providence.
56. Smale, S. (1990), Some remarks on the foundations of numerical analysis, SIAM Rev. 32, 211-220.
57. Speckman, P. (1979), “Lp Approximation of Autoregressive Gaussian Processes, ” Tech. Rep., Department of Statistics, Univ. of Oregon, Eugene.
58. Suldin, A. V. (1959), Wiener measure and its applications to approximation methods I, Izv. Vyssh. Uchebn. Zaved. Mat. 13, 145-158.
59. Traub, J. F. (1964), "Iterative Methods for the Solution of Equations, " Prentice-Hall, Englewood Cliffs; reissued: Chelsea Press, New York, 1982.
60. Traub, J. F., Woźniakowski, G. W. and Woźniakowski, H. (1988), “Information-Based Complexity, ” Academic Press, New York.
61. Traub, J. F. and Woźniakowski, H. (1976), Strict lower and upper bounds on iterative computational complexity, in "Analytic Computational Complexity” (J. F. Traub, Ed.), pp. 15-34, Academic Press, New York.
62. Traub, J. F., and Woźniakowski, H. (1979), Convergence and complexity of Newton iteration for operator equations, J. Assoc. Comput. Mach. 26, 250-258.
63. Traub, J. F., and Woźniakowski, H. (1980), “A General Theory of Optimal Algorithms, ” Academic Press, New York.
64. Vakhania, N. N., Tarieladze, V. I., and Chobanyan, S. A. (1987), “Probability Distributions on Banach Spaces, ” Reidel, Dordrecht.
65. Wasilkowski, G. W. (1981), n-evaluation conjecture for multipoint iterations for the solution of scalar nonlinear equations, J. Assoc. Comput. Mach. 28, 71-80.
66. Wasilkowski, G. W. (1983), Any iteration for polynomial equations using linear information has infinite complexity, J. Theoret. Comput. Sci. 22, 195-208.
67. Wasilkowski, G. W. (1986), Information of varying cardinality, J. Complexity 2, 204-228.
68. Wasilkowski, G. W. (1992), Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure, Bull. Amer. Math. Soc., to appear.
69. Wasilkowski, G. W., and Gao, F. (1992), On the power of adaptive information for functions with singularities. Math. Comp. 58, 285-304.
70. Woźniakowski, H. (1976), Maximal order of multipoint iterations using n evaluations, in "Analytic Computational Complexity” (J. F. Traub, Ed.), pp. 75-107, Academic Press, New York.
71. Woźniakowski, H. (1991), Average case complexity of multivariate integration, Bull. Amer. Math. Soc. 24, 185-194.
72. Woźniakowski, H. (1992), Average case complexity of linear multivariate problems, I. Theory, II. Applications, J. Complexity 8, 337-372, 373-392.