A formally fourth-order accurate compact scheme for 3D Poisson equation in cylindrical and spherical coordinates

Size: px
Start display at page:

Download "A formally fourth-order accurate compact scheme for 3D Poisson equation in cylindrical and spherical coordinates"

Transcription

1 A formally fourth-order accurate compact scheme for 3D Posson equaton n cylndrcal and sphercal coordnates Mng-Chh La Ju-Mng Tseng Department of Appled Mathematcs Natonal Chao Tung Unversty Hsnchu 300, TAIWAN Abstract In ths paper, we extend our prevous work (M.-C. La, A smple Compact Fourth-Order Posson Solver on Polar Geometry, J. Comput. Phys., 182, (2002)) to three-dmensonal cases. In partcular, we present a spectral/fnte dfference scheme for Posson equaton n cylndrcal and sphercal coordnates. The scheme reles on the truncated Fourer seres expanson, where the partal dfferental equatons of Fourer coeffcents are solved by a formally fourth-order accurate compact dfference dscretzaton. Here the formal fourth-order accuracy means that the scheme s exactly fourth-order accurate whle the poles are excluded and s thrd-order accurate otherwse. Despte the degradaton of one order of accuracy due to the presence of poles, the scheme handles the poles naturally; thus, no pole condton s needed. The resultant lnear system s then solved by the B-CGSTAB method wth the precondtoner arsng from the second-order dscretzaton whch shows the scalablty wth the problem sze. Keywords: Posson equaton; cylndrcal coordnates; sphercal coordnates; symmetry constrant; Fast Fourer Transform; B-CGSTAB method 1 Introducton In many physcal problems, one often needs to solve the Posson equaton on a three-dmensonal non-cartesan doman, such as cylndrcal or sphercal domans. Correspondng author. Department of Appled Mathematcs, Natonal Chao Tung Unversty, 1001, Ta Hsueh Road, Hsnchu 300, TAIWAN. E-mal: mcla@math.nctu.edu.tw 1

2 For example, the projecton method n the smulaton of ncompressble flow n a ppe requres solvng the pressure Posson equaton. It s convenent to rewrte the equaton n those coordnates. The frst problem that must be dealt wth s the coordnate sngulartes (or poles) caused by the transformaton. It s mportant to note that the occurrence of those sngulartes s due to the representaton of the governng equaton n those coordnates and the soluton tself s regular f the source functon and the boundary condtons are smooth. For the past few years, the frst author and hs collaborators have developed a class of FFT-based fast drect solvers for posson equaton on 2D [1] and 3D [2] cylndrcal and sphercal domans. The methods have three major features, namely, the coordnate sngulartes can be treated easly, the resultng lnear equatons can be solved effcently by exstng avalable fast algorthms, and the dfferent boundary condtons can be handled wthout substantal dfferences. Besdes, the method s easy to mplement. Despte those aforementoned advantages of our algorthm, the numercal schemes n 3D doman [2] are only second-order accurate. Recently, the frst author has developed a smple compact fourth-order Posson solver on 2D polar geometry [3]. In fact, the scheme n [3] s formally fourth-order meanng that t has fourth-order accuracy only for the problem excludng the polar orgn but degrades to thrd-order accuracy when the orgn s ncluded. Despte the degradaton of one order of accuracy due to the presence of pole, the scheme handles the pole naturally; thus, no pole condton s needed. There are a few papers n the lterature that dscuss fourth-order fnte dfference schemes for the Posson equaton n 2D polar [6, 4, 5] and 3D cylndrcal coordnates [6, 7]. However, those papers need to derve some specal equatons at r = 0 (that s, pole condton). In ths artcle, we shall extend the methodology presented n [3] to the three-dmensonal cylndrcal and also sphercal geometres. 2 Posson equaton n 3D cylndrcal coordnates The Posson equaton n a fnte crcular cylnder Ω = {0 < r 1, 0 θ < 2π, 0 z 1} can be convenently represented n cylndrcal coordnates as 2 u r + 1 u 2 r r u r 2 θ + 2 u = f(r, z, θ), (2.1) 2 z2 u(r, 1, θ) = u T (r, θ), u(r, 0, θ) = u B (r, θ), u(1, z, θ) = u S (z, θ). (2.2) Here, we restrct the Drchlet boundary condtons on the top, bottom and the sdewall boundares. 2

