- Can You Help Me With This Problem Thanks 1 (411.4 KiB) Viewed 18 times
E. For a numerical scheme, we consider an error measure called the relative error. Suppose a true value is o and an estimate to this value is ry. Then the relative error is In true value - approximate Rel(a) = true value BRO COM Consider the reciprocal finding process in part D. (with o for some positive b). Show that Rel = 1 bar) and similarly Rel(-1) = 1 -- bur+1 1+berr MIN Use the formula for 17+1 to show that Rel(+1) = (Rel.) This puts a restriction on how good (close to a) the initial guess must be to ensure that the method works. Find a condition on To or on Rel(zo) that will guarantee that the approximations get better with each iteration. Discuss what this means in terms of both the restriction on the method and how fast it works when it does work. (For example, if the relative error at some step is about 10-, how big would it be at the next step.)