arXiv (All)
open access
Fast matrix multiplication via recursive $\langle$ 4x4x4:48 $\rangle$ algorithms into practice
We present a fast algorithm for multiplying two 4x4 matrices using 48 multiplications and 216 other operations (addition, subtraction or scaling by a constant) over any ring containing an inverse of 2. Applied recursively, this algorithm reaches a cost bound with leading term $7.75 n^{\log_4(48)}$.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- MPX: A Unified Systolic Array for Matrix and Polynomial Multiplication#280109
- High-Rate Quantized Matrix Multiplication II#180656
- Riemannian Structure and Optimization for a Class of Low-Parametric Orthogonal Matrices#1064526
- A fast output-sensitive algorithm for Boolean matrix multiplication#284774
- $g$MAGNUS: Fast SpGEMM on GPUs for Irregular Matrices via Hierarchical Multisplit#405622
Record · ID 1000001
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive