Scribd
Upload
161 views3 pages

Numerical Analysis I: Take Home FINAL Exam Sept., 2020

This document provides the questions for a take-home final exam in numerical analysis. It consists of 10 questions covering various numerical analysis topics, including: 1) Determining if a function has roots, convergence of linear interpolation methods, and examples of Newton's method failing to converge. 2) Checking if a system of linear equations is ill-conditioned, and writing Jacobi and Gauss-Seidel iterative algorithms. 3) Determining if a matrix is ill-conditioned and the accuracy of solutions to systems of equations using Gaussian elimination with pivoting. 4) Proving uniqueness of polynomials and estimating errors in derivative approximations. 5) Completing tables of functions and their derivatives, and

Uploaded by

Ahmad Ali Khader
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
161 views3 pages

Numerical Analysis I: Take Home FINAL Exam Sept., 2020

This document provides the questions for a take-home final exam in numerical analysis. It consists of 10 questions covering various numerical analysis topics, including: 1) Determining if a function has roots, convergence of linear interpolation methods, and examples of Newton's method failing to converge. 2) Checking if a system of linear equations is ill-conditioned, and writing Jacobi and Gauss-Seidel iterative algorithms. 3) Determining if a matrix is ill-conditioned and the accuracy of solutions to systems of equations using Gaussian elimination with pivoting. 4) Proving uniqueness of polynomials and estimating errors in derivative approximations. 5) Completing tables of functions and their derivatives, and

Uploaded by

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

Take Home FINAL

EXAM
Sept., 2020
Time:
14 Hours

Numerical Analysis I
MATH. DEPT.
Answer the following questions Math 8

QUESTION ONE

a] If the function f(x) is continuous in a closed interval [a,b] and f (a ) f (b)  0 ,


does f(x) has a root in [a,b]?, Justify and explain geometrically,
b] Derive the sufficient condition for the convergence of linear interpolation Methods,
c] Explain geometrically one example where Newton's Method fail to converge.

d] What is the rate of convergence of the numerical formula for computing the root of
the nonlinear repeated root functions .
f ( xn )
x n 1  x n  2
f ( x n )
QUESTION TWO
Consider the linear equations
2.99x + 3.00y =4.00
3.00x + 2.99y =4.00
a] Check geometrically and computationally whether the system is ill-conditioned or
not.
b] Write Jacobi and Gauss-Seidel iterative algorithms to solve the above system of
linear equations

QUESTION THREE
a] If A is a square matrix with det(A)=.00000932. Can we confirm that it’s ill-
conditioned matrix? Justify
b] A system Ax=b solved with Gaussian elimination with pivoting, the residual is
r  10 7 , Can we confirm that the computed solution is a good approximation for
the true solution? Explain

c] The system Ax=b is solved using Gaussian elimination method with pivoting, with
three digit calculations. Then the same system is solved but with six digits
calculations. Two significant different solutions obtained, what you conclude?
 0.6 0.6
d] A   0.4 0.2 Use  to calculate the condition number of the matrix A.
 
Explain your result.

e] The determinant of a matrix A is computed by reducing it to upper triangular


matrix without row changes det(A)=12.45. What is the determinant of the matrix of
two raw changes used.

QUESTION FOUR
a] Prove that there is a unique n th degree polynomial passing through the (n+1)
points ( xi , y i ), i  0,1,..., n .

b] Consider the function f ( x)  2 xe 3 x , use the forward and the central difference
formula to compute f (0.5), h  0.1 , compute the error

QUESTION FIVE

x f (x ) f 2 f 3 f 4 f 5 f
0.1
0.3
0.5
0.7
0.9
1.1

a] Complete the table above for f ( x)  2 xe 3 x 0.1  x  1.1


b] Use cubic Newton Gregory polynomial to find 1.14e1.71 , calculate the next
term and actual error,

QUESTION Six 10
1. 1
Apply a combination of Simpson's rules to evaluate the integral I  2 0.1 xe 3 x dx
using the table in Question five.

QUESTION Seven

a] Derive Jacobi –iterative algorithm by factorizing the matrix A into L+D+U


matrices, apply the algorithm to the following system of equations without solving it.
83x  11 y  4 z  95
7 x  52 y  13z  104
3 x  8 y  29 z  71
b] Use Gaussian elimination with pivoting and scaling if necessary to solve the above
system,
c] Factorize the coefficient matrix into LU composition,
d] Use Gaussian limination to compute the inverse of the coefficient matrix.
QUESTION EIGHT

If the secant method is used to approximate the root of f(x)=0 , and if the
convergence is a one side. Write an algorithm to accelerate the convergence of the
solution.
QUESTION NINE

a] Use the fixed–point iteration method and Secant method to find the root of
3 x  tan x  2 correct to three decimal places, check convergence of the method
geometrically and analytically before calculations

QUESTION TEN

a] Write a computer algorithm to find all roots of n-th degree polynomial together,
[ you can use QD- ALGORITHM]
b] Use the above algorithm to compute the roots of the polynomial
f ( x )  5 x 3  20 x  3
C] Use Newton method to modify the above roots.

I wish u the best


Prof. A. M. Saman

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy