Cartesian decomposition of an almost definite complex matrix
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. Several 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)].
- A note on biquadratic forms
- Almost Definite Operators and Electro-mechanical Systems
- Generalized Schur complements
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3518951 (Why is no real title available?)
- scientific article; zbMATH DE number 3565979 (Why is no real title available?)
- On parallel summability of matrices
- Positive semidefinite biquadratic forms
- Pseudoinverss of Postive Semidefeinite Matrices
- Subalgebras of C^ *-algebras
- The Fundamental Bordered Matrix of Linear Estimation and the Duffin-Morley General Linear Electromechanical Systems
- The regular shorted matrix and the hybrid sum
This page was built for publication: Cartesian decomposition of an almost definite complex matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933440)