On Approximations by Polynomial and Trigonometrical Splines of the Fifth Order

Size: px
Start display at page:

Download "On Approximations by Polynomial and Trigonometrical Splines of the Fifth Order"

Transcription

1 I. G. Burova T. O. Evdoimova On Approximations by Polynomial and Trigonometrical Splines of te Fift Order I.G. BUROVA St. Petersburg State University Matematics and Mecanics Faculty Universitetsy prospet 8 Peterof St. Petersburg RUSSIA i.g.burova@spbu.ru burovaig@mail.ru T.O. EVDOKIMOVA St. Petersburg State University Matematics and Mecanics Faculty Universitetsy prospet 8 Peterof St. Petersburg RUSSIA t.evdoimova@spbu.ru Abstract: Here we consider several approaces for constructing approximations of a function by te polynomial and te trigonometric splines of te fift order. We compare te approximations to te left te rigt and te middle minimal polynomial splines te approximations to te left te rigt and te middle minimal trigonometrical splines te approximations to te left te middle polynomial integro-differential splines and te approximation to te left te rigt and te middle trigonometrical integro-differential splines. Te quadrature formulas are represented. Te results of some calculations are done. Key Words: Polynomial splines Trigonometrical splines Integro-Differential Splines Interpolation. 1 Introduction Nowadays tere are many different splines for solving different problems [1 10]. B-splines conic splines cubic polynomial and nonpolynomial splines and box spline functions can be used for interpolation or approximation of scattered data simulation of te eart waveform plotting surfaces and etc. Minimal splines are intended for te approximation and interpolation functions. If we now te values of te functions in grid nodes we can construct te approximation on every net interval separately. In te next sections we compare te results of te approximations to te minimal splines see [11] to te polynomial integro-differential splines and to te nonpolynomial integro-differential splines see [1] of te fift order. Polynomial integro-differential splines were first used by Kireev V.I. [13]. In general construction of solutions of delay differential equations is muc more complicated tan te construction of solutions of ordinary differential equations [14 1]. We ave te Caucy problem for a numerical solution on eac interval. Te solution on te interval requires te solution from te previous interval. Some necessary values may be missing among te calculated values but tey may be obtained by interpolating [0]. Interpolation sould use te positions of te discontinuities of te derivatives. Te application splines of te fift order for te delay problem is presented in te last section. We need to use te values of te function only in te given interval so we use te approximations wit te left and te rigt basic splines. Splines of te fift order We consider te grid of equidistant nodes wit te step a = x 0 < x 1 <... < x n = b. Let te function ux be suc tat u C 5 [a b]. We ave to use te interpolation nodes only on te interval [a b]. Terefore we can use polynomial boundaryminimal splines see [11]. Rigt boundary-minimal splines are used on te left side on [a b] and left boundary-minimal splines are used on te rigt side on te interval. We denote by ũx an approximation by te polynomial minimal splines: ũx = ux ω x x [x x +1 ] an approximation by te trigonometric minimal splines: ũx = ux w x x [x x +1 ] an approximation by te polynomial integro- E-ISSN: Volume 1 015

2 I. G. Burova T. O. Evdoimova differential splines: ũx = x +i1 ut dt ω < ii1> x x x x +1 x i an approximation by te trigonometric integrodifferential splines: ũx = x +i1 x i ut dt w < ii1> x x x x +1 were i 1 i are integer numbers ω x w x ω < i +i 1 > x w < i i 1 > x we determine from te system: ũx = ux ux = φ i x i = Here φ i x i = is Cebysev system on [a b] φ i C 5 [x 0 x n ]. In polynomial case we tae φ i x = x i 1 i = ; in trigonometric case we tae φ 1 x = 1 φ x = sinx φ 3 x = cosx φ 4 x = sinx φ 5 x = cosx. 3 Approximation by te middle polynomial integro-differential splines Let us tae an approximation for ux x x x +1 in te form: x ũx = x 1 x + utdt ω < 10> x + x 1 + utdt ω < 1> x+ +1 utdt ω <01> x +3 x+ + utdt ω <1> x + utdt ω <3> x x +1 x + were ω <ss+1> x s = we find from te system 1. Let us tae φ i x = x i 1 i = If we put x = x + t t 0 1 ten we obtain: x + t = 5t t + 10t 0t ω < 1> x +t = 10t4 7 15t + 75t 30t x + t = 30t t 15t 4 75t 60 5 x + t = 13 45t + 10t 4 + 5t 10t ω <3> x + t = 5t t ω < 10> ω <01> ω <1> Let us tae Ũx x a b suc tat Ũx = ũx x x x +1 = 3... n 3. We put f xi x i+1 = sup x x i x i+1 fx f = f Xab = max i sup x x i x i+1 fx. Teorem 1. Let function ux be suc tat u C 5 [a b]. For approximation ux x x x +1 by 3 7 we ave: ũx ux K 1 5 u 5 x x +3 8 R 1 = Ũ u Xx x n K 1 5 u 5 Xx0 x n 9 K 1 = Proof. Inequality 8 follows from te relations 3 7 and Taylor formula wit te remainder term in Lagrange form. Here te next inequalities were used: ω < 1> x 1/0 ω <01> x ω < 10> x 9/0 ω <1> x 9/0 ω <3> x 1/0. Inequality 9 follows from 8. 4 Approximation by middle polynomial minimal splines of Lagrange type Consider te case of te middle minimal splines. Let us tae an approximation for u C 5 [a b] x [x x +1 ] in te form: ũx = ux ω x + ux 1 ω 1 x+ +ux ω x + ux +1 ω +1 x+ 10 +ux + ω + x were supp ω = [x x +3 ] ω +s s = we find from te system 1. Let us tae φ i x = x i 1 i = E-ISSN: Volume 1 015

3 I. G. Burova T. O. Evdoimova If we put x = x + t t [0 1] ten we ave ω x + t = tt 1t t ω 1 x + t = ω x + t = ω +1 x + t = ω + x + t = tt 1t t t 1t t + t tt t + t tt 1t + t Teorem. Let function u be suc tat u C 5 [a b]. For approximation ux x [x x +1 ] by we ave: ũx ux K 5 u 5 [x x + ] 16 R = Ũ u [x x n ] K 5 u 5 [x0 x n] 17 K = Proof. Inequality 16 follows from te inequality: ũx ux [x x +1 ] 1 5! max [x x + ] u5 x max [x x +1 ] x x x x 1 x x x x +1 x x +. Inequality 17 follows from 16. Table 1 sows te actual errors of approximation of te functions. Here R M <P > is te actual error of approximation by te splines 3 7 RM P is te actual error of approximation by te splines on 1 1 wen = 0.1. Calculations were done in Maple Digits=15. Table 1. Actual errors of approximations by te splines 3 7 and by te splines ux R M <P > RM P 1/1 + 5x sinx sin3x x Figure 1 sows te error of approximation of te function 1/1 + 5x by te middle minimal polynomial middle splines Figure 1: Plot of te error of approximation ux = 1/1+5x by te middle polynomial spline Quadrature formula From te approximation by te minimal polynomial middle splines on [x x +1 ] we receive: x+1 x ũtdt = ux ux ux ux ux Now in we can use 18. We ave: x+1 x utdt = x+1 x ũtdt + r were r = 0 if ux = x i 1 i = Left polynomial splines For x [x x +1 ] we tae ũx in te form: ũx = ux 3 ω 3 x + ux ω x+ +ux 1 ω 1 x + ux ω x+ 19 +ux +1 ω +1 x were supp ω = [x 1 x +4 ] ω +s x s = we find from te system 1. Let us tae φ i x = x i 1 i = If we put x = x + t t [0 1] ten we ave: ω +1 x + t = tt + 1t + t ω x + t = t 1t + t tt 1t + t + 3 ω 1 x + t = 4 ω x + t = tt + 3t E-ISSN: Volume 1 015

