Efficient method for computing double matrix products

DOI10.1007/BF01183772MaRDI QIDQ808176zbMATH OpenOpenAlexFDO

Authors David R. O'Hallaron, Charles M. Fiduccia

Publication date 1991

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01183772

zbMATH Keywords

Kalman filtersparse matricescomplexitydouble matrix productsreal time computationssparse matrix multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Filtering in stochastic control theory (93E11)

Recommendations

• scientific article; zbMATH DE number 1083122
• Simple sparse matrix multiplication algorithm
• A matrix extension of Winograd's inner product algorithm
• Algorithm 993: Efficient computation with Kronecker products
• A streaming approach for sparse matrix products and its application in Galerkin multigrid methods

This page was built for publication: Efficient method for computing double matrix products

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