Lecture
This lecture covers the Choleski factorisation method for solving linear systems, focusing on symmetric and positive definite matrices. It explains the process of factorising a matrix into a lower triangular matrix with positive diagonal elements, essential for efficient computation. The lecture also discusses the Sylvester criterion for positive definiteness and the importance of reordering matrices to reduce memory occupation.