An upper bound for the Z-spectral radius of adjacency tensors. [PDF]
J Inequal Appl, 2018 Wu ZY, He J, Liu YM, Tian JK.
europepmc +1 more source
An Evaluation of Software for Computing Eigenvalues of Sparse Nonsymmetric Matrices
The past few years have seen a significant increase in research into numerical methods for computing selected eigenvalues of large sparse nonsymmetric matrices. This research has begun to lead to the development of high-quality mathematical software. The
Lehoucq Scott +2 more
core
Structured Backward Error And Condition Of Generalized Eigenvalue Problems
, 1996 . Backward errors and condition numbers are defined and evaluated for eigenvalues and eigenvectors of generalized eigenvalue problems. Both normwise and componentwise measures are used.
Nicholas +2 more
core
Bounds for the Z-spectral radius of nonnegative tensors. [PDF]
Springerplus, 2016 He J, Liu YM, Ke H, Tian JK, Li X.
europepmc +1 more source
Infinite Eigenvalues and the QZ Algorithm
, 1999 The implicitly shifted (bulge chasing ) QZ algorithm is the most popular method for solving the generalized eigenvalue problem Av = Bv. This paper explains why the QZ algorithm functions well even in the presence of infinite eigenvalues. The key to rapid
David S. Watkins, Preprint Sfb
core
New inclusion sets for singular values. [PDF]
J Inequal Appl, 2017 He J, Liu YM, Tian JK, Ren ZR.
europepmc +1 more source
An Overview Of Relative sin Theta Theorems For Invariant Subspaces Of Complex Matrices
, 2007 . Relative perturbation bounds for invariant subspaces of complex matrices are reviewed, with emphasis on bounding the sines of the largest principal angle between two subspaces, i.e. sin \Theta theorems.
Ilse C. F. Ipsen
core
RADI: a low-rank ADI-type algorithm for large scale algebraic Riccati equations. [PDF]
Numer Math (Heidelb), 2018 Benner P +3 more
europepmc +1 more source
If A Matrix Has Only A Single Eigenvalue How Sensitive Is This Eigenvalue?
, 1997 . For matrices with a single eigenvalue we analyse the sensitivity of the eigenvalue to perturbations in the matrix. We derive a closed form result that is similar in spirit to an analytical result by Lidskii; improve a bound by Henrici; and express the ...
Grace E. Cho, Ilse C.F. Ipsen
core
Randomized algorithms for distributed computation of principal component analysis and singular value decomposition. [PDF]
Adv Comput Math, 2018 Li H, Kluger Y, Tygert M.
europepmc +1 more source