Principal minors. II: The principal minor assignment problem (Q854863): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2006.04.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2141982996 / rank | |||
Normal rank | |||
Latest revision as of 09:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Principal minors. II: The principal minor assignment problem |
scientific article |
Statements
Principal minors. II: The principal minor assignment problem (English)
0 references
7 December 2006
0 references
The inverse problem of finding \(n\times n\) matrix \(A\) having prescribed principal minors is solved using a constructive algorithm based on a method already proposed by the same authors [\textit{K. Griffin, M. J. Tsatsomeros}, in part I [ibid. 419, No.~1, 107--124 (2006; reviewed above)]. The method computes all the principal minors of a matrix recursively by means of Schur complements, in a very efficient way. The listing of the complete MATLAB program takes 17 pages, but source codes are available for download on the web. Issues of numerical stability and accuracy are treated carefully in the program.
0 references
Principal submatrix
0 references
Inverse eigenvalue problem
0 references
Schur complement
0 references
prescribed principal minors
0 references
MATLAB program
0 references
numerical stability
0 references
