Fetching the paper…
Reading the bibliography…
This paper explores a key question in numerical linear algebra: how can we compute projectors onto the deflating subspaces of a regular matrix pencil $(A,B)$, in particular without using matrix inversion or defaulting to an expensive Schur decomposition? We focus specifically on spectral projectors, whose associated deflating subspaces correspond to sets of eigenvalues/eigenvectors.
Gaussian elimination is not optimal
V. Strassen · 1969
Earlier work this paper cites.
On the Sensitivity of the Eigenvalue Problem A x = λ B x {A}x=\lambda{B}x
G. W. Stewart · 1972
Earlier work this paper cites.
An algorithm for generalized matrix eigenvalue problems
C. B. Moler and G. W. Stewart · 1973
Earlier work this paper cites.
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
G. W. Stewart · 1973
Earlier work this paper cites.
A new similarity transformation method for eigenvalues and eigenvectors
A. Beavers and E. Denman · 1974
Earlier work this paper cites.
The generalized eigenvalue problem in quantum chemistry
B. Ford and G. Hall · 1974
Earlier work this paper cites.
Linear model reduction and solution of the algebraic Riccati equation by use of the sign function
J. D. Roberts · 1980
Earlier work this paper cites.
Perturbation theorems for the generalized eigenvalue problem
L. Elsner and J. Sun · 1982
Earlier work this paper cites.
A generalization of the matrix-sign-function solution for algebraic Riccati equations
J. D. Gardiner and A. J. Laub · 1986
Earlier work this paper cites.
Circular dichotomy of the spectrum of a matrix
A. Y. Bulgakov and S. Godunov · 1988
Earlier work this paper cites.
Computing invariant subspaces of a regular linear pencil of matrices
A. N. Malyshev · 1989
Earlier work this paper cites.
Matrix multiplication via arithmetic progressions
D. Coppersmith and S. Winograd · 1990
Earlier work this paper cites.
Guaranteed accuracy in spectral problems of linear algebra
A. N. Malyshev · 1990
Earlier work this paper cites.
Matrix Perturbation Theory
G. W. Stewart and J. Sun · 1990
Earlier work this paper cites.
Perturbation bounds for the Cholesky and QR factorizations
J.-G. Sun · 1991
Earlier work this paper cites.
Guaranteed accuracy in spectral problems of linear algebra. I
A. N. Malyshev · 1992
Cited alongside, same era.
Guaranteed accuracy in spectral problems of linear algebra. II
A. N. Malyshev · 1992
Cited alongside, same era.
The generalized Schur decomposition of an arbitrary pencil A – λ B {A}–\lambda{B} — robust software with error bounds and applications. Part I: theory and algorithms
J. Demmel and B. Kågström · 1993
Cited alongside, same era.
The generalized Schur decomposition of an arbitrary pencil A – λ B {A}–\lambda{B} — robust software with error bounds and applications. Part II: software and applications
J. Demmel and B. Kågström · 1993
Cited alongside, same era.
Parallel algorithm for solving some spectral problems of linear algebra
A. N. Malyshev · 1993
Cited alongside, same era.
The scaling and squaring method for the matrix exponential revisited
N. J. Higham · 2009
Later among the works it cites.
Optimizing Halley’s Iteration for Computing the Matrix Polar Decomposition
Y. Nakatsukasa, Z. Bai, and F. Gygi · 2010
Later among the works it cites.
Minimizing Communication for Eigenproblems and the Singular Value Decomposition
G. Ballard, J. Demmel, and I. Dumitriu · 2011
Later among the works it cites.
Minimizing Communication in Numerical Linear Algebra
G. Ballard, J. Demmel, O. Holtz, and O. Schwartz · 2011
Later among the works it cites.
Multiplying Matrices Faster than Coppersmith-Winograd
V. V. Williams · 2012
Later among the works it cites.
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev’s Functions
Y. Nakatsukasa and R. W. Freund · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Spectral portraits for matrix pencils
V. Frayssé, M. Gueury, F. Nicoud, and V. Toumazou · 1996
Cited alongside, same era.
Computing Eigenspaces with Specified Eigenvalues of a Regular Matrix Pair ( A , B ) ({A},{B}) and Condition Estimation: Theory, Algorithms and Software
B. Kågström and P. Poromaa · 1996
Cited alongside, same era.
An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
Z. Bai, J. Demmel, and M. Gu · 1997
Cited alongside, same era.
Evaluating products of matrix pencils and collapsing matrix products
P. Benner and R. Byers · 2001
Cited alongside, same era.
Accuracy and Stability of Numerical Algorithms
N. J. Higham · 2002
Cited alongside, same era.
A matrix analytical method for the discrete time Lindley equation using the generalized Schur decomposition
N. Akar · 2006
Cited alongside, same era.
An arithmetic for matrix pencils: Theory and new algorithms
P. Benner and R. Byers · 2006
Cited alongside, same era.
Later among the works it cites.
The AAA Algorithm for Rational Approximation
Y. Nakatsukasa, O. Sète, and L. N. Trefethen · 2018
Later among the works it cites.
A generalized randomized rank-revealing factorization
G. Ballard, J. Demmel, I. Dumitriu, and A. Rusciano · 2019
Later among the works it cites.
Canonical Polyadic Decomposition via the Generalized Schur Decomposition
E. Evert, M. Vandecappelle, and L. De Lathauwer · 2022
Later among the works it cites.
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time
J. Banks, J. Garza-Vargas, A. Kulkarni, and N. Srivastava · 2023
Closest in time.
Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization
J. Demmel, I. Dumitriu, and R. Schneider · 2023
Closest in time.
New bounds for matrix multiplication: from alpha to omega
V. V. Williams, Y. Xu, Z. Xu, and R. Zhou · 2023
Closest in time.
Pseudospectral Divide-and-Conquer for the Generalized Eigenvalue Problem
R. Schneider · 2024
Closest in time.
Fast Hermitian Diagonalization with Nearly Optimal Precision
R. Shah · 2024
Closest in time.
Invariant subspaces and PCA in nearly matrix multiplication time
A. Sobczyk, M. Mladenović, and M. Luisier · 2024
Closest in time.