subject

The objective of this problem is to compare second-order accurate forward, backward, and centered finite-difference approximations of the first derivative of a function to the actual value of the derivative. this will be done for
f (x) = eāˆ’2x āˆ’ x
(a) use calculus to determine the correct value of the deĀ­rivative at x = 2.
(b) develop an m-file function to evaluate the centered finite-difference approximations, starting with x = 0.5. thus, for the first evaluation, the x values for the cenĀ­tered difference approximation will be x = 2 Ā± 0.5 or x = 1.5 and 2.5. then, decrease in increments of 0.1 down to a minimum value of Ī“x = 0.01.
(c) repeat part (b) for the second-order forward and backĀ­ward differences. (note that these can be done at the same time that the centered difference is computed in the loop.)
(d) plot the results of (b) and (c) versus x. include the exact result on the plot for comparison.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 05:20
Write a program called assignment3 (saved in a ļ¬le assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very eā†µective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the ā€œlargerā€ integer is replaced by the diā†µerence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.
Answers: 3
question
Computers and Technology, 24.06.2019 05:30
Hey i really need some solving this problem: 1. encrypt this binary string into cipher text: 110000. include in your answer the formula the decoder would use to decrypt your cipher text in the format (coded answer) x n mod (m) = y & 2. decrypt this cipher text into a binary string: 106 you.
Answers: 2
question
Computers and Technology, 24.06.2019 17:00
What are some examples of what can be changed through options available in the font dialog box? check all that apply. font family italicizing bolding pasting drop shadow cutting character spacing special symbols
Answers: 2
question
Computers and Technology, 25.06.2019 00:00
When pasting an existing chart into a word document, you can choose to using the paste options button. a. paste the chart as a picture b. embed the chart c. add the chart while keeping the destination formatting intact d. insert the chart while keeping the source formatting intact
Answers: 1
You know the right answer?
The objective of this problem is to compare second-order accurate forward, backward, and centered fi...
Questions
question
History, 17.10.2019 01:30
question
Biology, 17.10.2019 01:30
Questions on the website: 13722367