Square root of a matrix

In mathematics, the square root of a matrix extends the notion of square root from numbers to matrices. A matrix B is said to be a square root of A if the matrix product BB is equal to A. ^[1]

Some authors use the name square root or the notation A^1/2 only for the specific case when A is positive semidefinite, to denote the unique matrix B that is positive semidefinite and such that BB = B^TB = A (for real-valued matrices, where B^T is the transpose of B).

Less frequently, the name square root may be used for any factorization of a positive semidefinite matrix A as B^TB = A, as in the Cholesky factorization, even if BB ≠ A. This distinct meaning is discussed in Positive definite matrix § Decomposition .

Examples

In general, a matrix can have several square roots. In particular, if ${\displaystyle A=B^{2}}$ then ${\displaystyle A=(-B)^{2}}$ as well.

The 2×2 identity matrix ${\displaystyle \textstyle {\begin{pmatrix}1&0\\0&1\end{pmatrix}}}$ has infinitely many square roots. They are given by

${\displaystyle {\begin{pmatrix}\pm 1&0\\0&\pm 1\end{pmatrix}}}$ and ${\displaystyle {\begin{pmatrix}a&b\\c&-a\end{pmatrix}}}$

where ${\displaystyle (a,b,c)}$ are any numbers (real or complex) such that ${\displaystyle a^{2}+bc=1}$. In particular if ${\displaystyle (a,b,t)}$ is any Pythagorean triple—that is, any set of positive integers such that ${\displaystyle a^{2}+b^{2}=t^{2}}$, then ${\displaystyle {\frac {1}{t}}{\begin{pmatrix}a&b\\b&-a\end{pmatrix}}}$ is a square root matrix of ${\displaystyle I}$ which is symmetric and has rational entries. ^[2] Thus

${\displaystyle {\begin{pmatrix}1&0\\0&1\end{pmatrix}}={\begin{pmatrix}0&1\\1&0\end{pmatrix}}^{2}={\begin{pmatrix}{\frac {4}{5}}&{\frac {3}{5}}\\{\frac {3}{5}}&-{\frac {4}{5}}\end{pmatrix}}^{2}.}$

Minus identity has a square root, for example:

${\displaystyle -{\begin{pmatrix}1&0\\0&1\end{pmatrix}}={\begin{pmatrix}0&-1\\1&0\end{pmatrix}}^{2},}$

which can be used to represent the imaginary unit i and hence all complex numbers using 2×2 real matrices, see Matrix representation of complex numbers.

Just as with the real numbers, a real matrix may fail to have a real square root, but have a square root with complex-valued entries. Some matrices have no square root. An example is the matrix ${\displaystyle {\begin{pmatrix}0&1\\0&0\end{pmatrix}}.}$

While the square root of a nonnegative integer is either again an integer or an irrational number, in contrast an integer matrix can have a square root whose entries are rational, yet non-integral, as in examples above.

Positive semidefinite matrices

See also: Positive definite matrix § Decomposition

A symmetric real n × n matrix ${\displaystyle A}$ is called positive semidefinite if ${\displaystyle x^{\textsf {T}}Ax\geq 0}$ for all ${\displaystyle x\in \mathbb {R} ^{n}}$ (here ${\displaystyle x^{\textsf {T}}}$ denotes the transpose, changing a column vector x into a row vector). A square real matrix ${\displaystyle A}$ is positive semidefinite if and only if ${\displaystyle A=B^{\textsf {T}}B}$ for some matrix B. There can be many different such matrices B. A positive semidefinite matrix A can also have many matrices B such that ${\displaystyle A=BB}$. However, A always has precisely one square root B that is positive semidefinite and symmetric. In particular, since B is required to be symmetric, ${\displaystyle B=B^{\textsf {T}}}$, so the two conditions ${\displaystyle A=BB}$ or ${\displaystyle A=B^{\textsf {T}}B}$ are equivalent.

For complex-valued matrices, the conjugate transpose ${\displaystyle B^{*}}$ is used instead and positive semidefinite matrices are Hermitian, meaning ${\displaystyle B^{*}=B}$.

Theorem ^[3]  —  Let A be a positive semidefinite and symmetric matrix (note that A can be positive semidefinite but not symmetric). Then there is exactly one positive semidefinite and symmetric matrix B such that ${\displaystyle A=BB}$. Note that there can be more than one non-symmetric and positive semidefinite matrix ${\displaystyle B}$ such that ${\displaystyle A=B^{T}B}$

