Deflation for block eigenvalues of block partitioned matrices with an application to matrix polynomials of commuting matrices (Q5948892): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Deflating Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algebraic Theory of Matrix Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia characteristics of self-adjoint matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:19, 3 June 2024

scientific article; zbMATH DE number 1672134
Language Label Description Also known as
English
Deflation for block eigenvalues of block partitioned matrices with an application to matrix polynomials of commuting matrices
scientific article; zbMATH DE number 1672134

    Statements

    Deflation for block eigenvalues of block partitioned matrices with an application to matrix polynomials of commuting matrices (English)
    0 references
    0 references
    0 references
    12 November 2001
    0 references
    The most immediate generalization of complex polynomials are matrix polynomials where the coefficients and the variable are commuting matrices over \(\mathbb{C}\). In the paper a numerical method of solving the related generalized polynomial algebraic equation is presented. It uses, basically, a block version of the Wielandt deflation procedure, applied to the the block companion matrix of the generalized polynomial in question. The procedure preserves a certain L-shaped structure of the sequence of deflated matrices. In essence, this algorithm extends the computation of a matrix root (called ``solvent'') presented by \textit{J. E. Dennis, J. P. Traub} and \textit{R. P. Weber} [On the matrix polynomial lambda-matrix and block eigenvalue problems, Tech. Rep. 71-109, Computer Science Department, Cornell Univ., Ithaca, NY and Carnegie-Mellon Univ., Pittsburgh, PA (1971)] by providing all of them.
    0 references
    0 references
    matrix polynomials
    0 references
    matrix roots
    0 references
    numerical factorization
    0 references
    block deflation method
    0 references
    polynomials with commuting matrix coefficients
    0 references
    block eigenvalues
    0 references
    block partitioned matrices
    0 references
    Wielandt deflation
    0 references
    algorithm
    0 references