4 I. G. Burova T. O. Evdoimova ω 3 x + t = tt 1t Let us tae Ũx x a b suc tat Ũx = ũx x x x +1 = n 1. Teorem 3. Let function ux be suc tat u C 5 [a b]. For approximation ux x [x x +1 ] by we ave te estimation: ũx ux K 5 u 5 [x 3 x +1 ] 5 R = Ũ u [x 3 x n ] K 5 u 5 [x0 x n ] 6 were K = Proof. Te inequality 5 follows from te next relation: ũx ux [x x +1 ] 1 5! max [x 3 x +1 ] u5 x max [x x +1 ] x x 3x x x x 1 x x x x +1. Inequality 6 follows from 5. Figure sows te error of approximation of te function 1/1 + 5x by te left polynomial splines Figure : Plot of te error of approximation ux = 1/1 + 5x by te left polynomial spline Quadrature formula From te approximation by te minimal polynomial left splines on [x x +1 ] we receive te next formula: x+1 ũtdt = ux ux x ux ux ux Now in we can use 7. We ave: x+1 x utdt = x+1 x ũtdt + r were r = 0 if ux = x i 1 i = Rigt polynomial splines For x [x x +1 ] we tae ũx in te form: ũx = ux ω x + ux +1 ω +1 x+ +ux + ω + x + ux +3 ω +3 x+ 8 +ux +4 ω +4 x were supp ω = [x 4 x +1 ] ω +s x s = we find from te system 1 for φ i x = x i 1 i = If we put x = x + t t [0 1] ten we ave: ω x + t = ω +1 x + t = ω + x + t = ω +3 x + t = ω +4 x + t = t 4t 3t t tt t 3t tt 1t 3t tt 1t t tt 1t t Let us tae Ũx x a b suc tat Ũx = ũx x x x +1 = n 5. Teorem 4. Let function ux be suc tat u C 5 [a b]. For approximation u x [x x +1 ] by we ave ũx ux K 5 u 5 [x x +4 ] 34 R = Ũ u [x 0 x n 4 ] K 5 u 5 [x0 x n] 35 K = Proof. Inequality 34 follows from te relation: ũx ux [x x +1 ] 1 5! max [x x +4 ] u5 x max [x x +1 ] x x x x +1 x x + x x +3 x x +4. Inequality 35 follows from 34. E-ISSN: Volume 1 015

5 I. G. Burova T. O. Evdoimova Table sows te actual errors of approximation by te left and rigt splines. Here RL P is te actual error of approximation by te splines and RR P is te actual error of approximation by te splines on 1 1 wen = 0.1. Calculations were done in Maple Digits=15. Table. Te actual errors of approximations by te left splines and te actual errors of approximations by te rigt splines ux RL P RR P 1/1 + 5x sinx sin3x x Figure 3 sows te error of approximation of te function 1/1 + 5x by te rigt polynomial splines Figure 3: Plot of te error of approximation ux = 1/1 + 5x by te rigt polynomial splines Quadrature formula From te approximation by te minimal polynomial rigt splines on [x x +1 ] we receive: x+1 x ũtdt = ux ux ux ux ux Now in we can use 36. We ave: x+1 x utdt = x+1 x ũtdt + r were r = 0 if ux = x i 1 i = Middle trigonometrical splines Let us tae an approximation for u C 5 [a b] x [x x +1 ] in te form: ũx = ux w x + ux 1 w 1 x+ +ux w x + ux +1 w +1 x+ 37 +ux + w + x were supp w = [x x +3 ] w +s s = we find from te system 1 were φ 1 x = 1 φ x = sinx φ 3 x = cosx φ 4 x = sinx φ 5 x = cosx. If we put x = x + t x [x x +1 ] t [0 1] ten: w x +t = S 1 = sin t+ sin t S 1 sin/ sin sin3/ sin sin t sin t 38 w 1 x + t = sin / sin sin3/ S = sin t + sin t w x + t = S 3 = sin t + sin t+ w +1 x +t = sin t S sin t 39 S 3 sin sin / 40 sin t S 4 = sin t + sin t+ sin t sin t S 4 sin3/ sin sin / 41 sin t S 5 w + x +t = sin sin3/ sin sin/ 4 S 5 = sin t + sin t+ sin t sin t. It can be sown tat for te polynomial basic splines ω s x 10 and trigonometrical basic splines w x 37 te next relation is fulfilled w x +t = ω x + t + O = Figure 4 sows te error of approximation of te function 1/1 + 5x by te trigonometrical splines Teorem 5. Te error of te approximation by te splines is te next: ũx ux K 5 4u + 5u + u V [x x + ] 43 were x [x x +1 ] K = 0.1. Proof. Te function ux on [x x +1 ] can be written in te form see [1] ux = x 3 x 4u τ+ E-ISSN: Volume 1 015

6 I. G. Burova T. O. Evdoimova Figure 4: Plot of te error of approximation 1/1 + 5x by te trigonometrical splines u τ+u V τ sin 4 x/ τ/dτ +c 1 +c sinx+ c 3 cosx+c 4 sinx+c 5 cosx were c i i = are arbitrary constants. We ave: w x 0.08 w 1 x 0.1 w x 1 w +1 x 1 w + x Using te metod from [1] we obtain Left trigonometrical splines For x [x x +1 ] we tae ũx in te form: ũx = ux 3 w 3 x + ux w x+ +ux 1 w 1 x + ux w x+ 44 +ux +1 w +1 x were supp ω = [x 1 x +4 ] w +s x s = we find from te system 1. Let us tae φ 1 x = 1 φ x = sinx φ 3 x = cosx φ 4 x = sinx φ 5 x = cosx. If we put x = x + t t [0 1] ten we ave: w +1 x + t = T +1 /T 1 45 T +1 = sin t+3 sin t + sin t+ sin t T 1 = sin sin 3 sin sin w x + t = T /T 46 T = sin t+3 sin t + sin t+ sin t T = sin 3 sin sin w 1 x + t = T 1 /T 3 47 T 1 = sin t+3 sin t + sin t sin t T 3 = sin sin T = sin t+3 w x + t = T /T 4 48 sin t+ sin t sin t T 4 = sin sin sin 3 w 3 x + t = T 3 /T 5 49 T 3 = sin t + sin t+ sin t sin t T 5 = sin sin sin 3 sin. Teorem 6. Te error of te approximation by te splines is te next: ũx ux K 5 4u + 5u + u V [x 3 x +1 ] 50 were x [x x +1 ] K = 0.5. Proof is similar to tat done in te proof of Teorem 5. Here te next inequalities were used: w 3 x 0.1 w x 0. w 1 x 0.36 w x 1 w +1 x Rigt trigonometrical splines For x [x x +1 ] we tae ũx in te form: ũx = ux w x + ux +1 w +1 x+ +ux + w + x + ux +3 w +3 x+ 51 +ux +4 w +4 x were supp w = [x 4 x +1 ] w +s s = we find from te system 1. Let us tae φ 1 x = 1 φ x = sinx φ 3 x = cosx φ 4 x = sinx φ 5 x = cosx. If we put x = x + t t [0 1] ten we ave: w x + t = T R /T 0R 5 T R = sin t sin t 3 sin t sin t T 0R = sin sin3/ sin sin/ w +1 x + t = T R +1 /T 1R 53 T+1 R = sin t sin t 3 sin t sin t T 1R = sin3/ sin sin / w + x + t = T R + /T R 54 T+3 R = sin t sin t 3 sin t sin t T R = sin sin / w +3 x + t = T R +3 /T 3R 55 T+3 R = sin t sin t sin t sin t T 3R = sin / sin sin/ w +4 x + t = T R +4 /T 4R 56 T+4 R = sin t 3 sin t sin t sin t T 4R = sin/ sin sin3/ sin. E-ISSN: Volume 1 015

