Abstract
This paper presents a special purpose dual algorithm for obtaining a Chebychev approximation to an overdetermined system of linear equations. The method is founded on the principles of linear programming and is designed to take advantage of the problem's special structure. It is shown that, while maintaining a reduced basis, certain iterations of the standard dual algorithm may be combined into one. Two computer code implementations of the method are discussed and a computational comparison with another algorithm for Chebychev approximation is given.
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.
