Completions of partial Jordan and Hessenberg matrices (Q1344066): 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/0024-3795(94)90406-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095508608 / rank | |||
Normal rank | |||
Revision as of 23:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completions of partial Jordan and Hessenberg matrices |
scientific article |
Statements
Completions of partial Jordan and Hessenberg matrices (English)
0 references
9 February 1995
0 references
A matrix completion problem is a problem of finding all completions of a given partial matrix with specific properties. This paper studies specifically the completion of partial Jordan matrices. An algorithm is given for constructing completions of a given partial Jordan matrix having prescribed eigenvalues and multiplicities. The most interesting aspect of the paper is the graph-theoretic interpretation given to the completion algorithm. As an extension, the completions of the partial Hessenberg matrices are also discussed.
0 references
matrix graph
0 references
matrix completion
0 references
partial matrix
0 references
Jordan matrices
0 references
prescribed eigenvalues
0 references
completion algorithm
0 references
Hessenberg matrices
0 references
