Chebyshev Series Expansion of Inverse Polynomials

Details Chebyshev Series Expansion of Inverse Polynomials Chebyshev Series Expansion of Inverse Polynomials

2004-03-22

arxiv.org/abs/math/0403344v4

J. Comp. Appl. Math. 196 (2) (2006) 596-607

Mathematics

Classical Analysis and ODEs

LaTeX2e, 24 pages, 1 PostScript figure. More references. Corrected typos in (1.1), (3.4), (4.2), (A.5), (E.8) and (E.11)

Scientific paper

10.1016/j.cam.2005.10.013

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear combinations of simple functions of the polynomial roots. If the first k of the coefficients a_n are known, the others become linear combinations of these with expansion coefficients derived recursively from the b_j's. On a closely related theme, finding a polynomial with minimum relative error towards a given f(x) is approximately equivalent to finding the b_j in f(x)/sum_(j=0..k)b_j*T_j(x)=1+sum_(n=k+1..oo) a_n*T_n(x), and may be handled with a Newton method providing the Chebyshev expansion of f(x) is known.

Affiliated with

Also associated with

No associations

Rating

Chebyshev Series Expansion of Inverse Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Chebyshev Series Expansion of Inverse Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chebyshev Series Expansion of Inverse Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701659