A Journey Through The History Of Numerical Linear Algebra
Download A Journey Through The History Of Numerical Linear Algebra PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get A Journey Through The History Of Numerical Linear Algebra book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
A Journey through the History of Numerical Linear Algebra
This expansive volume describes the history of numerical methods proposed for solving linear algebra problems, from antiquity to the present day. The authors focus on methods for linear systems of equations and eigenvalue problems and describe the interplay between numerical methods and the computing tools available at the time. The second part of the book consists of 78 biographies of important contributors to the field. A Journey through the History of Numerical Linear Algebra will be of special interest to applied mathematicians, especially researchers in numerical linear algebra, people involved in scientific computing, and historians of mathematics.
Hessenberg and Tridiagonal Matrices
This is the only book devoted exclusively to Hessenberg and tridiagonal matrices. Hessenberg matrices are involved in Krylov methods for solving linear systems or computing eigenvalues and eigenvectors, in the QR algorithm for computing eigenvalues, and in many other areas of scientific computing (for instance, control theory). Matrices that are both upper and lower Hessenberg are tridiagonal. Their entries are zero except for the main diagonal and the subdiagonal and updiagonal next to it. Hessenberg and Tridiagonal Matrices: Theory and Examples presents known and new results; describes the theoretical properties of the matrices, their determinants, LU factorizations, inverses, and eigenvalues; illustrates the theoretical properties with applications and examples as well as numerical experiments; and considers unitary Hessenberg matrices, inverse eigenvalue problems, and Toeplitz tridiagonal matrices. This book is intended for applied mathematicians, especially those interested in numerical linear algebra, and it will also be of interest to physicists and engineers.
Error Norm Estimation in the Conjugate Gradient Algorithm
The conjugate gradient (CG) algorithm is almost always the iterative method of choice for solving linear systems with symmetric positive definite matrices. This book describes and analyzes techniques based on Gauss quadrature rules to cheaply compute bounds on norms of the error. The techniques can be used to derive reliable stopping criteria. How to compute estimates of the smallest and largest eigenvalues during CG iterations is also shown. The algorithms are illustrated by many numerical experiments, and they can be easily incorporated into existing CG codes. The book is intended for those in academia and industry who use the conjugate gradient algorithm, including the many branches of science and engineering in which symmetric linear systems have to be solved.