3 2.1 Fourer mode equatons Snce the soluton u s perodc n θ, we can approxmate t by the truncated Fourer seres as u(r, z, θ) = N/2 1 n= N/2 where û n (r, z) s the complex Fourer coeffcent gven by û n (r, z) = 1 N N 1 k=0 û n (r, z) e nθ, (2.3) u(r, z, θ k ) e nθ k, (2.4) and θ k = 2kπ/N wth N the number of grd ponts along a crcle. The above transformaton between the physcal space and Fourer space can be effcently performed by the Fast Fourer Transform (FFT) wth O(N log 2 N) arthmetc operatons. Substtutng the expansons of (2.3) nto Eq.(2.1), and equatng the Fourer coeffcents, we derve û n (r, z) satsfyng the PDE 2 û n r r û n r + 2 û n z n2 2 r û 2 n = ˆf n (r, z), 0 < r 1, 0 z 1. (2.5) û n (r, 0) = û n B(r), û n (r, 1) = û n T (r), û n (1, z) = û n S(z). (2.6) Here, the nth Fourer coeffcent of the rght-hand sde functon ˆf n (r, z) and the boundary values û n S (z), ûn T (r), ûn B (r) are defned n a smlar fashon as (2.4). In the followng subsecton, we shall use the notatons U(r, z) = û n (r, z) and F (r, z) = ˆf n (r, z), respectvely. Usng the truncated Fourer seres expanson, the orgnal 3D Posson equaton (2.1) now becomes a set (N) of 2D Fourer mode equatons (2.5). In fact, we only need to solve half of Fourer modes, say n = 0, 1,..., N/2 1 snce u s a real valued functon and we have u n (r, z) = u n (r, z). Furthermore, snce those Fourer mode equatons are fully decoupled, they can be solved n parallel. After we solve those Fourer mode equatons and obtan the values of û n (r, z), the soluton u(r, z, θ) can be obtaned va the nverse FFT as (2.3). In [2], we have developed a second-order fnte dfference scheme to solve the Fourer mode equaton (2.5). In ths paper, our goal s to derve a formally fourth-order accurate compact scheme for the equaton (2.5). 2.2 Formally fourth-order compact dfference dscretzaton In order to derve a fourth-order fnte dfference approxmaton to Eq.(2.5), obvously, the frst and second dervatves, U r, U rr and U zz, must be approxmated to fourth-order accurately. To proceed, let us wrte down some dfference formulas for 3

4 the frst and second dervatves wth the truncaton errors O( r 4 ) and O( z 4 ) as follows. U r = δ 1 ru r2 6 U rrr + O( r 4 ), (2.7) U rr = δ 2 ru r2 12 U rrrr + O( r 4 ), (2.8) U zz = δ 2 zu z2 12 U zzzz + O( z 4 ). (2.9) Here δ 1 r, δ 2 r and δ 2 z are the centered dfference operators for the frst and second dervatves, defned as δru 1 j = U +1,j U 1,j, δ 2 2 r ru j = U +1,j 2U,j + U 1,j, (2.10) r 2 δ 2 zu j = U,j+1 2 U,j + U,j 1 z 2, (2.11) where U j are the dscrete values defned at the grd ponts (r, z j ). As n [2], we choose a shfted grd to avod the polar sngularty as r = ( 1/2) r, z j = j z, (2.12) for 1 L + 1; 0 j M + 1, wth r = 2/(2L + 1) and z = 1/(M + 1). Notce that, unlke the tradtonal mesh [9], we do not put the grd ponts on the polar axs drectly, thus; no pole condtons are needed. In order to have fourth-order approxmatons for U r, U rr and U zz, we need to approxmate the hgher order partal dervatves U rrr, U rrrr and U zzzz n Eqs.(2.7), (2.8) and (2.9) to be second-order accurate. In addton, those approxmatons should nvolve at most the neghborng nne-pont stencl to meet the compact requrement. To accomplsh ths, we dfferentate Eq.(2.5) wth respect to r and z and obtan the hgher order partal dervatves of U as U rrr = F r U rr r n2 U r 2 r 2n2 r U U zzr, (2.13) 3 U rrrr = F rr F r r n2 U r 2 rr 3 + 5n2 U r 3 r + 8n2 r U + U zzr 4 r U zzzz = F zz U rrzz U rzz r U zzrr, (2.14) + n2 r 2 U zz. (2.15) Now the partal dervatves U rrr, U rrrr and U zzzz are wrtten n terms of lower order partal dervatves whch are no hgher than second-order n r and z. Usng the standard centered dfference approxmatons to those lower order partal dervatves 4

