Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation

DOI10.1007/BF02252257zbMath0332.68041MaRDI QIDQ1228205

Jakob Spies

Publication date: 1976

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Direct numerical methods for linear systems and matrix inversion (65F05) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

Fast rectangular matrix multiplication and QR decomposition, Generic support of algorithmic and structural recursion for scientific computing1, Bibliography on the evaluation of numerical software

Cites Work

• Unnamed Item
• Gaussian elimination is not optimal
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• On multiplication of 2 \(\times\) 2 matrices
• On the Additive Complexity of Matrix Multiplication
• A New Algorithm for Inner Product
• ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication