Now the acclaimed Second Edition of Numerical Recipes is available in the C++ object-oriented programming language. Including and updating the full mathematical and explanatory contents of Numerical Recipes in C, this new version incorporates completely new C++ versions of the more than 300 Numerical Recipes routines that are widely recognized as the most accessible and practical basis for scientific computing. The product of a unique collaboration among four leading scientists in academic research and industry, Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. Highlights include linear algebra, interpolation, special functions, random numbers, nonlinear sets of equations, optimization, eigensystems, Fourier methods and wavelets, statistical tests, ODEs and PDEs, integral equations and inverse theory. The authors approach to C++ preserves the efficient execution that C users expect, while simultaneously employing a clear, object-oriented interface to the routines. Tricks and tips for scientific computing in C++ are liberally included. The routines, in ANSI/ISO C++ source code, can thus be used with almost any existing C++ vector/matrix class library, according to user preference. A simple class library for stand-alone use is also included in the book. Both scientific programmers new to C++, and experienced C++ programmers who need access to the Numerical Recipes routines, can benefit from this important new version of an invaluable, classic text.

This is the greatly revised and greatly expanded Second Edition of the hugely popular Numerical Recipes: The Art of Scientific Computing. The product of a unique collaboration among four leading scientists in academic research and industry Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, this new edition remains the most practical, comprehensive handbook of scientific computing available today. Highlights of the new material include: -A new chapter on integral equations and inverse methods -Multigrid and other methods for solving partial differential equations -Improved random number routines - Wavelet transforms -The statistical bootstrap method -A new chapter on "less-numerical" algorithms including compression coding and arbitrary precision arithmetic. The book retains the informal easy-to-read style that made the first edition so popular, while introducing some more advanced topics. It is an ideal textbook for scientists and engineers and an indispensable reference for anyone who works in scientific computing. The Second Edition is availabe in FORTRAN, the traditional language for numerical calculations and in the increasingly popular C language.

Do you want easy access to the latest methods in scientific computing? This greatly expanded third edition of Numerical Recipes has it, with wider coverage than ever before, many new, expanded and updated sections, and two completely new chapters. The executable C++ code, now printed in colour for easy reading, adopts an object-oriented style particularly suited to scientific applications. Co-authored by four leading scientists from academia and industry, Numerical Recipes starts with basic mathematics and computer science and proceeds to complete, working routines. The whole book is presented in the informal, easy-to-read style that made earlier editions so popular. Highlights of the new material include: a new chapter on classification and inference, Gaussian mixture models, HMMs, hierarchical clustering, and SVMs; a new chapter on computational geometry, covering KD trees, quad- and octrees, Delaunay triangulation, and algorithms for lines, polygons, triangles, and spheres; interior point methods for linear programming; MCMC; an expanded treatment of ODEs with completely new routines; and many new statistical distributions. For support, or to subscribe to an online version, please visit www.nr.com.

"This book is appropriate for an applied numerical analysis course for upper-level undergraduate and graduate students as well as computer science students. Actual programming is not covered, but an extensive range of topics includes round-off and function evaluation, real zeros of a function, integration, ordinary differential equations, optimization, orthogonal functions, Fourier series, and much more. 1989 edition"--Provided by publisher.

An essential resource for learning about general relativity and much more, from four leading experts Important and useful to every student of relativity, this book is a unique collection of some 475 problems--with solutions--in the fields of special and general relativity, gravitation, relativistic astrophysics, and cosmology. The problems are expressed in broad physical terms to enhance their pertinence to readers with diverse backgrounds. In their solutions, the authors have attempted to convey a mode of approach to these kinds of problems, revealing procedures that can reduce the labor of calculations while avoiding the pitfall of too much or too powerful formalism. Although well suited for individual use, the volume may also be used with one of the modem textbooks in general relativity.

On the occasion of this new edition, the text was enlarged by several new sections. Two sections on B-splines and their computation were added to the chapter on spline functions: Due to their special properties, their flexibility, and the availability of well-tested programs for their computation, B-splines play an important role in many applications. Also, the authors followed suggestions by many readers to supplement the chapter on elimination methods with a section dealing with the solution of large sparse systems of linear equations. Even though such systems are usually solved by iterative methods, the realm of elimination methods has been widely extended due to powerful techniques for handling sparse matrices. We will explain some of these techniques in connection with the Cholesky algorithm for solving positive definite linear systems. The chapter on eigenvalue problems was enlarged by a section on the Lanczos algorithm; the sections on the LR and QR algorithm were rewritten and now contain a description of implicit shift techniques. In order to some extent take into account the progress in the area of ordinary differential equations, a new section on implicit differential equa tions and differential-algebraic systems was added, and the section on stiff differential equations was updated by describing further methods to solve such equations.