Explicit solution of the row completion problem for matrix pencils (Q847217): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2009.10.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067564105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix pencils completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity class of a matrix with a prescribed submatrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix pencils completion problems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convexity of polynomial paths and generalized majorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assigning the Kronecker invariants of a matrix pencil by row or column completions / rank
 
Normal rank

Latest revision as of 11:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Explicit solution of the row completion problem for matrix pencils
scientific article

    Statements

    Explicit solution of the row completion problem for matrix pencils (English)
    0 references
    0 references
    12 February 2010
    0 references
    Necessary and sufficient conditions are provided for the existence of a matrix pencil whose strict equivalence (Kronecker) invariants and some of its rows (or columns) are prescribed. This result improves the conditions contained in a previous author's paper, by giving new and explicit necessary and sufficient conditions.
    0 references
    0 references
    0 references
    0 references
    0 references
    matrix pencils
    0 references
    Kronecker invariants
    0 references
    completion
    0 references
    0 references