7 I. G. Burova T. O. Evdoimova Teorem 7. Te error of te approximation by te splines is te next: ũx ux K 5 4u + 5u + u V [x x +4 ] were x x x +1 K =. Proof is similar to tat done in te proof of Teorem 5. Here te next inequalities were used: w x 1 w +1 x 1.1 w + x 0.36 w +3 x 0. w +4 x 0.1. Table 3 sows te actual errors of approximation by te left and rigt trigonometrical splines. RL T is te actual error of approximation by te splines RR T is te actual error of approximation by te splines on 1 1 wen = 0.1. Calculations were done in Maple Digits=15. Table 3. Actual errors of approximations by te left splines and by te rigt splines ux RL T RR T 1/1 + 5x sinx sin3x x Table 4 sows te actual and teoretical errors of approximation by te middle trigonometrical splines. RM T is te actual error of approximation by te splines R T M is te teoretical error of approximation by te splines on 1 1 wen = 0.1. Calculations were done in Maple Digits=15. Table 4. Actual errors of approximations by te middle splines and teoretical errors of approximation by te middle splines ux RM T R T M 1/1 + 5x sinx sin3x x Approximation by polynomial integro-differential splines in special form Let us tae for x x x +1 : ũx = J 1 ω <0> x+ +J ω < 11> x + J 3 ω < 1> x+ were J 1 = J 3 = +J 4 ω < 31> x + J 5 ω < 41> x 57 x+ x utdt J = x+1 x utdt J 4 = J 5 = x+1 x+1 x 1 utdt 58 x+1 x 3 utdt 59 x 4 utdt. 60 From ũx = ux u = x i 1 i = we find ω <0> x ω < 11> x ω < 1> x ω < 31> x ω < 41> x. So we ave for x = x + t t 0 1 x + t = 30t + 75t + 36t 3 + 5t x +t = 18t 33t 76t 3 15t x +t= 6 898t 69t + 356t t x +t= 57t 5t t 84t x +t= 55t4 310t 135t + 140t ω <0> ω < 11> ω < 1> ω < 31> ω < 41> Teorem 8. Suppose te function ux be suc tat u C 5 [x 0 x n ] ũx is given by Ten for x x x +1 we ave: ũx ux K 5 5 u 5 x 4 x + 66 K 5 = Proof. We ave from 61 65: ω <0> x 10/384 = 0.315/ ω < 11> x / / ω < 1> x / / ω < 31> x / / ω < 41> x / /. Representing ux by te Taylor formula one obtains 66. Let us tae Ũx x a b suc tat Ũx = ũx x x x +1 = n 3. E-ISSN: Volume 1 015

8 I. G. Burova T. O. Evdoimova Teorem 9. Suppose te ypotesis of te Teorem 3 is fulfilled. Ten: R = Ũ u x 4 x n K 5 u 5 ab 67 K = Proof. Inequality 67 follows from te relation 66. Table 5 sows te errors of approximation of functions by te splines on 1 1 wen = 0.1. Te calculations of te actual error R <P > were done in Maple Digits=15. Table 5. Te errors of approximation of functions by te splines N ux R <P > 1 1/1 + 5x sinx sin3x x Figure 5 sows te errors of approximation of te function 1/1 + 5x by te polynomial integrodifferential splines on 1 1 = utdt utdt + w <1> x + w <3> x x +1 x + 68 were w < 1> x w < 10> x w <01> x w <1> x w <3> x we find from ũx = φ i x φ 1 x = 1 φ x = sinx φ 3 x = cosx φ 4 x = sinx φ 5 x = cosx. So we ave for x = x + t t 0 1: w < 1> x + t = sin 3t 1 sin t+1 + cos + 1 sin t+1 sin 1 t sin sin cos cos w < 10> x + t = sin + sin 4t cos 4 cos sin t 1 cos t sint cos 8 cos 3 + sin cos 7 cos Figure 5: Plot of te error of approximation of te function 1/1 + 5x by te polynomial integrodifferential splines Trigonometric integro-differential splines Let us tae for x x x +1 : + x x 1 ũx = x 1 x utdt w < 10> x + utdt w < 1> x+ +1 utdt w <01> x x+ 1 4 cos sin w <01> x +t = cos3+cos+1+cost cos + 1 cos 1 cost cos cos sin cos 1 1 sin + + sin 71 w <1> x +t = 4 cos sin t+1 cos t 1 sin t 1 cos t+1 + sin + t sin + t cos cos4 cos3 + 4 cos cos 3 1 cos + sin cos sin 7 w <3> x + t = 4 cos cost + cos cos + t cos cos + 1 sin cos+sin cos cos E-ISSN: Volume 1 015

9 I. G. Burova T. O. Evdoimova If we don t now te value of te integrals we can use quadrature formula. For example from trigonometrical splines we obtain +1 utdt = ux J +ux 1 J 1 +ux J 0 + x ux +1 J 1 + ux + J were J = 8 sin cos cos cos 1 sin + sin + cos cos + 1 J 1 = 4 sin cos cos 1 sin cos 3 sin cos + 14 cos 1 J 0 = 4 sin 1 cos 1 sin + cos cos+ + sin 1/ + cos J 1 = 1/ cos 4 cos 3 3 cos +cos+1 8 sin cos 3 3 sin cos sin cos + 3 sin 4 cos cos + cos/4 J = 8 sin cos cos cos 1 cos + cos sin cos sin. It can be easily sown tat between polynomial and trigonometric integro-differential splines te next relation is fulfilled w <ss+1> x + t = ω <ss+1> x + t + O. Table 6 sows te errors of approximation of functions by splines on 1 1 wen = 0.1. Te calculations of te actual error R M <T > were done in Maple Digits=15. Table 6. Te errors of approximation of functions by splines N ux R M <T > 1 1/1 + 5x sinx 0. 3 sin3x x Teorem 10. Te error of te approximation by te splines is te next: ũx ux K 5 4u + 5u + u V x x were x x x +1 K = 0.. Proof is similar to tat done in te proof of Teorem 5. Here te next inequalities were used: w < 1> x 0.05/ w < 10> x 0.45/ w <01> x 1.1/ w <1> 0.45/ w <3> x 0.05/. x 8 Rigt integro-differential trigonometric splines On te left side of [a b] te best approximation gives us te rigt basic splines. In eac x x +1 = n 5 te approximation for ux are presented in te form: + ũx = +1 utdt w <01> x +3 x+ + utdt w <1> x + utdt w <3> x+ x +1 x utdt w <34> x + utdt w <45> x x +3 x were w <ss+1> x s = are determined from te conditions φ 1 x = 1 φ x = sinx φ 3 x = cosx φ 4 x = sinx φ 5 x = cosx. were If we put x = x + t t 0 1 ten we ave w <01> x + t = G <01> 1 G <01> 76 G <01> 1 = 8 sin 3 cos cos + 1 cos 1 1 G <01> = 1 sin cos + 1 cos + 1 cos4 cos 1 cost + + sin sint + 4cos + 1 cos cost + cos4 1 cost w <1> x + t = G <1> 1 G <1> 77 E-ISSN: Volume 1 015

10 I. G. Burova T. O. Evdoimova were G <1> 1 = 4 sin cos + 1cos 1 1 G <1> = sin 4 cos 1 cos + 1 cos cos sint sint sin 8 cos cos+ cos+1 cost + +sin4 + sin + sin cost sin cos4 + cos + 1 cost were w <3> x + t = 1 + cos 4 sin 5 G<3> 1 78 G <3> 1 = cos + cos + cost cos sin 3 sin sint+ sin 1 4 sin4 sin cos sin sint sin3 sin cost were G <34> w <34> x + t = G <34> 1 G <34> 79 1 = 4 sin cos + 1cos 1 1 G <34> = sin 4 cos 1 sint cos cos cos sint cos4 + cos3 + cos sin4 cost+ 4 cos cos+ +cos4+4 cos cos sin cos t were w <45> x + t = G <45> /G <45> G <45> G <45> = 1 1 =8 sin 3 cos cos+1cos 1 sin cos + 1 cos + 1 cos cost + cost 4. Teorem 11. Te error of te approximation by te splines is te next ũx ux K 5 4u + 5u + u V x x were x x x +1 K =. Proof. Te function ux on x x +1 can be written in te form see [1]: ux= 3 4u τ+5u τ+u V τ sin 4 x τ dτ+ x c 1 + c sinx + c 3 cosx + c 4 sinx + c 5 cosx were c i i = are arbitrary constants. Here te next inequalities were used: w <01> x.9/ w <1> x.7/ w <3> x.9/ w <34> x 1.05/ w <45> x 0./. Using te metod from [1] we obtain from Let Ũx x a b be suc tat ũ x Ũx = ũ x x x x +1 = n 5. Teorem 1. For te error of approximation by trigonometric splines we ave te next relation: Ũ u x 0 x n 4 K 5 4u + 5u + u V x0 x n K =. Proof. Te proof follows from 81. Table 7 sows te teoretical R <T R > and te actual R R <T > errors of approximation by te splines tey were found in Maple Digits = 5 wit = 0.1. Table 7. N ux R <T > 1 1 R R <T R > 1+5x sinx sin3x x Trigonometric quadrature Sometimes if te values of te integrals are unnown te next trigonometric quadrature may be useful. From we obtain: x+1 x utdt = ux J 0 + ux +1 J 1 + were: +ux + J + ux +3 J 3 + ux +4 J 4 + r J 0 = Q 01 /Q 0 Q 01 = cos 4 sin cossin + cos + sin + sin + cos Q 0 = 8cos cos cos sin J 1 = Q 11 /Q 1 Q 11 = + sin sin + sin4 cos + sincos cos1 4 cos 4 cos E-ISSN: Volume 1 015

