Advances in Dense Linear Algebra: From Gauss to Strassen
Sr No:
1
Page No:
1-8
Language:
English
Authors:
Moumouni Djassibo Woba, Zoungrana Amidou, Zongo Moumouni,
Published Date:
2025-04-01
Abstract:
Linear algebra lies at the core of many algorithmic problems. Standard matrix multiplication and the Gaussian elimination method have arithmetic complexity that is cubic in terms of input size. In this article, we show that for most dense linear algebra problems—multiplication, inversion, determinant, system solving—more efficient algorithms exist with strictly sub-cubic complexity.
Keywords:
Algorithms, matrix, Linear algebra, Multiplication, Determinant.