Zahri-Edu University › Linear Algebra

MATH 411

Numerical Linear Algebra

Stable algorithms for matrix problems: LU, QR and Cholesky factorizations, least squares, SVD, conditioning, and iterative solvers.

In preparation

The lecture notes for this course are being written. Below is the planned table of contents; chapters will be published one by one.

Table of contents

6 chapters · 25 sections

1

Foundations

  1. 1.1Vector and matrix norms
  2. 1.2Floating-point arithmetic
  3. 1.3Conditioning and stability
  4. 1.4Backward error analysis
2

Direct Methods

  1. 2.1Gaussian elimination and pivoting
  2. 2.2LU factorisation
  3. 2.3Cholesky factorisation
  4. 2.4Banded and sparse matrices
3

Orthogonal Factorisations

  1. 3.1Householder reflections
  2. 3.2Givens rotations
  3. 3.3QR factorisation
  4. 3.4Least-squares problems
4

Singular Value Decomposition

  1. 4.1Existence and geometry of the SVD
  2. 4.2Low-rank approximation (Eckart–Young)
  3. 4.3Pseudo-inverse
  4. 4.4Applications: compression and PCA
5

Eigenvalue Problems

  1. 5.1Power and inverse iteration
  2. 5.2Rayleigh quotient iteration
  3. 5.3The QR algorithm
  4. 5.4Symmetric eigenproblems
6

Iterative Methods

  1. 6.1Jacobi and Gauss–Seidel
  2. 6.2SOR
  3. 6.3Conjugate gradient
  4. 6.4Krylov subspaces and GMRES
  5. 6.5Preconditioning