Stability improvements for fast matrix multiplication

DOI10.1007/S11075-024-01806-YMaRDI QIDQ6926333zbMATH OpenFDO

Authors Charlotte Vermeylen, Marc van Barel

Publication date 24 September 2025

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11075-024-01806-Y

zbMATH Keywords

matrix multiplicationoptimizationpolyadic decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• A Riemannian trust region method for the canonical tensor rank approximation problem
• Approximate Solutions for the Bilinear Form Computational Problem
• Discovering faster matrix multiplication algorithms with reinforcement learning
• Equivalent polyadic decompositions of matrix multiplication tensors
• Gaussian elimination is not optimal
• Geometry and complexity theory
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• Improving the numerical stability of fast matrix multiplication
• Introduction to Smooth Manifolds
• New lower bounds for the border rank of matrix multiplication
• New ways to multiply \(3 \times 3\)-matrices
• Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication
• Numerical CP decomposition of some difficult tensors
• Numerical Optimization
• On the complexity of some algorithms of matrix multiplication
• On the complexity of the multiplication of matrices of small formats
• On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
• On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
• Partial and Total Matrix Multiplication
• Tensor rank is NP-complete
• The bilinear complexity and practical algorithms for matrix multiplication
• The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices

This page was built for publication: Stability improvements for fast matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926333)