• In mathematics, a triangular matrix is a special kind of square matrix. A square matrix is called lower triangular if all the entries above the main diagonal...
    21 KB (3,210 words) - 21:23, 18 July 2025
  • } Proposition—A normal triangular matrix is diagonal. Proof Let A be any normal upper triangular matrix. Since ( A ∗ A ) i i = ( A A ∗ ) i...
    13 KB (1,665 words) - 01:24, 23 May 2025
  • Thumbnail for Matrix (mathematics)
    called an upper triangular matrix. Similarly, if all entries of A above the main diagonal are zero, A is called a lower triangular matrix. If all entries...
    128 KB (15,698 words) - 22:28, 31 July 2025
  • the Crout matrix decomposition is an LU decomposition which decomposes a matrix into a lower triangular matrix (L), an upper triangular matrix (U) and,...
    3 KB (363 words) - 17:32, 5 September 2024
  • algebra, a Hessenberg matrix is a special kind of square matrix, one that is "almost" triangular. To be exact, an upper Hessenberg matrix has zero entries...
    11 KB (1,958 words) - 21:04, 14 April 2025
  • of these vectors. A matrix whose elements above the main diagonal are all zero is called a lower triangular matrix, while a matrix whose elements below...
    103 KB (13,663 words) - 21:59, 27 July 2025
  • In mathematics, particularly matrix theory, a band matrix or banded matrix is a sparse matrix whose non-zero entries are confined to a diagonal band, comprising...
    8 KB (1,182 words) - 05:08, 31 July 2025
  • Thumbnail for Square matrix
    diagonal matrix. If all entries below (resp. above) the main diagonal are zero, A {\displaystyle A} is called an upper (resp. lower) triangular matrix. The...
    16 KB (1,834 words) - 23:27, 29 July 2025
  • decomposition. The LU decomposition factorizes a matrix into a lower triangular matrix L and an upper triangular matrix U. The systems L ( U x ) = b {\displaystyle...
    26 KB (3,580 words) - 06:53, 18 July 2025
  • positive definiteness of a symmetric real matrix. Namely, the matrix is reduced to an upper triangular matrix by using elementary row operations, as in...
    50 KB (8,817 words) - 17:28, 20 May 2025
  • QR decomposition (category Matrix decompositions)
    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...
    30 KB (5,100 words) - 15:21, 3 August 2025
  • determinants, and the determinant of a triangular matrix is the product of its diagonal entries. The determinant of a 2 × 2 matrix is | a b c d | = a d − b c ,...
    91 KB (14,413 words) - 00:41, 30 July 2025
  • LU decomposition (category Matrix decompositions)
    factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix (see matrix multiplication and matrix decomposition)...
    54 KB (8,681 words) - 11:27, 29 July 2025
  • triangular Toeplitz matrices and C {\displaystyle C} is a strictly lower triangular matrix. The convolution operation can be constructed as a matrix multiplication...
    15 KB (2,060 words) - 09:17, 25 June 2025
  • In algebra, a triangular matrix ring, also called a triangular ring, is a ring constructed from two rings and a bimodule. If T {\displaystyle T} and U...
    1 KB (154 words) - 00:09, 7 July 2025
  • of a triangular matrix are precisely its eigenvalues (see Triangular matrix#Properties). An n × n matrix A is diagonalizable if there is a matrix V and...
    29 KB (4,651 words) - 22:14, 17 March 2025
  • Thumbnail for Symmetric matrix
    In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, A  is symmetric ⟺ A = A T . {\displaystyle A{\text{...
    17 KB (2,793 words) - 07:03, 4 August 2025
  • Cholesky decomposition (category Matrix decompositions)
    decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for...
    56 KB (8,349 words) - 23:57, 30 July 2025
  • possible for a real or complex matrix to have all real eigenvalues without being Hermitian. For example, a real triangular matrix has its eigenvalues along...
    40 KB (4,870 words) - 04:25, 26 May 2025
  • matrix. Typical examples of matrices that can take advantage of packed storage include: symmetric or hermitian matrix Triangular matrix Banded matrix...
    4 KB (565 words) - 21:06, 14 April 2025
  • Block reflector (category Matrix stubs)
    elementary reflectors. It is also referred to as a triangular factor, and is a triangular matrix and they are used in the Householder transformation...
    2 KB (229 words) - 00:12, 20 June 2025
  • Schur, is a matrix decomposition. It allows one to write an arbitrary complex square matrix as unitarily similar to an upper triangular matrix whose diagonal...
    12 KB (1,494 words) - 16:40, 18 July 2025
  • perturbation theory also leads to matrix eigenvalue problem for degenerate states. Defective matrix Scaling (geometry) Triangular matrix Semisimple operator Diagonalizable...
    27 KB (4,692 words) - 21:03, 14 April 2025
  • Thumbnail for Gram–Schmidt process
    vectors of a full column rank matrix yields the QR decomposition (it is decomposed into an orthogonal and a triangular matrix). The vector projection of...
    26 KB (4,423 words) - 20:07, 19 June 2025
  • perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors in the reverse order...
    27 KB (4,212 words) - 21:33, 16 July 2025
  • Thumbnail for Factorization
    many kinds of matrix factorizations. For example, every matrix has a unique LUP factorization as a product of a lower triangular matrix L with all diagonal...
    42 KB (7,863 words) - 11:34, 1 August 2025
  • Block LU decomposition (category Matrix decompositions)
    decomposition is a matrix decomposition of a block matrix into a lower block triangular matrix L and an upper block triangular matrix U. This decomposition...
    3 KB (647 words) - 16:33, 4 July 2025
  • Thumbnail for Gaussian elimination
    to another row. Using these operations, a matrix can always be transformed into an upper triangular matrix (possibly bordered by rows or columns of zeros)...
    33 KB (4,369 words) - 22:29, 19 June 2025
  • Complete orthogonal decomposition (category Matrix decompositions)
    {\displaystyle T} is a triangular matrix. For a matrix A {\displaystyle A} of rank r {\displaystyle r} , the triangular matrix T {\displaystyle T} can...
    6 KB (764 words) - 15:58, 16 December 2024
  • _{i}{\big (}|a_{ii}|{\big )}}}} recalling that the eigenvalues of any triangular matrix are simply the diagonal entries. The condition number computed with...
    17 KB (2,453 words) - 02:01, 9 July 2025