Generalized subspace iteration method for solving matrix pair eigenproblem

DOI10.22124/JMM.2019.13944.1297MaRDI QIDQ5212573zbMATH OpenOpenAlexFDO

Authors A. Kanber, Kamal Lachhab, Abdeslem H. Bentbib

Publication date 29 January 2020

Full work available at URL https://jmm.guilan.ac.ir/article_3574_0141f64dd2738f765c7053c4fc9f0630.pdf

zbMATH Keywords

matrix pencilgeneralized eigenvaluesgeneralized QR-Francisgeneralized subspace iteration method

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix pencils (15A22)

Recommendations

• A new inexact inverse subspace iteration for generalized eigenvalue problems
• A method for computing a few eigenpairs of large generalized eigenvalue problems
• Inexact inverse subspace iteration for generalized eigenvalue problems
• Subspace iteration method for generalized singular values
• A variant of the subspace iteration algorithm for generalized eigenproblems

Cites work

• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Balancing the Generalized Eigenvalue Problem
• Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form
• Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation
• Generalized eigenvalue problems with specified eigenvalues
• Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices
• Some Thoughts on the QZ Algorithm for Solving the Generalized Eigenvalue Problem
• Structured Eigenvalue Problems
• Subspace iteration method for generalized singular values
• The Combination Shift QZ Algorithm

Cited in

(5)

• scientific article; zbMATH DE number 1193040 (Why is no real title available?)
• Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
• Efficient computation of dominant eigenvalues using adaptive block Lanczos with Chebyshev filtering
• Subspace iteration method for generalized singular values
• Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)

This page was built for publication: Generalized subspace iteration method for solving matrix pair eigenproblem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212573)