Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
This book, like many books, was born in frustration. When in the fall of 1994 I set out to teach a second course in computational statistics to d- toral students at the University of Michigan, none of the existing texts seemed exactly right. On the one hand, the many decent, even inspiring, books on elementary computational statistics stress the nuts and bolts of using packaged programs and emphasize model interpretation more than numerical analysis. On the other hand, the many theoretical texts in - merical analysis almost entirely neglect the issues of most importance to statisticians. TheclosestbooktomyidealwastheclassicaltextofKennedy and Gentle [2]. More than a decade and a half after its publication, this book still has many valuable lessons to teach statisticians. However, upon re?ecting on the rapid evolution of computational statistics, I decided that the time was ripe for an update. The book you see before you represents a biased selection of those topics in theoretical numerical analysis most relevant to statistics. By intent this book is not a compendium of tried and trusted algorithms, is not a c- sumer’s guide to existing statistical software, and is not an exposition of computer graphics or exploratory data analysis. My focus on principles of numerical analysis is intended to equip students to craft their own software and to understand the advantages and disadvantages of di?erent numerical methods. Issues of numerical stability, accurate approximation, compu- tional complexity, and mathematical modeling share the limelight and take precedence over philosophical questions of statistical inference.
Content Level »Research
Keywords »Markov chain Monte Carlo - Newton's method - STATISTICA - algorithms - expectation–maximization algorithm - linear regression - optimization
Recurrence Relations.- Power Series Expansions.- Continued Fraction Expansions.- Asymptotic Expansions.- Solution of Nonlinear Equations.- Vector and Matrix Norms.- Linear Regression and Matrix Inversion.- Eigenvalues and Eigenvectors.- Splines.- The EM Algorithm.- Newton’s Method and Scoring.- Variations on the EM Theme.- Convergence of Optimization Algorithms.- Constrained Optimization.- Concrete Hilbert Spaces.- Quadrature Methods.- The Fourier Transform.- The Finite Fourier Transform.- Wavelets.- Generating Random Deviates.- Independent Monte Carlo.- Bootstrap Calculations.- Finite-State Markov Chains.- Markov Chain Monte Carlo.