Fast multiplication and sparse structures

DOI10.1023/B:PACS.0000021269.20049.0FMaRDI QIDQ557527zbMATH OpenOpenAlexFDO

Authors E. S. Satina, Gennadi I. Malaschonok

Publication date 30 June 2005

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:pacs.0000021269.20049.0f

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Algorithms – ESA 2004
• Fast sparse matrix multiplication
• On optimizing multiplications of sparse matrices
• Processor-efficient sparse matrix-vector multiplication
• Nearly Optimal Sparse Polynomial Multiplication
• Essentially optimal sparse polynomial multiplication
• Cache friendly sparse matrix-vector multiplication
• scientific article; zbMATH DE number 1953307
• Efficient computation of sparse structures
• Fast simultaneous scalar multiplication

Cited in

(10)

• Dense polynomial multiplication with reduced array manipulation overhead
• On the bit-complexity of sparse polynomial and series multiplication
• On the choice of a multiplication algorithm for polynomials and polynomial matrices
• Fast sparse matrix multiplication
• Efficient representation scheme for multidimensional array operations
• On optimizing multiplications of sparse matrices
• Nearly Optimal Sparse Polynomial Multiplication
• Algorithms – ESA 2004
• Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve
• Fast multiplication algorithm for square sparse matrices. Application toimages processing

This page was built for publication: Fast multiplication and sparse structures

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