Abstract
The solvability, either unconditional or under certain conditions, is proved for three matrix completion problems of block type. Being a problem of block type means that a matrixA must be constructed with a prescribed characteristic polynomial and one or several blocks in a 2 × 2 partition also prescribed. For the problems under analysis, one prescribes, respectively, (a) the blockA 12; (b) the blockA 11; (c) the blocksA 11 andA 12. We discuss our experience in implementing the algorithms that solve the problems above as procedures in the symbolic computation system MAPLE.
Key words
matrix inverse eigenvalue problem field of characteristic zero completion problem completely controllable pair computer algebra systems MAPLEPreview
Unable to display preview. Download preview PDF.
References
- 1.Kh. D. Ikramov and V. N. Chugunov, “Matrix completion problems with arbitrary locations of prescribed entries,”Zh. Vychisl. Mat. i Mat. Fiz. [Comput. Math. and Math. Phys.],39, No. 9, 1427–1444 (1999).Google Scholar
- 2.M. Marcus and H. Minc,A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston (1964).MATHGoogle Scholar
- 3.F. R. Gantmakher,Matrix Theory [in Russian], Nauka, Moscow (1966).Google Scholar
- 4.H. K. Wimmer, “Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie,”Monatsh. Math.,78, 256–263 (1974).MATHCrossRefGoogle Scholar
- 5.W. M. Wonham and A. S. Morse, “Decoupling and pole assignment in linear multivariable systems: a geometric approach,”SIAM J. Control,8, 1–18 (1970).MATHCrossRefGoogle Scholar
- 6.Kh. D. Ikramov, “On the pole placement for linear stationary systems,” in:Computational Processes and Systems [in Russian], Vol. 9, Nauka, Moscow (1993), pp. 35–162.Google Scholar
Copyright information
© Kluwer Academic/Plenum Publishers 2000