Fast and inverse-free algorithms for deflating subspaces

DOI10.1016/J.LAA.2026.01.014MaRDI QIDQ6855018zbMATH OpenFDO

Authors James Demmel, Ioana Dumitriu, Ryan Schneider

Publication date 23 February 2026

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

Full work available at URL https://doi.org/10.1016/J.LAA.2026.01.014

zbMATH Keywords

matrix pencildeflating subspacesmatrix sign functionspectral projectorsrepeated squaringgeneralized Schur decomposition

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix exponential and similar matrix functions (65F60)

Cites work

• scientific article; zbMATH DE number 4211374 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• A new similarity transformation method for eigenvalues and eigenvectors
• Accuracy and Stability of Numerical Algorithms
• An Algorithm for Generalized Matrix Eigenvalue Problems
• An arithmetic for matrix pencils: theory and new algorithms
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• Application of elliptic functions to the problem of functions which vary the least or the most from zero.
• Bounding Zolotarev numbers using Faber rational functions
• Circular dichotomy of the matrix spectrum
• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• Computing eigenspaces with specified eigenvalues of a regular matrix pair (A,B) and condition estimation: Theory, algorithms and software
• Computing invariant subspaces of a regular linear pencil of matrices
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Evaluating products of matrix pencils and collapsing matrix products
• Fast linear algebra is stable
• Fast matrix multiplication is stable
• Gaussian elimination is not optimal
• Guaranteed accuracy in spectral problems of linear algebra. II
• Guaranteed accuracy in spectral proplems of linear algebra. I
• Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
• Matrix multiplication via arithmetic progressions
• Minimizing communication in numerical linear algebra
• Multiplying matrices faster than coppersmith-winograd
• Near-circularity for the rational Zolotarev problem in the complex plane
• On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
• On the Third and Fourth Zolotarev Problems in the Complex Plane
• Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
• Parallel algorithm for solving some spectral problems of linear algebra
• Perturbation theorems for the generalized eigenvalue problem
• Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
• The Littlewood-Offord problem and invertibility of random matrices
• The scaling and squaring method for the matrix exponential revisited

This page was built for publication: Fast and inverse-free algorithms for deflating subspaces

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