This unique matrix is called the principal, non-negative, or positive square root (the latter in the case of positive definite matrices).

The principal square root of a real positive semidefinite matrix is real. ^[3] The principal square root of a positive definite matrix is positive definite; more generally, the rank of the principal square root of A is the same as the rank of A. ^[3]

The operation of taking the principal square root is continuous on this set of matrices. ^[4] These properties are consequences of the holomorphic functional calculus applied to matrices. ^{[5] [6]} The existence and uniqueness of the principal square root can be deduced directly from the Jordan normal form (see below).

Matrices with distinct eigenvalues

An n×n matrix with ndistinct nonzero eigenvalues has 2ⁿ square roots. Such a matrix, A, has an eigendecomposition VDV⁻¹ where V is the matrix whose columns are eigenvectors of A and D is the diagonal matrix whose diagonal elements are the corresponding n eigenvalues λ_i. Thus the square roots of A are given by VD^1/2V⁻¹, where D^1/2 is any square root matrix of D, which, for distinct eigenvalues, must be diagonal with diagonal elements equal to square roots of the diagonal elements of D; since there are two possible choices for a square root of each diagonal element of D, there are 2ⁿ choices for the matrix D^1/2.

This also leads to a proof of the above observation, that a positive-definite matrix has precisely one positive-definite square root: a positive definite matrix has only positive eigenvalues, and each of these eigenvalues has only one positive square root; and since the eigenvalues of the square root matrix are the diagonal elements of D^1/2, for the square root matrix to be itself positive definite necessitates the use of only the unique positive square roots of the original eigenvalues.

Solutions in closed form

See also: Square root of a 2 by 2 matrix

If a matrix is idempotent, meaning ${\displaystyle A^{2}=A}$, then by definition one of its square roots is the matrix itself.

Diagonal and triangular matrices

If D is a diagonal n × n matrix ${\displaystyle D=\operatorname {diag} (\lambda _{1},\dots ,\lambda _{n})}$, then some of its square roots are diagonal matrices ${\displaystyle \operatorname {diag} (\mu _{1},\dots ,\mu _{n})}$, where ${\displaystyle \mu _{i}=\pm {\sqrt {\lambda _{i}}}}$. If the diagonal elements of D are real and non-negative then it is positive semidefinite, and if the square roots are taken with non-negative sign, the resulting matrix is the principal root of D. A diagonal matrix may have additional non-diagonal roots if some entries on the diagonal are equal, as exemplified by the identity matrix above.

If U is an upper triangular matrix (meaning its entries are ${\displaystyle u_{i,j}=0}$ for ${\displaystyle i>j}$) and at most one of its diagonal entries is zero, then one upper triangular solution of the equation ${\displaystyle B^{2}=U}$ can be found as follows. Since the equation ${\displaystyle u_{i,i}=b_{i,i}^{2}}$ should be satisfied, let ${\displaystyle b_{i,i}}$ be the principal square root of the complex number ${\displaystyle u_{i,i}}$. By the assumption ${\displaystyle u_{i,i}\neq 0}$, this guarantees that ${\displaystyle b_{i,i}+b_{j,j}\neq 0}$ for all i,j (because the principal square roots of complex numbers all lie on one half of the complex plane). From the equation

${\displaystyle u_{i,j}=b_{i,i}b_{i,j}+b_{i,i+1}b_{i+1,j}+b_{i,i+2}b_{i+2,j}+\dots +b_{i,j}b_{j,j}}$

we deduce that ${\displaystyle b_{i,j}}$ can be computed recursively for ${\displaystyle j-i}$ increasing from 1 to n-1 as:

${\displaystyle b_{i,j}={\frac {1}{b_{i,i}+b_{j,j}}}\left(u_{i,j}-b_{i,i+1}b_{i+1,j}-b_{i,i+2}b_{i+2,j}-\dots -b_{i,j-1}b_{j-1,j}\right).}$

