Scribd
Upload
10 views2 pages

Introduction Di Nagtuturo

Uploaded by

marco.range26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

Introduction Di Nagtuturo

Uploaded by

marco.range26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Introduction

Fixed-point iteration is a numerical method used to find solutions to equations, particularly those
that are difficult or impossible to solve algebraically. The method is based on transforming the
original equation into an equivalent form that allows iterative computation of an approximate
solution. The basic idea is to rearrange the equation f(x)=0f(x) = 0f(x)=0 into the form x=g(x)x =
g(x)x=g(x), where g(x)g(x)g(x) is a function derived from the original equation. Starting with an
initial guess x0x_0x0, the method repeatedly applies the function g(x)g(x)g(x) to generate a
sequence of approximations x1,x2,x3,…x_1, x_2, x_3, \ldotsx1,x2,x3,… that ideally converge to
the actual solution.

Objective(s)

1. To understand and apply the fixed-point iteration method for solving non-linear
equations of the form f(x)=0f(x) = 0f(x)=0.
2. To demonstrate the process of transforming a given equation into a suitable form for
fixed-point iteration.
3. To perform iterative calculations using a chosen initial guess and observe the
convergence (or divergence) of the method.
4. To analyze the conditions under which fixed-point iteration converges, including the
role of the initial guess and the function's behavior.

Procedures – How Computations Are Done

1. Rearrange the Given Equation:


o Start with the equation you want to solve, f(x)=0f(x) = 0f(x)=0.
o Transform this equation into the form x=g(x)x = g(x)x=g(x). This step may
involve algebraic manipulation, such as isolating xxx on one side of the equation.
o Ensure that the function g(x)g(x)g(x) is chosen such that the iteration will
converge to a solution.
2. Choose an Initial Guess:
o Select an initial value x0x_0x0 based on an estimate of where the root might be.
The choice of x0x_0x0 can significantly affect the convergence of the method.
3. Iterative Computation:
o Apply the fixed-point iteration formula: xn+1=g(xn)x_{n+1} = g(x_n)xn+1=g(xn
).
o Compute the next approximation xn+1x_{n+1}xn+1 by substituting the current
value xnx_nxn into g(x)g(x)g(x).

∣xn+1−xn∣|x_{n+1} - x_n|∣xn+1−xn∣ is smaller than a predetermined tolerance


o Repeat this process until the difference between successive approximations

level, indicating convergence.


4. Monitor Convergence:
o Track the sequence of values x0,x1,x2,…x_0, x_1, x_2, \ldotsx0,x1,x2,… and
observe whether the values are converging to a specific number.
o If the sequence diverges or oscillates without converging, reconsider the choice of
the initial guess or the function g(x)g(x)g(x).
5. Stopping Criterion:
o The iteration can be stopped when the difference between successive
approximations is less than a small positive number (tolerance), or after a fixed
number of iterations if convergence is slow.

Conclusion(s)

Fixed-point iteration is a powerful and straightforward method for solving equations that cannot
be easily handled analytically. The success of this method depends on the proper selection of the
function g(x)g(x)g(x) and the initial guess x0x_0x0. When the method converges, it provides an
accurate approximation of the root. However, not all choices of g(x)g(x)g(x) and x0x_0x0 lead to
convergence; the method can fail or converge slowly if the function is not chosen carefully.
Understanding the convergence criteria and the behavior of the function g(x)g(x)g(x) is crucial
for the effective application of fixed-point iteration. This activity demonstrates the practical
aspects of fixed-point iteration, showing its usefulness in solving equations iteratively and
highlighting the importance of strategic problem formulation and initial conditions.

Numerical methods are techniques used to approximate solutions to mathematical problems that are
too complex to solve exactly. They rely on algorithms to provide near-accurate answers, making them
essential in fields like science, engineering, and finance. These methods are particularly useful when
dealing with equations that cannot be solved analytically, employing iterative processes to refine
guesses until a satisfactory solution is found. Because they are computationally efficient, numerical
methods can handle large-scale problems and are versatile, applicable to tasks such as finding roots of
equations, solving differential equations, and approximating integrals.

To find the three roots of X^3 - 2X^2 - 5 = 0 using fixed-point iteration, start by transforming the
equation into the form X=g(X) with suitable or 3 functions. Select initial guesses based on expected root
locations, such as near -2, 1, and 3. Apply the chosen transformation iteratively, updating the
approximation until the values converge to a root, with the convergence criterion being a small
difference between successive approximations. Repeat the process with different initial guesses and
transformations to find all three roots of the equation.

You might also like