Efficient similarity factorization of rank-1 modifications

DOI10.1002/PAMM.200510371MaRDI QIDQ3177130zbMATHOpenAlexWikidataFDO

Authors Sebastian Schlenkrich, Andreas Griewank, Andrea Walther

Publication date 26 July 2018

Published in PAMM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/pamm.200510371

Mathematics Subject Classification ID

Numerical methods for stiff equations (65L04)

Recommendations

• scientific article; zbMATH DE number 3999146
• Fast, memory-efficient low-rank approximation of SimRank
• scientific article; zbMATH DE number 6125202
• An efficient method for computing factor similarity coefficients: a computational note and an algorithm
• scientific article; zbMATH DE number 5870325
• Similarity preserving low-rank representation for enhanced data representation and effective subspace learning

Cited in

(1)

• Improving the efficiency of matrix operations in the numerical solution of large implicit systems of linear differential equations

This page was built for publication: Efficient similarity factorization of rank-1 modifications

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