Matrix compression by common subexpression elimination

DOI10.1016/J.JCP.2013.03.042MaRDI QIDQ347831zbMATH OpenOpenAlexFDO

Authors Tomas Oppelstrup

Publication date 5 December 2016

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

Full work available at URL http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-11566

zbMATH Keywords

matrix compressionblack box optimizationcommon subexpression elimination

Mathematics Subject Classification ID

Recommendations

• How to multiply a matrix of normal equations by an arbitrary vector using FFT
• On the fast matrix multiplication in the boundary element method by panel clustering
• Extra High Speed Matrix Multiplication on the Cray-2
• How Can We Speed Up Matrix Multiplication?
• Monte Carlo matrix computations based on compression

Cites work

• scientific article; zbMATH DE number 46317 (Why is no real title available?)
• A Generalized Fast Multipole Method for Nonoscillatory Kernels
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Matrix compression by common subexpression elimination

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