Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

QR Factorization and Least Squares

In course

MATH-111(f): Linear Algebra

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications. ...

Description

This lecture covers the factorization QR, where a matrix A can be decomposed into the product of an orthonormal matrix Q and an upper triangular matrix R. The process involves finding an orthonormal basis of the column space of A, ensuring the diagonal elements of R are positive. Additionally, the lecture introduces the least squares method, which aims to find the vector closest to the column space of A when a system of equations has no exact solution. Through examples and the Gram-Schmidt process, the instructor demonstrates how to compute the QR factorization and apply the least squares method to solve such systems.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Mikaël Cavallin

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Matrix decomposition

In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems. In numerical analysis, different decompositions are used to implement efficient matrix algorithms. For instance, when solving a system of linear equations , the matrix A can be decomposed via the LU decomposition.

QR decomposition

In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of an orthonormal matrix Q and an upper triangular matrix R. QR decomposition is often used to solve the linear least squares problem and is the basis for a particular eigenvalue algorithm, the QR algorithm. Any real square matrix A may be decomposed as where Q is an orthogonal matrix (its columns are orthogonal unit vectors meaning ) and R is an upper triangular matrix (also called right triangular matrix).

LU decomposition

In numerical analysis and linear algebra, lower–upper (LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix (see matrix decomposition). The product sometimes includes a permutation matrix as well. LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using LU decomposition, and it is also a key step when inverting a matrix or computing the determinant of a matrix.

Least squares

The method of least squares is a standard approach in regression analysis to approximate the solution of overdetermined systems (sets of equations in which there are more equations than unknowns) by minimizing the sum of the squares of the residuals (a residual being the difference between an observed value and the fitted value provided by a model) made in the results of each individual equation. The most important application is in data fitting.

Orthonormal basis

In mathematics, particularly linear algebra, an orthonormal basis for an inner product space V with finite dimension is a basis for whose vectors are orthonormal, that is, they are all unit vectors and orthogonal to each other. For example, the standard basis for a Euclidean space is an orthonormal basis, where the relevant inner product is the dot product of vectors. The of the standard basis under a rotation or reflection (or any orthogonal transformation) is also orthonormal, and every orthonormal basis for arises in this fashion.

Related lectures (47)

Linear Algebra: Orthogonal Projection and QR Factorization

Explores Gram-Schmidt process, orthogonal projection, QR factorization, and least squares solutions for linear systems.

QR Factorization: Least Squares System Resolution MOOC: Linear Algebra (Part 3)

Covers the QR factorization method applied to solving a system of linear equations in the least squares sense.

QR Factorization MOOC: Linear Algebra (Part 3)

Explains the QR factorization theorem and demonstrates the Gram-Schmidt procedure with an example.

QR Factorization: Orthogonal Bases MOOC: Linear Algebra (Part 3)

Covers the QR factorization of a matrix A into Q and R.

Singular Value Decomposition: Example MOOC: Linear Algebra (Part 3)