🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.theory
Article #1985

polynomial interpolation

#1985
From: Richard Beigel
Date: Wed, 03 Jan 1990 14:22
18 lines
1103 bytes
I am looking for theorems along the following lines:

(a) If p(x) is a dth degree polynomial and |p(x)| < 1 for
1 <= x <= m where m is much larger than d then all the coefficients
of p are very small.

(b) If p(x) is a dth degree polynomial and |p(i)| < 1 for
i = 1,2,...,m where m is much larger than d then all the coefficients
of p are very small.

(c) If p(x) is a dth degree polynomial and |p(i)| < 1 for
i = 1,2,...,m where m is much larger than d then
|p(x)| < 2 for 1 <= x <= m.

I have some results but I suspect that this problem has already been
studied.  I would appreciate any leads.  Thanks.

-- Richard Beigel
Technical Details
Message-ID: <8912270836.AA24311@thailand.CS.YALE.EDU>
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!tut.cis.ohio-state.edu!ucbvax!VM1.NODAK.EDU!beigel-richard%YALE.ARPA

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!tut.cis.ohio-state.edu!ucbvax!VM1.NODAK.EDU!beigel-richard%YALE.ARPA
From: beigel-richard%YALE.ARPA@VM1.NODAK.EDU (Richard Beigel)
Newsgroups: comp.theory
Subject: polynomial interpolation
Message-ID: <8912270836.AA24311@thailand.CS.YALE.EDU>
Date: 3 Jan 90 14:22:03 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Richard Beigel <beigel-richard%YALE.ARPA@VM1.NoDak.EDU>
Lines: 18