BCA3010 - COMPUTER OREINETED NUMERICAL METHODS


Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :

“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )


ASSIGNMENT


PROGRAM
BCA REVISED 2012
SEMESTER
III
SUBJECT CODE AND NAME
BCA3010 - COMPUTER OREINETED NUMERICAL METHODS
CREDIT
4
BK ID
B1643
MAX. MARKS
60





Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Eachquestion is followed by evaluation scheme.





Q.1 (i) State Lagrange’s mean value theorem.
(ii) Explain truncation errors.
(iii) Find the truncation error in the result of the following function for x= (N/2)when we use(a) first three terms(b) first four terms(c) first five terms ex = (1+x2/2+x3/3+x4/4+x5/5+x6/6)

Answer :- State Lagrange’s mean value theorem:- Suppose is a function defined on a closed interval (with ) such that the following two conditions hold:

1.      f is a continuous function on the closed interval (i.e., it is right continuous at , left continuous at , and two-sided

(ii) Explain truncation errors: Suppose we have a continuous differential equation

    y' = f(t,y), \q y(t_0) = y_0, \ t \ t_0

and we wish to compute an approximation y_n of the true solution y(t_n) at discrete time steps t_1,t_2,\l ,t_N . For simplicity, assume the time steps are equally spaced:

    h = t_n - t_{n-1}, \qquad n=1,2,\ldots,N.

Suppose we compute the sequence y_n with a one-step method of the form

y_n = y_{n-1} + h A(t_{n-1}, y_{n-1}, h, f).

The function A is called the increment function, and can be interpreted as an estimate of the slope of y_n .

Local truncation error

The local truncation error \tau_n is the error that our increment function, A , causes during a single iteration, assuming perfect knowledge of the true solution at the previous iteration.

More formally, the local truncation error, \tau_n , at step n is computed from the difference between the left- and the right-hand side of the equation for the increment y_n \approx y_{n-1} + h A(t_{n-1}, y_{n-1}, h, f) :

    \tau_n = y(t_n) - y(t_{n-1}) - h A(t_{n-1}, y(t_{n-1}), h, f).

The numerical method is consistent if the local truncation error is o(h) (this means that for every \varepsilon> 0 there exists an H such that |\tau_n| < \varepsilon h for all h < H ; see big O notation). If the increment function A is differentiable, then the method is consistent if, and only if, A(t,y,0,f) = f(t,y) .

Furthermore, we say that the numerical method has order p if for any sufficiently smooth solution of the initial value problem, the local truncation error is O(h^{p+1}) (meaning that there exist constants C and H such that |\tau_n| <Ch^{p+1} for all h < H ).

Global truncation error

The global truncation error is the accumulation of the local truncation error over all of the iterations, assuming perfect knowledge of the true solution at the initial time step.[citation needed]

More formally, the global truncation error, e_n , at time t_n is defined by:

    \begin{align} e_n&= y(t_n) - y_n \\ &= y(t_n) - \Big( y_0 + h A(t_0,y_0,h,f) + h A(t_1,y_1,h,f) + \cdots + h A(t_{n-1},y_{n-1},h,f) \Big). \end{align}

The numerical method is convergent if global truncation error goes to zero as the step size goes to zero; in other words, the numerical solution converges to the exact solution: \lim_{h\to0} \max_n |e_n| = 0 .



(iii) Find the truncation error in the result of the following function for x= (N/2)when we use(a) first three terms(b) first four terms(c) first five terms ex = (1+x2/2+x3/3+x4/4+x5/5+x6/6)

To determine the local truncation error for the three-step Adams-Bash forth m



Q2 Find the Taylors series of the function
f(x)  = 3x5- 2x4+ 15x3+ 13x2- 12x- 5  atthepoint c=  2

Answer:Definition

The Taylor series of a real or complex-valued function ƒ(x) that is infinitely differentiable at a real or complex number a is the power series

f(a)+ {f'(a)}/{1!} (x-a)+ {f''(a)}{2




Q3. (i) Evaluate2( x2) ; h= 1 and 2 (ex )
(ii) Find the backward difference table of the following set

X
9
10
11
12
13
14
y
5.0
5.4
6.0
6.8
7.5
8.1


Answer: -(i) Evaluate2( x2) ; h= 1 and 2   (ex )
= ∆2( x2)





Q4:- Investigate the values of λ and μ such that the system of equations
x+y+z=6, x+2y+3z=10, x+2y+λ z = μ  may have
 (a) Unique solution (b) Infinite number of solutions (c) no solution

Answer:-
  x+y+z=6   ……………………………………………… (i)
 x+2y+3z=10


Q.5Using the method of least squares, find a relation of the form y = axb
, that fits the data
X
2
3
4
5
y
27.8
62.1
110
161




Answer:-



Q6: Obtain the solution of initial value problem. dy/dx = y-x2.

y(0) = (1), y(0.2)=  1.1218 ,y(0.4)= 1.4682, y(0.6) = 1.7379
Estimate y (0.8) by Adam Moulton’s method.

Answer: Given
y(0) = (1), y(0.2)=  1.1218 ,y(0.4)= 1.4682, y(0.6) = 1.7379


Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :

“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.