An efficient algorithm for computing the generalized null space decomposition

DOI10.1137/140956737MaRDI QIDQ3453429zbMATH OpenOpenAlexFDO

Authors 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 inversegeneralized null spaceJordan formstaircase algorithms

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
• The generalized Schur algorithm and some applications
• Computing the Generalized Singular Value Decomposition
• Computing the Generalized Singular Value Decomposition
• An application of the Dulmage-Mendelsohn decomposition to sparse null space bases of full row rank matrices

Cited in

(20)

• On the convergence rate of DGMRES
• Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
• Numerical investigation of Crouzeix's conjecture
• Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study
• The numerical Jordan form
• Jordan-Schur algorithms for computing the matrix exponential
• A Symbolic Approach to Compute a Null-Space Basis in the Projection Method
• Nested Dissection for Sparse Nullspace Bases
• The Null Space Problem II. Algorithms
• The QR steps with perfect shifts
• Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
• First-order perturbation theory for eigenvalues and eigenvectors
• Differential equations for real-structured defectivity measures
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• On the Nearest Singular Matrix Pencil
• Computing the Jordan structure of an eigenvalue
• A fast randomized algorithm for computing an approximate null space
• Deflating invariant subspaces for rank structured pencils
• Structured linear stability problems
• On the Loewner framework, the Kolmogorov superposition theorem, and the curse of dimensionality

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: An efficient algorithm for computing the generalized null space decomposition

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