Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Who can help me to write the secant method code by Octave? I provide an example of the Newton Raphson Method code , please write

Who can help me to write the secant method code by Octave?

I provide an example of the Newton Raphson Method code, please write the code as the form.

image text in transcribed

This is code for the Newton Raphson Method

image text in transcribed

2.3.1 The Secant Method To avoid the issue with the computation of the derivative in the Newton-Raphson Method, an alternative method called the Secant Method can be used. In this method, we simply approximate f'(xn-1) with f(xn-1) - f(xn-2) 2n-1 Xn-2 which leads to the iteration equation f(In-1)(xn-1 Xn-2) In = {n-1- f(In-1) - f(xn-2) For this algorithm we will need two initial values. Further, we will not need to differentiate so we won't use the variable dfh and we won't need to type syms x in the m-file. MO 1 Q function (r, n] =NewtonRaphsonMethod(f, initialValue, tol, nmax) t(1)=initialValue; $$ Initial Value fh=function_handle(f); $$ syms x; $$ to find the derivative symbolically df=diff(f,x); dfh=function_handle (df); 10 11 printf("%s\t\t\tss ", 'n','t (n)'); *% for loop start n=2 since initialValue have t(1) for n=2 : nmax t(n)=(t (n-1) +fh (t (n-1)))/(dfh (t (n-1))); $$ equation to find tan) printf("%d\t\t$18.08 ", n, t(n)); 1 *$ if derivative fh =0 printf error if (dfh(t (n-1))==0) printf("Error"); break; endif $$ if one of them less than tolerance halt program ET if (fh(t (n-1))==0 || (abs(t (n)-t (n-1)))

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Fundamentals Of Database Management Systems

Authors: Mark L. Gillenson

2nd Edition

0470624701, 978-0470624708

More Books

Students also viewed these Databases questions