Login / Signup
Fast computation of error bounds for all eigenpairs of a Hermitian and all singular pairs of a rectangular matrix with emphasis on eigen- and singular value clusters.
Siegfried M. Rump
Marko Lange
Published in:
J. Comput. Appl. Math. (2023)
Keyphrases
</>
singular values
error bounds
singular value decomposition
theoretical analysis
arbitrary shaped
clustering algorithm
low rank
worst case
singular vectors
pairwise
least squares
fundamental matrix
data sets
input data
convex optimization
small number
pattern recognition
low rank approximation