Solving the Poisson Partial Differential Equation using Spectral Polynomial Methods
|
|
- Mildred McCarthy
- 6 years ago
- Views:
Transcription
1 Solving the Poisson Prtil Differentil Eqution using Spectrl Polynomil Methods Seungkeol Choe April 8th, 4 Abstrct In this report, we present spectrl polynomil method for solving the Poisson eqution with Dirichlet nd Neumnn boundry conditions respectively on one dimensionl compct intervl We cn control the number, size of elements, nd order of pproximting polynomils to obtin ccurte solutions with fster convergence thn the clssicl finite element method We present spectrl Fourier method for solving Poisson eqution with the sme boundry conditions on n two dimensionl nnulus domin By using the tensor product between one dimensionl spectrl bses nd Fourier bses, we pply the high-order method to rdius direction nd the fst Fourier trnsform to ngulr direction Computtionl Engineering nd Science Progrm, University of Uth
2 Contents Introduction 3 Poisson Eqution 4 Method of Weighted Residuls 4 Spectrl Polynomil Elements Method on n Intervl 6 Mthemticl Formultions 6 Bsis Functions 6 Spectrl Polynomil Method in n Element 7 3 Globl Assembly/Direct Stiffness Summtion 8 4 Applying Boundry Conditions 9 Experiment Results H/P Convergence Test for One-dimensionl Solution High order Polynomil Solution nd Its Convergence 3 Spectrl Fourier Method on -dimensionl Annulus 4 3 Mthemticl Formultions 4 3 Poisson Eqution in Polr Coordintes nd Bsis Functions 4 3 Formultion of Spectrl Polynomil nd Fourier Methods 4 3 Experiment Results 7 3 H/P Convergence Test for Two-dimensionl Solution 7 3 High order Polynomil Solution nd Its Convergence 8 4 Conclusion
3 Introduction The spectrl method is numericl scheme for pproximting the solution of prtil differentil equtions It hs developed rpidly in the pst three decdes nd hs been pplied to numericl simultion problems in mny fields One reson for its brod nd fst cceptnce is its use of vrious systems of infinitely differentible bsis functions s tril functions By choosing n pproprite orthogonl system bsed on domin of orthogonlity, we cn pply the method to periodic nd non-periodic problems, s well s problems defined on vrious domins, such s compct domin, hlf/ll intervls Another dvntge of the spectrl method is its high ccurcy In prticulr, the spectrl polynomil method llows control of both the resolution of element size nd the order of pproximtion This results in exponentil convergence, which is mrked improvement over clssicl finite difference nd other purely element methods For solving the problem, we discretize the domin nd obtin the following pproximtion of infinite series A function u is represented vi truncted series expnsion s follows: u u N = N û n φ n, () where φ n re the bsis functions In generl the Chebyshev polynomils T n or the Legendre polynomils L n or nother member of the clss of Jcobi polynomils Pn α,β re employed s bsis functions In choosing proper bsis function, we pply the following 3 chrcteristics to the cndidte bsis n= Numericl Efficiency After discretiztion, the choice of bsis ffects complexity of mss mtrix Moreover we need consider the efficiency in solving the system of liner equtions For exmple, using the monomils {x k } N k= result in the mtrix whose non-zero component re the hlf But its inverse mtrix is full nd the cost of inverting is dominnt In contrst, the Legendre polynomil bsis composes digonl mss mtrix nd its inverse mtrix cn be clculted very efficiently Conditioning If mtrix system is ill-conditioned the round-off error in the mtrix system cn led to lrge errors in the solution Furthermore the number itertion required in inverting the mtrix using itertive solver cn be increse by the condition number The condition number of monomils nd Lgrnge polynomil re close to p, for the polynomil order p But Legendre polynomil hs condition number P + This condition lso ffects the degree of liner independence of ech bsis function This project seeks to study the fundmentl theory of spectrl method, problems, solvbility, nd to obtin its constructive procedure to pply the method to vrious ppliction problems By checking solutions obtined vi the spectrl method ginst exct solutions, we cn vlidte the method nd see how much we cn sve the effort on discretistion of domin to chieve the sme degree of ccurcy in comprison to clssicl element methods 3
4 In chpter, I investigte spectrl method solutions for the forwrd Poisson problem with Dirichlet nd Neumnn boundry condition on ech end of one dimensionl intervl domin In chpter 3, I investigte the spectrl polynomil method nd Fourier method for solving the forwrd Poisson problem with Dirichlet nd Neumnn boundry condition on inner nd outer boundry circles respectively Our pproch utilizes spectrl polynomil element nd Fourier method in tensor product form As n conclusion we present the result of numericl solution nd its convergence by h/p dptive control Poisson Eqution Science nd engineering disciplines re generlly interested in systems of continuous quntities nd reltions This project focuses on solutions of the Poisson eqution, which ppers in vrious field such s electrosttics, mgnetics, het flow, elstic membrnes, torsion, nd fluid flow For exmple, electrosttics, the governing eqution ppers s Guss s lw in differentil form [3]: E = 4πρ () which indictes tht the chrge within closed sphericl surfce is relted to the electric field E norml to surfce element where ρ is chrge density Since it is known in electrosttics tht the electric field E is conservtive, E is form of grdient of sclr potentil Φ, E = Φ (3) With these two reltionships, we obtin Poisson eqution In this report, the one-dimensionl Poisson eqution is defined s Φ = 4πρ (4) L(u) d u + f = (5) dx where u nd f re defined on Ω In pointwise viewpoint, the one dimensionl Poisson eqution (5) is written s for ll x in (, b) L(u)(x) d u(x) + f(x) =, (6) dx Method of Weighted Residuls According to the Weierstrss pproximtion theorem, for ny given rel vlued continuous solution u on compct intervl [, b] we cn obtin rel polynomil function p of certin degree such tht p uniformly pproximtes u Although the result of convergence t ech point is within predefined 4
5 error bound, this does not stisfy the requirement tht we need to cquire n ccurte solution on specific sitution By imposing certin restrictions, we cn obtin formultion tht stisfies the requirement To describe this, we set generl liner differentil eqution on Ω L(u) = (7) with pproprite initil nd boundry conditions Under certin restriction, we ssume tht the true solution u(x) cn be pproximted by finite series expnsion of the form: u δ (x) = N dof i= û i Φ i (x), (8) where Φ i (x) re polynomil tril functions nd û i re N dof unknown coefficients We ssume the following: û = G D : Dirichlet Boundry Vlue, (9) Φ () =, Φ Ndof (b) = where, b re the boundry of domin Ω () We then define non-zero residul R by: () R(u δ ) = L(u δ ) () Define set of functions, H (Ω) nd norm H (Ω) on the spce s follows: H (Ω) = {v L d (Ω) : dx v L (Ω)}, (3) [ v H (Ω) = v(x) + d ] Ω dx v(x) dx, v H (Ω) (4) We define n inner-product, over H (Ω) s follows: u, v = u(x) v(x)dx, (5) This method is restricted to test functions, v(x) tht stisfy: Ω v, R = (6) For exmple, in the colloction method, the j th test function is the Dirc delt function which evlutes to colloction point x = x j Then we hve = δ j, R = R(u δ )(x)δ j (x)dx = R(u δ )(x j ) = L(u δ )(x j ) (7) Other possible test functions re exmined in [] Ω 5
6 Spectrl Polynomil Elements Method on n Intervl Mthemticl Formultions We will exmine equtions of the form of (5) nd (6) with the following boundry conditions: u() = G D : Dirichlet Condition (8) d dx u(b) = G N : Neumnn Condition (9) Multiplying eqution (5) by test functions v(x) nd integrting by prts, we obtin: v(x) d dx u(x)dx + d dx v(x) d dx u(x)dx = v(x)f(x)dx =, () [ v(x)f(x)dx + v d ] b dx u, () for u, v being sufficiently smooth We consider solutions to problem (5) where the forcing function f is well defined in the sense tht vf + [vu ] b < Therefore we only consider tril solutions to eqution () which lie in H (Ω) nd stisfy the Dirichlet boundry condition We cn define the tril spce by X = {u H u() = G D } () Similrly, the spce of ll test functions is restricted to the functions tht re homogeneous on ll Dirichlet boundries Tht is: V = {v H v() = } (3) For numericl pproximtion, we select finite subspces X δ ( X ) nd V δ ( V) for which eqution () holds In prticulr, we cn define δ by the choice of two different discretiztion pproches : Element size or polynomil order The formultion for the wek solution () cn be stted s: Find u δ X δ, such tht Bsis Functions d dx vδ (x) d dx uδ (x)dx = The spectrl pproximtion of solution u is generlly represented s u(x) = [ v δ (x)f(x)dx + v δ d ] b dx uδ, v δ V δ (4) N dof i= û i Φ i (x) (5) on [, b] To construct the globl bsis functions {Φ i (x)} N dof i=, ech Φ i is represented by the liner combintion of locl bsis functions φ i on ech element in [, b], we sy the element Ω e 6
7 We define the locl bsis functions φ i on [, ] to be rel vlued function with Jcobi polynomil of α = nd β = {P, i } s follows: φ i (ξ) = ξ ( ξ +ξ, ) ( ) i = +ξ P, i (ξ), i P (6), i = P for ll ξ in [, ] Then on single stndrd element [, ], the pproximtion u(ξ) is represented s P e u(ξ) = û e i φ i (ξ), (7) i= for ξ in [, ] The locl bsis function φ e i on generl element [x, x ] is defined by the chnge of vrible for φ i between two intervls [x, x ] nd [, ] Spectrl Polynomil Method in n Element We pply the bsis representtion (7) to wek formultion () with the sme test function {φ q }, to obtin the following: P e û e p d dx φ p, φ q = d dx p= P e p= u e pφ p, φ q = f, φ q (8) for q =,, P e where P e is the order of polynomil on locl element Ω e, sy [x, x ] Integrting by prts, we cn use the fct tht [ ] d d x dx φ p, φ q = dx φ p(x)φ q (x) Applying (9) to (8), we obtin x d dx φ p, d dx φ q (9) [ d dx u(x)φ q(x) ] x x + P e p= ûe p d dx φ p, d dx φ q = P e p= ûe p d φ dx p, φ q = f, φ q (3) Pe p= ûe p d dx φ p, d dx φ q = f, φ q + [ d dx u(x)φ q(x) ] x x (3) for q =,, P e In mtrix form we obtin the following the system of equtions for locl coefficients nd modes: φ e, φ e,p e û e f e φ e, û e f e = + u (x ) u (x ) (3) φ e P e,p e û e P e fp e e φ e P e, φ e P e,p e û e P e fp e e where φ p,q = d dx φ p, d dx φ q, fq e = f, φ q, p, q =,, P e Note tht φ q (x ) = δ q,, φ q (x ) = δ q,pe the orthogonlity on {φ q } Pe q= nd 7
8 3 Globl Assembly/Direct Stiffness Summtion As seen in eqution (8), we hve the finite element pproximtion u δ in terms of the globl modes Moreover, we cn represent u δ by liner combintion of locl modes φ e p : u δ (x) = N dof i= N el P e û i Φ i (x) = û e pφ e p(ξ), (33) e= p= where in this cse P e is the polynomil order of the expnsion nd φ e p(ξ) is reprmetriztion of locl bsis function generl elements To see how the stiffness mtrix chnges fter globl ssembly, we hve the following reltionship between globl coefficients û i nd locl coefficients û e i : û = û û e P e = û e+ = û r, e =,, N el, for some r N dof, nd (35) û e P e = û r, e = N el, r = N dof (36) When we determine û i, i =,, N dof, this property plys role tht we cn reduce the size of system According to the orthogonlity defined in the derivtive of interior modes {φ e q} Pe q=, the following reltionships hold: φ e q,qû e q = fq e, q =,, P e (37) for every element e To derive reltionship between djcent boundry modes, we set in generl 3 elements, e = [x, x ], e = [x, x ], nd e = [x, x 3 ] of polynomil order P, P, nd P, respectively: (34) φ P,û + φ P,P û P = f P u (x ) (38) φ,û + φ,p û P = f + u (x ) (39) φ P,û + φ P,P û P = f P u (x ) (4) φ,û + φ,p û P = f + u (x ) (4) Adding (38) to (39), (4) to (4) nd evluting the bsis functions, we obtin: 5 û + û P (= u ) 5 û P = f P + f (4) 5 û + û P (= u ) 5 û P = f P + f (43) Utilizing equtions (37),(4), nd (43) we cn generte prt of the globl stiffness mtrix showing the ssembly of two djcent locl element mtrix system s follows: Aû = f is defined by (44) 8
9 φ P,P 5 5 φ, φ P,P 5 5 φ P,P û P û û û P û û = f P f P + f f f P f P + f f 4 Applying Boundry Conditions Now we cn pply the boundry conditions defined in (8) This is done by processing the system (44) bout the boundry points x = nd x = b This lters the globl system s follows: Aû = f + u (b) u () = f + G N u () (45) We denote: A = A, A,Ndof A Ndof, A Ndof,N dof, û = û û Ndof, nd f = f f Ndof (46) Since û is known to be G D, we cn modify (45) to: A, A, A,Ndof A Ndof, A Ndof, A Ndof,N dof û û û Ndof = f f Ndof + G N G D (47) which results in system of equtions tht hs one solution A, A,Ndof A Ndof, A Ndof,N dof û û û Ndof = f f Ndof + G N A, A Ndof, G D (48) We employ liner solver to obtin [û,, û Ndof ] T 9
10 Experiment Results We now consider eqution (5) in the viewpoint of convergence hving solution u H k (Ω) = {u j k dj L (Ω)} dx j Assuming discretiztion on uniform domin of equi-spced subintervls of size h, the generl error estimte in the norm H k (Ω) for the h-nd p-type extension process cn be written s []: ɛ H k (Ω) CH µ P (k ) u H k (Ω), (49) where ɛ = u u δ, µ = min(k, P + ), nd C is independent of h, P nd u, but depends on k This mens if solution u lies in H k (Ω) for sufficiently lrge k > P +, then this error estimte shows tht we cn chieve exponentil convergence s we increse the polynomil order P Also in prticulr to h-extension process, the error respect to norm H (Ω) stisfies: ɛ H (Ω) K Ch (5) From [], we see tht the slope of the h-type extension process is relted to the minimum of P + nd the smoothness k of the solution Becuse our experiment involves smooth solutions, we observe the slope of h-type extension grph of errors to be very close to P + 5 Approximtion by Spectrl Method Anlytic Solution 5 537e Figure : Numericl nd exct solution of eqution (5) with polynomil order P = 5 H/P Convergence Test for One-dimensionl Solution In this section we present the result of convergence in both h refinement nd p refinement with the following stedy-stte Poisson differentil eqution: d u(x) = sin(πx), (5) dx for ll x in [, ] with zero Dirichlet nd Neumnn boundry conditions For comprison, the numericl nd exct solutions re depicted in figure () Convergence of h-type extension for eqution (5)
11 5 6 Order 3 Order 4 Order Elements Elements Discrete L Error 9 Discrete L Error Element Size (h) Order Per Element Figure : (Left) Convergence with respect to discrete L norm s function of size of elements This test is performed using the h-type extension with polynomils of order 3, 4, nd 5 respectively Error on the Log-Log xis demonstrtes the lgebric convergence of the h-type extension (Right) Convergence wrt L norm s function of size of polynomil order in semi-log plot This shows the exponentil convergence of p-type extension for smooth solution The tests were performed for p-type extension with element length nd This test seeks to estblish the reltion between size of element nd the ccurcy of pproximtion Utilizing equi-distnce elements, we investigte error As shown in Figure (), s elements decrese in size, the ccurcy of the solution improves As we see the reltionship (5) in the theory, the slope of convergence grph should exhibit slopes of slope 4, 5, nd 6 for the polynomil orders 3, 4, nd 5, respectively The exct outcome is shown in left tble of Tble () Convergence of p-type extension for eqution (5) Since the exct solution is n infinite sum of polynomil function, finite order interpolting tril functions cnnot rech idel convergence It is lso pprnt tht the convergence will stgnte before the error reches mchine precision, shown in right figure of Figure (), the experimented results support the behvior described in eqution (49) High order Polynomil Solution nd Its Convergence In this section we construct polynomil P n of order n defined on [, ], which stisfies the following P n () =, P n () = (5) d k dx k P n() =, d k dx k P n () = (53)
12 Tble : This tble shows the convergence of h-type (left) nd p-type (right) resolution control done bove Figure () Observe tht the slopes of ech order P is P + Polynomil order Error(L ) Slope Error 3 6e 44 Element Size (L ) e e e e 6 4 Plot of nnlytic solution 8 imge domin Figure 3: Exmple of curve stisfing conditions (5), with polynomil order n = 9 for ll k =,, n For ech n, we obtin polynomil P n by solving system of liner equtions tht determines the coefficients of P n We pply the spectrl polynomil solver to pproximte the second derivtive Q n of P n The numericl nd exct solutions by the solver we developed is shown in figure (3) Problem Consider the following differentil eqution for u(x) such tht d dx u(x) = Q n, (54) for ll x in [, ] with the boundry condition defined in eqution (5) spectrl polynomil method Approximte u(x) using Note tht the ccurcy of the interpoltion stisfying equtions (5) is dependent on the stbility of the mtrix defining the coefficients of interpolnts We used the Legendre bsis functions becuse they re known to be more stble thn monomils Despite this choise, interpoltion error is nerly e 3 This results in the sme mount of convergence error in p-type extension mode shown in right of Figure (4) nd Tble () Convergence h-type extension for eqution (54) Exmining the eqution (5), in Figure (4), we observe tht the error with respect to L of the discrete solution to the eqution is exponentilly convergent with respect to the size of element This verifies the Log-Log scle of reltion of theory (5)
13 Convergence p-type extension for eqution (54) This semi-log scle plot lso shows the exponentil convergence of p-type extension of tril functions Note tht we pproximte the finite order of the polynomils So there exists the lowest order P l tht pproximtes with tril functions of order P which P > P l should shows the sme convergence s the cse using tril functions of order P l In right of Figure (4), we observe tht the convergence is stying on pproximtion error which theoreticlly should be mchine precision 4 5 Order 3 Order 4 Order 5 5 Elements Elements Discrete L Error 8 9 Discrete L Error Element Size (h) Order Per Element Figure 4: (Left) Convergence with respect to discrete L norm s function of element size This test is performed using the h-type extension with fixed polynomil order 3, 4, nd 5 respectively Error on the Log-Log xis demonstrtes the lgebric convergence of the h-type extension (Right) Convergence wrt L norm s function of size of polynomil order in semi-log plot It shows the exponentil convergence of p-type extension for smooth solution The two tests re performed for p-type extension with element lengths of nd Tble : This tble shows the convergence of h-type resolution control done bove Figure (4) Note tht the slopes of ech order P is P + Polynomil order Error(L ) Slope e e e Error Element Size (L ) 343e 3 386e 3 3
14 3 Spectrl Fourier Method on -dimensionl Annulus 3 Mthemticl Formultions 3 Poisson Eqution in Polr Coordintes nd Bsis Functions We formulte the Generlized Poisson problem on n nnulus [, b] [, π], > under the periodic solution u s follows: [ r (σ(r, θ) r ) + r (σ(r, θ) r ) + r θ (σ(r, θ) ] θ ) u(r, θ) = f(r, θ), (55) where r [, b] nd θ [, π] The boundry conditions for this domin is given by: where θ [, π] u(, θ) = G D (θ), with periodicity of u, u(r, ) = u(r, π), (56) r u(b, θ) = G N(θ), (57) The representtion of pproximtion of u is gurnteed by Weierstrss theorem: u(r, θ) = N r N θ / j= k= N θ /+ û jk φ j (r)e ikθ, (58) where r [, b] nd θ [, π] for the globl degree of freedom N r nd N θ on û jk s The bsis functions {φ j } Nr j= shown t liner spn (58) re defined s modified Jcobi polynomils defined in [] As review of discrete Fourier trnsform in N-point grid described in [], the formul for the discrete Fourier trnsform for {v j } is where x j = j π N N ˆv k = h e ikx j v j, k = N +,, N, (59) j= nd the inverse discrete Fourier trnsform for {ˆv k} is given by v j = π Nr/ k= N/+ e ikxj ˆv k, j =,, N (6) 3 Formultion of Spectrl Polynomil nd Fourier Methods In this project, we ssume the conductivity term σ in eqution (55) to be only dependent on vribles showing the rdius domin s we multiply r in ech side of eqution (55) Then the Poisson eqution in polr coordinte is s follows: ] [r (σ(r) ) + rσ(r) + σ(r) r r r θ u(r, θ) = r f(r, θ) (6) 4
15 We utilize the Glerkin method, with test functions of the form: φ p (r)e iqθ, p =,, N r, q = N θ +,, N θ (6) The wek form of the eqution is s follows: r r (σ r u) + rσ r u + σ θ u, φ pe iqθ = r f, φ p e iqθ (63) Define T i, i =,, 4 s follows T = T = T 3 = nd T 4 = Then eqution (63) becomes: π π π π φ p e iqθ r r [σ(r) r u(r, θ) ] drdθ, (64) φ p e iqθ rσ(r) u(r, θ)drdθ, (65) r φ p e iqθ σ(r) u(r, θ)drdθ, (66) θ φ p e iqθ r f(r, θ)drdθ (67) T T T 3 = T 4 (68) We obtin boundry terms by integrting by prts on T s follows: T = π e [r iqθ σ(r) ] b r u(r, θ)φ p(r) π π Then the right hnd side of (68) becomes π T T T 3 = + + dθ (69) e iqθ rσ(r) r u(r, θ)φ p(r)drdθ (7) e iqθ r σ(r) r u(r, θ) d dr φ p(r)drdθ (7) π π π e [r iqθ σ(r) ] b r u(r, θ)φ p(r) dθ (7) e iqθ rσ(r) r u(r, θ)φ p(r)drdθ (73) e iqθ r σ(r) r u(r, θ) d dr φ p(r)drdθ (74) e iqθ σ(r) θ u(r, θ)φ p(r)drdθ (75) Using (58) nd the orthogonl properties of {e ikθ }, k = N θ +,, N θ, we cn simplify (7) to obtin: 5
16 π T T T 3 = e [r iqθ σ(r) ] b r u(r, θ)φ p(r) dθ (76) N θ + π û jq rσ(r) d dr φ j(r)φ p (r)dr (77) Let us define the following mtrices: j= N θ + π û jq r σ(r) d dr φ j(r) d dr φ p(r)dr (78) j= N θ + π û jq q σ(r)φ j (r)φ p (r)dr (79) j= where j, p =,, N θ T 4 becomes: (M ) jp = (M ) jp = (M 3 ) jp = rσ(r) d dr φ j(r)φ p (r) dr (8) r σ(r) d dr φ j(r) d dr φ p(r) dr (8) σ(r)φ j (r)φ p (r) dr, (8) T 4 = = π r φ p (r) φ p (r)e iqθ r f(r, θ)dθdr (83) π f(r, θ)e iqθ dθdr (84) (85) For given r, the Discrete Fourier Trnsform for f(r, θ) is defined by where f(r, θ τ ) = π f(r) k = π N θ N θ / k= N θ /+ N θ e ikθτ f(r) k (86) e ikθ j f(r, θ j ) (87) j= with k { N θ +,, N θ } nd θ j { π N θ,, π} Then: 6
17 T 4 = = π r φ p (r) π N θ / k= N θ /+ e ikθ f(r)k e iqθ dθdr (88) r φ p (r) f(r) q dr (89) N θ π û jq M jp + π û jq M jp + π û jq q M 3jp = j= +b σ(b)φ p (b) N θ j= π N θ j= e iqθ G N (θ)dθ σ()φ p () π r φ p (r) f(r) q dr (9) e iqθ u(, θ)dθ (9) r where j, p =,, N r We pply the Fourier trnsform to the integrl term with G N nd the sme ide s one-dimensionl cse to ech term bout boundry conditions 3 Experiment Results 3 H/P Convergence Test for Two-dimensionl Solution In this section we present the convergence behvior in both h refinement nd p refinement for the following stedy-stte Poisson differentil eqution: r r (σ r u) rσ r u σ θ u = r cos θ [ 4rπ cos S r + {4π + } sin S r ], (9) for ll r [, ], θ [, π] with σ(r) = r The nlytic solution is known to be u(r, θ) = sin S r cos θ, (93) where S r = π(r ) π The numericl tht hs sme shpe s exct solutions re shown in figure (5) with different viewpoint Tble 3: This tble shows the convergence of h-type (left) nd p-type (right) resolution control done bove Figure (6) We cn see the slope of ech cse is P + of order P Polynomil order Error(L ) Slope Element Size Error(L ) e e e 346e 3 7
18 5 Approximtion Vlue 5 Approximtion Vlue θ 4 Rdius θ Rdius Figure 5: Numericl solution of eqution (9) with polynomil order P =, equidistnce elements The difference to exct solution is 4774e-5 in terms of L norm 3 High order Polynomil Solution nd Its Convergence In this section we construct polynomil P n of order n defined on [, ], which stisfies the following P n () =, P n () = (94) d k dx k P n() =, d k dx k P n () = (95) for ll k =,, n For ech n, we obtin polynomil P n by solving system of liner equtions tht determines the set of coefficients of P n We use the spectrl polynomil solver to pproximte the second derivtive Q n of P n We investigte the convergences by the h-type, p-type extension of tril functions below Problem 3 Consider the following differentil eqution for u(x) such tht r r (σ r u) rσ r u σ θ u = e (r ) {P n (r) + (r (r ) r)p n(r) r P n (r)} cos θ, (96) for ll r in [, ] with σ(r) = e (r ) The exct solution is known to be: u(r, θ) = P n (r) cos θ (97) where r in [, ] nd θ in [, π] 8
19 6 Order 5 Order 6 5 Elements Elements Discrete L Error 9 Discrete L Error Element Size (h) Order Per Element Figure 6: (Left) Convergence with respect to discrete L norm s function of size of elements This test is performed using the h-type extension with fixed polynomil order 5 nd 6 respectively Error on the Log-Log xis is demonstrting the lgebric convergence of the h-type extension (Right) Convergence wrt L norm s function of size of polynomil order in semi-log plot It shows the exponentil convergence of p-type extension for smooth solution Two tests re performed for p-type extension with element length nd Tble 4: This tble shows the convergence of h-type resolution control done bove Figure (8) We cn see the slopes of ech order P is P + Polynomil order Error(L ) Slope Element Size Error(L ) e e e e Exct Solution 5 5 Approximtion Vlue θ 4 6 Rdius θ 4 6 Rdius 8 Figure 7: Exmple of curve tht stisfies conditions (94) with polynomil order n = 7, 9,, 4, 5 The error is 939e 8 9
20 5 Order 5 Order 6 5 Elements Elements 6 4 Discrete L Error 7 8 Discrete L Error Element Size (h) Order Per Element Figure 8: (Left) Convergence with respect to discrete L norm s function of size of elements This test is performed using the h-type extension with fixed polynomils of order 3, 4, nd 5 respectively Error on the Log-Log xis demonstrtes the lgebric convergence of the h-type extension (Right) Convergence wrt L norm s function of size of polynomil order in semi-log plot It shows the exponentil convergence of p-type extension for smooth solutions The two tests re performed for p-type extension with element lengths of nd
21 4 Conclusion Throughout this project, we investigte the ppliction of Spectrl Polynomil Element Method to Poisson equtions We lso compred the of h/p convergence properties of the method to the clssicl finite element method The Glerkin method llows incorportion of the wek solution into the formultion for the problem s system of liner equtions which cn be solved numericlly The Spectrl element solver for one dimensionl Poisson eqution with Dirichlet nd Neumnn boundry conditions, with high-order solutions exhibited much ccurte solutions which were hrd to get cceptble convergence in given time nd resolution of domin in pst For the future study, we would like del with problems regrding: development multi-dimensionl solver obtining solutions to vrious nturl phenomen tht obey governing equtions utilizing the method in the ill-posed problem By using certin technique tht we cn pproximte the solution, we cn lso pply this method to the problem nd compre with other method in tht sitution References [] Spectrl/Hp Element Methods for Cfd George Em Krnidkis, Spencer J Sherwin, Oxford Univ Press, 999 [] Spectrl Methods in MATLAB Lloyd N Trefethen, Society for Industril nd Applied Mthemtics, [3] Lecture note of Advnced Methods in Scientific Computing Christopher R Johnson, School of Computing, University of Uth, [4] A direct spectrl colloction Poisson solver in polr nd cylindricl coordintes, Chen HL Su YH nd Shizgl BD, Journl of Computtionl Physics 6(), ()
Numerical Methods I Orthogonal Polynomials
Numericl Methods I Orthogonl Polynomils Aleksndr Donev Cournt Institute, NYU 1 donev@cournt.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fll 2014 Nov 6th, 2014 A. Donev (Cournt Institute) Lecture IX
More informationIntroduction to Finite Element Method
Introduction to Finite Element Method Introductory Course on Multiphysics Modelling TOMASZ G. ZIELIŃSKI bluebox.ippt.pn.pl/ tzielins/ Tble of Contents 1 Introduction 1 1.1 Motivtion nd generl concepts.............
More informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationLecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 6: Singulr Integrls, Open Qudrture rules, nd Guss Qudrture (Compiled 6 August 7) In this lecture we discuss the
More informationOrthogonal Polynomials and Least-Squares Approximations to Functions
Chpter Orthogonl Polynomils nd Lest-Squres Approximtions to Functions **4/5/3 ET. Discrete Lest-Squres Approximtions Given set of dt points (x,y ), (x,y ),..., (x m,y m ), norml nd useful prctice in mny
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More informationMath 270A: Numerical Linear Algebra
Mth 70A: Numericl Liner Algebr Instructor: Michel Holst Fll Qurter 014 Homework Assignment #3 Due Give to TA t lest few dys before finl if you wnt feedbck. Exercise 3.1. (The Bsic Liner Method for Liner
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More informationDefinite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationDiscrete Least-squares Approximations
Discrete Lest-squres Approximtions Given set of dt points (x, y ), (x, y ),, (x m, y m ), norml nd useful prctice in mny pplictions in sttistics, engineering nd other pplied sciences is to construct curve
More informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationPlates on elastic foundation
Pltes on elstic foundtion Circulr elstic plte, xil-symmetric lod, Winkler soil (fter Timoshenko & Woinowsky-Krieger (1959) - Chpter 8) Prepred by Enzo Mrtinelli Drft version ( April 016) Introduction Winkler
More informationChapter 3 Polynomials
Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling
More informationSTURM-LIOUVILLE BOUNDARY VALUE PROBLEMS
STURM-LIOUVILLE BOUNDARY VALUE PROBLEMS Throughout, we let [, b] be bounded intervl in R. C 2 ([, b]) denotes the spce of functions with derivtives of second order continuous up to the endpoints. Cc 2
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationBest Approximation in the 2-norm
Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
More informationCandidates must show on each answer book the type of calculator used.
UNIVERSITY OF EAST ANGLIA School of Mthemtics My/June UG Exmintion 2007 2008 ELECTRICITY AND MAGNETISM Time llowed: 3 hours Attempt FIVE questions. Cndidtes must show on ech nswer book the type of clcultor
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 4: Piecewise Cubic Interpoltion Compiled 5 September In this lecture we consider piecewise cubic interpoltion
More informationTheoretische Physik 2: Elektrodynamik (Prof. A.-S. Smith) Home assignment 4
WiSe 1 8.1.1 Prof. Dr. A.-S. Smith Dipl.-Phys. Ellen Fischermeier Dipl.-Phys. Mtthis Sb m Lehrstuhl für Theoretische Physik I Deprtment für Physik Friedrich-Alexnder-Universität Erlngen-Nürnberg Theoretische
More informationMA Handout 2: Notation and Background Concepts from Analysis
MA350059 Hndout 2: Nottion nd Bckground Concepts from Anlysis This hndout summrises some nottion we will use nd lso gives recp of some concepts from other units (MA20023: PDEs nd CM, MA20218: Anlysis 2A,
More informationMatrices, Moments and Quadrature, cont d
Jim Lmbers MAT 285 Summer Session 2015-16 Lecture 2 Notes Mtrices, Moments nd Qudrture, cont d We hve described how Jcobi mtrices cn be used to compute nodes nd weights for Gussin qudrture rules for generl
More informationMonte Carlo method in solving numerical integration and differential equation
Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The
More informationNumerical quadrature based on interpolating functions: A MATLAB implementation
SEMINAR REPORT Numericl qudrture bsed on interpolting functions: A MATLAB implementtion by Venkt Ayylsomyjul A seminr report submitted in prtil fulfillment for the degree of Mster of Science (M.Sc) in
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More information3.4 Numerical integration
3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationPartial Derivatives. Limits. For a single variable function f (x), the limit lim
Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationCzechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction
Czechoslovk Mthemticl Journl, 55 (130) (2005), 933 940 ESTIMATES OF THE REMAINDER IN TAYLOR S THEOREM USING THE HENSTOCK-KURZWEIL INTEGRAL, Abbotsford (Received Jnury 22, 2003) Abstrct. When rel-vlued
More informationChapter 1. Basic Concepts
Socrtes Dilecticl Process: The Þrst step is the seprtion of subject into its elements. After this, by deþning nd discovering more bout its prts, one better comprehends the entire subject Socrtes (469-399)
More informationInterpolation. Gaussian Quadrature. September 25, 2011
Gussin Qudrture September 25, 2011 Approximtion of integrls Approximtion of integrls by qudrture Mny definite integrls cnnot be computed in closed form, nd must be pproximted numericlly. Bsic building
More informationEuler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )
Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More informationVariational Techniques for Sturm-Liouville Eigenvalue Problems
Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More informationChapter 7 Notes, Stewart 8e. 7.1 Integration by Parts Trigonometric Integrals Evaluating sin m x cos n (x) dx...
Contents 7.1 Integrtion by Prts................................... 2 7.2 Trigonometric Integrls.................................. 8 7.2.1 Evluting sin m x cos n (x)......................... 8 7.2.2 Evluting
More informationMath Advanced Calculus II
Mth 452 - Advnced Clculus II Line Integrls nd Green s Theorem The min gol of this chpter is to prove Stoke s theorem, which is the multivrible version of the fundmentl theorem of clculus. We will be focused
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More information1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),
1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on
More informationUNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE
UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE 1. Pointwise Convergence of Sequence Let E be set nd Y be metric spce. Consider functions f n : E Y for n = 1, 2,.... We sy tht the sequence
More informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationChapter 3 Solving Nonlinear Equations
Chpter 3 Solving Nonliner Equtions 3.1 Introduction The nonliner function of unknown vrible x is in the form of where n could be non-integer. Root is the numericl vlue of x tht stisfies f ( x) 0. Grphiclly,
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationOrdinary differential equations
Ordinry differentil equtions Introduction to Synthetic Biology E Nvrro A Montgud P Fernndez de Cordob JF Urchueguí Overview Introduction-Modelling Bsic concepts to understnd n ODE. Description nd properties
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationSummary: Method of Separation of Variables
Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More information1.3 The Lemma of DuBois-Reymond
28 CHAPTER 1. INDIRECT METHODS 1.3 The Lemm of DuBois-Reymond We needed extr regulrity to integrte by prts nd obtin the Euler- Lgrnge eqution. The following result shows tht, t lest sometimes, the extr
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationLecture Notes: Orthogonal Polynomials, Gaussian Quadrature, and Integral Equations
18330 Lecture Notes: Orthogonl Polynomils, Gussin Qudrture, nd Integrl Equtions Homer Reid My 1, 2014 In the previous set of notes we rrived t the definition of Chebyshev polynomils T n (x) vi the following
More informationTHE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS
THE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS CARLOS SUERO, MAURICIO ALMANZAR CONTENTS 1 Introduction 1 2 Proof of Gussin Qudrture 6 3 Iterted 2-Dimensionl Gussin Qudrture 20 4
More informationDOING PHYSICS WITH MATLAB MATHEMATICAL ROUTINES
DOIG PHYSICS WITH MATLAB MATHEMATICAL ROUTIES COMPUTATIO OF OE-DIMESIOAL ITEGRALS In Cooper School of Physics, University of Sydney in.cooper@sydney.edu.u DOWLOAD DIRECTORY FOR MATLAB SCRIPTS mth_integrtion_1d.m
More informationJackson 2.7 Homework Problem Solution Dr. Christopher S. Baird University of Massachusetts Lowell
Jckson.7 Homework Problem Solution Dr. Christopher S. Bird University of Msschusetts Lowell PROBLEM: Consider potentil problem in the hlf-spce defined by, with Dirichlet boundry conditions on the plne
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationConstruction of Gauss Quadrature Rules
Jim Lmbers MAT 772 Fll Semester 2010-11 Lecture 15 Notes These notes correspond to Sections 10.2 nd 10.3 in the text. Construction of Guss Qudrture Rules Previously, we lerned tht Newton-Cotes qudrture
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationUndergraduate Research
Undergrdute Reserch A Trigonometric Simpson s Rule By Ctherine Cusimno Kirby nd Sony Stnley Biogrphicl Sketch Ctherine Cusimno Kirby is the dughter of Donn nd Sm Cusimno. Originlly from Vestvi Hills, Albm,
More informationProblem Set 3 Solutions
Msschusetts Institute of Technology Deprtment of Physics Physics 8.07 Fll 2005 Problem Set 3 Solutions Problem 1: Cylindricl Cpcitor Griffiths Problems 2.39: Let the totl chrge per unit length on the inner
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationPartial Differential Equations
Prtil Differentil Equtions Notes by Robert Piché, Tmpere University of Technology reen s Functions. reen s Function for One-Dimensionl Eqution The reen s function provides complete solution to boundry
More informationADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS
ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS F. Tkeo 1 nd M. Sk 1 Hchinohe Ntionl College of Technology, Hchinohe, Jpn; Tohoku University, Sendi, Jpn Abstrct:
More informationCAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam.
Exmintion 1 Posted 23 October 2002. Due no lter thn 5pm on Mondy, 28 October 2002. Instructions: 1. Time limit: 3 uninterrupted hours. 2. There re four questions, plus bonus. Do not look t them until you
More informationdifferent methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).
Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More informationu = 0 in Ω, u = f on B,
Preprint April 1991 Colordo Stte University Deprtment of Mthemtics COMPUTATION OF WEAKLY AND NEARLY SINGULAR INTEGRALS OVER TRIANGLES IN R 3 EUGENE L. ALLGOWER 1,2,4, KURT GEORG 1,3,4 nd KARL KALIK 3,5
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
ADVANCED CALCULUS PRACTICE PROBLEMS JAMES KEESLING The problems tht follow illustrte the methods covered in clss. They re typicl of the types of problems tht will be on the tests. 1. Riemnn Integrtion
More informationThe Fundamental Theorem of Calculus. The Total Change Theorem and the Area Under a Curve.
Clculus Li Vs The Fundmentl Theorem of Clculus. The Totl Chnge Theorem nd the Are Under Curve. Recll the following fct from Clculus course. If continuous function f(x) represents the rte of chnge of F
More informationLecture 20: Numerical Integration III
cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationNumerical Integration. 1 Introduction. 2 Midpoint Rule, Trapezoid Rule, Simpson Rule. AMSC/CMSC 460/466 T. von Petersdorff 1
AMSC/CMSC 46/466 T. von Petersdorff 1 umericl Integrtion 1 Introduction We wnt to pproximte the integrl I := f xdx where we re given, b nd the function f s subroutine. We evlute f t points x 1,...,x n
More informationMath 100 Review Sheet
Mth 100 Review Sheet Joseph H. Silvermn December 2010 This outline of Mth 100 is summry of the mteril covered in the course. It is designed to be study id, but it is only n outline nd should be used s
More information1 The Riemann Integral
The Riemnn Integrl. An exmple leding to the notion of integrl (res) We know how to find (i.e. define) the re of rectngle (bse height), tringle ( (sum of res of tringles). But how do we find/define n re
More informationThe Riemann Integral
Deprtment of Mthemtics King Sud University 2017-2018 Tble of contents 1 Anti-derivtive Function nd Indefinite Integrls 2 3 4 5 Indefinite Integrls & Anti-derivtive Function Definition Let f : I R be function
More information1 2-D Second Order Equations: Separation of Variables
Chpter 12 PDEs in Rectngles 1 2-D Second Order Equtions: Seprtion of Vribles 1. A second order liner prtil differentil eqution in two vribles x nd y is A 2 u x + B 2 u 2 x y + C 2 u y + D u 2 x + E u +
More informationIntegration Techniques
Integrtion Techniques. Integrtion of Trigonometric Functions Exmple. Evlute cos x. Recll tht cos x = cos x. Hence, cos x Exmple. Evlute = ( + cos x) = (x + sin x) + C = x + 4 sin x + C. cos 3 x. Let u
More informationMAC-solutions of the nonexistent solutions of mathematical physics
Proceedings of the 4th WSEAS Interntionl Conference on Finite Differences - Finite Elements - Finite Volumes - Boundry Elements MAC-solutions of the nonexistent solutions of mthemticl physics IGO NEYGEBAUE
More informationLecture 17. Integration: Gauss Quadrature. David Semeraro. University of Illinois at Urbana-Champaign. March 20, 2014
Lecture 17 Integrtion: Guss Qudrture Dvid Semerro University of Illinois t Urbn-Chmpign Mrch 0, 014 Dvid Semerro (NCSA) CS 57 Mrch 0, 014 1 / 9 Tody: Objectives identify the most widely used qudrture method
More information1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.
1 12 Liner Vrible Coefficient Equtions Section Objective(s): Review: Constnt Coefficient Equtions Solving Vrible Coefficient Equtions The Integrting Fctor Method The Bernoulli Eqution 121 Review: Constnt
More information