A note on detecting simple redundancies in linear systems

Two efficient algorithms are presented that, for a given linear system Ax = b, eliminate equations that are non-zero multiples of other equations. The second algorithm runs in linear time when the entries of A are +1, −1 or 0.

Saved in:
Bibliographic Details
Published in:Operations research letters 1987, Vol.6 (1), p.15-17
Main Authors: Bixby, R.E., Wagner, D.K.
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
efficient algorithms
Exact sciences and technology
linear systems
redundancy
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two efficient algorithms are presented that, for a given linear system Ax = b, eliminate equations that are non-zero multiples of other equations. The second algorithm runs in linear time when the entries of A are +1, −1 or 0.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(87)90004-6