Scribd
Upload
24 views6 pages

Q9

final submit

Uploaded by

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

Q9

final submit

Uploaded by

lalitpandit806
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 6
The computatio: 3 Pe tion a of both the differences i.e., forward an Ff &) is the polynomial of nth degree i wth gree in x, then the constant and (n + 1)th differences are cent re : Proof. Let f(x) =ayx"+a,x"1+a,x"24.... is a positive integer and XH, Gy, Agy....,0,, ALE consignee -. By the definition of the operator A, we have Af x) =f@+h)-f) = fag x + AY + aye + hy + age + hy +... In — fag” + a,xr = ay [x + hy? — 2") +0, [e+ hyt- 2") + ay [x + hy P-2*7] +... sayin. xt}. han.(n— Der? het ey ] (n= Dx? h+ -V)(n-2)x"9 AP +$do [(n- 2) x". + (n-2) 0 +a, 9 UNLEKPULATION WITH EQUAL INTERVALS CHAPTER 2.1. INTERPOLATION —_ Interpolation is the process of estimating the value of the function (or entry) for any intermediate value of the variable (or argument) with the help of its given set of values (w! high may be at equal interval or at unequal interval), C4 S]}let us assume that the functio = f(x) is known for certain values of x He Maemo hyp BSF (Xo), (x), F(x,),... f tx, f The process of finding the values of f(x) corresponding to % =x, where x, %, Hor exampleSf the population of a town during the last five censuses is as given below : Year: 1961 1971 1981 1991 2001 Population (in lacs) : 12 15 20 27 39 a then, the process of finding the population for the year 1965 is called interpolation while the Process of finding population for the year 2005 is called extrapolation The exact form of the function / (x) is generally unknown or even if known it is usually of a complicated nature. Hence for interpolation purpose, we have to depend on finite difference methods. All finite difference methods are based on the following assumptions : (@ The given function is a polynomial in x. The degree of the polynomial depends upon the number of given values of the function. In general, ifn +1 values are given, we assume that f(x) isa poly of degree n unless stated otherwise. values of the function should be either in increasing or in decreasing order ie., not be sudden jumps or falls in the values of the function in the interval under er, we shall discuss the Newton’s forward and Newton’s backward formulae n when the values of arguments (x) are equally spaced, rT OFC) part as The te oe prs ss = sf Ache Punchs Ft) ty ae od a, ee t eee Cx th) be Mae fu Pow 2a xd alifpene thogonal rotation matrix in plan py Aq, @,, and a ay = Cos 0 =a ‘ap Which are ag follows : aw pq =—sin @ and a, =sin 0 example : (i) An sepganal rotation matrix i in plane C dy ae =F cos6 0 —sin @ Pr D) rs F | Be |o(0'. Ae: 20 F*Colornn, Told sin® 0 cos@ a) cose —Sing = rotation matrix in plane (1, “ofordee sis) | met CoS O a cos8 0 0 —sin @ 7 24 L 0 10 0 pa xt ae Ont 9 (2,3) sin@ 0 0 cosg : ocae as HODFOR SYMMETRIC MATRIX eS A D Sing (4 e eigen value S of a real sym me ic matrix, retin cnt er eh a Jacobi’s method consists of alizing A by applying a seri , B, such that ‘their Product B sati; ‘tric matrix, BC + "C=" tg ofy of fifth term and onwards by 1, we have Ix Fo + May Ao + Ko) 1 + (U + Dig, A%y_, + (U+ D4) (A4V_2 + 4°72) + [Te Ay, = Ary gt Att ly o, -. AG = At tA | =: # UAV + Ue A*y_, + (U+ Dg A®y_, + (Ut Dy dty_o + sii led the Gauss Forward Interpolation Formul a oe uc) = ~ Mea= 1 \y Gauss Forward formula is useful when u lies between 0 and 4.3. GAUSS BACKWARD INTERPOLATION FORMULA \ {K.U. 2017, ! We know that Newton’s advancing formula is . Ye =Yo + Way AYo + Hi) Ag + Hig AXV9 + Uy AY + fl Here, except the first term on R.H.S., the subscript of y in each term is reduced by 1, ust the formula 9 AP yy = Nahe ty. | ‘a

You might also like