arXiv (All)
open access
A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication
We present a rank-23 algorithm for general 3 x 3 matrix multiplication using 52 additions or subtractions, together with a Karstadt-Schwartz-style basis change [1, 2]. This gives, to the best of our knowledge, a new best-known candidate for the addition-minimization problem for rank-23 general 3 x 3
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
- Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming#1035072
- Using Subproblem Objective Gaps in Inexact Augmented Lagrangian and ADMM Algorithms, with Applications to Stochastic Mixed Integer Programming#652408
- Using Subproblem Objective Gaps in Inexact Augmented Lagrangian and ADMM Algorithms, with Applications to Stochastic Mixed Integer Programming#650955
- Space Filling Curves is All You Need: Communication-Avoiding Matrix Multiplication Made Simple#1143671
- Beyond the Matrix Sign: Quadratic Spectral Descent#984508
Record · ID 974697
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