Computational Matrix Analysis

Using an approach that author Alan Laub calls "matrix analysis for grown-ups," this new textbook introduces fundamental concepts of numerical linear algebra and their application to solving certain numerical problems arising in state-space control and systems theory. It is written for advanced undergraduate and beginning graduate students and can be used as a follow-up to Matrix Analysis for Scientists and Engineers (SIAM, 2005), a compact single-semester introduction to matrix analysis for engineers and computational scientists by the same author. Computational Matrix Analysis provides readers with a one-semester introduction to numerical linear algebra; an introduction to statistical condition estimation in book form for the first time; and an overview of certain computational problems in control and systems theory. The book features a number of elements designed to help students learn to use numerical linear algebra in day-to-day computing or research, including a brief review of matrix analysis, including notation, and an introduction to finite (IEEE) arithmetic; discussion and examples of conditioning, stability, and rounding analysis; an introduction to mathematical software topics related to numerical linear algebra; a thorough introduction to Gaussian elimination, along with condition estimation techniques; coverage of linear least squares, with orthogonal reduction and QR factorization; variants of the QR algorithm; and applications of the discussed algorithms.

This volume presents recent advances in the field of matrix analysis based on contributions at the MAT-TRIAD 2015 conference. Topics covered include interval linear algebra and computational complexity, Birkhoff polynomial basis, tensors, graphs, linear pencils, K-theory and statistic inference, showing the ubiquity of matrices in different mathematical areas. With a particular focus on matrix and operator theory, statistical models and computation, the International Conference on Matrix Analysis and its Applications 2015, held in Coimbra, Portugal, was the sixth in a series of conferences. Applied and Computational Matrix Analysis will appeal to graduate students and researchers in theoretical and applied mathematics, physics and engineering who are seeking an overview of recent problems and methods in matrix analysis.

This comprehensive book is presented in two parts; the first part introduces the basics of matrix analysis necessary for matrix computations, and the second part presents representative methods and the corresponding theories in matrix computations. Among the key features of the book are the extensive exercises at the end of each chapter. Matrix Analysis and Computations provides readers with the matrix theory necessary for matrix computations, especially for direct and iterative methods for solving systems of linear equations. It includes systematic methods and rigorous theory on matrix splitting iteration methods and Krylov subspace iteration methods, as well as current results on preconditioning and iterative methods for solving standard and generalized saddle-point linear systems. This book can be used as a textbook for graduate students as well as a self-study tool and reference for researchers and engineers interested in matrix analysis and matrix computations. It is appropriate for courses in numerical analysis, numerical optimization, data science, and approximation theory, among other topics

Matrix algebra is one of the most important areas of mathematics for data analysis and for statistical theory. This much-needed work presents the relevant aspects of the theory of matrix algebra for applications in statistics. It moves on to consider the various types of matrices encountered in statistics, such as projection matrices and positive definite matrices, and describes the special properties of those matrices. Finally, it covers numerical linear algebra, beginning with a discussion of the basics of numerical computations, and following up with accurate and efficient algorithms for factoring matrices, solving linear systems of equations, and extracting eigenvalues and eigenvectors.

Matrix analysis presented in the context of numerical computation at a basic level.

Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.

Matrix algorithms are at the core of scientific computing and are indispensable tools in most applications in engineering. This book offers a comprehensive and up-to-date treatment of modern methods in matrix computation. It uses a unified approach to direct and iterative methods for linear systems, least squares and eigenvalue problems. A thorough analysis of the stability, accuracy, and complexity of the treated methods is given. Numerical Methods in Matrix Computations is suitable for use in courses on scientific computing and applied technical areas at advanced undergraduate and graduate level. A large bibliography is provided, which includes both historical and review papers as well as recent research papers. This makes the book useful also as a reference and guide to further study and research work.

This book is a revised version of the first edition, regarded as a classic in its field. In some places, newer research results have been incorporated in the revision, and in other places, new material has been added to the chapters in the form of additional up-to-date references and some recent theorems to give readers some new directions to pursue.

Revised and updated, the third edition of Golub and Van Loan's classic text in computer science provides essential information about the mathematical background and algorithmic skills required for the production of numerical software. This new edition includes thoroughly revised chapters on matrix multiplication problems and parallel matrix computations, expanded treatment of CS decomposition, an updated overview of floating point arithmetic, a more accurate rendition of the modified Gram-Schmidt process, and new material devoted to GMRES, QMR, and other methods designed to handle the sparse unsymmetric linear system problem.