Perturbation, extraction and refinement of invariant pairs for matrix polynomials (Q541918): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
A polynomial eigenvalue problem can be considered as an extension of the classical linear eigenvalue problem, where the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. The present paper fills this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view the authors investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, they describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of the extraction and refinement procedures.
Property / review text: A polynomial eigenvalue problem can be considered as an extension of the classical linear eigenvalue problem, where the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. The present paper fills this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view the authors investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, they describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of the extraction and refinement procedures. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Andreas Arvanitoyeorgos / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A54 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A18 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5905216 / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial eigenvalue problem
Property / zbMATH Keywords: polynomial eigenvalue problem / rank
 
Normal rank
Property / zbMATH Keywords
 
invariant pairs
Property / zbMATH Keywords: invariant pairs / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
perturbation theory
Property / zbMATH Keywords: perturbation theory / rank
 
Normal rank
Property / zbMATH Keywords
 
extraction
Property / zbMATH Keywords: extraction / rank
 
Normal rank
Property / zbMATH Keywords
 
linearization
Property / zbMATH Keywords: linearization / rank
 
Normal rank
Property / zbMATH Keywords
 
matrix polynomial
Property / zbMATH Keywords: matrix polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
refinement
Property / zbMATH Keywords: refinement / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical experiments
Property / zbMATH Keywords: numerical experiments / rank
 
Normal rank

Revision as of 11:26, 1 July 2023

scientific article
Language Label Description Also known as
English
Perturbation, extraction and refinement of invariant pairs for matrix polynomials
scientific article

    Statements

    Perturbation, extraction and refinement of invariant pairs for matrix polynomials (English)
    0 references
    0 references
    0 references
    8 June 2011
    0 references
    A polynomial eigenvalue problem can be considered as an extension of the classical linear eigenvalue problem, where the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. The present paper fills this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view the authors investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, they describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of the extraction and refinement procedures.
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial eigenvalue problem
    0 references
    invariant pairs
    0 references
    algorithm
    0 references
    perturbation theory
    0 references
    extraction
    0 references
    linearization
    0 references
    matrix polynomial
    0 references
    refinement
    0 references
    numerical experiments
    0 references