Addition requirements for matrix and transposed matrix products

DOI10.1016/0196-6774(88)90026-0MaRDI QIDQ3799563zbMATH OpenOpenAlexFDO

Authors Michael Kaminski, Nader H. Bshouty, David Kirkpatrick

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90026-0

zbMATH Keywords

complexitybilinear algorithmsbilinear formlinear algorithmslinear formsmatrix products

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63)

Recommendations

• The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
• A general transposition method for a matrix on auxiliary store
• The bilinear complexity and practical algorithms for matrix multiplication
• On the Reuse of Additions in Matrix Multiplication
• Fast rectangular matrix multiplication and applications

Cited in

(9)

• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
• Computing Frobenius maps and factoring polynomials
• Subquadratic-time algorithms for normal bases
• Invariant and geometric aspects of algebraic complexity theory. I
• On the additive complexity of 2 \(\times 2\) matrix multiplication
• Subquadratic-time factoring of polynomials over finite fields
• The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
• Fast Fourier Analysis for SL₂over a Finite Field and Related Numerical Experiments

This page was built for publication: Addition requirements for matrix and transposed matrix products

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