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

This text presents selected aspects of matrix theory that are most useful in developing computational methods for solving linear equations and finding characteristic roots. Topics include norms, bounds and convergence; localization theorems; more. 1964 edition.

The breadth of matrix theory's applications is reflected by this volume, which features material of interest to applied mathematicians as well as to control engineers studying stability of a servo-mechanism and numerical analysts evaluating the roots of a polynomial. Starting with a survey of complex symmetric, antisymmetric, and orthogonal matrices, the text advances to explorations of singular bundles of matrices and matrices with nonnegative elements. Applied mathematicians will take particular note of the full and readable chapter on applications of matrix theory to the study of systems of linear differential equations, and the text concludes with an exposition on the Routh-Hurwitz problem plus several helpful appendixes. 1959 edition.

This book presents a substantial part of matrix analysis that is functional analytic in spirit. Topics covered include the theory of majorization, variational principles for eigenvalues, operator monotone and convex functions, and perturbation of matrix functions and matrix inequalities. The book offers several powerful methods and techniques of wide applicability, and it discusses connections with other areas of mathematics.

Clear and concise introduction to matrices with elegant proofs; Of interest to scientists from many disciplines; Gives many interesting applications to different parts of mathematics, such as algebra, analysis and complexity theory; Contains 160 exercises, half of them on advanced material; Includes at least one advanced result per chapter

Mathematically rigorous introduction covers vector and matrix norms, the condition-number of a matrix, positive and irreducible matrices, much more. Only elementary algebra and calculus required. Includes problem-solving exercises. 1968 edition.

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.

This revised and corrected second edition of a classic on special matrices provides researchers in numerical linear algebra and students of general computational mathematics with an essential reference. 1986 edition.

A thorough and elegant treatment of the theory of matrix functions and numerical methods for computing them, including an overview of applications, new and unpublished research results, and improved algorithms. Key features include a detailed treatment of the matrix sign function and matrix roots; a development of the theory of conditioning and properties of the Fre;chet derivative; Schur decomposition; block Parlett recurrence; a thorough analysis of the accuracy, stability, and computational cost of numerical methods; general results on convergence and stability of matrix iterations; and a chapter devoted to the f(A)b problem. Ideal for advanced courses and for self-study, its broad content, references and appendix also make this book a convenient general reference. Contains an extensive collection of problems with solutions and MATLAB implementations of key algorithms.

This volume concisely presents fundamental ideas, results, and techniques in linear algebra and mainly matrix theory. Each chapter focuses on the results, techniques, and methods that are beautiful, interesting, and representative, followed by carefully selected problems. For many theorems several different proofs are given. The only prerequisites are a decent background in elementary linear algebra and calculus.