Q-R decomposition with positive diagonals of R Matrix

Q-R decomposition with positive diagonals for a square random matrix
238 descargas
Actualizado 24 Feb 2015

Ver licencia

In linear algebra, a QR decomposition (also called a QR factorization) of a matrix is a decomposition of a matrix A into a product A = QR of an orthogonal 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 eigen value algorithm, the QR algorithm. If A has n linearly independent columns, then the first n columns of Q form an orthonormal basis for the column space of A. More specifically, the first k columns of Q form an orthonormal basis for the span of the first k columns of A for any 1 ≤ k ≤ n. The fact that any column k of A only depends on the first k columns of Q is responsible for the triangular form of R.

Citar como

Gnaneswar Nadh satapathi (2024). Q-R decomposition with positive diagonals of R Matrix (https://www.mathworks.com/matlabcentral/fileexchange/49807-q-r-decomposition-with-positive-diagonals-of-r-matrix), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2006b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Linear Algebra en Help Center y MATLAB Answers.
Etiquetas Añadir etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Versión Publicado Notas de la versión
1.2.0.0

Q-R decomposition for random matrix with positive diagonal elements

1.1.0.0

Positive diagonals of R matrix for a random input matrix

1.0.0.0