11 I. G. Burova T. O. Evdoimova Q 1 = 4cos cos sin J = Q 1 /Q Q 1 = 3 sin cos + 4 sin cos 3 + sin 4 cos 3 + cos Q = 4cos 3 cos cos + 1 J 3 = Q 31 /Q 3 J 4 = Q 41 /Q 4 Q 31 = sin cos3 + 4 cos + cos cos cos Q 3 = 4cos cos sin Q 41 = sin cos cos cos + sin Q 4 = 8cos cos cos sin. Tis formula suc tat r = 0 if u = 1 sinx cosx sinx cosx. 9 Left integro-differential trigonometric splines On te rigt side of [a b] te best approximation gives us te left basic splines. In eac interval x x +1 = te approximation for ux is presented in te form: + x ũx = x 3 x 4 utdtw < 3 > x 3 + x x 1 utdt w < 4 3> x+ x+ 1 utdtw < 10> x + utdtw < 1> x +1 utdtw <01> x x+ x 8 were w <ss+1> x s = are determined from te conditions from ũx = φ i x φ 1 = 1 φ = sinx φ 3 = cosx φ 4 = sinx φ 5 = cosx. If we put x = x + t t 0 1 ten we ave: w < 4 3> x + t = P < 4 3> were: P < 4 3> /P < 4 3> = 4 sin sin cos + 1 cos 1 P < 4 3> = cos + 1 cos cost + + sin cos cos + t 1 w < 3 > x + t = P < 3 > /P < 3 > 1 84 were: P < 3 > P < 3 > 1 = 4 sin cos + 1cos 1 = sin cost sin cost + sin 4 cos 1 + cos + cos + 1 sin cos t + sin cost + w < 1> x + t = P < 1> were: P < 1> /P < 1> = 4 sin 3 cos 1 P < 1> = 4 cos 3 cos cos t cos cost sin4 + sin cost w < 10> x + t = P < 10> /P < 10> 1 86 were: P < 10> 1 = 4 sin 3 1 cos cos + 1 P < 10> = sin cos + 1 sint + cos cos 1 1 cos t + cos + cos+1 sin sint cost+ cos cos 3 cos t + sin4 cos 1 cos+1 were: P <01> P <01> w <01> x + t = P <01> /P <01> =8 sin 3 cos cos+1cos 1 = cos + 1 cos cost + + cos4 + t + 1 sin cos + 1. Teorem 13. Te error of te approximation by te splines is te next: ũx ux K 5 4u + 5u + u V x 4 x were x x x +1 K =.1. Proof is similar te proof of Teorem 11. Here te next inequalities were used: w < 4 3> x 0./ w < 3 > x 1.05/ w < 1>.7/ w <01> x.9/ w < 10> x.9/. x Let Ũx x a b be suc tat ũ x Ũx = ũ x x x x +1 = n 1. Teorem 14. For te error of approximation by trigonometric splines we ave te next relation: Ũ u x 4 x n K 5 4u + 5u + u V x0 x n K =.1. Proof follows from 88. E-ISSN: Volume 1 015

12 I. G. Burova T. O. Evdoimova Table 8 sows te teoretical R <T L > and actual R L <T > errors of approximation of functions by trigonometric splines calculated in Maple for Digits = 5 and = Table 8. N fx R <T > 1 1 L R <T L > 1+5x sinx sin3x x We can use te next formula if te values of te integrals are unnown. From we obtain: x+1 x utdt ux 3 J 3 + ux J + were: +ux 1 J 1 + ux J 0 + ux +1 J 1 J 3 = Q 31 /Q 3 J = Q 1 /Q Q 31 = sin cos + sin cos cos Q 4 = 8 sin cos cos cos Q 1 = sin cos + sin cos + cos cos3 Q = 4 sin cos cos J 1 = Q 11 /Q 1 J 0 = Q 01 /Q 0 Q 11 = sin cos3+1+sin cos Q 1 = 4 sin 1 cos Q 01 = sin4 cos sin + cos3 + sin 3 cos 3 cos Q 0 = 4 sin cos cos J 1 = Q 11 /Q 1 Q 11 = sin sin sin sin4 + cos + cos Q 1 = 8 sin cos cos cos. 10 Application for solving delay equation We consider te delay differential equations: y = yt 1 for t 1 89 wit constant istory yt = 1 0 t 1. Te solution of equation 89 is suc tat y becomes discontinuous at x = 1 y becomes discontinuous at x = and so on. Here for solving tis problem we apply approximation metods wit te minimal trigonometric splines and te polynomial integro-differential splines. Figures 6 and 7 sow te errors of solution of te delay problem 89 wen = e 07 3e 07 e 07 1e e Figure 6: Plot of te error of solution of te delay problem 89 by trigonometric left and rigt splines. 1e 07 8e 08 6e 08 4e 08 e 08 e e 08 6e 08 8e Figure 7: Plot of te error of solution of te delay problem 89 by polynomial splines Conclusion Polynomial and nonpolynomial minimal and integrodifferential splines are useful for solving different approximation problems. Te results represented in te tables sows tat te constants in te estimations of te errors of approximation represented in te teorems can be diminised. Here tese constants were calculated using te Taylor teorem wit te remainder term in Lagrange form. Furter more we are going to minimize te constants taing te remainder term of te Taylor teorem in anoter form and to find a way for minimizing te constants in te estimations of te errors of approximation for nonpolynomial splines. References: [1] Sarfraz M. Generating outlines of generic sapes by mining feature points. WSEAS Transactions on Systems. Vol pp [] Sala V. Fast interpolation and approximation of scattered multidimensional and dynamic data E-ISSN: Volume 1 015

