Meyer C. D. - Matrix Analysis & Applied Linear Algebra.pdf

(7051 KB) Pobierz
Matrix Analysis & Applied Linear Algebra
133734855.001.png
Contents
Preface ....................... ix
1. Linear Equations ..............1
1.1 Introduction . . . ............... 1
1.2 Gaussian Elimination and Matrices ........ 3
1.3 Gauss–Jordan Method .............. 15
1.4 Two-Point BoundaryValue Problems ....... 18
1.5 Making Gaussian Elimination Work ........ 21
1.6 Ill-Conditioned Systems ............. 33
2. Rectangular Systems and Echelon Forms . . . 41
2.1 Row Echelon Form and Rank ........... 41
2.2 Reduced Row Echelon Form ........... 47
2.3 Consistencyof Linear Systems .......... 53
2.4 Homogeneous Systems .............. 57
2.5 Nonhomogeneous Systems ............ 64
2.6 Electrical Circuits . ............... 73
3. Matrix Algebra .............. 79
3.1 From Ancient China to Arthur Cayley ....... 79
3.2 Addition and Transposition ........... 81
3.3 Linearity .................... 89
3.4 WhyDo It This Way .............. 93
3.5 Matrix Multiplication .............. 95
3.6 Properties of Matrix Multiplication ....... 105
3.7 Matrix Inversion . .............. 115
3.8 Inverses of Sums and Sensitivity ........ 124
3.9 ElementaryMatrices and Equivalence ...... 131
3.10 The LU Factorization ............. 141
4. Vector Spaces ...............159
4.1 Spaces and Subspaces ............. 159
4.2 Four Fundamental Subspaces .......... 169
4.3 Linear Independence ............. 181
4.4 Basis and Dimension ............. 194
vi
Contents
4.5 More about Rank . .............. 210
4.6 Classical Least Squares ............ 223
4.7 Linear Transformations ............ 238
4.8 Change of Basis and Similarity ......... 251
4.9 Invariant Subspaces .............. 259
5. Norms, Inner Products, and Orthogonality . . 269
5.1 Vector Norms . . .............. 269
5.2 Matrix Norms . . .............. 279
5.3 Inner-Product Spaces ............. 286
5.4 Orthogonal Vectors .............. 294
5.5 Gram–Schmidt Procedure ........... 307
5.6 Unitaryand Orthogonal Matrices ........ 320
5.7 Orthogonal Reduction ............. 341
5.8 Discrete Fourier Transform ........... 356
5.9 ComplementarySubspaces ........... 383
5.10 Range-Nullspace Decomposition ........ 394
5.11 Orthogonal Decomposition ........... 403
5.12 Singular Value Decomposition ......... 411
5.13 Orthogonal Projection ............. 429
5.14 WhyLeast Squares? .............. 446
5.15 Angles between Subspaces ........... 450
6. Determinants ...............459
6.1 Determinants . . . .............. 459
6.2 Additional Properties of Determinants ...... 475
7. Eigenvalues and Eigenvectors ........489
7.1 ElementaryProperties of Eigensystems ..... 489
7.2 Diagonalization bySimilarityTransformations . . 505
7.3 Functions of Diagonalizable Matrices ...... 525
7.4 Systems of Differential Equations ........ 541
7.5 Normal Matrices . .............. 547
7.6 Positive Definite Matrices ........... 558
7.7 Nilpotent Matrices and Jordan Structure .... 574
7.8 Jordan Form . . . .............. 587
7.9 Functions of Nondiagonalizable Matrices ..... 599
Contents
vii
7.10 Difference Equations, Limits, and Summability. . 616
7.11 Minimum Polynomials and Krylov Methods . . . 642
8. Perron–Frobenius Theory .........661
8.1 Introduction . . . .............. 661
8.2 Positive Matrices . .............. 663
8.3 Nonnegative Matrices ............. 670
8.4 Stochastic Matrices and Markov Chains ..... 687
Index ...................... 705
Preface
Scaffolding
Reacting to criticism concerning the lack of motivation in his writings,
Gauss remarked that architects of great cathedrals do not obscure the beauty
of their work by leaving the scaffolding in place after the construction has been
completed. His philosophy epitomized the formal presentation and teaching of
mathematics throughout the nineteenth and twentieth centuries, and it is still
commonly found in mid-to-upper-level mathematics textbooks. The inherent ef-
ficiency and natural beauty of mathematics are compromised by straying too far
from Gauss’s viewpoint. But, as with most things in life, appreciation is gen-
erally preceded by some understanding seasoned with a bit of maturity, and in
mathematics this comes from seeing some of the scaffolding.
Purpose, Gap, and Challenge
The purpose of this text is to present the contemporary theory and applica-
tions of linear algebra to university students studying mathematics, engineering,
or applied science at the postcalculus level. Because linear algebra is usually en-
countered between basic problem solving courses such as calculus or differential
equations and more advanced courses that require students to cope with mathe-
matical rigors, the challenge in teaching applied linear algebra is to expose some
of the scaffolding while conditioning students to appreciate the utility and beauty
of the subject. Effectively meeting this challenge and bridging the inherent gaps
between basic and more advanced mathematics are primary goals of this book.
Rigor and Formalism
To reveal portions of the scaffolding, narratives, examples, and summaries
are used in place of the formal definition–theorem–proof development. But while
well-chosen examples can be more effective in promoting understanding than
rigorous proofs, and while precious classroom minutes cannot be squandered on
theoretical details, I believe that all scientifically oriented students should be
exposed to some degree of mathematical thought, logic, and rigor. And if logic
and rigor are to reside anywhere, they have to be in the textbook. So even when
logic and rigor are not the primary thrust, they are always available. Formal
definition–theorem–proof designations are not used, but definitions, theorems,
and proofs nevertheless exist, and they become evident as a student’s maturity
increases. A significant effort is made to present a linear development that avoids
forward references, circular arguments, and dependence on prior knowledge of the
subject. This results in some ine-ciencies—e.g., the matrix2-norm is presented
Zgłoś jeśli naruszono regulamin