A History of Algorithms
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > Mathematical modelling > A History of Algorithms: From the Pebble to the Microchip
A History of Algorithms: From the Pebble to the Microchip

A History of Algorithms: From the Pebble to the Microchip


     0     
5
4
3
2
1



Available


X
About the Book

A Source Book for the History of Mathematics, but one which offers a different perspective by focusinng on algorithms. With the development of computing has come an awakening of interest in algorithms. Often neglected by historians and modern scientists, more concerned with the nature of concepts, algorithmic procedures turn out to have been instrumental in the development of fundamental ideas: practice led to theory just as much as the other way round. The purpose of this book is to offer a historical background to contemporary algorithmic practice.

Table of Contents:
1 Algorithms for Arithmetic Operations.- 1.1 Sumerian Division.- 1.2 A Babylonian Algorithm for Calculating Inverses.- 1.3 Egyptian Algorithms for Arithmetic.- 1.4 Tableau Multiplication.- 1.5 Optimising Calculations.- 1.6 Simple Division by Difference on a Counting Board.- 1.7 Division on the Chinese Abacus.- 1.8 Numbers Written as Decimals.- 1.9 Binary Arithmetic.- 1.10 Computer Arithmetic.- 2 Magic Squares.- Squares with Borders.- The Marking Cells Method.- Proceeding by 2 and by 3.- Arnauld's Borders Method.- 3 Methods of False Position.- 3.1 Mesopotamia: a Geometric False Position.- 3.2 Egypt: Problem 26 of the Rhind Papyrus.- 3.3 China: Chapter VII of the Jiuzhang Suanshu.- 3.4 India: Bh?skara and the Rule of Simple False Position.- 3.5 Qust? Ibn L?q?: A Geometric Justification.- 3.6 Ibn al-Bann?: The Method of the Scales.- 3.7 Fibonacci: the Elchatayn rule.- 3.8 Pellos: The Rule of Three and The Method of Simple False Position.- 3.9 Clavius: Solving a System of Equations.- 4 Euclid's Algorithm.- 4.1 Euclid's Algorithm.- 118 Comparing Ratios.- 4.3 Bézout's Identity.- 4.4 Continued Fractions.- 4.5 The Number of Roots of an Equation.- 5 From Measuring the Circle to Calculating ?.- Geometric Approaches.- 5.1 The Circumference of the Circle.- 5.2 The Area of the Circle in the Jiuzhang Suanshu.- 5.3 The Method of Isoperimeters.- Analytic Approaches.- 5.4 Arithmetic Quadrature.- 5.5 Using Series.- 5.6 Epilogue.- 6 Newton's Methods.- The Tangent Method.- 6.1 Straight Line Approximations.- 6.2 Recurrence Formulas.- 6.3 Initial Conditions.- 6.4 Measure of Convergence.- 6.5 Complex Roots.- Newton's Polygon.- 6.6 The Ruler and Small Parallelograms.- Solving Equations by Successive Approximations.- Extraction of Square Roots.- 7.1 The Method of Heron of Alexandria.-7.2 The Method of Theon of Alexandria.- 7.3 Mediaeval Binomial Algorithms.- Numerical Solutions of Equations.- 7.4 Al-T?si’s Tables.- 7.5 Viète's Method.- 7.6 Kepler's Equation.- 7.7 Bernoulli's Method of Recurrent Series.- 7.8 Approximation by Continued Fractions.- Horner like Transformations of Polynomial Equations.- 7.9 The Ruffini-Budan Schema.- Algorithms in Arithmetic.- Factors and Multiples.- 8.1 The Sieve of Eratosthenes.- 8.2 Criteria For Divisibility.- 8.3 Quadratic Residues.- Tests for Primality.- 8.4 The Converse of Fermat's Theorem.- 8.5 The Lucas Test.- 8.6 Pépin'sTest.- Factorisation Algorithms.- 8.7 Factorisation by the Difference of Two Squares.- 8.8 Factorisation by Quadratic Residues.- 8.9 Factorisation by Continued Fractions.- The Pell-Fermat Equation.- 8.10 The Arithmetica of Diophantus.- 8.11 The Lagrange Result.- Solving Systems of Linear Equations.- 9.1 Cramer's Rule.- 9.2 The Method of Least Squares.- 9.3 The Gauss Pivot Method.- 9.4 A Gauss Iterative Method.- 9.5 Jacobi's Method.- 9.6 Seidel's Method.- 9.7 Nekrasov and the Rate of Convergence.- 9.8 Cholesky's Method.- 9.9 Epilogue.- 10 Tables and Interpolation.- 10.1 Ptolemy's Chord Tables.- 10.2 Briggs and Decimal Logarithms.- 10.3 The Gregory-Newton Formula.- 10.4 Newton's Interpolation Polynomial.- 10.5 The Lagrange Interpolation Polynomial.- 10.6 An Error Upper Bound.- 10.7 Neville's Algorithm.- Approximate Quadratures.- 11.1 Gregory's Formula.- 11.2 Newton's Three-Eighths Rule.- 11.3 The Newton-Cotes Formulas.- 11.4 Stirling's Correction Formulas.- 11.5 Simpson's Rule.- 11.6 The Gauss Quadrature Formulas.- 11.7 Chebyshev's Choice.- 11.8 Epilogue.- Approximate Solutions of Differential Equations.- 12.1 Euler's Method.- 12.2 The Existence of a Solution.- 12.3 Runge's Methods.- 12.4Heun's Methods.- 12.5 Kutta's Methods.- 12.6 John Adams and the Use of Finite Differences.- 12.7 Epilogue.- 13 Approximation of Functions.- Uniform Approximation.- 13.1 Taylor's Formula.- 13.2 The Lagrange Remainder.- 13.3 Chebyshev's Polynomial of Best Approximation.- 13.4 Spline-Fitting.- Mean Quadratic Approximation.- 13.5 Fourier Series.- 13.6 The Fast Fourier Transform.- 14 Acceleration of Convergence.- 14.1 Stirling's Method for Series.- 14.2 The Euler-Maclaurin Summation Formula.- 14.3 The Euler Constant.- 14.4 Aitken's Method.- 14.5 Richardson's Extrapolation Method.- 14.6 Romberg's Integration Method.- 15 Towards the Concept of Algorithm.- Recursive Functions and Computable Functions.- 15.1 The 1931 Definition.- 15.2 General Gödel Recursive Functions.- 15.3 Alonzo Church and Effective Calculability.- 15.4 Recursive Functions in the Kleene Sense.- Machines.- 15.5 The Turing Machine.- 15.6 Post's Machine.- 15.7 Conclusion.- Biographies.- General Index.- Index of Names.


Best Sellers


Product Details
  • ISBN-13: 9783540633693
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 524
  • Returnable: N
  • Width: 155 mm
  • ISBN-10: 3540633693
  • Publisher Date: 20 Aug 1999
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: From the Pebble to the Microchip


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
A History of Algorithms: From the Pebble to the Microchip
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
A History of Algorithms: From the Pebble to the Microchip
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

A History of Algorithms: From the Pebble to the Microchip

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!