2. Suppose we have a computer that can't divide. One way to get around this is...

Transcribed Image Text:

2. Suppose we have a computer that can't divide. One way to get around this is to create a routine that finds the roots of f(a) = -a. We then input a and get its inverse. (You (human) can use division in formulating the algorithm, but the algorithm must not require the computer to divide.) Show how you would use Newton-Raphson to do this. Show if/when it converges. What is the order of the convergence? 2. Suppose we have a computer that can't divide. One way to get around this is to create a routine that finds the roots of f(a) = -a. We then input a and get its inverse. (You (human) can use division in formulating the algorithm, but the algorithm must not require the computer to divide.) Show how you would use Newton-Raphson to do this. Show if/when it converges. What is the order of the convergence?

Answer rating: 100% (QA)

Answer Th... View the full answer