Fast construction of hierarchical matrix representation from matrix-vector multiplication

From MaRDI portal
Publication:544585

DOI10.1016/J.JCP.2011.02.033zbMATH Open1218.65038arXiv1001.0149OpenAlexW2169370352MaRDI QIDQ544585FDOQ544585


Authors: Lexing Ying, Lin Lin, Jianfeng Lu Edit this on Wikidata


Publication date: 15 June 2011

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses mathcalO(logn) applications of the matrix on structured random test vectors and mathcalO(nlogn) extra computational cost, where n is the dimension of the unknown matrix. Numerical examples on constructing Green's functions for elliptic operators in two dimensions show efficiency and accuracy of the proposed algorithm.


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




Recommendations




Cites Work


Cited In (53)





This page was built for publication: Fast construction of hierarchical matrix representation from matrix-vector multiplication

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