Overview
Description
Norms of vectors and matrices, computation of eigenvalues and eigenvectors, matrix transformations, Weierstrass’ approximation theorem, Chebyshev polynomials, best and uniform approximation, splines, approximation in abstract spaces.
Units
Lecture3
Learning Outcomes
- state and prove basic theorems in numerical linear algebra including Schur’s Theorem, quadratic order of convergence of Newton’s methods and the Gershgorin circle theorem.
- demonstrate familiarity common algorithms including the shifted QR algorithm of Francis, the algorithms for computation of matrix norms, Gram Schmidt algorithm, Thomas algorithm and Newton’s divided difference formula.
- recall and define terminology including error, condition number, matrix norm, machine epsilon, unitary matrix, Haar subspace, order of convergence positive definite matrix and stability.
- write practical computer programs.