13 I. G. Burova T. O. Evdoimova using radial basis functions. WSEAS Transactions on Matematics. Vol. 1 Iss. 5 May 013 pp [3] Popoviciu N. Boncut M. On te teorem of curry & scoenberg and te relation between B-Spline and Box-Spline Functions. Recent Researces in Computational Tecniques Non-Linear Systems and Control. Proc. of te 13t WSEAS Int. Conf. on MAMECTIS 11 NO- LASC 11 CONTROL 11 WAMUS pp [4] Kalovretis K. Ganetsos T. Sammas N.Y.A. Taylor I. Andonopoulos J. Development of a computerized ECG analysis model using te cubic spline interpolation metod. Recent Researces in Circuits Systems and Signal Processing - Proc. of te 15t WSEAS Int. Conf. on Circuits Part of te 15t WSEAS CSCC Multiconference Proc. of te 5t Int. Conf. on CSS pp [5] Popoviciu N. A comparison between two box spline algoritms based on inductive metod and geometric metod. Recent Researces in Computational Tecniques Non-Linear Systems and Control. Proc. of te 13t WSEAS Int. Conf. on MAMECTIS 11 NOLASC 11 CON- TROL 11 WAMUS pp [6] Furferi R. Governi L. Palai M. Volpe Y. From unordered point cloud to weigted B- spline - A novel PCA-based metod. Applications of Matematics and Computer Engineering - American Conf. on Applied Matematics AMERICAN-MATH 11 5t WSEAS International Conference on Computer Engineering and Applications CEA pp [7] Caglar H. Yilmaz S. Caglar N. Iseri M. A non-polynomial spline solution of te onedimensional wave equation subect to an integral conservation condition. Proc. of te 9t WSEAS International Conf. on Applied Computer and Applied Computational Science ACA- COS pp [8] Kuragano T. Quintic B-spline curve generation using given points and gradients and modification based on specified radius of curvature Article. WSEAS Transactions on Matematics. Vol. 9 Iss. 010 pp [9] Harus Kalis Oars Lietuvietis. On Finite Difference Approximations for Solving some Problems of Matematical Pysics wit Periodical Boundary Conditions. Advances in Applied and Pure Matematics. Proc. of te 7-t International Conf. on Finite Differences Finite Elements Finite Volumes Boundary Elements Fand-B 14. Gdans. Poland. May pp [10] Fengmin Cen Patricia J.Y.Wong. On periodic discrete spline interpolation: Quintic and biquintic case. Journal of Computational and Applied Matematics pp [11] Burova I.G. Demyanovic Yu.K. Minimal Splines and teirs Applications. Spb.010. in Russian [1] Burova Irina. On Integro- Differential Splines Construction. Advances in Applied and Pure Matematics. Proc. of te 7-t International Conf. on Finite Differences Finite Elements Finite Volumes Boundary Elements F-and-B 14. Gdans. Poland. May pp [13] Kireev V.I. Panteleev A.V. Numerical metods in examples and tass. Moscow p. Russian [14] N.E.Mastorais. An extended Cran-Nicolson metod and its Applications in te Solution of Partial Differential Equations: 1-D and 3-D Conduction Equations. Proceedings of te 10t WSEAS International Conference on APPLIED MATHEMATICS Dallas Texas USA November pp [15] Nicola Guglielmi Ernst Hairer. Numerical approaces for state-dependent neutral delay equations wit discontinuities. Matematics And Computers In Simulation. Vol pp. 1. [16] Kennedy Benamin B. A State-Dependent Delay Equation wit Negative Feedbac and Mildly Unstable Rapidly Oscillating Periodic Solutions. Discrete and Continuous Dynamical System. Series B pp [17] Borges Ricardo; Calsina Angel; Cuadrado Silvi Odo Diemann. Delay equation formulation of a cyclin-structured cell population model Journal of Evolution Equations. Vol. 14 Issue pp [18] Abdellatif Ben Malouf Moamed Ali Hammami. A comment on Exponential stability of nonlinear delay equation wit constant decay rate via perturbed system metod. International Journal of Control Automation and Systems. Vol. 1 Issue pp [19] Bellman R.E. Cooe K.L. On te Computational solution of a class of functional differential equations. J.Mat. Anal. and its Appl. Volume pp [0] Hall G. Watt J.M. Modern Numerical Metods for Ordinary Differential Equations [1] Zang Cengui Agarwal Ravi P. Boner Martin And Li Tongxing. Oscillation of fourt-order delay dynamic equations. Science Cina. January 015 Vol.58 No.1 pp E-ISSN: Volume 1 015

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x

More information

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note

More information

New Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems

New Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems MATEMATIKA, 2015, Volume 31, Number 2, 149 157 c UTM Centre for Industrial Applied Matematics New Fourt Order Quartic Spline Metod for Solving Second Order Boundary Value Problems 1 Osama Ala yed, 2 Te

More information

Parametric Spline Method for Solving Bratu s Problem

Parametric Spline Method for Solving Bratu s Problem ISSN 749-3889 print, 749-3897 online International Journal of Nonlinear Science Vol4202 No,pp3-0 Parametric Spline Metod for Solving Bratu s Problem M Zarebnia, Z Sarvari 2,2 Department of Matematics,

More information

Superconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract

Superconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract Superconvergence of energy-conserving discontinuous Galerkin metods for linear yperbolic equations Yong Liu, Ci-Wang Su and Mengping Zang 3 Abstract In tis paper, we study superconvergence properties of

More information

Parameter Fitted Scheme for Singularly Perturbed Delay Differential Equations

Parameter Fitted Scheme for Singularly Perturbed Delay Differential Equations International Journal of Applied Science and Engineering 2013. 11, 4: 361-373 Parameter Fitted Sceme for Singularly Perturbed Delay Differential Equations Awoke Andargiea* and Y. N. Reddyb a b Department

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL IFFERENTIATION FIRST ERIVATIVES Te simplest difference formulas are based on using a straigt line to interpolate te given data; tey use two data pints to estimate te derivative. We assume tat

More information

Order of Accuracy. ũ h u Ch p, (1)

Order of Accuracy. ũ h u Ch p, (1) Order of Accuracy 1 Terminology We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, wic can be for instance te grid size or time step in a numerical

More information

How to Find the Derivative of a Function: Calculus 1

How to Find the Derivative of a Function: Calculus 1 Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te

More information

Click here to see an animation of the derivative

Click here to see an animation of the derivative Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,

More information

lecture 26: Richardson extrapolation

lecture 26: Richardson extrapolation 43 lecture 26: Ricardson extrapolation 35 Ricardson extrapolation, Romberg integration Trougout numerical analysis, one encounters procedures tat apply some simple approximation (eg, linear interpolation)

More information

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx. Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions

More information

Calculus I - Spring 2014

Calculus I - Spring 2014 NAME: Calculus I - Spring 04 Midterm Exam I, Marc 5, 04 In all non-multiple coice problems you are required to sow all your work and provide te necessary explanations everywere to get full credit. In all

More information

Lecture 21. Numerical differentiation. f ( x+h) f ( x) h h

Lecture 21. Numerical differentiation. f ( x+h) f ( x) h h Lecture Numerical differentiation Introduction We can analytically calculate te derivative of any elementary function, so tere migt seem to be no motivation for calculating derivatives numerically. However

More information

(a) At what number x = a does f have a removable discontinuity? What value f(a) should be assigned to f at x = a in order to make f continuous at a?

(a) At what number x = a does f have a removable discontinuity? What value f(a) should be assigned to f at x = a in order to make f continuous at a? Solutions to Test 1 Fall 016 1pt 1. Te grap of a function f(x) is sown at rigt below. Part I. State te value of eac limit. If a limit is infinite, state weter it is or. If a limit does not exist (but is

More information

2.3 Algebraic approach to limits

2.3 Algebraic approach to limits CHAPTER 2. LIMITS 32 2.3 Algebraic approac to its Now we start to learn ow to find its algebraically. Tis starts wit te simplest possible its, and ten builds tese up to more complicated examples. Fact.

More information

LECTURE 14 NUMERICAL INTEGRATION. Find

LECTURE 14 NUMERICAL INTEGRATION. Find LECTURE 14 NUMERCAL NTEGRATON Find b a fxdx or b a vx ux fx ydy dx Often integration is required. However te form of fx may be suc tat analytical integration would be very difficult or impossible. Use

More information

1. Consider the trigonometric function f(t) whose graph is shown below. Write down a possible formula for f(t).

1. Consider the trigonometric function f(t) whose graph is shown below. Write down a possible formula for f(t). . Consider te trigonometric function f(t) wose grap is sown below. Write down a possible formula for f(t). Tis function appears to be an odd, periodic function tat as been sifted upwards, so we will use

More information

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines Lecture 5 Interpolation II Introduction In te previous lecture we focused primarily on polynomial interpolation of a set of n points. A difficulty we observed is tat wen n is large, our polynomial as to

More information

Numerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions

Numerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions Proc. of te 8t WSEAS Int. Conf. on Matematical Metods and Computational Tecniques in Electrical Engineering, Bucarest, October 16-17, 2006 219 Numerical Solution of One Dimensional Nonlinear Longitudinal

More information

Fractional Derivatives as Binomial Limits

Fractional Derivatives as Binomial Limits Fractional Derivatives as Binomial Limits Researc Question: Can te limit form of te iger-order derivative be extended to fractional orders? (atematics) Word Count: 669 words Contents - IRODUCIO... Error!

More information

An Approximation to the Solution of the Brusselator System by Adomian Decomposition Method and Comparing the Results with Runge-Kutta Method

An Approximation to the Solution of the Brusselator System by Adomian Decomposition Method and Comparing the Results with Runge-Kutta Method Int. J. Contemp. Mat. Sciences, Vol. 2, 27, no. 2, 983-989 An Approximation to te Solution of te Brusselator System by Adomian Decomposition Metod and Comparing te Results wit Runge-Kutta Metod J. Biazar

More information

The Verlet Algorithm for Molecular Dynamics Simulations

The Verlet Algorithm for Molecular Dynamics Simulations Cemistry 380.37 Fall 2015 Dr. Jean M. Standard November 9, 2015 Te Verlet Algoritm for Molecular Dynamics Simulations Equations of motion For a many-body system consisting of N particles, Newton's classical

More information

MATH 155A FALL 13 PRACTICE MIDTERM 1 SOLUTIONS. needs to be non-zero, thus x 1. Also 1 +

MATH 155A FALL 13 PRACTICE MIDTERM 1 SOLUTIONS. needs to be non-zero, thus x 1. Also 1 + MATH 55A FALL 3 PRACTICE MIDTERM SOLUTIONS Question Find te domain of te following functions (a) f(x) = x3 5 x +x 6 (b) g(x) = x+ + x+ (c) f(x) = 5 x + x 0 (a) We need x + x 6 = (x + 3)(x ) 0 Hence Dom(f)

More information

1. Introduction. We consider the model problem: seeking an unknown function u satisfying

1. Introduction. We consider the model problem: seeking an unknown function u satisfying A DISCONTINUOUS LEAST-SQUARES FINITE ELEMENT METHOD FOR SECOND ORDER ELLIPTIC EQUATIONS XIU YE AND SHANGYOU ZHANG Abstract In tis paper, a discontinuous least-squares (DLS) finite element metod is introduced

More information

On the best approximation of function classes from values on a uniform grid in the real line

On the best approximation of function classes from values on a uniform grid in the real line Proceedings of te 5t WSEAS Int Conf on System Science and Simulation in Engineering, Tenerife, Canary Islands, Spain, December 16-18, 006 459 On te best approximation of function classes from values on

More information

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x) Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of

