Abstract
A method is described for interpolation of data points by a polygon of arbitrarily high subdivision, the breakpoints of which are obtained by a simple and rapid process, which can be performed on programmable desk calculators. When compared with classical interpolation methods in quality of approximation and computational expense, polygonal interpolation proves as a useful and versatile tool for approximation of general functions.
Full Text
Published Version
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 call