Sampling and multilevel coarsening algorithms for fast matrix approximations

DOI10.1002/NLA.2234zbMath1463.65096arXiv1711.00439OpenAlexW2963748097WikidataQ128246225 ScholiaQ128246225MaRDI QIDQ5227180

Yousef Saad, Shashanka Ubaru

Publication date: 5 August 2019

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

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

zbMATH Keywords

randomizationmultilevel methodslatent semantic indexinggraph coarseningsubspace iterationfast matrix approximationhypergraph coarseningSVD approximation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Approximation algorithms (68W25) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (1)

Admissible subspaces and the subspace iteration method

Uses Software

• Unnamed Item
• SuiteSparse
• ORL face

This page was built for publication: Sampling and multilevel coarsening algorithms for fast matrix approximations