Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Computation of best one-sided $L_{1}$ approximation

Author: James T. Lewis
Journal: Math. Comp. 24 (1970), 529-536
MSC: Primary 65.20; Secondary 41.00
MathSciNet review: 0273780
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A computational procedure based on linear programming is presented for finding the best one-sided ${L_1}$ approximation to a given function. A theorem which ensures that the computational procedure yields approximations which converge to the best approximation is proved. Some numerical examples are discussed.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65.20, 41.00

Retrieve articles in all journals with MSC: 65.20, 41.00

Additional Information

Keywords: One-sided approximation, <IMG WIDTH="28" HEIGHT="38" ALIGN="MIDDLE" BORDER="0" SRC="images/img1.gif" ALT="${L_1}$"> approximation, convex constraints, computation of best approximation, linear programming
Article copyright: © Copyright 1970 American Mathematical Society