More information

A = h w (1) Error Analysis Physics 141

A = h w (1) Error Analysis Physics 141 Introduction In all brances of pysical science and engineering one deals constantly wit numbers wic results more or less directly from experimental observations. Experimental observations always ave inaccuracies.

More information

Some Review Problems for First Midterm Mathematics 1300, Calculus 1

Some Review Problems for First Midterm Mathematics 1300, Calculus 1 Some Review Problems for First Midterm Matematics 00, Calculus. Consider te trigonometric function f(t) wose grap is sown below. Write down a possible formula for f(t). Tis function appears to be an odd,

More information

MVT and Rolle s Theorem

MVT and Rolle s Theorem AP Calculus CHAPTER 4 WORKSHEET APPLICATIONS OF DIFFERENTIATION MVT and Rolle s Teorem Name Seat # Date UNLESS INDICATED, DO NOT USE YOUR CALCULATOR FOR ANY OF THESE QUESTIONS In problems 1 and, state

More information

= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c)

= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c) Paper 1: Pure Matematics 1 Mark Sceme 1(a) (i) (ii) d d y 3 1x 4x x M1 A1 d y dx 1.1b 1.1b 36x 48x A1ft 1.1b Substitutes x = into teir dx (3) 3 1 4 Sows d y 0 and states ''ence tere is a stationary point''

More information

The Sinc-Collocation Method for Solving the Telegraph Equation

The Sinc-Collocation Method for Solving the Telegraph Equation Te Sinc-Collocation Metod for Solving te Telegrap Equation E. Hesameddini *1, E. Asadolaifard Department of Matematics, Faculty of Basic Sciences, Siraz University of Tecnology, Siraz, Iran *1 esameddini@sutec.ac.ir;

More information

HOMEWORK HELP 2 FOR MATH 151

HOMEWORK HELP 2 FOR MATH 151 HOMEWORK HELP 2 FOR MATH 151 Here we go; te second round of omework elp. If tere are oters you would like to see, let me know! 2.4, 43 and 44 At wat points are te functions f(x) and g(x) = xf(x)continuous,

More information

NON STANDARD FITTED FINITE DIFFERENCE METHOD FOR SINGULAR PERTURBATION PROBLEMS USING CUBIC SPLINE

NON STANDARD FITTED FINITE DIFFERENCE METHOD FOR SINGULAR PERTURBATION PROBLEMS USING CUBIC SPLINE Global and Stocastic Analysis Vol. 4 No. 1, January 2017, 1-10 NON STANDARD FITTED FINITE DIFFERENCE METHOD FOR SINGULAR PERTURBATION PROBLEMS USING CUBIC SPLINE K. PHANEENDRA AND E. SIVA PRASAD Abstract.

More information

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems 5 Ordinary Differential Equations: Finite Difference Metods for Boundary Problems Read sections 10.1, 10.2, 10.4 Review questions 10.1 10.4, 10.8 10.9, 10.13 5.1 Introduction In te previous capters we

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary

More information

MANY scientific and engineering problems can be

MANY scientific and engineering problems can be A Domain Decomposition Metod using Elliptical Arc Artificial Boundary for Exterior Problems Yajun Cen, and Qikui Du Abstract In tis paper, a Diriclet-Neumann alternating metod using elliptical arc artificial

More information

Quantum Theory of the Atomic Nucleus

Quantum Theory of the Atomic Nucleus G. Gamow, ZP, 51, 204 1928 Quantum Teory of te tomic Nucleus G. Gamow (Received 1928) It as often been suggested tat non Coulomb attractive forces play a very important role inside atomic nuclei. We can

More information

Dedicated to the 70th birthday of Professor Lin Qun

Dedicated to the 70th birthday of Professor Lin Qun Journal of Computational Matematics, Vol.4, No.3, 6, 4 44. ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS Guang-wei Yuan Xu-deng Hang Laboratory of Computational Pysics,

More information

Research Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic Spline Quasi Interpolation

Research Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic Spline Quasi Interpolation Advances in Numerical Analysis Volume 204, Article ID 35394, 8 pages ttp://dx.doi.org/0.55/204/35394 Researc Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic

More information

Numerical Solution to Parabolic PDE Using Implicit Finite Difference Approach

Numerical Solution to Parabolic PDE Using Implicit Finite Difference Approach Numerical Solution to arabolic DE Using Implicit Finite Difference Approac Jon Amoa-Mensa, Francis Oene Boateng, Kwame Bonsu Department of Matematics and Statistics, Sunyani Tecnical University, Sunyani,

More information

3.4 Worksheet: Proof of the Chain Rule NAME

3.4 Worksheet: Proof of the Chain Rule NAME Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are

More information

NUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example,

NUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example, NUMERICAL DIFFERENTIATION James T Smit San Francisco State University In calculus classes, you compute derivatives algebraically: for example, f( x) = x + x f ( x) = x x Tis tecnique requires your knowing

More information

1.72, Groundwater Hydrology Prof. Charles Harvey Lecture Packet #9: Numerical Modeling of Groundwater Flow

1.72, Groundwater Hydrology Prof. Charles Harvey Lecture Packet #9: Numerical Modeling of Groundwater Flow 1.7, Groundwater Hydrology Prof. Carles Harvey Lecture Packet #9: Numerical Modeling of Groundwater Flow Simulation: Te prediction of quantities of interest (dependent variables) based upon an equation

More information

Continuity and Differentiability of the Trigonometric Functions

Continuity and Differentiability of the Trigonometric Functions [Te basis for te following work will be te definition of te trigonometric functions as ratios of te sides of a triangle inscribed in a circle; in particular, te sine of an angle will be defined to be te

More information

arxiv: v1 [math.ap] 4 Aug 2017

arxiv: v1 [math.ap] 4 Aug 2017 New Two Step Laplace Adam-Basfort Metod for Integer an Non integer Order Partial Differential Equations arxiv:178.1417v1 [mat.ap] 4 Aug 17 Abstract Rodrigue Gnitcogna*, Abdon Atangana** *Department of

More information

Numerical Differentiation

Numerical Differentiation Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function

More information

The Laplace equation, cylindrically or spherically symmetric case

The Laplace equation, cylindrically or spherically symmetric case Numerisce Metoden II, 7 4, und Übungen, 7 5 Course Notes, Summer Term 7 Some material and exercises Te Laplace equation, cylindrically or sperically symmetric case Electric and gravitational potential,

More information

University Mathematics 2

University Mathematics 2 University Matematics 2 1 Differentiability In tis section, we discuss te differentiability of functions. Definition 1.1 Differentiable function). Let f) be a function. We say tat f is differentiable at

More information

