Binary Solutions for Overdetermined Systems of Linear Equations
Numerical Analysis
2011-01-18 v1
Abstract
This paper presents a finite step method for computing the binary solution to an overdetermined system of linear algebraic equations Ax = b, where A is an m x n real matrix of rank n < m, and b is a real m-vector. The method uses the optimal policy of dynamic programming along with the branch and bound concept. Numerical examples are given.
Cite
@article{arxiv.1101.3056,
title = {Binary Solutions for Overdetermined Systems of Linear Equations},
author = {Subhendu Das},
journal= {arXiv preprint arXiv:1101.3056},
year = {2011}
}
Comments
13 Pages