Introduction to matrix computations
Author(s)
Bibliographic Information
Introduction to matrix computations
（Computer science and applied mathematics）
Academic Press, c1973
Available at / 81 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
STE||37||1||複本1979262
-
Research Institute for Economics & Business Administration (RIEB) Library , Kobe University図書
651.2-195081000047274
-
Faculty of Textile Science and Technology Library, Shinshu University図
411.3:St 5:2箱260650265200
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
dc19:512.9/st492021108495
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. 417-423
Includes indexes
Description and Table of Contents
Description
Numerical linear algebra is far too broad a subject to treat in a single introductory volume. Stewart has chosen to treat algorithms for solving linear systems, linear least squares problems, and eigenvalue problems involving matrices whose elements can all be contained in the high-speed storage of a computer. By way of theory, the author has chosen to discuss the theory of norms and perturbation theory for linear systems and for the algebraic eigenvalue problem. These choices exclude, among other things, the solution of large sparse linear systems by direct and iterative methods, linear programming, and the useful Perron-Frobenious theory and its extensions. However, a person who has fully mastered the material in this book should be well prepared for independent study in other areas of numerical linear algebra.
Table of Contents
Preliminaries. Practicalities. The Direct Solution of Linear Systems. Norms, Limits, and Condition Numbers. The Linear Least Squares Problem. Eigenvalues and Eigenvectors. The QR Algorithm. The Greek Alphabet and Latin Notational Correspondents. Determinants. Rounding-Error Analysis of Solution of Triangular Systems and of Gaussian Elimination. Of Things Not Treated. Bibliography. Index.
by "Nielsen BookData"
