1 books for « traub j f ed wi... »Edit

‎Analytic Computational Complexity , Proceedings of the Symposium on Analytic Computational Complexity held by the Computer Science Department, Carnegie-Mellon University, Pittsburg, on April, 7-8 1975‎

‎Academic Press Malicorne sur Sarthe, 72, Pays de la Loire, France 1976 Book condition, Etat : Bon hardcover, no dust-jacket grand In-8 1 vol. - 248 pages‎

‎ 1st Edition Contents, Chapitres : Contents, Preface, ix, Text, 239 pages - J.F. Traub : Introduction - S. Winograd : Some remarks on proof techniques in analytic complexity - J.F. Traub and H. Wozniakowski : Strict lower and upper bounds on iterative computational complexity - H.T. Kung : The complex of obtaining starting points for solving operator equations by Newton's method - Richard P. Brent : A class of optimal-order zero-finding methods using derivative evaluations - H. Wozniakowski : Maximal order of mulipoint iterations using n evaluations - Robert Meersman : Optimal use of information in certain iterative processes - B. Kacewicz : The use of integrals in the solution of nonlinear equations in N dimensions - M.H. Schulz : Complexity and differential equations - Richard P. Brent : Multiple-decision zero-finding methods and the complexity of elementary function evaluation - H. Wozniakowski : Numerical stability of iterations for solution of nonlinear equations and large linear systems - John R. Rice : On the computational complexity of approximation operators II - David Y.Y. Yun : Hensel meets Newton - algebraic construction in an analytic setting - Richard P. Brent and H.T. Kung : O ((n log n) 3/2) algorithms for composition and reversion of power series - Abstracts of contributed papers ex-library copy, sticker on the spine and few stamps on the first pages, else very good copy, no other markings, the spine is very lightly torn‎