5 Fgure 1: A nne-pont compact stencl. n Eqs.(2.13)-(2.15) and substtutng those approxmatons nto the equatons (2.7)- (2.9) and (2.5), we obtan the followng dfference scheme δru 2,j r2 12 [δ2 rf,j 1 δ r rf 1,j n2 δ r ru 2 2,j 3 + 5n2 δ r ru 1 3,j + 8n2 U r 4,j + 1 δ r rδ 1 zu 2,j δrδ 2 zu 2,j ] + 1 δ r ru 1,j r2 [δ 6r rf 1,j 1 δ r ru 2,j n2 r 2 δ 1 ru,j 2n2 r 3 U,j δrδ 1 zu 2,j ] n2 U r 2,j +δzu 2,j z2 12 [δ2 zf,j δzδ 2 ru 2,j 1 δ r zδ 2 ru 1,j + n2 δzu 2,j ] = F,j, (2.16) for 1 L, 1 j M. Note that, the scheme nvolves centered dfference approxmatons to frst or second order partal dervatves n r and z so only a nnepont compact stencl s used, see the Fgure 1 for llustraton. One can also see that f the order terms of r 2 and z 2 are gnored n the equaton (2.16), then the scheme recovers to the usual second-order accurate scheme as n [2]. In order to close the lnear system, the numercal boundary values U 0,j, U L+1,j and U,0, U,M+1 should be suppled. The numercal boundary value U 0,j can be gven by U 0,j = ( 1) n U 1,j due to the symmetry constrant of Fourer coeffcents (û n ( r/2, z j ) = ( 1) n û n ( r/2, z j )) [3]. And the other numercal boundary can be easly obtaned by the gven Drchlet boundary values U L+1,j = û n S (z j), U,0 = û n B (r ) 5 r 2

6 and U,M+1 = û n T (r ). 2.3 Numercal results In ths subsecton, we perform some numercal tests on the accuracy and effcency of our scheme. Snce the matrx of the resultant lnear system n (2.16) s nonsymmetrc, we use the BConjugate Gradent Stablzed method (B-CGSTAB) [10] to solve the lnear systems. The stoppng crteron of the convergence s based on the relatve resdual whch the tolerance ranges from dependng on the dfferent Fourer modes. Table 1 shows the maxmum relatve errors for three dfferent solutons of Posson equaton n cylndrcal coordnates. In all our tests, we use L mesh ponts n the radal (r) and axal (z) drectons, and 2L ponts n the azmuthal (θ) drecton. The rate of convergence s computed by the formula log 2 ( E L/2 E L ), where E L s the maxmum relatve error wth mesh resoluton L. From Table 1, we can see that the errors of the solutons show thrd-order convergence for all examples n the case of sold cylnder (0 < r 1). The loss of one order of accuracy seems to come from the dscretzaton near the polar orgn. Ths can be seen from the followng truncaton error analyss. In the Fourer mode equaton (2.5), the U r (= û n / r) term s dvded by r. So the second-order approxmaton of U rrr n (2.7) s dvded by an O( r) term near the orgn, whch makes the approxmaton of U rrr /r frst-order accurate. Ths has the consequence that the overall truncaton error of the U r /r term n the vcnty of the orgn s O( r 3 ) and thus so s the Fourer mode equaton (2.5). However, ths loss of accuracy does not appear when solvng the problem on a cylnder that excludes the polar sngularty such as the case of 0 < a r 1. Let us explan why s the case next. As n the sold cylnder case, we need to solve Eq.(2.5) wth the Drchlet boundary condton at r = 1 and an addtonal boundary condton mposed at r = a. Instead of settng a grd as n (2.12), we choose a regular grd n the radal drecton as r = a + r, = 0, 1,..., L, L + 1, (2.17) wth the mesh wdth r = (1 a)/(l + 1). Now the second-order approxmaton of U rrr n (2.7) s dvded by an O(a + r) term nstead of an O( r) term, so the truncaton error of the U rrr /r term s stll O( r 2 ) whch makes the dscretzaton error of U r /r term s O( r 4 ). Therefore, the overall truncaton error of Eq.(2.5) s O( r 4 ). One can see n Table 1 that the fourth-order convergence ndeed can be acheved for all test examples for the case of 0.5 r 1. In order to speed up the convergence of B-CGSTAB teraton, we have appled dfferent precondtoners whch nclude Block Jacob (BJ) [8], Incomplete LU factorzaton (ILU) [8], and the Fast Drect Solver (FDS) arsng from the second-order dscretzaton for the equaton (2.5) whch s developed n [2]. Here, we solve the 6

