Fast Estimation of Approximate Matrix Ranks Using Spectral Densities | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Fast Estimation of Approximate Matrix Ranks Using Spectral Densities

Neural Computation (2017) 29 (5): 1317–1351.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Fast randomized numerical rank estimation for numerically low-rank matrices

Maike Meier
Yuji Nakatsukasa

Linear Algebra and its Applications (2024) 686: 1.

Towards quantum advantage via topological data analysis

Casper Gyurik
Chris Cade
Vedran Dunjko

Quantum (2022) 6: 855.

Spectrum-Adapted Polynomial Approximation for Matrix Functions with Applications in Graph Signal Processing

Tiffany Fan
David I. Shuman
Shashanka Ubaru
Yousef Saad

Algorithms (2020) 13 (11): 295.

Sampling and multilevel coarsening algorithms for fast matrix approximations

Shashanka Ubaru
Yousef Saad

Numerical Linear Algebra with Applications (2019) 26 (3)

Using Low-Rank Approximations to Speed Up Kernel Logistic Regression Algorithm

Dajiang Lei
Jianyang Tang
Zhixing Li
Yu Wu

IEEE Access (2019) 7: 84242.

Distributed Signal Processing via Chebyshev Polynomial Approximation

David I Shuman
Pierre Vandergheynst
Daniel Kressner
Pascal Frossard

IEEE Transactions on Signal and Information Processing over Networks (2018) 4 (4): 736.

Low rank approximation and decomposition of large matrices using error correcting codes

Shashanka Ubaru
Arya Mazumdar
Yousef Saad

IEEE Transactions on Information Theory 1.

Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature

Shashanka Ubaru
Jie Chen
Yousef Saad

SIAM Journal on Matrix Analysis and Applications (2017) 38 (4): 1075.