Gaussian elimination is not optimal, revisited

DOI10.1016/J.JLAMP.2016.06.003MaRDI QIDQ2374312zbMATH OpenOpenAlexFDO

Authors Hugo Daniel Macedo

Publication date 15 December 2016

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://backend.orbit.dtu.dk/ws/files/127617094/rbpa.pdf

zbMATH Keywords

algorithmcategory theoryGaussian eliminationmatrix multiplicationStrassen's algorithmtensor product

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.
• A geometric analysis of Gaussian elimination. I
• Matrix multiplication, a little faster
• Matrices as arrows! A biproduct approach to typed linear algebra
• On transformations of algorithms to multiply 2 2 matrices

Cites work

• ``Keep definition, change category -- a practical approach to state-based system calculi
• A linear algebra approach to OLAP
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 4002273 (Why is no real title available?)
• scientific article; zbMATH DE number 3568615 (Why is no real title available?)
• Matrices as arrows! A biproduct approach to typed linear algebra
• Towards a linear algebra of programming

Cited in

(5)

• Gaussian elimination is optimal for solving linear equations in dimension two
• Gaussian elimination: When is scaling beneficial!
• Matrices as arrows! A biproduct approach to typed linear algebra
• scientific article; zbMATH DE number 2232784 (Why is no real title available?)
• A collection of examples where Neville elimination outperforms Gaussian elimination

This page was built for publication: Gaussian elimination is not optimal, revisited

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