7 0 < r < r 1 L E L Rate E L Rate r cos θ+r sn θ+z u(r, z, θ) = e E E E E E E E E u(r, z, θ) = r 3 (cos θ + sn θ)z(1 z) E E E E E E E E u(r, z, θ) = cos(π(r 2 cos 2 θ + r sn θ)) sn(πz 2 ) E E E E E E E E Table 1: The maxmum relatve errors for dfferent solutons to Posson equaton n cylndrcal coordnates. dfference equaton (2.16) wth the Fourer mode number n = 1. The tolerance for the relatve resdual s chosen as Table 2 shows the number of teratons needed to be convergent for dfferent precondtoners appled to B-CGSTAB teraton. The column of B-CGSTAB s the one wthout any precondtoner whch, as expected, has the largest number of teratons. The precondtoners BJ and ILU both need double teratons when the grd ponts are doubled. One can see that, the FDS precondtoner turns out to be the most effcent one snce t has the least number of teratons, and the teratons are kept to be a constant when we double the grd ponts. L B-CGSTAB BJ ILU FDS Table 2: The performance comparson of dfferent precondtoners for the cylndrcal case. 7

8 3 Posson equaton n 3D sphercal coordnates In ths secton, we perform the smlar dervaton as the cylndrcal case and develop a spectral/fnte dfference scheme for Posson equaton n 3D sphercal doman. The Posson equaton wth Drchlet boundary n a sphercal shell Ω = {R 0 1, 0 φ π, 0 θ 2π} can be wrtten n sphercal coordnates as 2 u + 2 u u 2 φ + cot φ 2 2 u φ sn 2 φ 2 u = f(, φ, θ), (3.18) θ2 u(r 0, φ, θ) = u I (φ, θ), u(1, φ, θ) = u S (φ, θ). (3.19) Here, the boundary condton should be mposed on the nner ( = R 0 > 0) and outer ( = 1) surfaces of the sphere. As the cylndrcal case, the man dffculty for solvng Eq.(3.18) s to treat the coordnate sngulartes along the polar axs where north (φ = 0) and south (φ = π) poles are located. Most of numercal approaches ncludng fnte dfference and spectral methods nvolve mposng addtonal pole condtons to capture the behavor of the soluton n the vcnty of the poles. In [1, 2], we have developed a seres of FFT-based second-order fast Posson solver wthout pole condtons for 2D and 3D sphercal domans. In the followng, we wll develop a formally fourth-order compact scheme for Eqs. (3.18)-(3.19). To the best of our knowledge, we have not seen any related work n the lterature. 3.1 Fourer mode equatons As n the cylndrcal coordnate case, we approxmate u by the truncated Fourer seres as u(, φ, θ) = N/2 1 n= N/2 where û n (, φ) s the complex Fourer coeffcent gven by û n (, φ) = 1 N N 1 k=0 û n (, φ) e nθ, (3.20) u(, φ, θ k ) e nθ k, (3.21) and θ k = 2kπ/N and N s the number of grd ponts along a lattude crcle. Once agan, the above transformaton between the physcal space and Fourer space can be effcently performed by the Fast Fourer Transform (FFT) wth O(N log 2 N) arthmetc operatons. The expanson for the functon f can be wrtten n the smlar fashon. 8

9 Substtutng those expansons nto Eq.(3.18), and equatng the Fourer coeffcents, û n (, φ) then satsfes the PDE 2 û n û n û n 2 φ 2 + cot φ û n 2 φ n2 2 sn 2 φûn = ˆf n (, φ), (3.22) û n (R 0, φ) = û n I (φ), û n (1, φ) = û n S(φ). (3.23) Here, û n I (φ) and ûn S (φ) are the nth Fourer coeffcent of u I(φ, θ) and u S (φ, θ), respectvely. Next, we need to derve a formally fourth-order compact scheme for the Fourer mode equatons (3.22). 3.2 Formally fourth-order compact dfference dscretzaton As n [2], we choose a grd n (, φ) plane by = R 0 + r, φ j = (j 1/2) φ, (3.24) for 0 L + 1, 0 j M + 1 wth = (1 R 0 )/(L + 1) and φ = π/m. By the choce of those mesh ponts, we avod placng ponts drectly at north (φ = 0) and south (φ = π) poles. Agan, let the dscrete values be denoted by U(, φ j ) û n (, φ j ), and F (, φ j ) ˆf n (, φ j ). Our goal s to derve a fourth-order fnte dfference approxmaton to Eq.(3.22). Obvously, the frst and second dervatves, U, U, U φ and U φφ must be approxmated to fourth-order accurately. In order to have fourth-order approxmatons for U, U, U φ and U φφ, we need to approxmate the hgher order dervatves U, U, U φφφ and U φφφφ to be second-order accurate. We then reduce those hgher order partal dervatves to lower order by dfferentatng the equaton (3.22) and use the regular centered dfference to approxmate those lower order partal dervatves. The dervaton s very smlar to the cylndrcal case, so we omt the detal here. After a tedous calculaton, we obtan a fnte dfference scheme as follows. 9

