A straightforward proof of the polynomial factorization of a positive semi-definite polynomial matrix (Q2249734): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2014.02.013 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2086519601 / rank | |||
Normal rank |
Revision as of 19:38, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A straightforward proof of the polynomial factorization of a positive semi-definite polynomial matrix |
scientific article |
Statements
A straightforward proof of the polynomial factorization of a positive semi-definite polynomial matrix (English)
0 references
3 July 2014
0 references
A polynomial matrix \(P(x)=\sum_{i=1}^nP_ix^i\), where \(P_i\in\mathbb{C}^{n\times n}\), is called semidefinite if \(P(x)=P^*(x)\) and \(v^*P(x)v\) is non-negative for every \(x\in\mathbb{R}\) and \(v\in \mathbb{C}^n\). It is a well-known theorem that every positive semidefinite polynomial matrices with complex (real) coefficients can be written as a product of a polynomial matrix with complex (real) coefficients and its conjugate transpose. The author of this paper presents an elementary proof of this theorem. The complex case is proved first and the real case is concluded from the complex one.
0 references
polynomial semidefinite matrix
0 references
polynomial factorization
0 references