N13 - ME 510 NUMERICAL METHODS FOR ME II Chebyshev Fitting...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ME – 510 NUMERICAL METHODS FOR ME II gG±²³´µG³´¶·G¸¹´ºG»¼½ Fall 2007 Chebyshev Fitting Given: f (x) in [a , b] Problem : Find the best fitting, single degree polynomial with small degree, P n (x), that represents f (x) in the whole range, [a , b]. Solution : Change variable from x in [a , b] to z in [1 , +1], and f (x) to F(z) : a - b b - a - x 2 = z Minimize E (z) : ) ( F ! 1) + (n ) z - (z ... ) z - (z ) z - (z = (z) P - (z) F = (z) E 1) + (n n 1 0 n g ME – 510 NUMERICAL METHODS FOR ME II gG±²³´µG³´¶·G¸¹´ºG»¼½ Fall 2007 ! 1) (n ) ( F ) z - (z (z) E n 0 i 1) (n i G ± ² ² g ± Minimize E(z) means to find z 0 , z 1 , …, z n , which are the cross over points between F(z) and P n (z) where the error is exactly zero, such that the product, (z - z 0 ) (z - z 1 ) … (z -z n ) is minimized. Chebyshev proved the following: The roots of the (n+1)st Chebyshev polynomial, T n+1 (z), gives the cross- over (z) points:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

N13 - ME 510 NUMERICAL METHODS FOR ME II Chebyshev Fitting...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online