Analytic Computational Complexity
eBook - PDF

Analytic Computational Complexity

  1. 250 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Analytic Computational Complexity

About this book

Analytic Computational Complexity contains the proceedings of the Symposium on Analytic Computational Complexity held by the Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania, on April 7-8, 1975. The symposium provided a forum for assessing progress made in analytic computational complexity and covered topics ranging from strict lower and upper bounds on iterative computational complexity to numerical stability of iterations for solution of nonlinear equations and large linear systems. Comprised of 14 chapters, this book begins with an introduction to analytic computational complexity before turning to proof techniques used in analytic complexity. Subsequent chapters focus on the complexity of obtaining starting points for solving operator equations by Newton's method; maximal order of multipoint iterations using n evaluations; the use of integrals in the solution of nonlinear equations in N dimensions; and the complexity of differential equations. Algebraic constructions in an analytic setting are also discussed, along with the computational complexity of approximation operators. This monograph will be of interest to students and practitioners in the fields of applied mathematics and computer science.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Analytic Computational Complexity by J.F. Traub in PDF and/or ePUB format, as well as other popular books in Mathematics & Applied Mathematics. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Academic Press
Year
2014
Print ISBN
9780126975604
eBook ISBN
9781483257891
Topic
Mathematics
Subtopic
Applied Mathematics
Index
Mathematics

Table of contents

  1. Front Cover
  2. Analytic Computational Complexity
  3. Copyright Page
  4. Table of Contents
  5. LIST OF INVITED AUTHORS
  6. PREFACE
  7. CHAPTER 1. INTRODUCTION
  8. CHAPTER 2. SOME REMARKS ON PROOF TECHNIQUES IN ANALYTIC COMPLEXITY
  9. CHAPTER 3. STRICT LÖWER AND UPPER BOUNDS ON ITERATIVE COMPUTATIONAL COMPLEXITY
  10. CHAPTER 4. THE COMPLEXITY OF OBTAINING STARTING POINTS FOR SOLVING OPERATOR EQUATIONS BY NEWTON'S METHOD
  11. CHAPTER 5. A CLASS OF OPTIMAL-ORDER ZERO-FINDING METHODS USING DERIVATIVE EVALUATIONS
  12. CHAPTER 6. MAXIMAL ORDER OF MULTIPOINT ITERATIONS USING n EVALUATIONS
  13. CHAPTER 7. OPTIMAL USE OF INFORMATION IN CERTAIN ITERATIVE PROCESSES
  14. CHAPTER 8. THE USE OF INTEGRALS IN THE SOLUTION OF NONLINEAR EQUATIONS IN N DIMENSIONS
  15. Chapter 9. Complexity and Differential Equations
  16. CHAPTER 10. MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION
  17. CHAPTER 11. NUMERICAL STABILITY OF ITERATIONS FOR SOLUTION OF NONLINEAR EQUATIONS AND LARGE LINEAR SYSTEMS
  18. CHAPTER 12. ON THE COMPUTATIONAL COMPLEXITY OF APPROXIMATION OPERATORS II
  19. CHAPTER 13. HENSEL MEETS NEWTON ALGEBRAIC CONSTRUCTIONS IN AN ANALYTIC SETTING
  20. CHAPTER 14. ο ((n log n)3/2) ALGORITHMS FOR COMPOSITION AND REVERSION OF POWER SERIES
  21. ABSTRACTS OF CONTRIBUTED PAPERS