Skip to content

Latest commit

 

History

History
22 lines (16 loc) · 701 Bytes

2001-49.md

File metadata and controls

22 lines (16 loc) · 701 Bytes
course course_year question_number tags title year
Numerical Analysis
IB
49
IB
2001
Numerical Analysis
2.II.14E
2001

(a) Let $B$ be an $n \times n$ positive-definite, symmetric matrix. Define the Cholesky factorization of $B$ and prove that it is unique.

(b) Let $A$ be an $m \times n$ matrix, $m \geqslant n$, such that $\operatorname{rank} A=n$. Prove the uniqueness of the "skinny QR factorization"

$$A=Q R,$$

where the matrix $Q$ is $m \times n$ with orthonormal columns, while $R$ is an $n \times n$ upper-triangular matrix with positive diagonal elements.

[Hint: Show that you may choose $R$ as a matrix that features in the Cholesky factorization of $B=A^{T} A$.]