0% found this document useful (0 votes)
9 views

Fixwed Point Lab

Lab report numerical computation , fixed point

Uploaded by

ittefaq abbasi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
9 views

Fixwed Point Lab

Lab report numerical computation , fixed point

Uploaded by

ittefaq abbasi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
-- numerical computations-- submitted by:fa20-bee-012(abdullah)--. --date:25-oct-2023 fixed point iteration method description: The fixed point iteration method in numerical analysis is used to find an approximate solution to algebraic and transcendental equations. The fixed point iteration method in numerical analysis is used to find an approximate solution to algebraic and transcendental equations. Suppose we have an equation f(x) = 0, for which we have to find the solution. The equation can be expressed as x= g(t), Choose g(x) such that [g')| < atx = xo where xo,is some initial guess called fixed point iterative scheme. Then the iterative method is applied by successive approximations given by xn = g(vn 1) thats xt = gh), x2 = gb) and so on. Algorithm of Fixed Point Iteration Method: initial value x0 for the iterative method. One way to choose xo is to find the values x = a and x = ‘which f(@) < 0 and f(b) > 0. By narrowing down the selection of a and b, take xo as the average of a and bExpress the given equation, in the form x = g(x) such that |g (x)| < Lat x = x0. IF there more thart one possibility of G(x), choose the g(x) which has the minimum value of g'(x) at x = xo.By applying the successive approximations xn = g(xn - 1), if fis a continuous function, we get a sequence of {xn) which converges to a point lo, which is the approximate solution of the given equation. disadvantages camera quel The hd int tan thd nye nn alae. mening conene Sastry reel aed oe hr sa ao SOSGPRS ic SRM ene Senki We aler eee RC ag SHR acd etn pester in ape Seat ae ao Sent conS es Aa pftced point tteratton method def Fixod point _iteration(g, initial guess, tolerance, max_tterations): xn anieiolaguess for 4 in range(nax_sterations) next_x = 80%) Af abs(noxt_x - x) < tolerance: return fext.x, $+ 1 ‘return none, max_ iterations ef 00): return x0*364%x0°2-20 snitial_gues tolerance = e-20 nay iterations = 162 solution, iterations = fixed point_steration(g, initisl_guess, tolerance, max_iterations) 4 solution is not None rint("solution found: x = (solution) after (iterations) sterations”) ise! rint("Fixed-point iteration did not converge after (nax_{terations) iterations")

You might also like