Scribd
Upload
23 views

Week 3 Date Oct 28,2021 Solution of Non-Linear Equations Simple Iterative Method/fixed Point Method

The document discusses algorithms for solving non-linear equations through simple iterative methods. It defines what an algorithm is and explains the concepts of stability, conditional stability, and how error grows in algorithms in either a linear or exponential way, with linear growth indicating a stable algorithm and exponential growth meaning it is unstable.

Uploaded by

AYESHA SHAZ
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Week 3 Date Oct 28,2021 Solution of Non-Linear Equations Simple Iterative Method/fixed Point Method

The document discusses algorithms for solving non-linear equations through simple iterative methods. It defines what an algorithm is and explains the concepts of stability, conditional stability, and how error grows in algorithms in either a linear or exponential way, with linear growth indicating a stable algorithm and exponential growth meaning it is unstable.

Uploaded by

AYESHA SHAZ
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Week 3

Date Oct 28,2021

Solution of Non-Linear Equations


Simple Iterative method/Fixed Point Method
An algorithm is a procedure that describes, in an unambiguous
manner, a finite sequence of steps to be performed in a specified
order. The object of the algorithm is to implement a procedure to
solve a problem or approximate a solution to the problem.

If in an algorithm whenever possible, if the small changes in the


initial data produce correspondingly small changes in the final
results,
An algorithm that satisfies this property is called stable;
otherwise it is unstable.

Some algorithms are stable only for certain choices of initial data,
and are called conditionally stable

Explanation

Suppose an error with magnitude 𝐸0 > 0 is introduced at some


stage in the calculations and that the magnitude of the error after
n subsequent operations is denoted by 𝐸𝑛 . The two cases that arise
most often in practice are defined as follows.

Suppose that 𝐸0 > 0 denotes an error introduced at some stage


in the calculations and 𝐸𝑛 presents the magnitude of the error after
n subsequent operations.
Case 1
• If 𝐸𝑛 ≈ 𝐶𝑛𝐸0 , where C is a constant independent of n, then the
growth of error is said to be linear.
Case 2
• If 𝐸𝑛 ≈ 𝐶 𝑛 𝐸0 , for some C > 1, then the growth of error is called
exponential
An algorithm that exhibits linear growth of error is stable,
whereas an algorithm exhibiting exponential error growth is
unstable

Determine any fixed points of the function 𝒈(𝒙) = 𝒙𝟐 − 𝟐.

You might also like