Optimization techniques for small matrix multiplication

No abstract is available for this paper.

• Publication year

  2011

• Venue

  ACCA

• Publication date

  2011-01-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/1940475.1940488
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Products of ordinary differential operators by evaluation and interpolation

  2008cited by this paper
• Adaptive Strassen's matrix multiplication

  2007cited by this paper
• Beyond the Alder-Strassen bound

  2005cited by this paper
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication

  2004cited by this paper
• Complexity results for triangular sets

  2003cited by this paper
• On the complexity of the multiplication of matrices of small formats

  2003cited by this paper
• FFT-like Multiplication of Linear Differential Operators

  2002cited by this paper
• New trends in high performance computing

  2001cited by this paper
• Algebraic complexity theory

  1997cited by this paper
• The Magma Algebra System I: The User Language

  1997cited by this paper
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants

  1994cited by this paper
• On practical algorithms for accelerated matrix multiplication

  1992cited by this paper
• Algebraic Complexity Theory

  1991cited by this paper
• Computers in Mathematics

  1991cited by this paper
• Degeneration and complexity of bilinear maps: Some asymptotic spectra.

  1991cited by this paper
• The asymptotic spectrum of tensors.

  1988cited by this paper
• A non-commutative algorithm for multiplying 5×5 matrices using one hundred multiplications

  1988cited by this paper
• Matrix multiplication via arithmetic progressions

  1987cited by this paper
• An algorithm for multiplying 3 x 3 matrics

  1987cited by this paper
• Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication

  1986cited by this paper
• How can we speed up matrix multiplication

  1984cited by this paper
• How to Multiply Matrices Faster

  1984influential reference
• Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication

  1982cited by this paper
• Partial and Total Matrix Multiplication

  1981cited by this paper
• Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants

  1980cited by this paper
• New Fast Algorithms for Matrix Operations

  1980cited by this paper
• A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications

  1978cited by this paper
• A Fast Non-Commutative Algorithm for Matrix Multiplication

  1977cited by this paper
• A noncommutative algorithm for multiplying $3 \times 3$ matrices using 23 multiplications

  1976cited by this paper
• Duality applied to the complexity of matrix multiplications and other bilinear forms

  1973cited by this paper
• On the algebraic complexity of inner product

  1971cited by this paper
• On multiplication of 2 × 2 matrices

  1971cited by this paper
• On Winograd's Algorithm for Inner Products

  1970cited by this paper
• Algorithms for matrix multiplication

  1970cited by this paper
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

  1969cited by this paper
• Gaussian elimination is not optimal

  1969cited by this paper
• A New Algorithm for Inner Product

  1968cited by this paper
• Journal für die reine und angewandte Mathematik

  year unknowncited by this paper

• Complex to Rational Fast Matrix Multiplication

  2026cites this paper
• Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation

  2025influential citation
• Exploring the Meta Flip Graph for Matrix Multiplication

  2025cites this paper
• XXt Can Be Faster

  2025cites this paper
• Strassen's algorithm via orbit flip graphs

  2025cites this paper
• Flip Graphs with Symmetry and New Matrix Multiplication Schemes

  2025cites this paper
• Exploring Commutative Matrix Multiplication Schemes via Flip Graphs

  2025cites this paper
• A Machine Learning Approach Towards Runtime Optimisation of Matrix Multiplication

  2023cites this paper
• Fast Commutative Matrix Algorithms

  2022cites this paper
• Discovering faster matrix multiplication algorithms with reinforcement learning

  2022cites this paper
• The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89

  2021influential citation
• Coded Computing for Resilient, Secure, and Privacy-Preserving Distributed Matrix Multiplication

  2021cites this paper
• Fast Machine Learning in Data Science with a Comprehensive Data Summarization

  2021cites this paper
• Improved Private and Secure Distributed (Batch) Matrix Multiplication

  2021cites this paper
