Numerical Recipes. The Art of Scientific Computing
3rd edition
Par : , , , Formats :
- Nombre de pages1235
- PrésentationRelié
- FormatGrand Format
- Poids2.165 kg
- Dimensions18,3 cm × 26,0 cm × 4,8 cm
- ISBN978-0-521-88068-8
- EAN9780521880688
- Date de parution01/01/2007
- ÉditeurCambridge University Press
Résumé
Co-authored by four leading scientists from academia and industry, Numerical Recipes, Third Edition starts with basic mathematics and computer science and proceeds to complete, working routines. Widely recognized as the most comprehensive, accessible, and practical basis for scientific computing, this …
Co-authored by four leading scientists from academia and industry, Numerical Recipes, Third Edition starts with basic mathematics and computer science and proceeds to complete, working routines. Widely recognized as the most comprehensive, accessible, and practical basis for scientific computing, this new edition incorporates more than 400 Numerical Recipes routines, many of them new or upgraded. The executable C++ code, now printed in color for easy reading, adopts an object-oriented style particularly suited to scientific applications.
The whole book is presented in the informal, easy-to-read style that made earlier editions so popular. New key features : 2 new chapters, 25 new sections, 25% longer than the Second Edition ; Thorough upgrades throughout the text ; Over 100 completely new routines and upgrades of many more ; New classification and inference chapter. including Gaussian mixture models, HMMs, hierarchical clustering, and Support Vector Machines ; New computational geometry chapter covering KD trees, quad- and octrees, Delaunay triangulation, and algorithms for lines, polygons, triangles, and spheres ; New sections including interior point methods for linear programming, Monte Carlo Markov Chains, spectral and pseudospectral methods for PDEs, and many new statistical distributions ; An expanded treatment of ODEs with completely new routines ; And much, much more !
The whole book is presented in the informal, easy-to-read style that made earlier editions so popular. New key features : 2 new chapters, 25 new sections, 25% longer than the Second Edition ; Thorough upgrades throughout the text ; Over 100 completely new routines and upgrades of many more ; New classification and inference chapter. including Gaussian mixture models, HMMs, hierarchical clustering, and Support Vector Machines ; New computational geometry chapter covering KD trees, quad- and octrees, Delaunay triangulation, and algorithms for lines, polygons, triangles, and spheres ; New sections including interior point methods for linear programming, Monte Carlo Markov Chains, spectral and pseudospectral methods for PDEs, and many new statistical distributions ; An expanded treatment of ODEs with completely new routines ; And much, much more !
