Solvability theory and iteration method for one self-adjoint polynomial matrix equation (Q2336633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solvability theory and iteration method for one self-adjoint polynomial matrix equation |
scientific article; zbMATH DE number 7131783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solvability theory and iteration method for one self-adjoint polynomial matrix equation |
scientific article; zbMATH DE number 7131783 |
Statements
Solvability theory and iteration method for one self-adjoint polynomial matrix equation (English)
0 references
19 November 2019
0 references
Summary: The solvability theory of an important self-adjoint polynomial matrix equation is presented, including the boundary of its Hermitian positive definite (HPD) solution and some sufficient conditions under which the (unique or maximal) HPD solution exists. The algebraic perturbation analysis is also given with respect to the perturbation of coefficient matrices. An efficient general iterative algorithm for the maximal or unique HPD solution is designed and tested by numerical experiments.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8285863399505615
0 references
0.8039127588272095
0 references
0.7900176048278809
0 references
0.7900176048278809
0 references
