Introduction to Linear Algebra
Systems of Linear Equations
- Introduction
- Linear systems
- Vectors
- Linear combinations
- Matrices
- Planes in ℝ³
- Row operations
- Gaussian elimination
- Reduced Row-Echelon Form
- Equation A x = b
- Sensitivity of solutions
- Iterative methods
- Linear independence
- Plane transformations
- Space transformations
- Rotations
- Linear transformations
- Affine maps
- Exercises
- Answers
Matrix Algebra
- Introduction
- Manipulation of matrices
- Partitioned matrices
- Block matrices
- Matrix operators
- Determinants
- Cofactors
- Cramer's rule
- Elementary matrices
- Inverse matrices
- Equivalent matrices
- Rank
- Elimination: A = L U
- PLU factorization
- Reflection
- Givens rotation
- Special matrices
- Exercises
- Answers
Vector Spaces
- Introduction
- Motivation
- Vector spaces
- Bases
- Dimension
- Coordinate systems
- Linear transformations
- Change of basis
- Matrix transformations
- Compositions
- Isomorphisms
- Dual spaces
- Dual transformations
- Subspaces
- Quotient spaces
- Vector products
- Wedge products
- Rotors
Eigenvalues, Eigenvectors
- Introduction
- Characteristic polynomials
- Companion matrix
- Algebraic and geometric multiplicities
- Minimal polynomials
- Eigenspaces
- Where are eigenvalues?
- Eigenvalues of A B and B A
- Generalized eigenvectors
- Similarity
- Diagonalizability
- Self-adjoint operators
- Exercises
- Answers
Euclidean Spaces
- Introduction
- Dot product
- Euclidean space
- Bilinear transformations
- Inner product
- Norm and distance
- Matrix norms
- Dual norms
- Dual transformations
- Examples of transformations
- Orthogonality
- Gram--Schmidt Process
- Orthogonal matrices
- Self-adjoint matrices
- Unitary matrices
- Projection operators
- QR-decomposition
- Least Square Approximation
- Quadratic forms
- Exercises
- Answers
Matrix Decompositions
- Introduction
- 2D decomposition
- Projectors
- Direct-sum decompositions
- Cyclic decompositions
- Symmetric matrices
- Symmetric matrices
- Pseudoinverse
- Eigenvalue decomposition
- URV-decomposition
- LU-decomposition
- QR-decomposition
- Cholesky decomposition
- Schur decomposition
- Jordan decomposition
- Positive matrices
- Roots
- Polar factorization
- Spectral decomposition
- Singular value decomposition
- CUR decomposition
- Exercises
- Answers
Tensors
- Introduction
- Circles along curves
- TNB frames
- Tensors
- Tensors in ℝ³
- Tensors & Mechanics
- Differential forms
- Calculus
- Answers
Applications
- Introduction
- GPS problem
- Poisson equation
- Graph theory
- Error correcting codes
- Electric circuits
- FSA
- Markov chains
- Cryptography
- Wave-length transfer matrix
- Computer graphics
- Linear Programming
- Hill's determinant
- Fibonacci matrices
- Discrete dynamic systems
- Discrete Fourier transform
- Fast Fourier transform
- Curve fitting
- Answers
Functions of Matrices
- Introduction
- Diagonalization
- Sylvester formula
- The Resolvent method
- Polynomial interpolation
- Positive matrices
- Roots <
- Pseudoinverse
- Exercises
- Answers
Miscellany
- Introduction
- Circles along curves
- TNB frames
- Differential forms
- Calculus
- Vector representations
- Matrix representations
- Change of basis
- Orthonormal Diagonalization
- Generalized inverse
- Differential forms
Preliminaries
- Complex Number Operations
- Sets
- Polynomials
- Polynomials and Matrices
- Computer solves Systems of Linear Equations
- Location of Eigenvalues
- Power Method
- Iterative Method
- Similarity and Diagonalization
Glossary
Reference

This Book is licensed under Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License
‹‹
Moore--Penrose Inverse
For an arbitrary m×n matrix A and self-adjoint (Hermitian) positive definite matrices M and N of order m and n, respectively, there is a unique matrix n×m matrix G satisfying the following equations:
\[
{\bf A}\,{\bf G}\,{\bf A} = {\bf A}, \quad {\bf G}\,{\bf A}\,{\bf G} = {\bf G} , \quad \left( {\bf M}\,{\bf A}\,{\bf G} \right)^{\ast} = {\bf M}\,{\bf A}\,{\bf G} , \quad \left( {\bf N}\,{\bf G}\,{\bf A} \right)^{\ast} = {\bf N}\,{\bf G}\,{\bf N} .
\]
Matrix G is known as the weighted Moore–Penrose inverse of A and is denoted by A†. In particular, when
m×m matrix M is the identity matrix and n×n matrix N is the identity matrix, the matrix G that satisfies the above conditions is recognized as the Moore–Penrose inverse or pseudoinverse.
- Wei, Y. and Wang, D., Condition numbers and perturbation of the weighted Moore–Penrose inverse and weighted linear least squares problem, Applied Mathematics and Computation, Volume 145, Issue 1, 20 December 2003, Pages 45-58; https://doi.org/10.1016/S0096-3003(02)00437-X