An Efficient Algorithm for Computing the Generalized Null Space Decomposition

DOI10.1137/140956737zbMath1327.65072OpenAlexW2069131920MaRDI QIDQ3453429

Michael L. Overton, G. W. Stewart, Nicola Guglielmi

Publication date: 27 November 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/140956737

zbMATH Keywords

Drazin inverseJordan formgeneralized null spacestaircase algorithms

Mathematics Subject Classification ID

Related Items (13)

The $QR$ Steps with Perfect Shifts ⋮ Pseudospectra of Matrix Pencils for Transient Analysis of Differential-Algebraic Equations ⋮ On the Nearest Singular Matrix Pencil ⋮ Computing the Jordan Structure of an Eigenvalue ⋮ First-Order Perturbation Theory for Eigenvalues and Eigenvectors ⋮ Deflating invariant subspaces for rank structured pencils ⋮ Jordan-Schur algorithms for computing the matrix exponential ⋮ On the convergence rate of DGMRES ⋮ Numerical investigation of Crouzeix's conjecture ⋮ Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study ⋮ The numerical Jordan form ⋮ Differential Equations for Real-Structured Defectivity Measures ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

Uses Software

• mctoolbox

This page was built for publication: An Efficient Algorithm for Computing the Generalized Null Space Decomposition