Presenting aspects of numerical analysis applicable to statisticians, this volume enables students to craft their own software and to understand both the advantages and challenges of numerical methods. Topics include numerical stability, accurate approximations, computational complexity and more.

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 sampling. 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.

Serves as a graduate text for a survey of computational statistics Second edition adds material on optimization, MM algorithm, penalty and barrier methods, and model selection via the lasso Other major topics are updated

Autorentext

Kenneth Lange is the Rosenfeld Professor of Computational Genetics in the Departments of Computational Medicine, Human Genetics, and Statistics at the University of California, Los Angeles. He served as chair of the UCLA Department of Computational Medicine for 9 years and as chair of the UCLA Department of Human Genetics for 12 years. He has authored five other books, including Mathematical and Statistical Methods for Genetic Analysis (Springer, 2002), Numerical Analysis for Statisticians (Springer, 2010) and Optimization (Springer, 2013). In 2021 he was elected to the National Academy of Sciences.

Inhalt
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.