Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Hi, please make the asnser cleaer. i can not read it if the line is hard to see or if it is untid . i
Hi, please make the asnser cleaer. i can not read it if the line is hard to see or if it is untid . i have problem with that. thank you so much. it is numerical analisys . plase make clear with nice line. it s numerical analysis cours. please make your answer clear and write it slowly. thank u so much 7 5. The centered divided difference approximation for f'() in le+ ) -- h 2h In the analysis of the source of error asociated with the calculation of this divided difference, we saw that there were two contributions to the error: that is, I Erora - Erme+ ERUNDOPP: EyOTO) M 3! where - + In this question we will assume that f(t) = et, implying that ff -"=".... Furthermore, we will also me that all evaluations off are equal. (a) Use this information and explain how to write Erora.(h) in the simpler form: () Find the optimal value for that will minimize this simpler form of Eroth) (c) Substitute thuis optimal value of into the simpler expresion for Prorach) above, and simplify completely to find the minimum valoe for Broru(). 5. The centered divided difference approximation for !'(o) is 1 (+ 1- 1 - A) 24 In the analysis of the source of error asociated with the calculation of this divided difference, we saw that there were two contributions to the error that is, Erora Erntne + EMUNDOFT Erorath) + 3! = rm2) + 10,35) for wbere M for y (-1,2+1), and
Hi, please make the asnser cleaer. i can not read it if the line is hard to see or if it is untid . i have problem with that. thank you so much.
it s numerical analysis cours. please make your answer clear and write it slowly. thank u so much
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started