Advertisement

A survey of recent problems and results in analytic computational complexity

  • B. Kacewicz
  • H. Woźniakowski
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Abstract

We survey recent problems in analytic computational complexity. We deal primarily with the problem of solving nonlinear equations from complexity point of view. We summarize known results and we pose some open problems. The paper is concluded with new areas of further investigations in analytic computational complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. Bibliography

  1. Brent [72]
    Brent, R.P., "The computational complexity of iterative methods for systems of nonlinear equations", Proc. Complexity Symposium, Yorktown Heights, N.Y., Plenum Press, New York.Google Scholar
  2. Brent [75]
    Brent, R.P., "A class of optimal-order zero-finding methods using derivative evaluations", in Analytic Computational Complexity, edited by J. F. Traub, Academic Press 1976, pp. 59–73.Google Scholar
  3. Brent, Winograd and Wolfe [73]
    Brent, R.P., Winograd, S., Wolfe, P., "Optimal iterative processes for root-finding," Numer.Math., 20, pp. 327–341.Google Scholar
  4. Jankowska [75]
    Jankowska, J., "Multivariate secant method", Ph.D.thesis, University of Warsaw, to appear in SIAM J. on Num.Anal. Google Scholar
  5. Kacewicz [75]
    Kacewicz, B., "Integrals with kernel in the solution of nonlinear equations in N dimensions", Computer Science Department Report, Carnegie-Mellon University, 1975.Google Scholar
  6. Kung and Traub [74]
    Kung, K.T., Traub, J.F., "Optimal order of one-point and multipoint iterations" J.Assoc.Comput.Mach. Vol. 21, No. 4, 1974, pp. 643–651.Google Scholar
  7. Meersman [76]
    Meersman, R., "Optimal use of information in certain iterative processes", in Analytic Computational Complexity, Academic Press 1976, pp. 109–125.Google Scholar
  8. Nowożyński and Wasilkowski [77]
    Nowożyński, K., Wasilkowski, G., "Global convergence of interpolatory iterations in the scalar case", to appearGoogle Scholar
  9. Traub and Woźniakowski [76a]
    Traub, J.F., Woźniakowski, H., "Strict lower and upper bounds on iterative computational complexity", in Analytic Computational Complexity, Academic Press 1976, pp. 15–34.Google Scholar
  10. Traub and Woźniakowski [76b]
    "Optimal radius of convergence of interpolatory iterations for operator equations", Dept. of Computer Science Report, Carnegie-Mellon University, 1976.Google Scholar
  11. Traub and Woźniakowski [76c]
    "Optimal linear information for the solution of nonlinear equations", Algorithms and Complexity, New Directions and Recent Results, edited by J.F. Traub, Academic Press 1976.Google Scholar
  12. Traub and Woźniakowski [77]
    "Convergence and complexity of interpolatory — Newton iteration in a Banach space", Computer Science Department Report, Carnegie-Mellon University, 1977.Google Scholar
  13. Woźniakowski [74]
    Woźniakowski, H., "Maximal stationary iterative methods for the solution of operator equations", SIAM J.Numer.Anal., 11, 5, pp. 934–949, 1974.CrossRefGoogle Scholar
  14. Woźniakowski [75]
    "Generalized information and maximal order of iteration for operator equations", SIAM J.Numer.Anal., 12,1,pp. 121–135, 1975.Google Scholar
  15. Woźniakowski [76]
    "Maximal order of multipoint iterations using n evaluations", in Analytic Computational Complexity, Academic Press 1976, pp. 75–107.Google Scholar
  16. Rice [76]
    Rice, J.R., "On the Computational Complexity of Approximation Operators II", in Analytic Computational Complexity, Academic Press, 1976, 191–205.Google Scholar
  17. Schultz [76]
    Schultz, M.M., "Complexity and Differential Equations", in Analytic Computational Complexity, Academic Press, 1976, 143–151.Google Scholar
  18. Winograd [76]
    Winograd, S., "Some Remarks on Proof Techniques in Analytic Complexity", in Analytic Computational Complexity, Academic Press, 1976, 5–15.Google Scholar
  19. Traub [73]
    Traub, J.F., "Complexity of Sequential and Parallel Numericall Algorithms", editor, Academic Press, 1973.Google Scholar
  20. Traub [76a]
    Traub, J.F., "Analytic Computational Complexity", editor, Academic Press, 1976.Google Scholar
  21. Traub [76b]
    Traub, J.F., "Algorithms and Complexity: Recent Results and New Directions", editor, Academic Press, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • B. Kacewicz
    • 1
  • H. Woźniakowski
    • 1
  1. 1.Department of MathematicsUniversity of WarsawPoland

Personalised recommendations