By Topic

Some Numerical Experiments in the Theory of Polynomial Interpolation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Luttmann, F.W. ; University of Arizona, Tucson, USA ; Rivlin, T.J.

An important unsolved problem in the theory of polynomial interpolation is that of finding a set of nodes which is optimal in the sense that it leads to minimal Lebesgue constants. In this paper results connected to this problem are obtained, and some conjectures are presented based upon numerical evidence garnered from extensive computations.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:9 ,  Issue: 3 )