Cartesian decomposition of an almost definite complex matrix (Q5933440)

A square complex matrix is called almost definite if \(x^*Vx = 0 \Rightarrow Vx = 0\), where \(x\) is a column vector. The square complex matrix \(V\) can be decomposed into two Hermitian matrices corresponding to the real and imaginary parts of \(V\). This decomposition called the Cartesian decomposition is very useful because the verification of the almost definiteness of a Hermitian matrix is easily verified as is shown in this work. NEWLINENEWLINENEWLINESeveral important theorems concerning the check of almost definiteness of an arbitrary square complex matrix are proved. These theorems could be applied to the analysis of a general linear electromechanical system characterized by complex matrices and originally studied by \textit{R. J. Duffin} and \textit{T. D. Morley} [SIAM J. Appl. Math. 35, 21-30 (1978; Zbl 0387.47011)].