Efficient computation of the spectral projections of regular matrix pairs

DOI10.1016/j.cam.2015.11.035zbMath1332.65060OpenAlexW2192771815MaRDI QIDQ908371

Roger B. Sidje, Miloud Sadkane

Publication date: 4 February 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2015.11.035

zbMATH Keywords

spectral projectionnumerical comparisonsSchur decompositiongeneralized Sylvester equationgeneralized Schur formreordering of eigenvaluesspectral dichotomy

Mathematics Subject Classification ID

Related Items (1)

Lyapunov-based stability of delayed linear differential algebraic systems

Uses Software

• specdicho

Cites Work

• Computing stable eigendecompositions of matrix pencils
• On estimating the condition of eigenvalues and eigenvectors
• Problem of the dichotomy of the spectrum of a matrix
• Parallel algorithm for solving some spectral problems of linear algebra
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
• Some new algorithms for the spectral dichotomy methods
• Algorithm 918
• Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
• On Parabolic and Elliptic Spectral Dichotomy
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient computation of the spectral projections of regular matrix pairs