Numerical Methods: Unit 2: Solution of Non-Linear Equations
Numerical Methods: Unit 2: Solution of Non-Linear Equations
Numerical Methods: Unit 2: Solution of Non-Linear Equations
1
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
2
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
• Linear equations have one and only one root and the solution for linear equations in standard forms can
be easily computed.
2
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
• Linear equations have one and only one root and the solution for linear equations in standard forms can
be easily computed.
• Non-linear equations may have multiple or infinite number of roots or they may not possess any real root
at all.
2
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
• Linear equations have one and only one root and the solution for linear equations in standard forms can
be easily computed.
• Non-linear equations may have multiple or infinite number of roots or they may not possess any real root
at all.
• Analytical solution of non-linear equations demand different approach for each new form of the problem.
2
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
• Linear equations have one and only one root and the solution for linear equations in standard forms can
be easily computed.
• Non-linear equations may have multiple or infinite number of roots or they may not possess any real root
at all.
• Analytical solution of non-linear equations demand different approach for each new form of the problem.
• Numerical techniques generally employ some mathematical principle iteratively in some tricky manner to
obtain one root at a time, numerically.
2
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
• Linear equations have one and only one root and the solution for linear equations in standard forms can
be easily computed.
• Non-linear equations may have multiple or infinite number of roots or they may not possess any real root
at all.
• Analytical solution of non-linear equations demand different approach for each new form of the problem.
• Numerical techniques generally employ some mathematical principle iteratively in some tricky manner to
obtain one root at a time, numerically.
• Numerical techniques may be cumbersome than analytical techniques and produce only approximate
results, but may be the only alternate when analytical techniques are hard or impossible to implement.
2
Non-linear Equations
• Any single variable function in the form of f (x) = 0 can be classified as a non-linear equation if we
cannot identify it clearly as a linear equation.
• Linear equations have one and only one root and the solution for linear equations in standard forms can
be easily computed.
• Non-linear equations may have multiple or infinite number of roots or they may not possess any real root
at all.
• Analytical solution of non-linear equations demand different approach for each new form of the problem.
• Numerical techniques generally employ some mathematical principle iteratively in some tricky manner to
obtain one root at a time, numerically.
• Numerical techniques may be cumbersome than analytical techniques and produce only approximate
results, but may be the only alternate when analytical techniques are hard or impossible to implement.
• Compared to analytical techniques, numerical techniques are far more easier to implement as computer
algorithms.
2
2.1 Bisection Method
f(x)
Intermediate Value Theorem: a
If a function f (x) = 0 is continuous
between an interval (a, b) such that f (a)
and f (b) are of opposite signs, then there
exists at least one real root in the interval
(a, b).
x
1
f (x) = + sin(x)
x3
3
Intermediate Value Theorem
f(x)
b
f(x)
a
5
Intermediate Value Theorem
f(x)
a b
6
Intermediate Value Theorem
f(x)
a b
7
Intermediate Value Theorem
f(x)
x
8
Intermediate Value Theorem
f(x)
x
9
Bisection Method
f(a)
f(c)
b
f(x)
a c f(b)
=(a+b)/2
x 10
Bisection Method
b
f(x)
a (old) a (new)
x 11
Bisection Method
b
f(x)
a c
x 12
Bisection Method
c b
f(x)
x 13
Bisection Method
c b
f(x)
|
a
x 14
When to stop?
Absolute Error:
|b − a| ≤ tolerable error
Relative Error:
|b − a|
≤ tolerable error
|c|
15
No. of iterations (n)
Error Tolerance = ε
Initial Interval = (a, b)
|b − a| |b − a|
≤ε ⇒ 2n ≥
2n ε
n |b − a|
log(2 ) ≥ log
ε