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

Description

This lecture covers the QR factorization theorem, stating that for a matrix A with linearly independent columns, there exists a factorization A = QR where Q has orthonormal columns forming a basis of the column space of A and R is an upper triangular matrix with strictly positive diagonal coefficients. The Gram-Schmidt procedure is used to transform the columns of A into an orthonormal basis. The lecture demonstrates the algorithm with an example, finding the QR factorization of a given matrix.

In MOOC

Linear Algebra (Part 3)

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

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).

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.

Triangular matrix

In mathematics, a triangular matrix is a special kind of square matrix. A square matrix is called if all the entries above the main diagonal are zero. Similarly, a square matrix is called if all the entries below the main diagonal are zero. Because matrix equations with triangular matrices are easier to solve, they are very important in numerical analysis. By the LU decomposition algorithm, an invertible matrix may be written as the product of a lower triangular matrix L and an upper triangular matrix U if and only if all its leading principal minors are non-zero.

Numerical linear algebra

Numerical linear algebra, sometimes called applied linear algebra, is the study of how matrix operations can be used to create computer algorithms which efficiently and accurately provide approximate answers to questions in continuous mathematics. It is a subfield of numerical analysis, and a type of linear algebra. Computers use floating-point arithmetic and cannot exactly represent irrational data, so when a computer algorithm is applied to a matrix of data, it can sometimes increase the difference between a number stored in the computer and the true number that it is an approximation of.

Schur decomposition

In the mathematical discipline of linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition. It allows one to write an arbitrary complex square matrix as unitarily equivalent to an upper triangular matrix whose diagonal elements are the eigenvalues of the original matrix. The Schur decomposition reads as follows: if A is an n × n square matrix with complex entries, then A can be expressed as where Q is a unitary matrix (so that its inverse Q−1 is also the conjugate transpose Q* of Q), and U is an upper triangular matrix, which is called a Schur form of A.

Related lectures (39)

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

Explains the step-by-step process of finding the singular value decomposition of a matrix.

LU Decomposition Algorithm MOOC: Linear Algebra (Part 1)

Covers the LU decomposition algorithm, transforming a matrix into L and U.

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

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

Linear Algebra: Orthogonal Projection and QR Factorization

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

LU Decomposition: Linear Systems Applications MOOC: Linear Algebra (Part 1)