A quasi-random approach to matrix spectral analysis

DOI10.4230/LIPICS.ITCS.2018.6MaRDI QIDQ4993269zbMATH OpenFDO

Authors Michael Ben-Or, Lior Eldar

Publication date 15 June 2021

Full work available at URL https://arxiv.org/abs/1505.08126

zbMATH Keywords

eigenvalueseigenvectorslow-discrepancy sequence

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Networks and circuits as models of computation; circuit complexity (68Q06) Parallel algorithms in computer science (68W10) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Randomization and the parallel solution of linear algebra problems
• A randomized homotopy for the Hermitian eigenpair problem
• A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix
• Inverting well conditioned matrices in quantum logspace
• scientific article; zbMATH DE number 702158

Cites work

• Efficient parallel factorization and solution of structured and unstructured linear systems
• Fast linear algebra is stable
• scientific article; zbMATH DE number 4074508 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Inverting well conditioned matrices in quantum logspace
• Multiplying matrices faster than coppersmith-winograd
• Norms and exclusion theorems
• Parallel Complexity of Numerically Accurate Linear System Solvers
• Perturbation bounds for the definite generalized eigenvalue problem
• Practical improvement of the divide-and-conquer eigenvalue algorithms

Cited in

(8)

• A spectral approach to the Randić index
• Hermitian matrix definiteness from quantum phase estimation
• A randomized homotopy for the Hermitian eigenpair problem
• How long does it take to compute the eigenvalues of a random symmetric matrix?
• On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
• scientific article; zbMATH DE number 1347881 (Why is no real title available?)
• An efficient quantum algorithm for spectral estimation
• Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time

This page was built for publication: A quasi-random approach to matrix spectral analysis

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