A simplex algorithm for the one-sided Chebyshev solution form above of overdetermined systems of linear equations is described. In this algorithm minimum storage is required, no artificial variables are needed and no conditions are imposed on the coefficient matrix. The described algorithm applies as well for the one-sided Chebyshev solution from below. The algorithm is a simple and a fast one. Numerical results are given.Peer reviewed: YesNRC publication: Ye
A matrix method, which is called the Chebyshev-matrix method, for the approximate solution of linear...
summary:An algorithm is described for obtaining a best Tshebyshev approximation to solutions of an o...
summary:An algorithm is described for obtaining a best Tshebyshev approximation to solutions of an o...
Two new algorithms for solving the overdetermined system of linear inequalities Ca > 0 are presented...
Two algorithms are here presented. The first one is for obtaining a Chebyshev solution of an overdet...
A method for calculating the strict Chebyshev solution of overdetermined systems of linear equations...
AbstractThis paper constitutes a computer program for the discrete linear restricted Chebyshev appro...
AbstractThis paper constitutes a computer program for the discrete linear restricted Chebyshev appro...
The problem of obtaining a minimum L 1e solution of an underdetermined system of consistent linear e...
This program calculates the strict Chebyshev solution of an overdetermined system of linear equation...
In a previous paper by the author, an algorithm for calculating the L1 solution of an overdetermined...
A matrix method, which is called the Chebyshev-matrix method, for the approximate solution of linear...
A Chebyshev approximation algorithm for solving the linear system of inequalities Ca<0 is presented....
AbstractUsow's algorithm for solving the discrete linear L1 approximation problem is generalized so ...
An algorithm for computing the Chebyshev solution of a system of inconsistent linear equations is gi...
A matrix method, which is called the Chebyshev-matrix method, for the approximate solution of linear...
summary:An algorithm is described for obtaining a best Tshebyshev approximation to solutions of an o...
summary:An algorithm is described for obtaining a best Tshebyshev approximation to solutions of an o...
Two new algorithms for solving the overdetermined system of linear inequalities Ca > 0 are presented...
Two algorithms are here presented. The first one is for obtaining a Chebyshev solution of an overdet...
A method for calculating the strict Chebyshev solution of overdetermined systems of linear equations...
AbstractThis paper constitutes a computer program for the discrete linear restricted Chebyshev appro...
AbstractThis paper constitutes a computer program for the discrete linear restricted Chebyshev appro...
The problem of obtaining a minimum L 1e solution of an underdetermined system of consistent linear e...
This program calculates the strict Chebyshev solution of an overdetermined system of linear equation...
In a previous paper by the author, an algorithm for calculating the L1 solution of an overdetermined...
A matrix method, which is called the Chebyshev-matrix method, for the approximate solution of linear...
A Chebyshev approximation algorithm for solving the linear system of inequalities Ca<0 is presented....
AbstractUsow's algorithm for solving the discrete linear L1 approximation problem is generalized so ...
An algorithm for computing the Chebyshev solution of a system of inconsistent linear equations is gi...
A matrix method, which is called the Chebyshev-matrix method, for the approximate solution of linear...
summary:An algorithm is described for obtaining a best Tshebyshev approximation to solutions of an o...
summary:An algorithm is described for obtaining a best Tshebyshev approximation to solutions of an o...
DOI
Add to ORKG