10 For 1 L, 1 j M, we have δu 2,j 2 12 [δ2 F,j 2 δ F 1,j + ( 8 + n2 csc 2 φ j +( 8 6n2 csc 2 φ j )δ 1 U,j δ 2 φu,j 10 cot φ j 4 )δu 2,j + 10n2 csc 2 φ j U 4,j δφu 1,j + 6 cot φ j δ δ 1 φu 1 3,j δδ 1 φu 2,j cot φ j δ δ 2 φu 1 2,j 1 δ δ 2 φu 2 2,j ] + 2 {δ U 1,j r2 6 [δ1 F,j 2 δ 2 U,j + ( 2 + n2 csc 2 φ j 2 )δu 1,j + 2 cot φ j δ φu 1 3,j δφu 2,j cot φ j δ δ 1 φu 1 2,j 1 δ δ 1 φu 2 2,j 2n2 csc 2 φ j U 3,j ]} + 1 {δ φu 2 2,j φ2 12 [2 δφf 2,j 2 cot φ j δφf 1,j +((3 + n 2 ) csc 2 φ j 1)δφU 2,j + ( 3 5n 2 ) csc 2 φ j cot φ j δφu 1,j +2n 2 csc 2 φ j (4 csc 2 φ j 3)U,j + 2 cot φ j δ 1 φδ 1 U,j + 2 cot φ j δ 1 φδ 2 U,j 2 δφδ 2 U 1,j 2 δφδ 2 U 2,j ]} + cot φ j {δ φu 1 2,j φ2 6 [ 2 δφδ 1 U 2,j 2 δφδ 1 U 1,j +(1 + n 2 ) csc 2 φ j δφu 1,j cot φ j δφu 2,j 2n 2 csc 2 φ j cot φ j U,j + 2 δφf 1,j ]} n2 csc 2 φ j U 2,j = F,j. (3.25) Note that, the scheme nvolves centered dfference approxmatons to frst or second order partal dervatves n and φ so only a nne-pont compact stencl s used. One can also see that f the order terms of 2 and φ 2 are gnored n the equaton (3.25), then the scheme recovers to the usual second-order accurate scheme as n [2]. When j = 1 for Eq.(3.25), the numercal boundary value U,0 can be gven by U,0 = ( 1) n U,1. Ths s because the Fourer coeffcent satsfes the symmetry constrant û n (, φ/2) = ( 1) n û n (, φ/2) [2]. Smlarly, another numercal boundary value U,M+1 can also be obtaned by U,M+1 = ( 1) n U,M for the same reason. So the numercal boundary values n the φ drecton are provded and no pole condton s needed n our fnte dfference settng. The other numercal boundary U 0,j, U L+1,j are gven by the boundary values û n I (φ j), û n S (φ j). 3.3 Numercal results In ths subsecton, we perform smlar numercal tests on the accuracy and effcency of our scheme for the sphercal coordnates case. In all our tests, we use L mesh ponts n the radal () and colattude (φ) drectons, and 2L ponts n the longtude (θ) drecton. The nner radus s chosen as R 0 = 0.5. The dfference equaton (3.25) s solved by the B-CGSTAB method for n = 0, 1,... L 1 where the tolerance of 10

11 stoppng ranges from dependng on the dfferent Fourer modes. Once we obtan the Fourer coeffcents, the numercal soluton can be computed by the nverse FFT as n (3.20). Table 3 shows the maxmum errors of the method for three dfferent solutons of Posson equaton n a sphercal shell. One can see that the errors of the solutons show thrd-order convergence for all test examples. The reason of losng one order of accuracy s exactly the same as the cylndrcal case so we omt the dscusson here. Table 4 shows the number of teratons needed for solvng the dfference equaton (3.25) of n = 1 by the B-CGSTAB method wth dfferent precondtoners. The tolerance of stoppng for the relatve resdual s chosen as Generally speakng, the performance of those precondtoners are almost the same as the cylndrcal case. It s nterestng to see that the ILU precondtoner seems to have the less number of teratons than the FDS when the number of grd ponts s small. However, the ILU does ncrease the teratons as the grd ponts ncreasng whle the FDS precondtoner stll keeps the number of teratons. L E L Rate sn φ cos θ+ sn φ sn θ+ cos φ u(, φ, θ) = e E E E E u(, φ, θ) = 3 (cos θ + sn θ) sn φ(1 cos φ) E E E E u(, φ, θ) = cos(π( 2 cos 2 θ sn 2 φ + sn θ sn φ)) sn(π 2 cos 2 φ) E E E E Table 3: The maxmum relatve errors for dfferent solutons to Posson equaton n sphercal coordnates. 4 Concluson and acknowledgement In ths paper, we present a formally fourth-order compact dfference scheme for 3D Posson equaton n cylndrcal and sphercal coordnates. The solver reles on the 11

