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.
Every advance in computer architecture and software tempts statisticians to tackle numerically harder problems. To do so intelligently requires a good working knowledge of numerical analysis. This book equips students to craft their own software and to understand the advantages and disadvantages of different numerical methods. Issues of numerical stability, accurate approximation, computational complexity, and mathematical modeling share the limelight in a broad yet rigorous overview of those parts of numerical analysis most relevant to statisticians.
In this second edition, the material on optimization has been completely rewritten. There is now an entire chapter on the MM algorithm in addition to more comprehensive treatments of constrained optimization, penalty and barrier methods, and model selection via the lasso. There is also new material on the Cholesky decomposition, Gram-Schmidt orthogonalization, the QR decomposition, the singular value decomposition, and reproducing kernel Hilbert spaces. The discussions of the bootstrap, permutation testing, independent Monte Carlo, and hidden Markov chains are updated, and a new chapter on advanced MCMC topics introduces students to Markov random fields, reversible jump MCMC, and convergence analysis in Gibbs
Numerical Analysis for Statisticians can serve as a graduate text for a course surveying computational statistics. With a careful selection of topics and appropriate supplementation, it can be used at the undergraduate level. It contains enough material for a graduate course on optimization theory. Because many chapters are nearly self-contained, professional statisticians will also find the book useful as a reference.
Kenneth Lange is the Rosenfeld Professor of Computational Genetics in the Departments of Biomathematics and Human Genetics and the Chair of the Department of Human Genetics, all in the UCLA School of Medicine. His research interests include human genetics, population modeling, biomedical imaging, computational statistics, high-dimensional optimization, and applied stochastic processes. Springer previously published his books Mathematical and Statistical Methods for Genetic Analysis, 2nd ed., Applied Probability, and Optimization. He has written over 200 research papers and produced with his UCLA colleague Eric Sobel the computer program Mendel, widely used in statistical genetics.
Content Level »Graduate
Keywords »Algorithm - Computational statistics - Monte Carlo sampling - Numerical analysis - Optimization - expectation–maximization algorithm - linear regression
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.- Singular Value Decomposition.- Splines.- Optimization Theory.- The MM Algorithm.- The EM Algorithm.- Newton’s Method and Scoring.- Local and Global Convergence.- Advanced Optimization Topics.- Concrete Hilbert Spaces.- Quadrature Methods.- The Fourier Transform.- The Finite Fourier Transform.- Wavelets.- Generating Random Deviates.- Independent Monte Carlo.- Permutation Tests and the Bootstrap.- Finite-State Markov Chains.- Markov Chain Monte Carlo.- Advanced Topics in MCMC.