Sin, Cos and All That

Sin, Cos and All That Sin, Cos and All Tat James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 9, 2017 Outline Sin, Cos and all tat! A New Power Rule Derivatives

More information

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these. Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra

More information

Solution. Solution. f (x) = (cos x)2 cos(2x) 2 sin(2x) 2 cos x ( sin x) (cos x) 4. f (π/4) = ( 2/2) ( 2/2) ( 2/2) ( 2/2) 4.

Solution. Solution. f (x) = (cos x)2 cos(2x) 2 sin(2x) 2 cos x ( sin x) (cos x) 4. f (π/4) = ( 2/2) ( 2/2) ( 2/2) ( 2/2) 4. December 09, 20 Calculus PracticeTest s Name: (4 points) Find te absolute extrema of f(x) = x 3 0 on te interval [0, 4] Te derivative of f(x) is f (x) = 3x 2, wic is zero only at x = 0 Tus we only need

More information

2.3 More Differentiation Patterns

2.3 More Differentiation Patterns 144 te derivative 2.3 More Differentiation Patterns Polynomials are very useful, but tey are not te only functions we need. Tis section uses te ideas of te two previous sections to develop tecniques for

More information

Copyright c 2008 Kevin Long

Copyright c 2008 Kevin Long Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula

More information

ALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU. A. Fundamental identities Throughout this section, a and b denotes arbitrary real numbers.

ALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU. A. Fundamental identities Throughout this section, a and b denotes arbitrary real numbers. ALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU A. Fundamental identities Trougout tis section, a and b denotes arbitrary real numbers. i) Square of a sum: (a+b) =a +ab+b ii) Square of a difference: (a-b)

More information

Taylor Series and the Mean Value Theorem of Derivatives

Taylor Series and the Mean Value Theorem of Derivatives 1 - Taylor Series and te Mean Value Teorem o Derivatives Te numerical solution o engineering and scientiic problems described by matematical models oten requires solving dierential equations. Dierential

More information

Continuity. Example 1

Continuity. Example 1 Continuity MATH 1003 Calculus and Linear Algebra (Lecture 13.5) Maoseng Xiong Department of Matematics, HKUST A function f : (a, b) R is continuous at a point c (a, b) if 1. x c f (x) exists, 2. f (c)

More information

Implicit-explicit variational integration of highly oscillatory problems

Implicit-explicit variational integration of highly oscillatory problems Implicit-explicit variational integration of igly oscillatory problems Ari Stern Structured Integrators Worksop April 9, 9 Stern, A., and E. Grinspun. Multiscale Model. Simul., to appear. arxiv:88.39 [mat.na].

More information

A method for solving first order fuzzy differential equation

A method for solving first order fuzzy differential equation Available online at ttp://ijim.srbiau.ac.ir/ Int. J. Industrial Matematics (ISSN 2008-5621) Vol. 5, No. 3, 2013 Article ID IJIM-00250, 7 pages Researc Article A metod for solving first order fuzzy differential

More information

A CLASS OF EVEN DEGREE SPLINES OBTAINED THROUGH A MINIMUM CONDITION

A CLASS OF EVEN DEGREE SPLINES OBTAINED THROUGH A MINIMUM CONDITION STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume XLVIII, Number 3, September 2003 A CLASS OF EVEN DEGREE SPLINES OBTAINED THROUGH A MINIMUM CONDITION GH. MICULA, E. SANTI, AND M. G. CIMORONI Dedicated to

More information

OSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS. Sandra Pinelas and Julio G. Dix

OSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS. Sandra Pinelas and Julio G. Dix Opuscula Mat. 37, no. 6 (2017), 887 898 ttp://dx.doi.org/10.7494/opmat.2017.37.6.887 Opuscula Matematica OSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS Sandra

More information

Simpson s 1/3 Rule Simpson s 1/3 rule assumes 3 equispaced data/interpolation/integration points

Simpson s 1/3 Rule Simpson s 1/3 rule assumes 3 equispaced data/interpolation/integration points CE 05 - Lecture 5 LECTURE 5 UMERICAL ITEGRATIO COTIUED Simpson s / Rule Simpson s / rule assumes equispaced data/interpolation/integration points Te integration rule is based on approximating fx using

More information

AMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error.

AMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error. Lecture 09 Copyrigt by Hongyun Wang, UCSC Recap: Te total error in numerical differentiation fl( f ( x + fl( f ( x E T ( = f ( x Numerical result from a computer Exact value = e + f x+ Discretization error

More information

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z

More information

Chapter 5 FINITE DIFFERENCE METHOD (FDM)

Chapter 5 FINITE DIFFERENCE METHOD (FDM) MEE7 Computer Modeling Tecniques in Engineering Capter 5 FINITE DIFFERENCE METHOD (FDM) 5. Introduction to FDM Te finite difference tecniques are based upon approximations wic permit replacing differential

More information

LIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT

LIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT LIMITS AND DERIVATIVES Te limit of a function is defined as te value of y tat te curve approaces, as x approaces a particular value. Te limit of f (x) as x approaces a is written as f (x) approaces, as

More information

Math 1210 Midterm 1 January 31st, 2014

Math 1210 Midterm 1 January 31st, 2014 Mat 110 Midterm 1 January 1st, 01 Tis exam consists of sections, A and B. Section A is conceptual, wereas section B is more computational. Te value of every question is indicated at te beginning of it.

More information

Flapwise bending vibration analysis of double tapered rotating Euler Bernoulli beam by using the differential transform method

Flapwise bending vibration analysis of double tapered rotating Euler Bernoulli beam by using the differential transform method Meccanica 2006) 41:661 670 DOI 10.1007/s11012-006-9012-z Flapwise bending vibration analysis of double tapered rotating Euler Bernoulli beam by using te differential transform metod Ozge Ozdemir Ozgumus

More information

2.1 THE DEFINITION OF DERIVATIVE

2.1 THE DEFINITION OF DERIVATIVE 2.1 Te Derivative Contemporary Calculus 2.1 THE DEFINITION OF DERIVATIVE 1 Te grapical idea of a slope of a tangent line is very useful, but for some uses we need a more algebraic definition of te derivative

More information

(4.2) -Richardson Extrapolation

(4.2) -Richardson Extrapolation (.) -Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Suppose tat lim G 0 and lim F L. Te function F is said to converge to L as

More information

High-Order Energy and Linear Momentum Conserving Methods for the Klein-Gordon Equation

High-Order Energy and Linear Momentum Conserving Methods for the Klein-Gordon Equation matematics Article Hig-Order Energy and Linear Momentum Conserving Metods for te Klein-Gordon Equation He Yang Department of Matematics, Augusta University, Augusta, GA 39, USA; yang@augusta.edu; Tel.:

More information

Name: Answer Key No calculators. Show your work! 1. (21 points) All answers should either be,, a (finite) real number, or DNE ( does not exist ).

Name: Answer Key No calculators. Show your work! 1. (21 points) All answers should either be,, a (finite) real number, or DNE ( does not exist ). Mat - Final Exam August 3 rd, Name: Answer Key No calculators. Sow your work!. points) All answers sould eiter be,, a finite) real number, or DNE does not exist ). a) Use te grap of te function to evaluate

More information

ERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER*

ERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER* EO BOUNDS FO THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BADLEY J. LUCIE* Abstract. Te expected error in L ) attimet for Glimm s sceme wen applied to a scalar conservation law is bounded by + 2 ) ) /2 T

More information

Math 31A Discussion Notes Week 4 October 20 and October 22, 2015

Math 31A Discussion Notes Week 4 October 20 and October 22, 2015 Mat 3A Discussion Notes Week 4 October 20 and October 22, 205 To prepare for te first midterm, we ll spend tis week working eamples resembling te various problems you ve seen so far tis term. In tese notes

More information

Quaternion Dynamics, Part 1 Functions, Derivatives, and Integrals. Gary D. Simpson. rev 01 Aug 08, 2016.

Quaternion Dynamics, Part 1 Functions, Derivatives, and Integrals. Gary D. Simpson. rev 01 Aug 08, 2016. Quaternion Dynamics, Part 1 Functions, Derivatives, and Integrals Gary D. Simpson gsim1887@aol.com rev 1 Aug 8, 216 Summary Definitions are presented for "quaternion functions" of a quaternion. Polynomial

