Kolmogorov's complexity for positive definite matrices (Q5957191)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1716573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kolmogorov's complexity for positive definite matrices |
scientific article; zbMATH DE number 1716573 |
Statements
Kolmogorov's complexity for positive definite matrices (English)
0 references
31 October 2002
0 references
Using the complexity for graphs introduced by Kolmogorov, the authors define the complexity of positive definite matrices with respect to a unit vector. They show that the complexity range coincides with the logarithm of the matrix spectrum, the induced order equals to the spectral order, and that this order is stronger than that one induced by the operator entropy. Finally they observe that almost all the obtained results hold for positive operators on a Hilbert space.
0 references
complexity range
0 references
positive definite matrices
0 references
spectral order
0 references
matrix spectrum
0 references
operator entropy
0 references
positive operators
0 references
Hilbert space
0 references
0.7828891277313232
0 references
0.7620997428894043
0 references
0.7407710552215576
0 references
0.7403128147125244
0 references
