Gaussian elimination is optimal for solving linear equations in dimension two

DOI10.1016/0020-0190(86)90065-7MaRDI QIDQ1076478zbMATH OpenOpenAlexFDO

Authors Thomas Lickteig

Publication date 1986

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(86)90065-7

zbMATH Keywords

complexity of rational functionscomputationaldimension twoGaussian eliminationstraight-line programs

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Gaussian elimination for the solution of linear systems of equations
• Gaussian elimination is not optimal, revisited
• scientific article; zbMATH DE number 3843058
• scientific article; zbMATH DE number 7526278
• Gauss method to solve linear programming problems
• scientific article; zbMATH DE number 741210
• A new folding gaussian elimination algorithm for general linear systems
• Solution of sparse quasi-square rectangular systems by Gaussian elimination
• A geometric analysis of Gaussian elimination. II

Cites work

• Gaussian elimination is not optimal
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• On multiplication of 2 2 matrices
• On the number of multiplications necessary to compute certain functions

Cited in

(2)

• Gaussian elimination: When is scaling beneficial!
• scientific article; zbMATH DE number 32256 (Why is no real title available?)

This page was built for publication: Gaussian elimination is optimal for solving linear equations in dimension two

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