Abstract
Efficient linear programming algorithms for the solution of a set of overdetermined linear equations in the $l_1 $ norm are employed in order to obtain a minimum $l_\infty $ solution to a set of consistent linear equations. In addition, the solution is proved to be of a particular form in case the set of equations is a Chebyshev system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
