# Linear algebra and its applications [4th ed.]

##### By: Strang, Gilbert.

Material type: BookPublisher: New Delhi Cengage 2006Edition: 4th ed.Description: viii, 487p.ISBN: 9788131501726.Subject(s): Algebras, LinearDDC classification: 512.5 | St81l4 Summary: The exercise sets in the book have been extensively updated. They feature many new problems from Professor Strang's long experience.New coverage of the Singular Value Decomposition has been added to the text.?A second color has been added to the illustrations and boxes, many of which are new.Includes an optional section on the Fast Fourier Transform. Students discover how this outstanding algorithm fits into linear algebra and introduces complex numbers.Recognizes what the computer can do in linear algebra, without being dominated by it. Table of Contents 1. MATRICES AND GAUSSIAN ELIMINATION. Introduction. The Geometry of Linear Equations. An Example of Gaussian Elimination. Matrix Notation and Matrix Multiplication. Triangular Factors and Row Exchanges. Inverses and Transposes. Special Matrices and Applications. Review Exercises. 2. VECTOR SPACES. Vector Spaces and Subspaces. The Solution of m Equations in n Unknowns. Linear Independence, Basis, and Dimension. The Four Fundamental Subspaces. Networks and Incidence Matrices. Linear Transformations. Review Exercises. 3. ORTHOGONALITY. Perpendicular Vectors and Orthogonal Subspaces. Inner Products and Projections onto Lines. Least Squares Approximations. Orthogonal Bases, Orthogonal Matrices, and Gram-Schmidt Orthogonalization. The Fast Fourier Transform. Review and Preview. Review Exercises. 4. DETERMINANTS. Introduction. Properties of the Determinant. Formulas for the Determinant. Applications of Determinants. Review Exercises. 5. EIGENVALUES AND EIGENVECTORS. Introduction. Diagonalization of a Matrix. Difference Equations and the Powers Ak. Differential Equations and the Exponential eAt. Complex Matrices: Symmetric vs. Hermitian. Similarity Transformations. Review Exercises. 6. POSITIVE DEFINITE MATRICES. Minima, Maxima, and Saddle Points. Tests for Positive Definiteness. The Singular Value Decomposition. Minimum Principles. The Finite Element Method. 7. COMPUTATIONS WITH MATRICES. Introduction. The Norm and Condition Number. The Computation of Eigenvalues. Iterative Methods for Ax = b. 8. LINEAR PROGRAMMING AND GAME THEORY. Linear Inequalities. The Simplex Method. Primal and Dual Programs. Network Models. Game Theory. Appendix A: Computer Graphics. Appendix B: The Jordan Form. References. Solutions to Selected Exercises. Index.Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

Books | PK Kelkar Library, IIT Kanpur | General Stacks | 512.5 St81l4 (Browse shelf) | Available | GB2775 |

The exercise sets in the book have been extensively updated. They feature many new problems from Professor Strang's long experience.New coverage of the Singular Value Decomposition has been added to the text.?A second color has been added to the illustrations and boxes, many of which are new.Includes an optional section on the Fast Fourier Transform. Students discover how this outstanding algorithm fits into linear algebra and introduces complex numbers.Recognizes what the computer can do in linear algebra, without being dominated by it.

Table of Contents

1. MATRICES AND GAUSSIAN ELIMINATION. Introduction. The Geometry of Linear Equations. An Example of Gaussian Elimination. Matrix Notation and Matrix Multiplication. Triangular Factors and Row Exchanges. Inverses and Transposes. Special Matrices and Applications. Review Exercises.

2. VECTOR SPACES. Vector Spaces and Subspaces. The Solution of m Equations in n Unknowns. Linear Independence, Basis, and Dimension. The Four Fundamental Subspaces. Networks and Incidence Matrices. Linear Transformations. Review Exercises.

3. ORTHOGONALITY. Perpendicular Vectors and Orthogonal Subspaces. Inner Products and Projections onto Lines. Least Squares Approximations. Orthogonal Bases, Orthogonal Matrices, and Gram-Schmidt Orthogonalization. The Fast Fourier Transform. Review and Preview. Review Exercises.

4. DETERMINANTS. Introduction. Properties of the Determinant. Formulas for the Determinant. Applications of Determinants. Review Exercises.

5. EIGENVALUES AND EIGENVECTORS. Introduction. Diagonalization of a Matrix. Difference Equations and the Powers Ak. Differential Equations and the Exponential eAt. Complex Matrices: Symmetric vs. Hermitian. Similarity Transformations. Review Exercises.

6. POSITIVE DEFINITE MATRICES. Minima, Maxima, and Saddle Points. Tests for Positive Definiteness. The Singular Value Decomposition. Minimum Principles. The Finite Element Method.

7. COMPUTATIONS WITH MATRICES. Introduction. The Norm and Condition Number. The Computation of Eigenvalues. Iterative Methods for Ax = b.

8. LINEAR PROGRAMMING AND GAME THEORY. Linear Inequalities. The Simplex Method. Primal and Dual Programs. Network Models. Game Theory. Appendix A: Computer Graphics. Appendix B: The Jordan Form. References. Solutions to Selected Exercises. Index.

There are no comments for this item.