TOPICS
Search

Complex Matrix


A matrix whose elements may contain complex numbers.

The matrix product of two 2×2 complex matrices is given by

 [x_(11)+y_(11)i x_(12)+y_(12)i; x_(21)+y_(21)i x_(22)+y_(22)i][u_(11)+v_(11)i u_(12)+v_(12)i; u_(21)+v_(21)i u_(22)+v_(22)i]=[R_(11) R_(12); R_(21) R_(22)]+i[I_(11) I_(12); I_(21) I_(22)],
(1)

where

R_(11)=u_(11)x_(11)+u_(21)x_(12)-v_(11)y_(11)-v_(21)y_(12)
(2)
R_(12)=u_(12)x_(11)+u_(22)x_(12)-v_(12)y_(11)-v_(22)y_(12)
(3)
R_(21)=u_(11)x_(21)+u_(21)x_(22)-v_(11)y_(21)-v_(21)y_(22)
(4)
R_(22)=u_(12)x_(21)+u_(22)x_(22)-v_(12)y_(21)-v_(22)y_(22)
(5)
I_(11)=v_(11)x_(11)+v_(21)x_(12)+u_(11)y_(11)+u_(21)y_(12)
(6)
I_(12)=v_(12)x_(11)+v_(22)x_(12)+u_(12)y_(11)+u_(22)y_(12)
(7)
I_(21)=v_(11)x_(21)+v_(21)x_(22)+u_(11)y_(21)+u_(21)y_(22)
(8)
I_(22)=v_(12)x_(21)+v_(22)x_(22)+u_(12)y_(21)+u_(22)y_(22).
(9)

Hadamard (1893) proved that the determinant of any complex n×n matrix A with entries in the closed unit disk |a_(ij)|<=1 satisfies

 |detA|<=n^(n/2)
(10)

(Hadamard's maximum determinant problem), with equality attained by the Vandermonde matrix of the n roots of unity (Faddeev and Sominskii 1965, p. 331; Brenner 1972). The first few values for n=1, 2, ... are 1, 2, 3sqrt(3), 16, 25sqrt(5), 216, ....

EigenvalueDistributions

Studying the maximum possible eigenvalue norms for random complex n×n matrices is computationally intractable. Although average properties of the distribution of |lambda| can be determined, finding the maximum value corresponds to determining if the set of matrices contains a singular matrix, which has been proven to be an NP-complete problem (Poljak and Rohn 1993, Kaltofen 2000). The above plots show the distributions for 2×2, 3×3, and 4×4 matrix eigenvalue norms for elements uniformly distributed inside the unit disk |z|<=1. Similar plots are obtained for elements uniformly distributed inside |R[z]|,|I[z]|<=1. The exact distribution of eigenvalues for complex matrices with both real and imaginary parts distributed as independent standard normal variates is given by Ginibre (1965), Hwang (1986), and Mehta (1991).


See also

Complex Vector, Hadamard's Maximum Determinant Problem, Integer Matrix, k-Matrix, Matrix, Real Matrix

Explore with Wolfram|Alpha

References

Brenner, J. and Cummings, L. "The Hadamard Maximum Determinant Problem." Amer. Math. Monthly 79, 626-630, 1972.Edelman, A. "The Probability that a Random Real Gaussian Matrix has k Real Eigenvalues, Related Distributions, and the Circular Law." J. Multivariate Anal. 60, 203-232, 1997.Faddeev, D. K. and Sominskii, I. S. Problems in Higher Algebra. San Francisco: W. H. Freeman, 1965.Ginibre, J. "Statistical Ensembles of Complex, Quaternion, and Real Matrices." J. Math. Phys. 6, 440-449, 1965.Hadamard, J. "Résolution d'une question relative aux déterminants." Bull. Sci. Math. 17, 30-31, 1893.Hwang, C. R. "A Brief Survey on the Spectral Radius and the Spectral Distribution of Large Random Matrices with i.i.d. Entries." In Random Matrices and Their Applications. Providence, RI: Amer. Math. Soc., pp. 145-152, 1986.Kaltofen, E. "Challenges of Symbolic Computation: My Favorite Open Problems." J. Symb. Comput. 29, 891-919, 2000.Mehta, M. L. Random Matrices, 3rd ed. New York: Academic Press, 2004.Poljak, S. and Rohn, J. "Checking Robust Nonsingularity is NP-Hard." Math. Control Signals Systems 6, 1-9, 1993.

Referenced on Wolfram|Alpha

Complex Matrix

Cite this as:

Weisstein, Eric W. "Complex Matrix." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/ComplexMatrix.html

Subject classifications