linear algebra, a square matrix A {\displaystyle A} is called diagonalizable or non-defective if it is similar to a diagonal matrix. That is, if there exists...
27 KB (4,692 words) - 21:03, 14 April 2025
factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can...
40 KB (5,590 words) - 01:51, 27 February 2025
contradict what is said on simultaneous diagonalization in the article Diagonalizable matrix, which refers to simultaneous diagonalization by a similarity transformation...
50 KB (8,817 words) - 17:28, 20 May 2025
rotation matrices. A method for finding log A for a diagonalizable matrix A is the following: Find the matrix V of eigenvectors of A (each column of V is an...
18 KB (2,982 words) - 14:00, 26 May 2025
there exists a unitary matrix U such that UAU* and UBU* are diagonal matrices. In other words A and B are simultaneously diagonalizable. In this special case...
13 KB (1,665 words) - 01:24, 23 May 2025
where D is a diagonal matrix and V is a suitable invertible matrix. If A can be written in this form, it is called diagonalizable. More generally, and...
117 KB (14,301 words) - 18:18, 18 June 2025
Commuting matrices (redirect from Matrix commutation)
{\displaystyle AB=BA} ) if they are simultaneously diagonalizable (that is, there exists an invertible matrix P {\displaystyle P} such that both P − 1 A P {\displaystyle...
9 KB (1,427 words) - 02:15, 25 May 2025
algebra, a defective matrix is a square matrix that does not have a complete basis of eigenvectors, and is therefore not diagonalizable. In particular, an...
4 KB (576 words) - 21:03, 14 April 2025
∗ {\displaystyle U^{*}U=UU^{*}} ). U is diagonalizable; that is, U is unitarily similar to a diagonal matrix, as a consequence of the spectral theorem...
10 KB (1,331 words) - 16:14, 3 June 2025
matrix B. For example, A is called diagonalizable if it is similar to a diagonal matrix. Not all matrices are diagonalizable, but at least over the complex...
8 KB (1,081 words) - 07:46, 17 June 2025
known as the power method) is an eigenvalue algorithm: given a diagonalizable matrix A {\displaystyle A} , the algorithm will produce a number λ {\displaystyle...
13 KB (2,487 words) - 02:24, 17 June 2025
nilpotent matrix are always zero. Consequently, a nilpotent matrix cannot be invertible. The only nilpotent diagonalizable matrix is the zero matrix. See also:...
10 KB (1,974 words) - 21:06, 14 April 2025
decomposition) of a diagonalizable matrix is a decomposition of a diagonalizable matrix into a specific canonical form whereby the matrix is represented in...
4 KB (515 words) - 04:24, 19 May 2025
P is the minimal polynomial of A. We further assume that A is a diagonalizable matrix. In particular, the roots of P are simple, and the "interpolation"...
55 KB (10,481 words) - 17:15, 27 February 2025
The matrix function f ( X ) {\displaystyle f(\mathbf {X} )} is defined in terms of the scalar function f ( x ) {\displaystyle f(x)} for diagonalizable matrices...
85 KB (7,062 words) - 19:08, 25 May 2025
\in \mathbb {C} ^{n}.} A square matrix A {\displaystyle A} is Hermitian if and only if it is unitarily diagonalizable with real eigenvalues. Hermitian...
20 KB (3,028 words) - 01:11, 26 May 2025
Projection (linear algebra) (section Projection matrix)
vector space of dimension d {\displaystyle d} over a field is a diagonalizable matrix, since its minimal polynomial divides x 2 − x {\displaystyle x^{2}-x}...
34 KB (5,806 words) - 14:46, 17 February 2025
diagonal entries of a matrix. Anti-diagonal matrix Banded matrix Bidiagonal matrix Diagonally dominant matrix Diagonalizable matrix Jordan normal form Multiplication...
17 KB (2,414 words) - 01:49, 15 June 2025
diagonalization procedure. A diagonalizable matrix is similar, in fact, to a special case of Jordan matrix: the matrix whose blocks are all 1 × 1. More...
16 KB (2,805 words) - 03:47, 10 June 2025
general (complex) symmetric matrix may be defective and thus not be diagonalizable. If A {\displaystyle A} is diagonalizable it may be decomposed as A =...
17 KB (2,812 words) - 21:08, 14 April 2025
Spectral theorem (category Matrix theory)
computations involving a diagonalizable matrix can often be reduced to much simpler computations involving the corresponding diagonal matrix. The concept of diagonalization...
25 KB (3,852 words) - 23:00, 22 April 2025
In mathematics, a block matrix or a partitioned matrix is a matrix that is interpreted as having been broken into sections called blocks or submatrices...
31 KB (5,122 words) - 03:49, 2 June 2025
Unipotent (redirect from Unipotent matrix)
quasi-unipotent means that some power is unipotent, for example for a diagonalizable matrix with eigenvalues that are all roots of unity. In the theory of algebraic...
11 KB (1,826 words) - 05:52, 19 May 2025
a complex-valued diagonalizable matrix. In its substance, it states an absolute upper bound for the deviation of one perturbed matrix eigenvalue from a...
9 KB (1,640 words) - 03:06, 20 April 2025
C(p)} is diagonalizable as C ( p ) = V − 1 D V {\displaystyle C(p)=V^{-1}\!DV} , where D is the diagonal matrix and V is the Vandermonde matrix corresponding...
12 KB (2,500 words) - 21:02, 14 April 2025
Gram matrix over the reals is a symmetric matrix, it is diagonalizable and its eigenvalues are non-negative. The diagonalization of the Gram matrix is the...
16 KB (3,167 words) - 12:03, 18 April 2025
skew-Hermitian matrix are all purely imaginary (and possibly zero). Furthermore, skew-Hermitian matrices are normal. Hence they are diagonalizable and their...
6 KB (921 words) - 21:08, 14 April 2025
Scaling in the most general sense is any affine transformation with a diagonalizable matrix. It includes the case that the three directions of scaling are not...
28 KB (3,988 words) - 16:28, 10 March 2025
List of named matrices (redirect from List of matrix)
matrices used in mathematics, science and engineering. A matrix (plural matrices, or less commonly matrixes) is a rectangular array of numbers called entries...
32 KB (1,336 words) - 21:01, 14 April 2025
triangular matrix are precisely its eigenvalues (see Triangular matrix#Properties). An n × n matrix A is diagonalizable if there is a matrix V and a diagonal...
29 KB (4,651 words) - 22:14, 17 March 2025