Skip Navigation

The Computer Journal 1971 14(3):272-275; doi:10.1093/comjnl/14.3.272
© 1971 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (13)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cox, M. G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An algorithm for approximating convex functions by means by first degree splines

M. G. Cox *

Division of Numerical and Applied Mathematics, National Physical Laboratory, Teddington, Middlesex, UK

An algorithm for determining minimax approximations to strictly convex functions by means of first degree splines with free knots is proposed. The method may be used in one of two modes. Either the minimax approximation having a prescribed number of knots can be found, or the minimax approximation with the smallest number of knots whose maximum error does not exceed a given error can be determined. The method, while processing quadratic convergence, does not require a knowledge of derivatives higher than the first.

Received August 1970.

* Division of Numerical and Applied Mathematics, National Physical Laboratory, Teddington, Middlesex


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.