Skip to Main Content
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.