Cover Image

A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dumas, Jean-Guillaume, Pernet, Clément, Sedoglavic, Alexandre
Format:	Preprint
Published:	2025
Subjects:	Symbolic Computation
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
by: Dumas, Jean-Guillaume, et al.
Published: (2026)

Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
by: Dumas, Jean-Guillaume, et al.
Published: (2025)

Strassen's algorithm is not optimally accurate
by: Dumas, Jean-Guillaume, et al.
Published: (2024)

Computing Krylov iterates in the time of matrix multiplication
by: Neiger, Vincent, et al.
Published: (2024)

In-place accumulation of fast multiplication formulae
by: Dumas, Jean-Guillaume, et al.
Published: (2023)

Fast in-place accumulation
by: Dumas, Jean-Guillaume, et al.
Published: (2023)

Computational Explorations on Semifields
by: Dumas, Jean-Guillaume, et al.
Published: (2026)

A complexity analysis of the F4 Gröbner basis algorithm with tracer data
by: Kouba, Robin, et al.
Published: (2026)

Optimal Communication Unbalanced Private Set Union
by: Dumas, Jean-Guillaume, et al.
Published: (2024)

Faster modular composition using two relation matrices
by: Neiger, Vincent, et al.
Published: (2026)

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
by: Prébet, Rémi, et al.
Published: (2024)

Probably faster multiplication of sparse polynomials
by: van der Hoeven, Joris
Published: (2025)

Generalized ODE reduction algorithm for bounded degree transformation
by: Huang, Shaoxuan
Published: (2025)

Generalized ODE reduction algorithm with bounded degree transformation
by: Huang, Shaoxuan
Published: (2025)

Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I
by: Berthomieu, Jérémy, et al.
Published: (2026)

On the scaling of random Tamari intervals and Schnyder woods of random triangulations (with an asymptotic D-finite trick)
by: Chapuy, Guillaume
Published: (2024)

Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set
by: Elliott, Jesse, et al.
Published: (2025)

On the equivalence problem of Smith forms for multivariate polynomial matrices
by: Lu, Dong, et al.
Published: (2024)

Fast interpolation and multiplication of unbalanced polynomials
by: Giorgi, Pascal, et al.
Published: (2024)

Conditions for eigenvalue configurations of two real symmetric matrices (signature approach)
by: Hong, Hoon, et al.
Published: (2023)

Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)
by: Hong, Hoon, et al.
Published: (2023)

Computing braids from approximate data
by: Guillemot, Alexandre, et al.
Published: (2026)

First-order factors of linear Mahler operators
by: Chyzak, Frédéric, et al.
Published: (2024)

Constructing Koszul filtrations: existence and non-existence for G-quadratic algebras
by: Berghofer, Emily, et al.
Published: (2026)

Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography
by: Oku, Sakura, et al.
Published: (2026)

An algorithm to recognize regular singular Mahler systems
by: Faverjon, Colin, et al.
Published: (2021)

Solving parametric polynomial systems using Generic Rational Univariate Representation
by: Corniquel, Florent
Published: (2026)

A Novel Approach to the Initial Value Problem with a complete validated algorithm
by: Zhang, Bingwei, et al.
Published: (2025)

Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial Equations
by: Moroz, Guillaume
Published: (2024)

A Rank 23 Algorithm for Multiplying 3 x 3 Matrices with an Arithmetic Complexity of 59
by: Mårtensson, Erik, et al.
Published: (2025)

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
by: Gopalakrishnan, Sriram, et al.
Published: (2024)

Validated numerics for algebraic path tracking
by: Guillemot, Alexandre, et al.
Published: (2024)

On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
by: Gopalakrishnan, Sriram
Published: (2024)

Probabilistic algorithm for computing all local minimizers of Morse functions on a compact domain
by: Din, Mohab Safey El, et al.
Published: (2025)

Solving Polynomial Systems with Gröbner Bases: An Introduction to F4 and FGLM
by: Bigatti, Anna Maria, et al.
Published: (2025)

f4ncgb: High Performance Gröbner Basis Computations in Free Algebras
by: Heisinger, Maximilian, et al.
Published: (2025)

A Syzygial Method for Equidimensional Decomposition
by: Mohr, Rafael
Published: (2024)

A Dataset of Nonlinear Equations for Subdivision
by: Xu, Juan, et al.
Published: (2026)

A note on a paper by Hashemi and Kapur
by: Heisel, Anna Nymann, et al.
Published: (2025)

A Generalisation of Goursat's Algorithm for Integration in Finite Terms
by: Blake, Sam
Published: (2026)