Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software (Q1815708)

From MaRDI portal





scientific article; zbMATH DE number 946977
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
    scientific article; zbMATH DE number 946977

      Statements

      Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software (English)
      0 references
      0 references
      0 references
      25 March 1997
      0 references
      A regular matrix pair \((A,B)\) and \((A-\lambda B)\) matrix pencils are considered. A pair of deflating subspaces with specified eigenvalues, error bounds of the eigenvalues and eigenspaces, condition estimation are computed using LAPACK software. The direct orthogonal transformation method for reordering eigenvalues in the generalized Schur form is overviewed. Direct reordering algorithms with generalized backward stability are discussed. The solution of a generalized Sylvester equation is involved. Theory and algorithms for computing condition numbers and error bounds for eigenvalues and deflating subspaces of a regular matrix are collected. A FORTRAN 77 software for computing deflating subspaces with specified eigenvalues, condition numbers and error bounds is developed and described. Computational experiments that illustrate the accuracy and reliability of the software are carried out.
      0 references
      complexity
      0 references
      numerical examples
      0 references
      matrix pair
      0 references
      matrix pencils
      0 references
      deflating subspaces
      0 references
      eigenvalues
      0 references
      error bounds
      0 references
      eigenspaces
      0 references
      generalized Schur form
      0 references
      reordering algorithms
      0 references
      backward stability
      0 references
      Sylvester equation
      0 references
      condition numbers
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references