If U is upper triangular but has multiple zeroes on the diagonal, then a square root might not exist, as exemplified by ${\displaystyle \left({\begin{smallmatrix}0&1\\0&0\end{smallmatrix}}\right)}$. Note the diagonal entries of a triangular matrix are precisely its eigenvalues (see Triangular matrix#Properties).

By diagonalization

An n × n matrix A is diagonalizable if there is a matrix V and a diagonal matrix D such that A = VDV⁻¹. This happens if and only if A has n eigenvectors which constitute a basis for Cⁿ. In this case, V can be chosen to be the matrix with the n eigenvectors as columns, and thus a square root of A is

${\displaystyle R=VSV^{-1}~,}$

where S is any square root of D. Indeed,

${\displaystyle \left(VD^{\frac {1}{2}}V^{-1}\right)^{2}=VD^{\frac {1}{2}}\left(V^{-1}V\right)D^{\frac {1}{2}}V^{-1}=VDV^{-1}=A~.}$

For example, the matrix ${\displaystyle A=\left({\begin{smallmatrix}33&24\\48&57\end{smallmatrix}}\right)}$ can be diagonalized as VDV⁻¹, where

${\displaystyle V={\begin{pmatrix}1&1\\2&-1\end{pmatrix}}}$ and ${\displaystyle D={\begin{pmatrix}81&0\\0&9\end{pmatrix}}}$.

D has principal square root

${\displaystyle D^{\frac {1}{2}}={\begin{pmatrix}9&0\\0&3\end{pmatrix}}}$,

giving the square root

${\displaystyle A^{\frac {1}{2}}=VD^{\frac {1}{2}}V^{-1}={\begin{pmatrix}5&2\\4&7\end{pmatrix}}}$.

When A is symmetric, the diagonalizing matrix V can be made an orthogonal matrix by suitably choosing the eigenvectors (see spectral theorem). Then the inverse of V is simply the transpose, so that

${\displaystyle R=VSV^{\textsf {T}}~.}$

By Schur decomposition

Every complex-valued square matrix ${\displaystyle A}$, regardless of diagonalizability, has a Schur decomposition given by ${\displaystyle A=QUQ^{*}}$ where ${\displaystyle U}$ is upper triangular and ${\displaystyle Q}$ is unitary (meaning ${\displaystyle Q^{*}=Q^{-1}}$). The eigenvalues of ${\displaystyle A}$ are exactly the diagonal entries of ${\displaystyle U}$; if at most one of them is zero, then the following is a square root ^[7]

${\displaystyle A^{\frac {1}{2}}=QU^{\frac {1}{2}}Q^{*}.}$

where a square root ${\displaystyle U^{\frac {1}{2}}}$ of the upper triangular matrix ${\displaystyle U}$ can be found as described above.

If ${\displaystyle A}$ is positive definite, then the eigenvalues are all positive reals, so the chosen diagonal of ${\displaystyle U^{\frac {1}{2}}}$ also consists of positive reals. Hence the eigenvalues of ${\displaystyle QU^{\frac {1}{2}}Q^{*}}$ are positive reals, which means the resulting matrix is the principal root of ${\displaystyle A}$.

By Jordan decomposition

Similarly as for the Schur decomposition, every square matrix ${\displaystyle A}$ can be decomposed as ${\displaystyle A=P^{-1}JP}$ where P is invertible and J is in Jordan normal form.

To see that any complex matrix with positive eigenvalues has a square root of the same form, it suffices to check this for a Jordan block. Any such block has the form λ(I + N) with λ > 0 and N nilpotent. If (1 + z)^1/2 = 1 + a₁z + a₂z² + ⋯ is the binomial expansion for the square root (valid in |z| < 1), then as a formal power series its square equals 1 + z. Substituting N for z, only finitely many terms will be non-zero and S = √λ (I + a₁N + a₂N² + ⋯) gives a square root of the Jordan block with eigenvalue √λ.

It suffices to check uniqueness for a Jordan block with λ = 1. The square constructed above has the form S = I + L where L is polynomial in N without constant term. Any other square root T with positive eigenvalues has the form T = I + M with M nilpotent, commuting with N and hence L. But then 0 = S² − T² = 2(L − M)(I + (L + M)/2). Since L and M commute, the matrix L + M is nilpotent and I + (L + M)/2 is invertible with inverse given by a Neumann series. Hence L = M.

If A is a matrix with positive eigenvalues and minimal polynomial p(t), then the Jordan decomposition into generalized eigenspaces of A can be deduced from the partial fraction expansion of p(t)⁻¹. The corresponding projections onto the generalized eigenspaces are given by real polynomials in A. On each eigenspace, A has the form λ(I + N) as above. The power series expression for the square root on the eigenspace show that the principal square root of A has the form q(A) where q(t) is a polynomial with real coefficients.

Power series

Recall the formal power series ${\textstyle (1-z)^{\frac {1}{2}}=\sum _{n=0}^{\infty }(-1)^{n}{\binom {1/2}{n}}z^{n}}$, which converges provided ${\displaystyle \|z\|\leq 1}$ (since the coefficients of the power series are summable). Plugging in ${\displaystyle z=I-A}$ into this expression yields

${\displaystyle A^{\frac {1}{2}}:=\sum _{n=0}^{\infty }(-1)^{n}{{\frac {1}{2}} \choose n}(I-A)^{n}}$

provided that ${\textstyle \limsup _{n}\|(I-A)^{n}\|^{\frac {1}{n}}<1}$. By virtue of Gelfand formula, that condition is equivalent to the requirement that the spectrum of ${\displaystyle A}$ is contained within the disk ${\displaystyle D(1,1)\subseteq \mathbb {C} }$. This method of defining or computing ${\displaystyle A^{\frac {1}{2}}}$ is especially useful in the case where ${\displaystyle A}$ is positive semi-definite. In that case, we have ${\textstyle \left\|I-{\frac {A}{\|A\|}}\right\|\leq 1}$ and therefore ${\textstyle \left\|\left(I-{\frac {A}{\|A\|}}\right)^{n}\right\|\leq \left\|I-{\frac {A}{\|A\|}}\right\|^{n}\leq 1}$, so that the expression ${\textstyle \|A\|^{\frac {1}{2}}=\left(\sum _{n=0}^{\infty }(-1)^{n}{\binom {1/2}{n}}\left(I-{\frac {A}{\|A\|}}\right)^{n}\right)}$ defines a square root of ${\displaystyle A}$ which moreover turns out to be the unique positive semi-definite root. This method remains valid to define square roots of operators on infinite-dimensional Banach or Hilbert spaces or certain elements of (C*) Banach algebras.

Iterative solutions

By Denman–Beavers iteration

Another way to find the square root of an n × n matrix A is the Denman–Beavers square root iteration. ^[8]

Let Y₀ = A and Z₀ = I, where I is the n × n identity matrix. The iteration is defined by

${\displaystyle {\begin{aligned}Y_{k+1}&={\frac {1}{2}}\left(Y_{k}+Z_{k}^{-1}\right),\\Z_{k+1}&={\frac {1}{2}}\left(Z_{k}+Y_{k}^{-1}\right).\end{aligned}}}$

As this uses a pair of sequences of matrix inverses whose later elements change comparatively little, only the first elements have a high computational cost since the remainder can be computed from earlier elements with only a few passes of a variant of Newton's method for computing inverses,

${\displaystyle X_{n+1}=2X_{n}-X_{n}BX_{n}.}$

With this, for later values of k one would set ${\displaystyle X_{0}=Z_{k-1}^{-1}}$ and ${\displaystyle B=Z_{k},}$ and then use ${\displaystyle Z_{k}^{-1}=X_{n}}$ for some small ${\displaystyle n}$ (perhaps just 1), and similarly for ${\displaystyle Y_{k}^{-1}.}$

Convergence is not guaranteed, even for matrices that do have square roots, but if the process converges, the matrix ${\displaystyle Y_{k}}$ converges quadratically to a square root A^1/2, while ${\displaystyle Z_{k}}$ converges to its inverse, A^−1/2.

By the Babylonian method

Yet another iterative method is obtained by taking the well-known formula of the Babylonian method for computing the square root of a real number, and applying it to matrices. Let X₀ = I, where I is the identity matrix. The iteration is defined by

${\displaystyle X_{k+1}={\frac {1}{2}}\left(X_{k}+AX_{k}^{-1}\right)\,.}$

Again, convergence is not guaranteed, but if the process converges, the matrix ${\displaystyle X_{k}}$ converges quadratically to a square root A^1/2. Compared to Denman–Beavers iteration, an advantage of the Babylonian method is that only one matrix inverse need be computed per iteration step. On the other hand, as Denman–Beavers iteration uses a pair of sequences of matrix inverses whose later elements change comparatively little, only the first elements have a high computational cost since the remainder can be computed from earlier elements with only a few passes of a variant of Newton's method for computing inverses (see Denman–Beavers iteration above); of course, the same approach can be used to get the single sequence of inverses needed for the Babylonian method. However, unlike Denman–Beavers iteration, the Babylonian method is numerically unstable and more likely to fail to converge. ^[1]

The Babylonian method follows from Newton's method for the equation ${\displaystyle X^{2}-A=0}$ and using ${\displaystyle AX_{k}=X_{k}A}$ for all ${\displaystyle k.}$ ^[9]

Square roots of positive operators

In linear algebra and operator theory, given a bounded positive semidefinite operator (a non-negative operator) T on a complex Hilbert space, B is a square root of T if T = B* B, where B* denotes the Hermitian adjoint of B. ^{[ citation needed ]} According to the spectral theorem, the continuous functional calculus can be applied to obtain an operator T^1/2 such that T^1/2 is itself positive and (T^1/2)² = T. The operator T^1/2 is the unique non-negative square root of T. ^{[ citation needed ]}

A bounded non-negative operator on a complex Hilbert space is self adjoint by definition. So T = (T^1/2)* T^1/2. Conversely, it is trivially true that every operator of the form B* B is non-negative. Therefore, an operator T is non-negative if and only if T = B* B for some B (equivalently, T = CC* for some C).

The Cholesky factorization provides another particular example of square root, which should not be confused with the unique non-negative square root.

Unitary freedom of square roots

If T is a non-negative operator on a finite-dimensional Hilbert space, then all square roots of T are related by unitary transformations. More precisely, if T = A*A = B*B, then there exists a unitary U such that A = UB.

Indeed, take B = T^⁠1/2⁠ to be the unique non-negative square root of T. If T is strictly positive, then B is invertible, and so U = AB⁻¹ is unitary:

${\displaystyle {\begin{aligned}U^{*}U&=\left(\left(B^{*}\right)^{-1}A^{*}\right)\left(AB^{-1}\right)=\left(B^{*}\right)^{-1}T\left(B^{-1}\right)\\&=\left(B^{*}\right)^{-1}B^{*}B\left(B^{-1}\right)=I.\end{aligned}}}$

If T is non-negative without being strictly positive, then the inverse of B cannot be defined, but the Moore–Penrose pseudoinverse B⁺ can be. In that case, the operator B⁺A is a partial isometry, that is, a unitary operator from the range of T to itself. This can then be extended to a unitary operator U on the whole space by setting it equal to the identity on the kernel of T. More generally, this is true on an infinite-dimensional Hilbert space if, in addition, T has closed range. In general, if A, B are closed and densely defined operators on a Hilbert space H, and A* A = B* B, then A = UB where U is a partial isometry.

Some applications

Square roots, and the unitary freedom of square roots, have applications throughout functional analysis and linear algebra.

Polar decomposition

Main article: Polar decomposition

If A is an invertible operator on a finite-dimensional Hilbert space, then there is a unique unitary operator U and positive operator P such that

${\displaystyle A=UP;}$

this is the polar decomposition of A. The positive operator P is the unique positive square root of the positive operator A^∗A, and U is defined by U = AP⁻¹.

If A is not invertible, then it still has a polar composition in which P is defined in the same way (and is unique). The unitary operator U is not unique. Rather it is possible to determine a "natural" unitary operator as follows: AP⁺ is a unitary operator from the range of A to itself, which can be extended by the identity on the kernel of A^∗. The resulting unitary operator U then yields the polar decomposition of A.

Kraus operators

Main article: Choi's theorem on completely positive maps

By Choi's result, a linear map

${\displaystyle \Phi :C^{n\times n}\to C^{m\times m}}$

is completely positive if and only if it is of the form

${\displaystyle \Phi (A)=\sum _{i}^{k}V_{i}AV_{i}^{*}}$

where k ≤ nm. Let {E_pq} ⊂ C^{n × n} be the n² elementary matrix units. The positive matrix

${\displaystyle M_{\Phi }=\left(\Phi \left(E_{pq}\right)\right)_{pq}\in C^{nm\times nm}}$

is called the Choi matrix of Φ. The Kraus operators correspond to the, not necessarily square, square roots of M_Φ: For any square root B of M_Φ, one can obtain a family of Kraus operators V_i by undoing the Vec operation to each column b_i of B. Thus all sets of Kraus operators are related by partial isometries.

Mixed ensembles

Main article: Density matrix

In quantum physics, a density matrix for an n-level quantum system is an n × n complex matrix ρ that is positive semidefinite with trace 1. If ρ can be expressed as

${\displaystyle \rho =\sum _{i}p_{i}v_{i}v_{i}^{*}}$

where ${\displaystyle p_{i}>0}$ and Σ p_i = 1, the set

${\displaystyle \left\{p_{i},v_{i}\right\}}$

is said to be an ensemble that describes the mixed state ρ. Notice {v_i} is not required to be orthogonal. Different ensembles describing the state ρ are related by unitary operators, via the square roots of ρ. For instance, suppose

${\displaystyle \rho =\sum _{j}a_{j}a_{j}^{*}.}$

The trace 1 condition means

${\displaystyle \sum _{j}a_{j}^{*}a_{j}=1.}$

Let

${\displaystyle p_{i}=a_{i}^{*}a_{i},}$

and v_i be the normalized a_i. We see that

${\displaystyle \left\{p_{i},v_{i}\right\}}$

gives the mixed state ρ.

See also

• Matrix function
• Holomorphic functional calculus
• Logarithm of a matrix
• Sylvester's formula
• Square root of a 2 by 2 matrix

Notes

1. Higham, Nicholas J. (April 1986), "Newton's Method for the Matrix Square Root" (PDF), Mathematics of Computation , 46 (174): 537–549, doi:10.2307/2007992, JSTOR   2007992
2. Mitchell, Douglas W. (November 2003). "Using Pythagorean triples to generate square roots of ${\displaystyle I_{2}}$". The Mathematical Gazette . 87 (510): 499–500. doi: 10.1017/s0025557200173723 .
3. Horn & Johnson (2013), p. 439, Theorem 7.2.6 with ${\displaystyle k=2}$
4. Horn, Roger A.; Johnson, Charles R. (1990). Matrix analysis. Cambridge: Cambridge Univ. Press. p. 411. ISBN   9780521386326.
5. For analytic functions of matrices, see
   • Higham 2008
   • Horn & Johnson 1994
6. For the holomorphic functional calculus, see:
   • Rudin 1991
   • Bourbaki 2007
   • Conway 1990
7. Deadman, Edvin; Higham, Nicholas J.; Ralha, Rui (2013), "Blocked Schur Algorithms for Computing the Matrix Square Root" (PDF), Applied Parallel and Scientific Computing, Springer Berlin Heidelberg, pp. 171–182, doi:10.1007/978-3-642-36803-5_12, ISBN   978-3-642-36802-8
8. Denman & Beavers 1976; Cheng et al. 2001
9. Higham, Nicholas J. (1997). "Stable iterations for the matrix square root". Numerical Algorithms. 15 (2): 227–242. Bibcode:1997NuAlg..15..227H. doi:10.1023/A:1019150005407.

References

• Bourbaki, Nicolas (2007), Théories spectrales, chapitres 1 et 2, Springer, ISBN   978-3540353317
• Conway, John B. (1990), A Course in Functional Analysis, Graduate Texts in Mathematics, vol. 96, Springer, pp. 199–205, ISBN   978-0387972459 , Chapter IV, Reisz functional calculus
• Cheng, Sheung Hun; Higham, Nicholas J.; Kenney, Charles S.; Laub, Alan J. (2001), "Approximating the Logarithm of a Matrix to Specified Accuracy" (PDF), SIAM Journal on Matrix Analysis and Applications, 22 (4): 1112–1125, CiteSeerX   10.1.1.230.912 , doi:10.1137/S0895479899364015, archived from the original (PDF) on 2011-08-09
• Burleson, Donald R., Computing the square root of a Markov matrix: eigenvalues and the Taylor series
• Denman, Eugene D.; Beavers, Alex N. (1976), "The matrix sign function and computations in systems", Applied Mathematics and Computation, 2 (1): 63–94, doi:10.1016/0096-3003(76)90020-5
• Higham, Nicholas (2008), Functions of Matrices. Theory and Computation, SIAM, ISBN   978-0-89871-646-7
• Horn, Roger A.; Johnson, Charles R. (2013). Matrix Analysis (2nd ed.). Cambridge University Press. ISBN   978-0-521-54823-6.
• Horn, Roger A.; Johnson, Charles R. (1994), Topics in Matrix Analysis, Cambridge University Press, ISBN   978-0521467131
• Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN   978-0-07-054236-5. OCLC   21163277.