• Characterization of Decomposition of Matrix Multiplication Tensors

  2021cites this paper
• Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier

  2020cites this paper
• Batched Small Tensor-Matrix Multiplications on GPUs

  2020cites this paper
• 2x2 Matrix Multiplication with 4-Bit elements in 45nm CMOS Technology

  2020cites this paper
• First Steps in Porting the LFRic Weather and Climate Model to the FPGAs of the EuroExa Architecture

  2019cites this paper
• Fast Commutative Matrix Algorithm

  2019cites this paper
• New ways to multiply 3 x 3-matrices

  2019cites this paper
• Design and Evaluation of a Power-Efficient Approximate Systolic Array Architecture for Matrix Multiplication

  2019cites this paper
• New ways to multiply 3 x 3-matrices

  2019cites this paper
• Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding

  2018cites this paper
• Fast Feasible and Unfeasible Matrix Multiplication

  2018cites this paper
• Fast matrix multiplication and its algebraic neighbourhood

  2017cites this paper
• Быстрое умножение матриц и смежные вопросы алгебры@@@Fast matrix multiplication and its algebraic neighborhood

  2017cites this paper
• A non-commutative algorithm for multiplying (7×7) matrices using 250 multiplications

  2017cites this paper
• Improved method for finding optimal formulas for bilinear maps in a finite field

  2017cites this paper
• A non-commutative algorithm for multiplying 5 $\times$ 5 matrices using 99 multiplications

  2017cites this paper
• A Secure and Fast Dispersal Storage Scheme Based on the Learning with Errors Problem

  2016cites this paper
• Fast Matrix Multiplication and Symbolic Computation

  2016cites this paper
• Numerical CP decomposition of some difficult tensors

  2016cites this paper
• Symmetries of matrix multiplication algorithms. I

  2015cites this paper
• Matrix Mutliplication References

  2015cites this paper
• A fast search algorithm for 〈m,m,m〉 Triple Product Property triples and an application for 5×5 matrix multiplication

  2015cites this paper
• Optimal block size for matrix multiplication using blocking

  2014cites this paper
• Improved matrix multiplier design for high-speed digital signal processing applications

  2014cites this paper
• Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation

  2014cites this paper
• A superlinear speedup region for matrix multiplication

  2014cites this paper
• BLOCK RECURSIVE COMPUTATION OF GENERALIZED INVERSES

  2013cites this paper
• Application of Computer Algebra in List Decoding

  2013cites this paper
• A Fast Search Algorithm for Triple Product Property Triples and an Application for 5x5 Matrix Multiplication

  2013cites this paper
• Matrix Multiplication Algorithms

  2012cites this paper
• Matrix Multiplication Algorithms

  2012cites this paper
• Computing with Large Populations Using Interactions

  2012cites this paper
• Hybrid 2D/1D Blocking as Optimal Matrix-Matrix Multiplication

  2012cites this paper
• Power series solutions of singular (q)-differential equations

  2012cites this paper
• A rationalized structure of processing unit to multiply 3x3 matrices

  2012cites this paper
• TR-2011011: Randomized and Derandomized Matrix Computations II

  2011cites this paper
• Fast computation of common left multiples of linear ordinary differential operators

  2011cites this paper
• Autour de l'évaluation numérique des fonctions D-finies

  2011cites this paper
• Randomized and Derandomized Matrix Computations ∗

  2011cites this paper
• TR-2010012: Randomized Preconditioning of Linear Systems of Equations

  2010cites this paper
• Randomized Preconditioning of Linear Systems of Equations

  2010cites this paper
• Solving Linear Systems with Randomized Augmentation II

  2010cites this paper
• TR-2010009: Solving Linear Systems with Randomized Augmentation II

  2009cites this paper
• A non-commutative algorithm for multiplying a 3x4 matrix by a 4x7 matrix using 63 non-complex multiplications

  year unknowncites this paper
• CUNY Academic Works

  year unknowncites this paper