A comparison of gaussian and gauss-jordan elimination in regular algebra

DOI10.1080/00207168208803290zbMath0492.65013OpenAlexW1981676529MaRDI QIDQ3954729

Bernard A. Carré, Roland C. Backhouse

Publication date: 1982

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168208803290

zbMATH Keywords

comparisonGaussian eliminationsparsityGauss-Jordan eliminationregular algebrapath-finding

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)

Related Items (1)

Components and acyclicity of graphs. An exercise in combining precision with concision

Cites Work

• Regular Algebra Applied to Path-finding Problems
• An Algebra for Network Routing Problems
• A Theorem on Boolean Matrices
• Sparse matrices
• Unnamed Item

This page was built for publication: A comparison of gaussian and gauss-jordan elimination in regular algebra