Computing stable eigendecompositions of matrix pencils

From MaRDI portal
Publication:1092607

DOI10.1016/0024-3795(87)90108-XzbMath0627.65032OpenAlexW4205696294MaRDI QIDQ1092607

James W. Demmel, Bo Kågström

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90108-x




Related Items (34)

Linear stability analysis of capillary instabilities for concentric cylindrical shellsComputing stable eigendecompositions of matrix pencilsFirst order spectral perturbation theory of square singular matrix polynomialsOn estimating the separation of two regular matrix pairsBiglobal linear stability analysis for the flow in eccentric annular channels and a related geometryInfinite- and finite-buffer Markov fluid queues: a unified analysisWhere is the nearest non-regular pencil?Pseudospectra of linear matrix pencils by block diagonalizationMethods and algorithms of solving spectral problems for polynomial and rational matricesComputing the Jordan Structure of an EigenvalueGeneric Eigenstructures of Hermitian PencilsEfficient computation of the spectral projections of regular matrix pairsEffective condition numbers and small sample statistical condition estimation for the generalized Sylvester equationFirst order spectral perturbation theory of square singular matrix pencilsNearly optimal scaling in the SR decompositionTrimmed linearizations for structured matrix polynomialsConsistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebraStability of reducing subspacesNumerical Linear Algebra Methods for Linear Differential-Algebraic EquationsAn Algorithm for the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils by Minimal Perturbation ApproachParallel algorithm for solving some spectral problems of linear algebraAnalytical and numerical solutions to higher index linear variable coefficient DAE systemsComputing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and softwareResearch on system zeros: a surveySolving Singular Generalized Eigenvalue Problems by a Rank-Completing PerturbationThe numerical Jordan formHermitian solutions of the equation \(X=Q+NX^{-1}N^*\)Coupled Sylvester-type Matrix Equations and Block DiagonalizationDeveloping the CGLS algorithm for the least squares solutions of the general coupled matrix equationsNumerical methods and questions in the organization of calculus. XII. Transl. from the RussianA Recursive Eigenspace Computation for the Canonical Polyadic DecompositionGuarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank TensorPencils of complex and real symmetric and skew matricesNumerical solution and perturbation theory for generalized Lyapunov equations


Uses Software


Cites Work


This page was built for publication: Computing stable eigendecompositions of matrix pencils