Scribd
Upload
8 views2 pages

SERIE-Résolution-des-équations-non-linéaires-Ang

The document outlines a series of exercises focused on solving nonlinear equations using various numerical methods, including the Dichotomy method and fixed point iteration. Each exercise requires finding roots of specific functions, determining intervals, calculating iterations for desired precision, and evaluating errors. Additionally, it includes homework assignments that further explore the application of these methods to different equations.

Uploaded by

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

SERIE-Résolution-des-équations-non-linéaires-Ang

The document outlines a series of exercises focused on solving nonlinear equations using various numerical methods, including the Dichotomy method and fixed point iteration. Each exercise requires finding roots of specific functions, determining intervals, calculating iterations for desired precision, and evaluating errors. Additionally, it includes homework assignments that further explore the application of these methods to different equations.

Uploaded by

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

Module: Numerical Methods

Series 1: Solving nonlinear equations


Exercise 1 :
We consider the function𝑓(𝑥 ) = 𝑥 2 𝑒 𝑥 − 1 = 0
1. Find an interval I a , b of length 1 containing the root of f x 
2. After checking the applicability of the Dichotomy method on this interval, calculate
the first five iterates.
3. Calculate the number of iterations needed to obtain the solution with a precision of
10 4
Exercise 2 :
We consider the function f defined by:𝑓(𝑥 ) = 𝑥 3 − 𝑥 2 − 𝑥 − 1
1. Separate the roots of the function f , then show that f(x)=0 has a unique real solution
on the interval [1.5; 2].
2. Determine the number of iterations sufficient to obtain a solution approximated to
within 0.05, using the Dichotomy method .
3. Calculate this approximation by the dichotomy method and evaluate the error made on
the last approximation
Exercise 3:
Write an iterative process ( x n ) n N from the fixed point defined by the following iteration
function:
1
𝑔(𝑥 ) = 𝑥 + (𝑒 −𝑥 − 𝑥 2 )
4
1. Show that the fixed point method converges to the solution in the interval I 0.1 .

2. Determine the number of iterations required to calculate an approximate solution with a


precision 10 10
3. Calculate the first five iterations.
Exercise 4 (homework):
1
We propose to find in R + an approximate value of one of the roots of the function𝑓(𝑥) = 𝑒 𝑥 − 𝑥
1
1. Show that there exists a unique root α for the equation f(x)=0 in the interval [ 4; 1]

2. We propose to solve the equation f(x)=0 by the fixed point method, by putting the
equation in the form:𝑥𝑘+1 = 𝑔𝑖 (𝑥𝑘 ); 𝑖 = 1,2 𝑎𝑣𝑒𝑐:
𝑔1 (𝑥 ) = 𝑒 −𝑥 𝑒𝑡 𝑔2 (𝑥) = 𝑥 2 𝑒 𝑥
Determining which of these forms leads to convergence for this method.
3. For the 𝑔𝑖 (𝑥 )restraint form,
Module: Numerical Methods

1. Determine the number of iterations needed to have an error less than 0.01.
2. Calculate by the fixed point method the first six approximations of the root of the
equation f(x)=0 starting from the initial point x 0 =0.75
Exercise 5 :
𝑒 −𝑥
We wish to find an approximate solution to the following equation: =1
𝑥

We define the function f by 𝑓 (𝑥 ) = 𝑥 − 𝑒 −𝑥 .


1. Show that x is a solution to the equation if and only if f(x)=0.
2. Show that the function f has only one root in R and it lies in the interval [0; 1]
3. Newton 's method are verified, give the expression of the Newton sequence.
4. Then calculate the 3rd approximation by this method.

You might also like