12 L B-CGSTAB BJ ILU FDS Table 4: The performance comparson of dfferent precondtoners for the sphercal case. truncated Fourer seres expanson, where the partal dfferental equatons of Fourer coeffcents are solved by a formal fourth-order compact dfference dscretzatons wthout pole condtons. The resultant lnear system s then solved by the B- CGSTAB method wth dfferent precondtoners. The numercal results confrm the formal accuracy of our scheme. Meanwhle, the precondtoner arsng from the second-order fast drect solver shows the scalablty of B-CGSTAB wth the problem sze. The authors are supported n part by the Natonal Scence councl of Tawan under research grant NSC M References [1] M.-C. La and W.-C. Wang, Fast drect solvers for Posson equaton on 2D polar and sphercal gepmetres. Numer. Meth. Partal Dff. Eq., 18, 56-68, (2002). [2] M.-C. La, W.-W. Ln and W. Wang, A fast spectral/dfference method wthout pole condtons for Posson-type equatons n cylndrcal and sphercal geometres. IMA J. Numer. Anal., 22, , (2002). [3] M.-C. La, A smple compact fourth-order Posson solver on polar geometry. J. Comput. Phys., 182, , (2002). [4] R. C. Mttal and S. Gahlaut, Hgh-order fnte-dfference schemes to solve Posson s equaton n polar coordnates, IMA J. Numer. Anal., 11, 261, (1991). [5] M. K. Jan, R. K. Jan and M. Krshna, A fourth-order dfference scheme for quaslnear Posson equaton n polar co-ordnates, Communcatons n Numercal Methods n Engneerng, vol. 10, (1994). [6] S. R. K. Iyengar and R. Manohar, Hgh order dfference methods for heat equaton n polar cylndrcal coordnates, J. Comput. Phys., 77, 425 (1988). 12

13 [7] S. R. K. Iyengar and A. Goyal, A note on multgrd for the three-dmensonal Posson equaton n cylndrcal coordnates, J. Comput. Appl. Math., 33, , (1990). [8] B. Rchard et al. Templates for the soluton of lnear systems:buldng blocks for teratve methods, SIAM (1994). [9] J. C. Strkwerda, Fnte Dfference schemes and Partal Dfferental Equatons, Page , Wadsworth & Brooks/Cole, (1989). [10] H. A. Van der Vorst, B-CGSTAB : A fast and smoothly convergng varant of B-CG for the soluton of nonsymmetrc lnear systems. SIAM J. Sc. Statst. Comput., 13, , (1992). 13

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

New Method for Solving Poisson Equation. on Irregular Domains

New Method for Solving Poisson Equation. on Irregular Domains Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

Implicit Integration Henyey Method

Implicit Integration Henyey Method Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure

