Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Das, Subhendu
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4394658148