IniciGrupsConversesMésTendències
Cerca al lloc
Aquest lloc utilitza galetes per a oferir els nostres serveis, millorar el desenvolupament, per a anàlisis i (si no has iniciat la sessió) per a publicitat. Utilitzant LibraryThing acceptes que has llegit i entès els nostres Termes de servei i política de privacitat. L'ús que facis del lloc i dels seus serveis està subjecte a aquestes polítiques i termes.

Resultats de Google Books

Clica una miniatura per anar a Google Books.

S'està carregant…

The Art of Computer Programming, Volume 2: Seminumerical Algorithms (1969)

de Donald E. Knuth

MembresRessenyesPopularitatValoració mitjanaMencions
1,033320,168 (4.53)2
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. Byte , September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org… (més)
S'està carregant…

Apunta't a LibraryThing per saber si aquest llibre et pot agradar.

No hi ha cap discussió a Converses sobre aquesta obra.

» Mira també 2 mencions

Es mostren totes 3
Indeholder "Preface", "Preface to the Second Edition", "Notes on the Exercises", "Chapter 3. Random Numbers", " 3.1. Introduction", " 3.2. Generating Uniform Random Numbers", " 3.2.1. The Linear Congruential Method", " 3.2.1.1. Choice of modulus", " 3.2.1.2. Choice of multiplier", " 3.2.1.3. Potency", " 3.2.2. Other Methods", " 3.3. Statistical Tests", " 3.3.1. General Test Procedures for Studying Random Data", " 3.3.2. Empirical Tests", " 3.3.3* Theoretical Tests", " 3.3.4. The Spectral Test", " 3.4. Other Types of Random Quantities", " 3.4.1. Numerical Distributions", " 3.4.2. Random Sampling and Shuffling", " 3.5* What Is a Random Sequence?", " 3.6. Summary", "Chapter 4. Arithmetic", " 4.1. Positional Number Systems", " 4.2. Floating Point Arithmetic", " 4.2.1. Single-Precision Calculations", " 4.2.2. Accuracy of Floating Point Arithmetic", " 4.2.3* Double-Precision Calculations", " 4.2.4. Distribution of Floating Point Numbers", " 4.3. Multiple Precision Arithmetic", " 4.3.1. The Classical Algorithms", " 4.3.2* Modular Arithmetic", " 4.3.3* How Fast Can We Multiply?", " 4.4. Radix Conversion", " 4.5. Rational Arithmetic", " 4.5.1. Fractions", " 4.5.1. The Greatest Common Divisor", " 4.5.3* Analysis of Euclid's Algorithm", " 4.5.1. Factoring into Primes", " 4.6. Polynomial Arithmetic", " 4.6.1. Division of Polynomials", " 4.6.2* Factorization of Polynomials", " 4.6.3. Evaluation of Powers", " 4.6.4. Evaluation of Polynomials", " 4.7* Manipulation of Power Series", "Answers to Exercises", "Appendix A. Tables of Numerical Quantities", " 1. Fundamental Constants (decimal)", " 2. Fundamental Constants (octal)", " 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers", "Appendix B. Index to Notations", "Index and Glossary".

Mesteren selv fortæller hvordan man bør programmere. Heldigvis har folkene bag Mathematica, Maple og lignende programmer læst på lektien, så vi andre ikke behøver være helt så skarpe. ( )
  bnielsen | Nov 8, 2016 |
I used this volume less than Fundamental Algorithms, and Sorting and Searching, but it still saved me hours and hours of work, more than once. ( )
  Lyndatrue | Jan 11, 2014 |
Difficult, instructive, intelligent, amusing and brain-numbing - all rolled-in-to-one in this classic of CS. Buy it, read a page at a sitting and savor it - this is a book read over 5 years. ( )
  appa | Dec 22, 2007 |
Es mostren totes 3
Sense ressenyes | afegeix-hi una ressenya

Pertany a aquestes sèries

Has d'iniciar sessió per poder modificar les dades del coneixement compartit.
Si et cal més ajuda, mira la pàgina d'ajuda del coneixement compartit.
Títol normalitzat
Informació del coneixement compartit en anglès. Modifica-la per localitzar-la a la teva llengua.
Títol original
Títols alternatius
Data original de publicació
Gent/Personatges
Llocs importants
Esdeveniments importants
Pel·lícules relacionades
Epígraf
Dedicatòria
Primeres paraules
Citacions
Darreres paraules
Nota de desambiguació
Editor de l'editorial
Creadors de notes promocionals a la coberta
Llengua original
CDD/SMD canònics
LCC canònic
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. Byte , September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org

No s'han trobat descripcions de biblioteca.

Descripció del llibre
Sumari haiku

Debats actuals

Cap

Cobertes populars

Dreceres

Valoració

Mitjana: (4.53)
0.5
1
1.5
2
2.5
3 8
3.5
4 18
4.5 4
5 47

Ets tu?

Fes-te Autor del LibraryThing.

 

Quant a | Contacte | LibraryThing.com | Privadesa/Condicions | Ajuda/PMF | Blog | Botiga | APIs | TinyCat | Biblioteques llegades | Crítics Matiners | Coneixement comú | 206,953,729 llibres! | Barra superior: Sempre visible