More information

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(

More information

FTCS Solution to the Heat Equation

FTCS Solution to the Heat Equation FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence. Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm

More information

Procedia Computer Science

Procedia Computer Science Avalable onlne at www.scencedrect.com Proceda Proceda Computer Computer Scence Scence 1 (01) 00 (009) 589 597 000 000 Proceda Computer Scence www.elsever.com/locate/proceda Internatonal Conference on Computatonal

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

CHAPTER 14 GENERAL PERTURBATION THEORY

CHAPTER 14 GENERAL PERTURBATION THEORY CHAPTER 4 GENERAL PERTURBATION THEORY 4 Introducton A partcle n orbt around a pont mass or a sphercally symmetrc mass dstrbuton s movng n a gravtatonal potental of the form GM / r In ths potental t moves

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

Relaxation Methods for Iterative Solution to Linear Systems of Equations

Relaxation Methods for Iterative Solution to Linear Systems of Equations Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary

More information

(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate

(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate Internatonal Journal of Mathematcs and Systems Scence (018) Volume 1 do:10.494/jmss.v1.815 (Onlne Frst)A Lattce Boltzmann Scheme for Dffuson Equaton n Sphercal Coordnate Debabrata Datta 1 *, T K Pal 1

More information

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962).

[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962). [7] R.S. Varga, Matrx Iteratve Analyss, Prentce-Hall, Englewood ls, New Jersey, (962). [8] J. Zhang, Multgrd soluton of the convecton-duson equaton wth large Reynolds number, n Prelmnary Proceedngs of

More information

PART 8. Partial Differential Equations PDEs

PART 8. Partial Differential Equations PDEs he Islamc Unverst of Gaza Facult of Engneerng Cvl Engneerng Department Numercal Analss ECIV 3306 PAR 8 Partal Dfferental Equatons PDEs Chapter 9; Fnte Dfference: Ellptc Equatons Assocate Prof. Mazen Abualtaef

More information

High resolution entropy stable scheme for shallow water equations

High resolution entropy stable scheme for shallow water equations Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal

More information

The Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites

The Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites 7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT

More information

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse

More information

2 Finite difference basics

2 Finite difference basics Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Numerical Solution of Ordinary Differential Equations

Numerical Solution of Ordinary Differential Equations Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

σ τ τ τ σ τ τ τ σ Review Chapter Four States of Stress Part Three Review Review

σ τ τ τ σ τ τ τ σ Review Chapter Four States of Stress Part Three Review Review Chapter Four States of Stress Part Three When makng your choce n lfe, do not neglect to lve. Samuel Johnson Revew When we use matrx notaton to show the stresses on an element The rows represent the axs

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Normally, in one phase reservoir simulation we would deal with one of the following fluid systems:

Normally, in one phase reservoir simulation we would deal with one of the following fluid systems: TPG4160 Reservor Smulaton 2017 page 1 of 9 ONE-DIMENSIONAL, ONE-PHASE RESERVOIR SIMULATION Flud systems The term sngle phase apples to any system wth only one phase present n the reservor In some cases

More information

Least squares cubic splines without B-splines S.K. Lucas

Least squares cubic splines without B-splines S.K. Lucas Least squares cubc splnes wthout B-splnes S.K. Lucas School of Mathematcs and Statstcs, Unversty of South Australa, Mawson Lakes SA 595 e-mal: stephen.lucas@unsa.edu.au Submtted to the Gazette of the Australan

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

A new integrated-rbf-based domain-embedding scheme for solving fluid-flow problems

A new integrated-rbf-based domain-embedding scheme for solving fluid-flow problems Home Search Collectons Journals About Contact us My IOPscence A new ntegrated-rbf-based doman-embeddng scheme for solvng flud-flow problems Ths artcle has been downloaded from IOPscence. Please scroll

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Tensor Smooth Length for SPH Modelling of High Speed Impact

Tensor Smooth Length for SPH Modelling of High Speed Impact Tensor Smooth Length for SPH Modellng of Hgh Speed Impact Roman Cherepanov and Alexander Gerasmov Insttute of Appled mathematcs and mechancs, Tomsk State Unversty 634050, Lenna av. 36, Tomsk, Russa RCherepanov82@gmal.com,Ger@npmm.tsu.ru

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Lecture 5.8 Flux Vector Splitting

Lecture 5.8 Flux Vector Splitting Lecture 5.8 Flux Vector Splttng 1 Flux Vector Splttng The vector E n (5.7.) can be rewrtten as E = AU (5.8.1) (wth A as gven n (5.7.4) or (5.7.6) ) whenever, the equaton of state s of the separable form

More information

Numerical Transient Heat Conduction Experiment

Numerical Transient Heat Conduction Experiment Numercal ransent Heat Conducton Experment OBJECIVE 1. o demonstrate the basc prncples of conducton heat transfer.. o show how the thermal conductvty of a sold can be measured. 3. o demonstrate the use

More information

PHYS 705: Classical Mechanics. Canonical Transformation II

PHYS 705: Classical Mechanics. Canonical Transformation II 1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Supplemental document

Supplemental document Electronc Supplementary Materal (ESI) for Physcal Chemstry Chemcal Physcs. Ths journal s the Owner Socetes 01 Supplemental document Behnam Nkoobakht School of Chemstry, The Unversty of Sydney, Sydney,

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

THE STURM-LIOUVILLE EIGENVALUE PROBLEM - A NUMERICAL SOLUTION USING THE CONTROL VOLUME METHOD

THE STURM-LIOUVILLE EIGENVALUE PROBLEM - A NUMERICAL SOLUTION USING THE CONTROL VOLUME METHOD Journal of Appled Mathematcs and Computatonal Mechancs 06, 5(), 7-36 www.amcm.pcz.pl p-iss 99-9965 DOI: 0.75/jamcm.06..4 e-iss 353-0588 THE STURM-LIOUVILLE EIGEVALUE PROBLEM - A UMERICAL SOLUTIO USIG THE

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

Week 9 Chapter 10 Section 1-5

Week 9 Chapter 10 Section 1-5 Week 9 Chapter 10 Secton 1-5 Rotaton Rgd Object A rgd object s one that s nondeformable The relatve locatons of all partcles makng up the object reman constant All real objects are deformable to some extent,

More information

Numerical Solutions of a Generalized Nth Order Boundary Value Problems Using Power Series Approximation Method

Numerical Solutions of a Generalized Nth Order Boundary Value Problems Using Power Series Approximation Method Appled Mathematcs, 6, 7, 5-4 Publshed Onlne Jul 6 n ScRes. http://www.scrp.org/journal/am http://.do.org/.436/am.6.77 umercal Solutons of a Generalzed th Order Boundar Value Problems Usng Power Seres Approxmaton

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

12. The Hamilton-Jacobi Equation Michael Fowler

12. The Hamilton-Jacobi Equation Michael Fowler 1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Module 3: Element Properties Lecture 1: Natural Coordinates

Module 3: Element Properties Lecture 1: Natural Coordinates Module 3: Element Propertes Lecture : Natural Coordnates Natural coordnate system s bascally a local coordnate system whch allows the specfcaton of a pont wthn the element by a set of dmensonless numbers

More information

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Georgia Tech PHYS 6124 Mathematical Methods of Physics I Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends

More information

Finite Element Modelling of truss/cable structures

Finite Element Modelling of truss/cable structures Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures

More information

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q For orthogonal curvlnear coordnates, eˆ grad a a= ( aˆ ˆ e). h q (98) Expandng the dervatve, we have, eˆ aˆ ˆ e a= ˆ ˆ a h e + q q 1 aˆ ˆ ˆ a e = ee ˆˆ ˆ + e. h q h q Now expandng eˆ / q (some of the detals

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

Grid Generation around a Cylinder by Complex Potential Functions

Grid Generation around a Cylinder by Complex Potential Functions Research Journal of Appled Scences, Engneerng and Technolog 4(): 53-535, 0 ISSN: 040-7467 Mawell Scentfc Organzaton, 0 Submtted: December 0, 0 Accepted: Januar, 0 Publshed: June 0, 0 Grd Generaton around

More information

Electron-Impact Double Ionization of the H 2

Electron-Impact Double Ionization of the H 2 I R A P 6(), Dec. 5, pp. 9- Electron-Impact Double Ionzaton of the H olecule Internatonal Scence Press ISSN: 9-59 Electron-Impact Double Ionzaton of the H olecule. S. PINDZOLA AND J. COLGAN Department

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION

ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LIX, 013, f.1 DOI: 10.478/v10157-01-00-y ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION BY ION

More information

Lecture 2: Numerical Methods for Differentiations and Integrations

Lecture 2: Numerical Methods for Differentiations and Integrations Numercal Smulaton of Space Plasmas (I [AP-4036] Lecture 2 by Lng-Hsao Lyu March, 2018 Lecture 2: Numercal Methods for Dfferentatons and Integratons As we have dscussed n Lecture 1 that numercal smulaton

More information

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com

More information

DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM

DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI

More information

The Finite Element Method

The Finite Element Method The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of

More information

An efficient algorithm for multivariate Maclaurin Newton transformation

An efficient algorithm for multivariate Maclaurin Newton transformation Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,

More information

Deriving the X-Z Identity from Auxiliary Space Method

Deriving the X-Z Identity from Auxiliary Space Method Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve

More information

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY. Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng -- ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng -- ABCM, Curtba, Brazl,- Dec. 5-8, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR

More information

2.29 Numerical Fluid Mechanics

2.29 Numerical Fluid Mechanics REVIEW Lecture 10: Sprng 2015 Lecture 11 Classfcaton of Partal Dfferental Equatons PDEs) and eamples wth fnte dfference dscretzatons Parabolc PDEs Ellptc PDEs Hyperbolc PDEs Error Types and Dscretzaton

More information

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

ACTM State Calculus Competition Saturday April 30, 2011

ACTM State Calculus Competition Saturday April 30, 2011 ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

2.29 Numerical Fluid Mechanics Fall 2011 Lecture 12

2.29 Numerical Fluid Mechanics Fall 2011 Lecture 12 REVIEW Lecture 11: 2.29 Numercal Flud Mechancs Fall 2011 Lecture 12 End of (Lnear) Algebrac Systems Gradent Methods Krylov Subspace Methods Precondtonng of Ax=b FINITE DIFFERENCES Classfcaton of Partal

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

MAE140 - Linear Circuits - Winter 16 Final, March 16, 2016

MAE140 - Linear Circuits - Winter 16 Final, March 16, 2016 ME140 - Lnear rcuts - Wnter 16 Fnal, March 16, 2016 Instructons () The exam s open book. You may use your class notes and textbook. You may use a hand calculator wth no communcaton capabltes. () You have

More information

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &

More information

MAE140 - Linear Circuits - Fall 13 Midterm, October 31

MAE140 - Linear Circuits - Fall 13 Midterm, October 31 Instructons ME140 - Lnear Crcuts - Fall 13 Mdterm, October 31 () Ths exam s open book. You may use whatever wrtten materals you choose, ncludng your class notes and textbook. You may use a hand calculator

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information