More information

Section 2.7 Derivatives and Rates of Change Part II Section 2.8 The Derivative as a Function. at the point a, to be. = at time t = a is

Section 2.7 Derivatives and Rates of Change Part II Section 2.8 The Derivative as a Function. at the point a, to be. = at time t = a is Mat 180 www.timetodare.com Section.7 Derivatives and Rates of Cange Part II Section.8 Te Derivative as a Function Derivatives ( ) In te previous section we defined te slope of te tangent to a curve wit

More information

4.2 - Richardson Extrapolation

4.2 - Richardson Extrapolation . - Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Definition Let x n n converge to a number x. Suppose tat n n is a sequence

More information

232 Calculus and Structures

232 Calculus and Structures 3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE

More information

Exam 1 Review Solutions

Exam 1 Review Solutions Exam Review Solutions Please also review te old quizzes, and be sure tat you understand te omework problems. General notes: () Always give an algebraic reason for your answer (graps are not sufficient),

More information

ch (for some fixed positive number c) reaching c

ch (for some fixed positive number c) reaching c GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan

More information

Chapter 4: Numerical Methods for Common Mathematical Problems

Chapter 4: Numerical Methods for Common Mathematical Problems 1 Capter 4: Numerical Metods for Common Matematical Problems Interpolation Problem: Suppose we ave data defined at a discrete set of points (x i, y i ), i = 0, 1,..., N. Often it is useful to ave a smoot

More information

1 Lecture 13: The derivative as a function.

1 Lecture 13: The derivative as a function. 1 Lecture 13: Te erivative as a function. 1.1 Outline Definition of te erivative as a function. efinitions of ifferentiability. Power rule, erivative te exponential function Derivative of a sum an a multiple

More information

ETNA Kent State University

ETNA Kent State University Electronic Transactions on Numerical Analysis. Volume 34, pp. 14-19, 2008. Copyrigt 2008,. ISSN 1068-9613. ETNA A NOTE ON NUMERICALLY CONSISTENT INITIAL VALUES FOR HIGH INDEX DIFFERENTIAL-ALGEBRAIC EQUATIONS

More information

Continuity and Differentiability Worksheet

Continuity and Differentiability Worksheet Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;

More information

Exercises for numerical differentiation. Øyvind Ryan

Exercises for numerical differentiation. Øyvind Ryan Exercises for numerical differentiation Øyvind Ryan February 25, 2013 1. Mark eac of te following statements as true or false. a. Wen we use te approximation f (a) (f (a +) f (a))/ on a computer, we can

More information

Research Article Cubic Spline Iterative Method for Poisson s Equation in Cylindrical Polar Coordinates

Research Article Cubic Spline Iterative Method for Poisson s Equation in Cylindrical Polar Coordinates International Scolarly Researc Network ISRN Matematical Pysics Volume 202, Article ID 2456, pages doi:0.5402/202/2456 Researc Article Cubic Spline Iterative Metod for Poisson s Equation in Cylindrical

More information

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions

Math 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions Mat 22: Principles of Analysis Fall 206 Homework 7 Part B Solutions. Sow tat f(x) = x 2 is not uniformly continuous on R. Solution. Te equation is equivalent to f(x) = 0 were f(x) = x 2 sin(x) 3. Since

More information

Precalculus Test 2 Practice Questions Page 1. Note: You can expect other types of questions on the test than the ones presented here!

Precalculus Test 2 Practice Questions Page 1. Note: You can expect other types of questions on the test than the ones presented here! Precalculus Test 2 Practice Questions Page Note: You can expect oter types of questions on te test tan te ones presented ere! Questions Example. Find te vertex of te quadratic f(x) = 4x 2 x. Example 2.

More information

Math 161 (33) - Final exam

Math 161 (33) - Final exam Name: Id #: Mat 161 (33) - Final exam Fall Quarter 2015 Wednesday December 9, 2015-10:30am to 12:30am Instructions: Prob. Points Score possible 1 25 2 25 3 25 4 25 TOTAL 75 (BEST 3) Read eac problem carefully.

More information

ROBUST REDUNDANCY RELATIONS FOR FAULT DIAGNOSIS IN NONLINEAR DESCRIPTOR SYSTEMS

ROBUST REDUNDANCY RELATIONS FOR FAULT DIAGNOSIS IN NONLINEAR DESCRIPTOR SYSTEMS Proceedings of te IASTED International Conference Modelling Identification and Control (AsiaMIC 23) April - 2 23 Puket Tailand ROBUST REDUNDANCY RELATIONS FOR FAULT DIAGNOSIS IN NONLINEAR DESCRIPTOR SYSTEMS

More information

Overlapping domain decomposition methods for elliptic quasi-variational inequalities related to impulse control problem with mixed boundary conditions

Overlapping domain decomposition methods for elliptic quasi-variational inequalities related to impulse control problem with mixed boundary conditions Proc. Indian Acad. Sci. (Mat. Sci.) Vol. 121, No. 4, November 2011, pp. 481 493. c Indian Academy of Sciences Overlapping domain decomposition metods for elliptic quasi-variational inequalities related

More information

arxiv: v1 [math.na] 28 Apr 2017

arxiv: v1 [math.na] 28 Apr 2017 THE SCOTT-VOGELIUS FINITE ELEMENTS REVISITED JOHNNY GUZMÁN AND L RIDGWAY SCOTT arxiv:170500020v1 [matna] 28 Apr 2017 Abstract We prove tat te Scott-Vogelius finite elements are inf-sup stable on sape-regular

More information

CONVERGENCE ANALYSIS OF FINITE ELEMENT SOLUTION OF ONE-DIMENSIONAL SINGULARLY PERTURBED DIFFERENTIAL EQUATIONS ON EQUIDISTRIBUTING MESHES

CONVERGENCE ANALYSIS OF FINITE ELEMENT SOLUTION OF ONE-DIMENSIONAL SINGULARLY PERTURBED DIFFERENTIAL EQUATIONS ON EQUIDISTRIBUTING MESHES INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume, Number, Pages 57 74 c 5 Institute for Scientific Computing and Information CONVERGENCE ANALYSIS OF FINITE ELEMENT SOLUTION OF ONE-DIMENSIONAL

More information

Effect of Numerical Integration on Meshless Methods

Effect of Numerical Integration on Meshless Methods Effect of Numerical Integration on Mesless Metods Ivo Babuška Uday Banerjee Jon E. Osborn Qingui Zang Abstract In tis paper, we present te effect of numerical integration on mesless metods wit sape functions

More information

A method of Lagrange Galerkin of second order in time. Une méthode de Lagrange Galerkin d ordre deux en temps

A method of Lagrange Galerkin of second order in time. Une méthode de Lagrange Galerkin d ordre deux en temps A metod of Lagrange Galerkin of second order in time Une métode de Lagrange Galerkin d ordre deux en temps Jocelyn Étienne a a DAMTP, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, Great-Britain.

More information

Wind Turbine Micrositing: Comparison of Finite Difference Method and Computational Fluid Dynamics

Wind Turbine Micrositing: Comparison of Finite Difference Method and Computational Fluid Dynamics IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 1, January 01 ISSN (Online): 169-081 www.ijcsi.org 7 Wind Turbine Micrositing: Comparison of Finite Difference Metod and Computational

More information

5.1 introduction problem : Given a function f(x), find a polynomial approximation p n (x).

5.1 introduction problem : Given a function f(x), find a polynomial approximation p n (x). capter 5 : polynomial approximation and interpolation 5 introduction problem : Given a function f(x), find a polynomial approximation p n (x) Z b Z application : f(x)dx b p n(x)dx, a a one solution : Te

More information

On convergence of the immersed boundary method for elliptic interface problems

On convergence of the immersed boundary method for elliptic interface problems On convergence of te immersed boundary metod for elliptic interface problems Zilin Li January 26, 2012 Abstract Peskin s Immersed Boundary (IB) metod is one of te most popular numerical metods for many

More information

Stability properties of a family of chock capturing methods for hyperbolic conservation laws

Stability properties of a family of chock capturing methods for hyperbolic conservation laws Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) Stability properties of a family of cock capturing metods for yperbolic conservation

More information