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

STutorial 07

This document contains tutorial problems on polynomial interpolation, nonlinear equations, and iterative methods for solving equations. The problems cover polynomial interpolation, error estimation, piecewise functions, bisection method, secant method, regula-falsi method, Newton's method, and finding solutions with quadratic convergence.

Uploaded by

sohith405
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views

STutorial 07

This document contains tutorial problems on polynomial interpolation, nonlinear equations, and iterative methods for solving equations. The problems cover polynomial interpolation, error estimation, piecewise functions, bisection method, secant method, regula-falsi method, Newton's method, and finding solutions with quadratic convergence.

Uploaded by

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

Section

Tutorial Sheet 7
Polynomial Interpolation (Week 2)
Nonlinear Equations (Week 1)

~
1. If f ∈ C n+1 [a, b] and if x0 , x1 , · · · , xn are distinct nodes in [a, b], then for x ∈ (a, b)
with x "= xi , i = 1, 2, . . . , n, show that there exists a point ξx ∈ (a, b) such that
f (n+1) (ξx )
f [x0 , x1 , · · · , xn , x] =
(n + 1) !
~
2. Prove that if we take any set of 23 nodes in the interval [−1, 1] and interpolate
the function f (x) = cosh x with a polynomial p22 of degree less than or equal to
22, then at each x ∈ [−1, 1] the relative error satisfies the bound
|f (x) − p22 (x)|
< 0.38134 × 10−15 .
|f (x)|
~
3. Derive the piecewise quadratic interpolating function for
f (x) = cos x
! "
π 3π
on the interval [0, 2π] with the partition 0, , π, , 2π .
~
2 2
4. Let bisection method be used to solve the nonlinear equation
x5 − 4x4 + 2 = 0
starting with the initial interval [0, 1]. In order to approximate a solution of the
nonlinear equation with an absolute error less than or equal to 10−4 , what is the
minimum number of iterations required as per the error estimate of the bisection

-
method? Using bisection method compute x3 .
5. Consider the equation x2 − 6x + 5 = 0.
~ i) Taking x0 = 0 and x1 = 4.5, obtain the secant method iterates x2 , x3 , . . . ,
x8 .
~ ii) Take the initial interval as [a0 , b0 ] = [0, 4.5], obtain the regula-falsi method
iterates x2 , x3 , . . . , x7 .
Observe to which roots of the given equation does the above two sequences con-
verge.
06. Give an example of a function f : R → R such that the equation f (x) = 0 has an
isolated real root with the condition that the Newton-Raphson method converges
but does not have quadratic convergence.
⑧7. Find the iterative method based on Newton-Raphson method for finding N 5/2 ,
where N is a positive real number. Take N = 2 and x0 = 6 and obtain xi ,
for i = 1, 2, 3, 4 using the Newton-Raphson method. Assume that the sequence
converges and show that it converges qudratically.

1
S. Sivaji Ganesh and S. Baskar Spring 2022-23

You might also like