This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

Size: px
Start display at page:

Download "This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and"

Transcription

1 Ths artcle appeared n a journal publshed by Elsever. The attached copy s furnshed to the author for nternal non-commercal research and educaton use, ncludng for nstructon at the authors nsttuton and sharng wth colleagues. Other uses, ncludng reproducton and dstrbuton, or sellng or lcensng copes, or postng to personal, nsttutonal or thrd party webstes are prohbted. In most cases authors are permtted to post ther verson of the artcle (e.g. n Word or Tex form) to ther personal webste or nsttutonal repostory. Authors requrng further nformaton regardng Elsever s archvng and manuscrpt polces are encouraged to vst:

2 Journal of Computatonal Physcs 230 (2011) Contents lsts avalable at ScenceDrect Journal of Computatonal Physcs journal homepage: Realzable hgh-order fnte-volume schemes for quadrature-based moment methods V. Vkas a,.j. Wang a,, A. Passalacqua b, R.O. Fox b a Department of Aerospace Engneerng, 2271 Howe Hall, Iowa State Unversty, Ames, IA 50011, USA b Department of Chemcal and Bologcal Engneerng, 2114 Sweeney Hall, Iowa State Unversty, Ames, IA 50011, USA artcle nfo abstract Artcle hstory: Receved 12 May 2010 Receved n revsed form 5 February 2011 Accepted 21 March 2011 Avalable onlne 27 March 2011 Keywords: Knetc equaton Quadrature method of moments Number densty functon Realzabllty Fnte-volume scheme Unstructured grds Dlute gas partcle flows can be descrbed by a knetc equaton contanng terms for spatal transport, gravty, flud drag and partcle partcle collsons. However, drect numercal soluton of knetc equatons s often nfeasble because of the large number of ndependent varables. An alternatve s to reformulate the problem n terms of the moments of the velocty dstrbuton. Recently, a quadrature-based moment method was derved for approxmatng solutons to knetc equatons. The success of the new method s based on a moment-nverson algorthm that s used to calculate non-negatve weghts and abscssas from the moments. The moment-nverson algorthm does not work f the moments are non-realzable, whch mght lead to negatve weghts. It has been recently shown [14] that realzablty s guaranteed only wth the 1st-order fnte-volume scheme that has an nherent problem of excessve numercal dffuson. The use of hgh-order fnte-volume schemes may lead to non-realzable moments. In the present work, realzablty of the fnte-volume schemes n both space and tme s dscussed for the 1st tme. A generalzed dea for developng realzable hgh-order fnte-volume schemes for quadrature-based moment methods s presented. These fnte-volume schemes gve remarkable mprovement n the solutons for a certan class of problems. It s also shown that the standard Runge Kutta tme-ntegraton schemes do not guarantee realzablty. However, realzablty can be guaranteed f strong stablty-preservng (SSP) Runge Kutta schemes are used. Numercal results are presented on both Cartesan and trangular meshes. Ó 2011 Elsever Inc. All rghts reserved. 1. Introducton Knetc equatons occur n mesoscopc models for many physcal phenomena, such as rarefed gases [7,10,11,24,35,47], plasmas [8,29,55], multphase flows [14,44,48,54], optcs [3,15,21,42,43], and quantum physcs [22,25,26], to name just a few. In ths work, we wll use the knetc equaton descrbng dlute gas partcle flows as an example applcaton. However, the proposed numercal schemes can easly be extended to treat a wde range of knetc equatons descrbng other applcatons. Gas partcle flows occur n many engneerng and natural systems such as fludzed-bed reactors, catalytc crackers, volcanc ash transport n the atmosphere, and helcopter brown-out. Currently, there exst several dfferent approaches for smulatng the knetc equaton descrbng the partcle phase and ts couplng to the gas phase. In general, all approaches use the same type of flow solver for the gas phase, but they dffer n the way n whch the knetc equaton s treated: Correspondng author. Tel.: ; fax: E-mal addresses: vvkas@astate.edu (V. Vkas), zjw@astate.edu (.J. Wang), albertop@astate.edu (A. Passalacqua), rofox@astate.edu (R.O. Fox) /$ - see front matter Ó 2011 Elsever Inc. All rghts reserved. do: /j.jcp

3 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) () drect solver that dscretzes the velocty phase space of the partcle number densty functon [4,36], () Lagrangan solver that tracks all the partcles ndvdually [6], () hydrodynamc models wth knetc-theory moment closures [16], (v) quadrature method of moments (QMOM) that solves for moments of the partcle number densty functon wth quadrature-based closures [14,17,31,37]. In many applcatons, the drect soluton of the knetc equaton s prohbtvely expensve due to the hgh dmensonalty of the space of ndependent varables, whle Lagrangan solvers are computatonally very expensve, snce the number of partcles to be tracked s very large. On the other hand, hydrodynamc models are developed assumng that the Knudsen number of the partcle phase s very small, whch s equvalent to assumng a Maxwellan (or nearly Maxwellan) equlbrum partcle velocty dstrbuton. Ths, however, s not correct n relatvely dlute gas partcle flows, where the Knudsen number can be hgh, the collson frequency s small and phenomena lke partcle trajectory crossng can occur. In partcular, Desjardns et al. [14] showed that the assumpton that a gas partcle flow can be descrbed accountng for only the mean momentum of the partcle phase leads to ncorrect predctons of all the velocty moments, ncludng the partcle number densty, showng the need of usng a mult-velocty method, n order to correctly capture the physcs of the flow. Smlar observatons were made for moderately collsonal gas partcle flows by Sakz and Smonn [44]. QMOM for gas partcle flow [17 19] s based on the dea of trackng a set of velocty moments of arbtrarly hgh order, provdng closures to the source terms and the moment spatal fluxes n the moment transport equatons by means of a quadrature approxmaton of the number densty functon. The key step of the approach s an nverson algorthm that allows one to unquely determne a set of weghts and abscssas from the set of transported moments. The condton for the nverson algorthm to be appled s that the set of moments s realzable, meanng t actually corresponds to a velocty dstrbuton. Ths condton s not generally satsfed by the tradtonal fnte-volume methods used n computatonal flud dynamcs. Desjardns et al. [14] recently showed that realzablty s guaranteed only wth the 1st-order fnte-volume scheme. The use of any other hgh-order fnte-volume scheme may lead to non-realzable moments, thereby resultng n negatve weghts. Weghts are representatve of partcle densty and hence cannot be negatve. Ths lmtaton n turn leads to the use of a hghly refned mesh for computaton as a 1st-order fnte-volume scheme produces hghly dffused solutons on a coarse mesh. For ths reason, mproved fnte-volume schemes are sought that could provde less-dffused solutons and smultaneously guarantee the realzablty of moments. In the present work, a generalzed dea for developng mproved fnte-volume schemes for quadrature-based moment methods s presented. The realzablty of the new mproved fnte-volume schemes s guaranteed under sutable realzablty crtera. These new schemes gve remarkable mprovement n the solutons for the class of problems where the velocty abscssas are constant over a range of cells. The present work also shows that the standard Runge Kutta tme-ntegraton schemes do not guarantee realzablty. However, the realzablty can be guaranteed f strong stablty-preservng (SSP) Runge Kutta schemes [23] are used. The remander of ths paper s organzed as follows. In Secton 2, QMOM s revewed. Secton 2 also dscusses fnte-volume schemes and ther realzablty propertes. Thereafter, n Secton 3, new realzable hgh-order fnte-volume schemes are presented. In Secton 4, mult-stage tme-ntegraton s dscussed and realzablty propertes of the standard RK2 and RK2SSP schemes are presented. Secton 5 presents some numercal results ncludng accuracy studes. Conclusons from the present study are summarzed n Secton 6. Fnally, n Appendx A we present an extenson of the realzable schemes to velocty-ndependent densty functons. 2. Quadrature method of moments 2.1. Knetc equaton Dlute gas partcle flows can be modeled by a knetc equaton [9,10,46] of the t f þ x f v ðf FÞ ¼C; ð1þ where f(v,x,t) s the velocty-based number densty functon, v s the partcle velocty, F s the force actng on an ndvdual partcle, and C s the collson term representng the rate of change n the number densty functon due to partcle partcle collsons. The collson term can be descrbed usng the Bhatnagar Gross Krook (BGK) collson operator [5]: C ¼ 1 s ðf eq f Þ; ð2þ where s s the characterstc collson tme, and f eq s the Maxwellan equlbrum number densty functon gven by M 0 f eq ðvþ ¼q jv! exp U pj 2 ; ð3þ ffffffffffffffffffffffffffffffffffffff ð2pr eq Þ 3 2r eq

4 5330 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) n whch U p s the mean partcle velocty, r eq s the equlbrum varance and M 0 ¼ R fdv s the partcle number densty. In gas partcle flows, the force term s gven by the sum of the gravtatonal contrbuton (F g ) and the drag term (F d ) exerted from the flud on the partcles: F ¼ F g þ F d : ð4þ For dlute gas partcle flows, the drag force on a partcle can be approxmated by F d ¼ 3m pq g 4q p d p C d ju r ju r ; where U r = U g U p s the relatve velocty between two phases, U g s the gas velocty, U p s the partcle phase local mean velocty, q g and q p are gas and partcle denstes, respectvely, and d p s the partcle dameter. The drag coeffcent C d s gven by the Schller Naumann correlaton [45]: C d ¼ 24 1 þ 0:15Re 0:687 p ; ð6þ Re p n whch Re p = q g d p ju g U p j/l g,l g beng the dynamc vscosty of gas phase Moment transport equatons In the quadrature-based moment method of Fox [17 19], a set of moments of the number densty functon f s transported and ts evoluton n space and tme s tracked. Each element of the moment set s defned through ntegrals of the number densty functon. For the frst few moments the defnng ntegrals are: M 0 ¼ fdv; M 1 ¼ v fdv; M 2 j ¼ v v j fdv; M 3 jk ¼ v v j v k fdv: ð7þ In these equatons, the superscrpt of M represents the order of correspondng moment. Moment transport equatons are obtaned by applyng the defnton of moments to (1). The transport equatons for moments n (7) can be wrtten @x ¼ 0; j ¼ g M 0 þ D 1 ; 3 jk ¼ k M 1 j þ g j M 1 þ C 2 j þ D2 j ; 4 jkl ¼ l M 2 jk þ g jm 2 k þ g km 2 j þ C3 jk þ D3 jk : In (8), g, g j, g k are the components of gravty, D 1 ; D2 j ; D3 jk are due to the drag force and C2 j ; C3 jk are due to collsons. ð8þ 2.3. Quadrature-based closures Usng the BGK model, the collson terms n (8) can be closed. However, the set of transport equatons n (8) s stll unclosed because of the spatal flux and drag terms. Each equaton contans the spatal fluxes of the moments of order mmedately hgher. In quadrature-based moment methods, quadrature formulas are used to provde closures to these terms n the moment transport equatons, by ntroducng a set of weghts and abscssas. The number densty functon f s wrtten n terms of the quadrature weghts (n a ) and abscssas (U a ) usng a Drac delta representaton: f ðvþ ¼ Xb n a dðv U a Þ: The method based on (9) s called b-node quadrature method. The moments can be computed as a functon of quadrature weghts and abscssas by usng the above defnton of f n (7): ð9þ M 0 ¼ Xb n a ; M 1 ¼ Xb n a U a ; M 2 j ¼ Xb n a U a U ja ; The source terms due to drag and gravty are computed as: D 1 ¼ Pb D 2 j ¼ Pb D 3 jk ¼ Pb n a m p F a ; na m p n a m p F a U ja þ F ja U a ; F a U ja U ka þ F ja U ka U a þ F ka U a U ja : M 3 jk ¼ Xb n a U a U ja U ka : ð10þ ð11þ

5 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) The detals of the computaton of the force terms F a, F ja and F ka, can be found n [17]. In order to ensure that the moments reman realzable and that the dscretzed fluxes are hyperbolc, the spatal flux terms are closed accordng to ther knetc descrpton [13,14,38,41]. Each moment nvolved n the spatal dervatve s decomposed nto two contrbutons, as shown n (12) for the zero-order moments: M 1 ¼ 0 v 1 fdv j dv k dv þ þ1 v 0 fdv j dv k dv : In a 1-D case, the left ntegral wll account for partcles gong from left to rght and the rght ntegral wll account for partcles gong from rght to left at the face. Usng (9), (12) can be wrtten as: M 1 ¼ Xb n a mnð0; U a Þþ Xb n a maxð0; U a Þ: For a 1-D case, the left ntegral/summaton n (12)/(13) s evaluated usng the values on left sde of the face and rght ntegral/summaton s evaluated usng the values on rght sde of the face. In order to solve the abovementoned moment transport equatons, boundary condtons are needed. These boundary condtons can be specfed ether n terms of moments or n terms of the weghts and abscssas. The latter approach s more convenent and s followed n the present work. In ths work, three types of boundary condtons are used: Drchlet, perodc and wall-reflectve. At a Drchlet boundary, the weghts and abscssas are specfed. Perodc boundary condtons copy the weghts and abscssas from the outgong perodc boundary cell to the correspondng ncomng perodc boundary cell. The boundary condtons at the walls are set so that a partcle that colldes wth the wall s specularly reflected. Ths condton corresponds to changng the sgn of the velocty component of the partcle along the drecton perpendcular to the wall. The mplementaton of ths boundary condton n the quadrature-based algorthm s done by changng the sgn of the abscssas n the approprate drecton [37]. If = 0 ndcates the poston of the wall, perpendcular to the second drecton of reference frame, and = 1 ndcates the neghborng computatonal cell, the boundary condton can be wrtten as: n a n a =e w U a U a B C ¼ B C ; V a e w V a A W a ¼0 W a ¼1 where e w s the partcle wall resttuton coeffcent. All the boundary condtons are appled usng a ghost-cell approach. ð12þ ð13þ 2.4. Fnte-volume method The moment transport equatons n (8) contan convecton, drag and collson terms. The three terms are treated separately usng an operator-splttng technque. The soluton algorthm nvolvng all the terms s gven later. The collson and the force terms do not create non-realzablty problems. Hence for all the analyss, these terms are dropped. For smplcty, a one-dmensonal case wth two quadrature nodes s dscussed here. A general 3-D case s presented n a later secton. For the 1-D case, the set of moment transport equatons after droppng collson and drag terms can be wrtten ¼ W ¼½M 0 M 1 M 2 M 3 Š T and HðWÞ ¼½M 1 M 2 M 3 M 4 Š T : ð16þ For a 2-node quadrature there are two weghts (n 1,n 2 ) and two abscssas (U 1,U 2 ). Let the set of weghts and abscssas be denoted as N =[n 1 n 2 U 1 U 2 ] T. The frst four moments can be wrtten n terms of these weghts and abscssas as: ð15þ M 0 ¼ n 1 ðu 1 Þ 0 þ n 2 ðu 2 Þ 0 ; M 1 ¼ n 1 ðu 1 Þ 1 þ n 2 ðu 2 Þ 1 ; M 2 ¼ n 1 ðu 1 Þ 2 þ n 2 ðu 2 Þ 2 ; M 3 ¼ n 1 ðu 1 Þ 3 þ n 2 ðu 2 Þ 3 : In the frst two equatons for M 0 and M 1, powers of U 1 and U 2 are redundant. The conserved moments and moment fluxes n (16) can be wrtten n terms of the number densty functon: W ¼ KðvÞf ðvþdv; HðWÞ ¼ vkðvþf ðvþ dv; ð17þ ð18þ where KðvÞ ¼½1 vv 2 v 3 Š T : ð19þ

6 5332 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) The moments n (15) can be advanced n tme usng a fnte-volume scheme. If a sngle-stage explct tme-ntegraton scheme s used, the updated set of moments can be wrtten as: h W nþ1 ¼ W n Dt Dx G Wn þ1=2;l ; Wn þ1=2;r G W n 1=2;l ; Wn 1=2;r ; ð20þ where superscrpts n and n + 1 denote tme levels, G s the numercal flux functon evaluated at cell nterfaces, and l and r denote the left and rght states at the nterfaces respectvely. Henceforth, the varables wth subscrpt wll denote the cell-averaged values and the ones wth ( + 1/2) or ( 1/2) as subscrpt wll denote the reconstructed values at the nterfaces. G s defned as: where GðW l ; W r Þ¼ v þ Kf l dv þ v Kf r dv; v þ ¼ 1 ðv 2 þjvjþ and v ¼ 1 ðv jvjþ: ð22þ 2 Ths corresponds to a splttng between partcles gong from left to rght (frst term) and partcles gong from rght to left (second term). Insertng the expresson for f n (21) yelds: ð21þ GðW l ; W r Þ¼H þ ðw l ÞþH ðw r Þ; ð23þ wth U H þ 1l ðw l Þ¼n 1l maxðu 1l ; 0ÞB A þ n U 2l 2l maxðu 2l ; 0ÞB A ; U 2 1l U 2 2l U 3 1l U H 1r ðw r Þ¼n 1r mnðu 1r ; 0ÞB A þ n U 2r 2r mnðu 2r ; 0ÞB A : U 2 1r U 3 2l U 2 2r ð24þ U 3 1r U 3 2r Before dscussng the 1st-, 2nd- and 3rd-order fnte-volume schemes, t s worth notcng that, n order to calculate the fluxes at the nterface, varables need to be reconstructed at the faces of each cell. However, there s an ambguty n the choce of varables to be chosen for reconstructon. Two choces are possble: () reconstructng the moments (H(W)=[M 1 M 2 M 3 M 4 ] T ) and () reconstructng the weghts and abscssas (N =[n 1 n 2 U 1 U 2 ] T ). For the 1st-order fnte-volume scheme both choces are equvalent. However, for second or any hgh-order fnte-volume schemes, these two choces are n general dfferent. The former approach often leads to non-realzable moments, especally n the problems nvolvng dscontnuous velocty felds. For ths reason, the second approach s adopted n ths work. In the sectons below, any reconstructon essentally refers to reconstructon of the weghts and abscssas. For example, W +1/2,l refers to moments at the left sde of nterface + 1/2 calculated usng the reconstructed values of the weghts and abscssas Frst-order fnte-volume scheme The 1st-order fnte-volume scheme for solvng moment transport equatons uses a pecewse constant approxmaton and s descrbed n [14]. The weghts and abscssas are assumed to be constant over a cell: N n 1=2;r ¼ Nn ; Nn þ1=2;l ¼ Nn : ð25þ Second-order fnte-volume scheme In the 2nd-order fnte-volume scheme, a pecewse lnear reconstructon for the weghts and abscssas s used. The pecewse lnear reconstructon s obtaned usng a mnmod slope lmter [27]. For the th cell, ths can be wrtten as: N n 1=2;r ¼ Nn Dx ; N n þ1=2;l ¼ Nn þ Dx ; ð26þ ¼ mnmod Nn N n 1 ; Nn þ1 Nn : ð27þ Dx Dx The mnmod functon s defned as: mnmodðx; yþ ¼sgnðxÞ 1 þ sgnðxyþ mnðjxj; jyjþ: 2 ð28þ

7 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Thrd-order fnte-volume scheme In the 3rd-order fnte-volume scheme, a pecewse parabolc reconstructon for the weghts and abscssas s used. For the th cell, the reconstructed weghts and abscssas can be wrtten as: N n 1=2;r ¼ Nn 1 3 Nn N n 1 þ 1 6 Nn þ1 Nn ; N n þ1=2;l ¼ Nn þ 1 6 Nn N n 1 þ 1 3 Nn þ1 ð29þ Nn : The 3rd-order MUSCL reconstructon wthout a lmter s the same as (29). However, n the case of a dscontnuous soluton a lmter s essental. A lmted verson of 3rd-order MUSCL can be found n [27] Soluton algorthm The fnte-volume schemes presented n the above secton are used to solve for the spatal transport part of the moment transport equatons. However, the complete moment transport equatons have collson and force terms as well. As mentoned earler, these two terms are treated usng an operator-splttng technque. A detaled soluton algorthm nvolvng all the terms can be found n [14,18,37]. Here a bref overvew of the steps nvolved n the soluton procedure s presented, assumng a sngle-stage explct tme-ntegraton: 1. Intalze weghts and abscssas n the doman. 2. Apply boundary condtons to weghts and abscssas. 3. Compute moments usng weghts and abscssas. 4. Compute tme-step sze Dt. 5. Reconstruct weghts and abscssas at cell faces. 6. Compute spatal flux terms at cell faces. 7. Advance moments by Dt due to spatal flux terms usng a fnte-volume approach. 8. Compute weghts and abscssas from moments usng the moment-nverson algorthm. 9. Advance weghts by Dt due to force terms (drag and gravty). 10. Compute moments usng weghts and abscssas. 11. Advance moments by Dt due to collson terms. 12. Compute weghts and abscssas from moments usng the moment-nverson algorthm. 13. Apply boundary condtons to weghts and abscssas. 14. Repeat steps (4) through (l3) at each tme step Non-realzablty problem At each tme step, the weghts and abscssas need to be recovered from the moments. The moment-nverson algorthm computes the set of weghts and abscssas from the correspondng set of moments by solvng a set of nonlnear equatons. In the moment-nverson algorthm M 0, M 1, M 2, M 3 are known and n 1, n 2, U 1, U 2 are computed, by solvng (17) n reverse drecton usng the product-dfference (PD) algorthm [32,53,40]. However, the set of moments cannot be consttuted by arbtrary values of each moment, but they have to conform to the defnton of the non-negatve number densty functon. The applcaton of the PD algorthm to a set of realzable moments leads to a set of weghts and abscssas that satsfy the propertes of Gaussan quadrature. In partcular the weghts are always postve. Durng the development of the numercal schemes, whch s the object of ths work, a set of weghts and abscssas wll be sad to represent realzable moments f weghts are postve and abscssas le n the nteror of the support of f. Because of the non-lnearty of the nverson problem, t s extremely dffcult to determne n advance whether a gven set of moments s realzable. However, Desjardns et al. [14] descrbed how any fnte-volume scheme that could guarantee non-negatvty of the effectve number densty functon wll always keep the moments n realzable space. The updated set of moments can be wrtten as: W nþ1 ¼ Khdv; ð30þ where h ¼ f n k v þ f n þ1=2;l þ v f n þ1=2;r v þ f n 1=2;l v f n 1=2;r ¼ f n kv þ f n þ1=2;l kv f n þ1=2;r þ kv þ f n 1=2;l þ kv f n 1=2;r ð31þ n whch k = Dt/Dx. In(31), h s the effectve number densty functon and has dfferent forms for dfferent fnte-volume schemes as the nterface values are reconstructed n dfferent ways. Desjardns et al. [14] stated that any fnte-volume scheme that guarantees the non-negatvty of h for all v, s realzable. Usng ths proposton, they derved the realzablty crteron for the 1st-order fnte-volume scheme. In the sectons below, the realzablty of the 1-D verson of 1st-, 2nd- and hgh-order fnte-volume schemes s dscussed.

8 5334 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Frst-order fnte-volume scheme For the 1st-order fnte-volume scheme (25) mples f n 1=2;r ¼ f n ; f n þ1=2;l ¼ f n : Usng ths n (31), the effectve number densty functon for the 1st-order fnte-volume scheme can be wrtten as: h ¼ð1 kjvjþf n þ kv þ f n 1 kv f n þ1 : As the moments at tme level n are assumed to be realzable, the non-negatvty of the number densty functon at tme level n s guaranteed,.e., f n P 0; f n 1 P 0 and f n þ1 P 0 for all v. Also, v+ P 0 and v 6 0. Hence, the non-negatvty of h wll be guaranteed f (1 kjvj) P 0. When wrtten n terms of the abscssas, ths condton becomes: 1 k 6 max ; U n : ð34þ U n 1 2 Ths s the realzablty crteron for the 1st-order fnte-volume scheme [14] Second- and hgh-order fnte-volume schemes For the 2nd-order and, n general, any hgh-order fnte-volume scheme, the reconstructed values at the cell nterfaces are dfferent from the cell-averaged values. The equalty of reconstructed values and cell-averaged values s a specal property that holds only for the 1st-order fnte-volume scheme. For 2nd and hgh-order fnte-volume schemes, the effectve number densty functon h can be obtaned from (31) by puttng n the reconstructed values. An nterestng thng to notce n (31) s that on the rght-hand sde, out of the fve terms, only three are non-negatve. The second and ffth terms are always nonpostve. As was stated n [14], realzablty can only be guaranteed f the effectve number densty functon s non-negatve for all veloctes. Clearly ths does not hold, n general, for 2nd and hgh-order fnte-volume schemes. Hence, realzablty cannot be guaranteed for any fnte-volume scheme other than 1st-order. ð32þ ð33þ 3. Improved realzable fnte-volume schemes 3.1. Basc dea As was stated earler, the two non-postve terms on the rght-hand sde of (31) mght lead to non-realzablty problems. The non-negatve terms present a physcal vew of the number densty functon. An mportant thng to notce s that, despte the presence of the two non-postve terms, the 1st-order fnte-volume scheme s stll realzable under the restrcton of a realzablty crteron. Ths s possble because n the 1st-order fnte-volume scheme, the nterface values are the same as the cell-averaged values f n ¼ f n þ1=2;l ¼ f n 1=2;r, thereby allowng a groupng of the frst term wth the two non-postve terms on rght-hand sde of (31). Ths dea of groupng the terms s essental to the realzablty of the 1st-order fnte-volume scheme and t also forms the bass of the development of new mproved realzable fnte-volume schemes. For hgh-order fnte-volume schemes, n general: N n N n þ1=2;l Nn 1=2;r ; ð35þ.e. n n ;a nn þ1=2;a;l nn 1=2;a;r and U n ;a Un þ1=2;a;l Un 1=2;a;r : ð36þ Consder a specal reconstructon where n n ;a nn þ1=2;a;l nn 1=2;a;r and U n ;a ¼ Un þ1=2;a;l ¼ Un 1=2;a;r : ð37þ For ths specal reconstructon, realzablty can always be guaranteed wth a sutable constrant on the tme-step sze. Ths s the subject of the followng theorem. Theorem 1. Let b; p 2 N and a 2 {1,2,...,b}. Also let the cell-averaged and reconstructed values of the weghts satsfy n n ;a > 0 and n n þ1=2;a;l ; nn 1=2;a;r P 0 8a. If a fnte-volume scheme usng a sngle-stage Euler explct tme-ntegraton scheme s devsed that uses a pth-order reconstructon for weghts and 1st-order reconstructon for abscssas, the non-negatvty of the effectve number densty functon (31) n the th cell can always be guaranteed under an explct constrant on tme-step sze ðdt 2 R þ Þ. Proof. Usng (31), the effectve number densty functon, regardless of the fnte-volume scheme used, can be wrtten as: h ¼ f n kv þ f n þ1=2;l þ kv f n 1=2;r þ nþ : In the above expresson, the frst non-negatve term and the two non-postve terms have been represented explctly. The other two terms are always non-negatve and have been grouped under n +. For a b-node quadrature, usng (9), the expresson for h becomes: ð38þ

9 h ¼ Xb h n n ;a d v Un ;a kv þ n n þ1=2;a;l d v Un þ1=2;a;l þ kv n n 1=2;a;r d v Un 1=2;a;r þ n þ : If a 1st-order reconstructon s used for the abscssas, then the nterface values of the abscssas wll be the same as the cellaveraged values: U n ;a ¼ Un þ1=2;a;l ¼ Un 1=2;a;r : V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) ð39þ ð40þ Puttng ths n (39), the effectve number densty functon becomes: h ¼ Xb n o n n ;a kvþ n n þ1=2;a;l þ kv n n 1=2;a;r d v U n ;a þ n þ : ð41þ For Dt 2 R þ satsfyng the condton: 0 n n ;a k ¼ mn A; ð42þ n n max þ1=2;a;l Un ;a ; 0 n n mn 1=2;a;r Un ;a ; 0 1 h s non-negatve for all v. Ths concludes the proof. h Clearly, Theorem 1 guarantees the realzablty of the specal reconstructon n (37), for all cases except for the one where n n ;a ¼ 0. However ths case turns out to be trval f a mnmod lmter s used to lmt the reconstructed values. A mnmod lmter guarantees that whenever n n ;a ¼ 0, then nn þ1=2;a;l ¼ nn 1=2;a;r = 0, thereby automatcally droppng the two non-postve terms n (39). For p = 1,(42) reduces to the same realzablty crteron as n (34): 0 1 B 1 k ¼ mn a2f1;2;...;bg A: ð43þ U n ;a Ths new reconstructon uses a hgh-order reconstructon for the weghts, but a 1st-order reconstructon for the abscssas. To remove the ambguty, t s worth clarfyng that all the fnte-volume schemes dscussed earler, n whch the same order of reconstructon was used for the weghts and abscssas wll be termed standard fnte-volume schemes. For example, a standard 2nd-order fnte-volume scheme s the one dscussed n Secton 2.4.2, where a 2nd-order reconstructon s used for both the weghts and abscssas. More generally, a standard pth-order fnte-volume scheme uses a pth-order reconstructon for both the weghts and abscssas. It s worth reteratng that the realzablty of the standard pth-order fnte-volume scheme s not guaranteed. Correspondng to the standard pth-order fnte-volume scheme another scheme can be developed based on the specal reconstructon dscussed above. Ths new scheme wll use pth-order reconstructon for the weghts and 1st-order reconstructon for the abscssas. Realzablty of ths new scheme s guaranteed by the constrant, also known as realzablty crteron, n (42). Because a 1st-order reconstructon s used for the abscssas, the new scheme s less accurate than the standard pth-order fnte-volume scheme and henceforth wll be termed a quas-pth-order fnte-volume scheme. The standard 1st-order fnte-volume scheme and the quas-1st-order fnte-volume scheme are the same and wll be smply referred to as the 1st-order fnte-volume scheme. Two mportant facts about the new schemes are: () they are better than 1st-order fnte-volume schemes as far as accuracy s concerned and () realzablty s guaranteed under the realzablty crteron that has an explct form. Ths marks a sgnfcant mprovement n soluton methods for quadrature-based moment methods. Over the years, many hgh-order fnte-volume schemes have been developed [1,2,12,28,49 52] for convecton-domnated problems n the feld of flud dynamcs. However, quadrature-based moment methods have not benefted from these hgh-order schemes because of the non-realzablty lmtaton. However, wth the new approach, all the already exstng knowledge about hgh-order fnte-volume schemes can now be utlzed for solutons usng quadrature-based moment methods. In general, the new quas-pth-order realzable fnte-volume scheme wll be less accurate compared to the standard pthorder fnte-volume scheme but for the problems where the veloctes are constant over a range of cells, the dfference n accuracy wll be neglgble. Ths fact s further demonstrated n Secton 5. Next the realzablty crteron for dfferent dmensons s presented, and we explan the way n whch t s appled. In Appendx A we show how quas-pth-order fnte-volume schemes can also be wrtten for the advecton of velocty-ndependent densty functons Realzablty crteron for 1-D cases The relaton gven n (42) s the realzablty crteron for 1-D problems. It can also be wrtten as: n o n n ;a k maxðu a; 0Þn n þ1=2;a;l þ k mnðu a; 0Þn n 1=2;a;r P 0 8a 2f1; 2;...; bg: ð44þ Ths smple realzablty crteron can be used for the calculaton of k and hence Dt for 1-D cases wth b-node quadrature.

10 5336 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Realzablty crteron for 2-D/3-D cases h In (44), maxðu a ; 0Þn n mnðu þ1=2;a;l a; 0Þn n 1=2;a;r s the total outgong flux from the th cell for the ath weght. Hence, (44) can also be wrtten as: n n n ;a k X o Outgong Flux n ;a P 0 8a 2f1; 2;...; bg; ð45þ where the summaton s over the faces of the th cell. Ths form of the realzablty crteron can be used for 2-D and 3-D cases. Although (45) was obtaned usng an analogy from (44), t can be derved drectly from the expresson for fnte-volume scheme n 2-D or 3-D. Consder a 3-D case. Let X and ox denote the th cell and ts boundary respectvely. Also let e 2 ox be a face of the th cell, A e be ts area and ^n e ¼½n e;x n e;y n e;z Š be the outward unt normal at ths face. The fnte-volume expresson for the snglestage Euler explct tme-ntegraton, analogous to (20) can be wrtten as: X n W nþ1 ¼ W n Dt jx j e2@x G W n e;l ; Wn e;r ; ^n e A e o ; ð46þ where jx j denotes the volume of the th cell and W n e;l and W n e;r represent the reconstructed value of W on the left and rght sdes of face e. The outward normal vector ^n e defned above, ponts from the left sde to the rght sde of face e. The form of W analogous to the one n (18) s: W ¼ Kðu;v; wþf ðu;v; wþdudv dw: ð47þ The numercal flux functon can be wrtten as: G W n e;l ; Wn e;r ; ^n e ¼ v þ n Kf e;l dudv dw þ v n Kf e;r dudv dw; ð48þ where v þ n ¼ maxðn e;xu þ n e;y v þ n e;z v; 0Þ; v n ¼ mnðn e;xu þ n e;y v þ n e;z v; 0Þ: Substtutng (47) and (48) n (46), the effectve number densty can be wrtten as: h ¼ f n k X v þ n f e;la e þ v n f e;ra e : ð50þ e2@x In (50), k = Dt/jX j. For b-node quadrature, f has the same form as n (9). Usng (9) and the specal reconstructon U n e;a;l ¼ Un e;a;r ¼ Un ;a ; h can be further wrtten as: ( h ¼ Xb n n ;a k X ) ( v þ n nn e;a;l A e þ v n nn e;a;r A e d v U n ;a ¼ Xb n n ;a k X ) v þ n nn e;a;l A e d v U n ;a þ n þ ; ð51þ e2@x where agan all the non-negatve terms except for the frst one have been grouped under n +. Non-negatvty of h can be guaranteed f: ( n n :a k X ) v þ n nn e;a;l A e P 0 8a 2f1; 2;...; bg: ð52þ e2@i e2@x ð49þ Ths s exactly the same as (45). It s worth reteratng that the summaton n (45) and (52) s for the outgong fluxes only. Hence, for calculatng these fluxes only the reconstructed weghts on the nteror sdes (sde towards the th cell) of faces should be used, the ones on the opposte sde should be set to zero,.e., the flux comng n from neghborng cells should not be accounted for. Consder a smple 2-D Cartesan case shown n Fg. 1. For the sake of smplcty, subscrpt a and superscrpt n wll be dropped and only 1-node quadrature wll be demonstrated. The cell n the center, X 0, has four neghbors X 1, X 2, X 3, X 4 and the reconstructed values of the weghts on nner sdes of the correspondng faces are n 01, n 02, n 03, n 04, respectvely. The cell-averaged weght for cell 0 s n 0 and the correspondng X-drecton and Y-drecton abscssas are U 0 and V 0, respectvely. The realzablty condton for X 0 can be wrtten as: fn 0 k½n 01 A 1 maxðu 0 ; 0Þþn 02 A 1 maxðv 0 ; 0Þ n 03 A 1 mnðu 0 ; 0Þ n 04 A 4 mnðv 0 ; 0ÞŠg P 0; ð53þ where A 1, A 2, A 3, A 4 are the areas of the four faces. In (53), k = Dt/jX 0 j. All the analyss to ths pont has been done for a number densty functon that depends on the velocty. However, many populaton balance models nvolve densty functons that do not depend on velocty. For such cases, each moment can be advected ndependently usng a 1st-order fnte-volume scheme wthout volatng realzablty of the moment set. On the other hand, the use of any hgh-order fnte-volume scheme may lead to unphyscal or non-realzable moment sets

11 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Fg. 1. Cells wth faces algned along Cartesan axes. [33,34,39,56]. As demonstrated n Appendx A, ths problem can be avoded f QMOM s used wth the quas-pth-order fntevolume schemes descrbed above. Before movng onto the next secton, here s a bref dscusson on the Courant Fredrchs Lewy (CFL) crteron vs. the realzablty crteron. The realzablty crteron s analogous to a CFL crteron. However, ther purposes are dfferent. A CFL crteron guarantees the stablty of the soluton whle the realzablty crteron guarantees the physcal nature of the soluton. An explct form of the CFL crteron exsts only for 1-D cases, whch s equvalent to the realzablty crteron. For 2-D and 3-D problems, there s no explct form for the CFL crteron. However, there exsts an explct form for the realzablty crteron even for 2-D and 3-D cases as shown above. It also turns out from numercal experments that the realzablty crteron s a more strct constrant on Dt as compared to the CFL crteron. Also the realzablty crteron correspondng to a pth-order (p > 1) fnte-volume scheme s n general strcter than the one for the 1st-order fnte-volume scheme. 4. Mult-stage tme-ntegraton For smplcty, all the prevous sectons employed sngle-stage Euler explct tme-ntegraton. However, sngle-stage Euler explct tme-ntegraton s only 1st-order accurate n tme. To mprove tme-accuracy, mult-stage explct tme-ntegraton schemes are used n practce. Nevertheless, not all mult-stage tme-ntegraton schemes guarantee realzablty. Here, two dfferent tme-ntegraton schemes are presented: RK2 and RK2SSP [23]. The former s the standard 2nd-order two-stage Runge Kutta scheme, whle the latter s the 2nd-order two-stage strong-stablty-preservng (SSP) Runge Kutta scheme RK2 scheme The standard 2nd-order two-stage Runge Kutta scheme can be wrtten as: W ¼ W n Dt h 2Dx G Wn þ1=2;l ; Wn þ1=2;r G W n 1=2;l ; Wn 1=2;r ; ð54þ W nþ1 ¼ W n Dt h Dx G W þ1=2;l ; W þ1=2;r G W 1=2;l ; W 1=2;r : ð55þ Frst stage The 1st stage s the same as the sngle-stage Euler explct tme-ntegraton scheme, the only dfference beng the factor of (1/2) n Dt Dt.Ifk ¼, realzablty can be guaranteed for 1st-order and quas-pth-order fnte-volume schemes subject to condton 2Dx 2Dx (42) Second stage The set of moments for the th cell after the 2nd stage can be wrtten as: ¼ Kh nþ1 dv; where W nþ1 h nþ1 ¼ f n ¼ f n k v þ f þ1=2;l þ v f þ1=2;r vþ f 1=2;l v f 1=2;r ¼ f n kv þ f þ1=2;l kv f þ1=2;r þ kv þ f 1=2;l þ kv f 1=2;r kv þ f þ1=2;l þ kv f 1=2;r þ nþ ; ð56þ ð57þ

12 5338 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) n whch k = Dt/Dx. For the 1st-order and quas-pth-order fnte-volume schemes: U þ1=2;a;l ¼ U 1=2;a;r ; ð58þ but n general U n ;a U þ1=2;a;l and U n ;a U 1=2;a;r : ð59þ Hence, groupng of terms s not possble and realzablty cannot be guaranteed for the 2nd stage. The RK2 scheme does not guarantee realzablty of the moment set RK2SSP scheme The 2nd-order two-stage strong stablty-preservng Runge Kutta scheme can be wrtten as: W ¼ W n Dt h Dx G Wn þ1=2;l ; Wn þ1=2;r W nþ1 ¼ 1 2 Wn þ W Dt n Dx G W þ1=2;l ; W þ1=2;r G W n 1=2;l ; Wn 1=2;r ; ð60þ o : ð61þ G W 1=2;l ; W 1=2;r Frst stage The 1st stage s exactly the same as the sngle-stage Euler explct tme-ntegraton scheme and realzablty can be guaranteed for 1st-order and quas-pth-order fnte-volume schemes subject to condton (42) Second stage The set of moments for the th cell after the 2nd stage can be wrtten as: where W nþ1 ¼ Kh nþ1 dv; ð62þ Table 1 L 1 error and order of accuracy of schemes usng 1-node quadrature. Grd sze L 1 error Order 1st-order scheme Standard 2nd-order scheme Quas-2nd-order scheme Quas-3rd-order scheme (wthout lmter) Quas-3rd-order scheme

13 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) h nþ1 ¼ 1 h 2 f n ¼ 1 h 2 f n ¼ 1 h 2 f þ f þ f k v þ f þ1=2;l þ v f þ1=2;r v þ f 1=2;l v f 1=2;r kv þ f þ1=2;l kv f þ1=2;r þ kvþ f 1=2;l þ kv f 1=2;r kv þ f þ1=2;l þ kv f 1=2;r þ w þ ; ¼ 1 h 2 f n þ f kv þ f þ1=2;l þ kv f 1=2;r þ n þ ð63þ n whch k = Dt/Dx and w þ ¼ n þ þ 1 2 f n. For the 1st-order and quas-pth-order fnte-volume schemes, groupng of the frst three terms s possble because U ;a ¼ U þ1=2;a;l ¼ U 1=2;a;r : ð64þ After groupng: h nþ1 ¼ Xb n o n ;a kvþ n þ1=2;a;l þ kv n 1=2;a;r d v U ;a þ w þ : ð65þ Table 2 L 1 error and order of accuracy of schemes usng 2-node quadrature. Grd sze L 1 error Order 1st-order scheme Standard 2nd-order scheme Quas-2nd-order scheme Quas-3rd-order scheme Fg. 2. Grd convergence study for dfferent schemes.

14 5340 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Ths s exactly the same form as n (42) wth the superscrpt n replaced by. Hence, the realzablty condton can be guaranteed usng (42), by replacng superscrpt n wth. The RK2SSP scheme, combned wth quas-pth-order fnte-volume schemes, guarantees realzablty of the moment set Alternate form Another way to wrte RK2SPP s: W ð0þ ¼ W n ; W ð1þ W ð2þ ¼ W ð0þ ¼ W ð1þ h W nþ1 ¼ 1 2 Wð0Þ h Dt G Dx Wð0Þ ; þ1=2;l Wð0Þ þ1=2;r Dt Dx h G Wð1Þ ; þ1=2;l Wð1Þ þ1=2;r þ W ð2þ : G W ð0þ ; 1=2;l Wð0Þ 1=2;r G W ð1þ ; 1=2;l Wð1Þ 1=2;r ; ; ð66þ Ths form s more amenable to usng an operator-splttng technque for the collson and drag terms Calculaton of tme-step sze The global tme-step sze (Dt) should satsfy both the CFL and realzablty crtera to guarantee stablty and physcal nature preservaton. Usually, the largest value of CFL O(1) that gves a stable soluton s used as a CFL crteron for all 1-D/2-D/ 3-D cases. The defnton of the CFL vares, but a general form s: CFL ¼ Dt cell velocty magntude cell length scale : ð67þ Fg. 3. Comparson of schemes for 1-D case wth only convecton terms.

15 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Let Dt CFL, and Dt realzable, be the tme-step szes n the th cell satsfyng the CFL and realzablty crtera, respectvely. An obvous way to calculate global tme-step sze s: Dt ¼ mn Dt CFL; ; Dt realzable; : ð68þ Fg. 4. Flud velocty for 1-D case. Fg. 5. Comparson of schemes usng mean densty for 1-D case wth convecton and drag terms.

16 5342 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) However, n the present paper a slghtly dfferent approach s used for the calculaton of Dt. As stated earler, n general Dt realzable, < Dt CFL,. Ths mples that most of the tme Dt = mn (Dt realzable, ). To have a better tme accuracy, a mult-stage tme-ntegraton s used. For a mult-stage tme-ntegraton, Dt calculated for the 1st-stage s used n all the later stages. But mn (Dt realzable, ) may be dfferent for dfferent stages of tme ntegraton and n that case Dt calculated for the 1st-stage wll not satsfy the realzablty crteron for a later stage. In order to get rd of ths problem, the followng approach s used. Suppose, the problem under consderaton uses a quas-pth-order fnte-volume scheme. A value of the CFL O(1) s pre-specfed and Dt s calculated as Dt = mn (Dt CFL, ). Durng each stage of tme ntegraton, ths Dt s used as the global tme-step sze, and the realzablty condton correspondng to quas-pth-order fnte-volume scheme s checked n each cell. For the cells n whch the check succeeds, a quas-pth-order reconstructon s used for the weghts. And for the cells n whch the check fals, a 1st-order reconstructon s used for the weghts. Thereafter, n the faled cells, the realzablty crteron correspondng to 1st-order fnte-volume scheme s checked. Ths check succeeds on almost all occasons f the CFL s not very large, thereby satsfyng the realzablty crteron n each cell. However, f the last check fals, the whole process s re-ntated usng a smaller CFL. 5. Numercal results In ths secton several results are presented for 1-D and 2-D cases. For all the cases a 2nd-order RK2SSP scheme s used for tme-ntegraton and Dt s calculated usng CFL = 0.5 unless otherwse stated. Perodc boundary condtons are used for all 1- D cases whle for the 2-D cases a combnaton of wall, Drchlet and perodc boundary condtons s used. The doman for the 1-D cases s defned by x 2 [ 1,1]. The smulatons consder ether the spatal flux terms alone or n combnaton wth flud drag terms. Collsons are not ncluded. The drag force s calculated usng (5) and the abscssas are updated usng smple knematc relatons. More detals can be found n [17 19]. The drag terms are dependent on the Stokes number defned by Fg. 6. Comparson of schemes usng mean velocty for 1-D case wth convecton and drag terms.

17 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) St ¼ 1 q p d 2 p : ð69þ 18 l g For the two cases presented here that nclude the drag terms, St = 1 s used. For the 1-D cases, the numercal results usng the quas-2nd-order and quas-3rd-order schemes are presented. For the quas-2nd-order scheme, a lnear reconstructon wth the mnmod lmter as descrbed n Secton s used whle for the quas-3rd-order scheme a MUSCL technque [27,49] s used. For the 2-D cases, results usng the quas-2nd-order scheme are presented. A 2nd-order least-squares reconstructon [1,50] s used for the weghts usng neghborng cell-averaged values. Moreover, a lmter [1,20,50] s appled to the least-squares reconstructon to avod spurous oscllatons. The results for the standard 2nd-order scheme are presented only for the smplest 1-D cases wth constant abscssas because of the nonrealzablty problem. In all the cases, the mean densty s computed usng P n a and the mean velocty s computed wth P ðna u a Þ= P n a Spatal accuracy study It was stated earler that although n general the new quas schemes have lower spatal accuracy compared to standard schemes, for problems where the veloctes are constant over a range of cells, both schemes have almost the same order of spatal accuracy. Here, the order of spatal accuracy of the standard and the new quas schemes s dscussed for cases where Fg. 7. Mean partcle densty for crossng partcle jets for dfferent schemes at two tmes.

18 5344 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) the abscssas are constant over a range of cells. Results n ths secton are based on smple 1-D cases for whch analytcal solutons exst. L 1 errors are calculated by comparng the numercal soluton wth the analytcal soluton for mean densty. L 1 errors and order of convergence are presented for four schemes: 1st-order, standard 2nd-order, quas-2nd-order, quas- 3rd-order. Tables 1 and 2 show the results for 1-node and 2-node quadrature, respectvely. For both cases Dt = s used. For 1-node quadrature, the ntal weght (n) and abscssa (U) are gven as: n ¼ 1:0 þ snðpxþ; U ¼ 1: ð70þ For 2-node quadrature, ntal weghts (n 1,n 2 ) and abscssas (U 1,U 2 ) are gven as: n 1 ¼jsnðpxÞj; n 2 ¼ 0; U 1 ¼ 1; U 2 ¼ 0 for x 2½ 1; 0Þ; n 1 ¼ 0; n 2 ¼jsnðpxÞj; U 1 ¼ 0; U 2 ¼ 1 for x 2½0; 1Š: ð71þ For 1-node quadrature, errors are calculated at t = 4, whle for 2-node quadrature errors are calculated at t = 1. It s observed that the formal order of accuracy can be obtaned for 1-node quadrature, but as the number of quadrature nodes s ncreased, the order of accuracy for all schemes decreases. Although the reason for ths loss of order of accuracy has not been studed extensvely, t can be attrbuted to the combned effects of an ncrease n the number of equatons and use of the momentnverson algorthm for ll-condtoned ponts. At many ponts the values of the weghts are very small and the non-lnear equatons solved usng the moment-nverson algorthm are often ll-condtoned for these ponts n the case of multple quadrature nodes. It can also be observed that the quas-2nd-order scheme always has approxmately the same order of convergence as the standard 2nd-order scheme, and the quas-3rd-order scheme s better compared to both Grd convergence study Grd convergence studes for the quas-2nd-order and quas-3rd-order schemes n 1-D are presented n Fg. 2. For both the schemes, the mean densty obtaned usng dfferent grd resolutons s compared wth the analytcal soluton. Four dfferent unform grds have been consdered wth the number of cells equal to 25, 50, 100, 200. The comparsons have been done for a 2-node quadrature case wth the same ntalzatons as n (71). Fg. 2(a) and (b) shows grd convergence for the quas-2ndorder and quas-3rd-order schemes, respectvely. As the number of grd cells s ncreased, the solutons usng both schemes converge towards the analytcal soluton Comparson of schemes for 1-D case wth only convecton terms For ths case, 2-node quadrature s used wth the weghts beng snusodal functons and the abscssas beng square functons. Ffty grd ponts are used and the results are shown n Fg. 3. The ntal (t = 0) condtons are same as n (71) and are shown n Fg. 3(a). Fg. 3(b) and (c) shows the fnal condtons for the mean densty and mean velocty, respectvely (t = 1). The weght dstrbuton s symmetrc about x = 0, wth the left wave movng towards the rght (negatve abscssa) and the rght wave movng towards the left (postve abscssa). The fnal tme has been chosen such that the waves coalesce at x = 0 and then separate agan. Four dfferent schemes have been compared: 1st-order, standard 2nd-order, quas-2nd-order, Fg. 8. Flud velocty for 2-D Taylor Green flow.

19 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) quas-3rd-order. The standard 2nd-order and quas-2nd-order results are on top of each other. The quas-3rd-order scheme shows an mprovement over the quas-2nd-order scheme Comparson of schemes for 1-D case wth both convecton and drag terms For ths case, 4-node quadrature s used. Intal condtons (t = 0) for x 2 [ 0.8, 0.7] are gven as: n1 ¼ n2 ¼ n3 ¼ n4 ¼ snð10pðx þ 0:8ÞÞ; U 1 ¼ U 2 ¼ U 3 ¼ U 4 ¼ 0: ð72þ Everywhere else both the weghts and abscssas are zero. The partcle flow s drven by flud drag. The flud velocty s gven by 2 U g ¼ e x ; ð73þ and s shown n Fg. 4. The QMOM results usng three schemes 1st-order, quas-2nd-order, quas-3rd-order are compared wth the Lagrangan results. The results for the mean densty are presented at four dfferent tmes n Fg. 5. The quas-3rdorder and quas-2nd-order results are closer to the Lagrangan results as compared to the 1st-order ones. Fg. 6 shows Fg. 9. Grd resoluton study of mean partcle densty n 2-D Taylor Green flow at t = 4 wth 1st-order scheme.

20 5346 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) comparsons for the mean velocty at the same tmes as n Fg. 5. It s evdent that the mean velocty s not constant but vares over a range of cells at each tme. Clearly n such scenaros as well, the new realzable schemes gve better solutons compared to the 1st-order scheme Comparson of schemes for 2-D case wth only convecton terms Here a dlute mpngng-jet problem n 2-D s presented. The doman conssts of a square (7 7) box wth two openngs on the bottom wall through whch partcle jets enter. As tme progresses, the jets cross each other, strke the wall and then rebound. These smulatons are done usng 4-node quadrature (n1, U1, V1), (n2, U2, V2), (n3, U3, V3), (n4, U4, V4). Intal (t = 0) condtons are gven as: n1 ¼ n2 ¼ n3 ¼ n4 ¼ 0:0001; U 1 ¼ 0:001; U 2 ¼ 0:001; V 1 ¼ 0:001; V 2 ¼ 0:001; U 3 ¼ 0:001; U 4 ¼ 0:001; V 3 ¼ 0:001; V 4 ¼ 0:001: Fg. 10. Grd resoluton study of mean partcle densty n 2-D Taylor Green flow at t = 4 wth quas-2nd-order scheme. ð74þ

21 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Fg. 11. Mean partcle densty n 2-D Taylor Green flow at t = 4 on trangular mesh wth dfferent schemes and cell numbers. 5347

22 5348 V. Vkas et al. / Journal of Computatonal Physcs 230 (2011) Fg. 12. Partcle number densty n 2-D Taylor Green flow obtaned by Lostec et al. [30] usng a Lagrangan smulaton. Densty s proportonal to darkness. The values of the weghts and abscssas at the left nlet jet (Drchlet) are: n 1 ¼ n 2 ¼ n 3 ¼ n 4 ¼ 0:01; U 1 ¼ 1:001; U 2 ¼ 0:999; U 3 ¼ 1:001; U 4 ¼ 0:999; V 1 ¼ 1:001; V 2 ¼ 1:001; V 3 ¼ 0:999; V 4 ¼ 0:999: ð75þ And the values at the rght nlet jet (Drchlet) are: n 1 ¼ n 2 ¼ n 3 ¼ n 4 ¼ 0:01; U 1 ¼ 1:001; U 2 ¼ 0:999; U 3 ¼ 1:001; U 4 ¼ 0:999; V 1 ¼ 1:001; V 2 ¼ 1:001; V 3 ¼ 0:999; V 4 ¼ 0:999: ð76þ For elastc collsons wth the walls, e w = 1. Results are presented for the 1st-order and quas-2nd-order schemes n Fg. 7. The computatonal grd contans 2562 trangular elements. Fg. 7(a) and (c) show the mean densty usng the 1st-order and quas- 2nd scheme, respectvely, at t = 4 after the jets cross. Fg. 7(b) and (d) shows the mean densty at t = 7 after the jets bounce off the walls. The soluton obtaned usng the 1st-order scheme s more dffused. The mprovement n the soluton usng the quas-2nd-order scheme s clearly evdent Comparson of schemes for 2-D case wth both convecton and drag terms In ths case, the evoluton of partcles n a Taylor Green flow s presented. The doman conssts of a square (1 1) box. All the boundares are perodc. The flud velocty n the Taylor Green flow s gven by U gx ¼ snð2pxþ cosð2pyþ; U gy ¼ snð2pyþ cosð2pxþ; ð77þ and s shown n Fg. 8. Fgs. 9 and 10 present results for dfferent schemes on a structured mesh, and Fg. 11 presents results for unstructured meshes. Results are presented for the 1st-order and quas-2nd-order schemes at t = 4. For the structured mesh, four dfferent grd resolutons are used: , , , Lostec et al. [30] presented results for the same problem usng both a Lagrangan smulaton and 1st-order QMOM. Here, the Lagrangan result obtaned n [30] s presented n Fg. 12. Note that the partcle number densty shown n Fg. 12 s proportonal to the mean partcle densty n our results. The results presented here clearly show that the quas-2nd-order scheme fares much better compared to the 1st-order scheme n resolvng the varous features obtaned n the Lagrangan smulaton n [30]. The unstructured mesh conssts of trangular cells. Three dfferent grd resolutons are used wth 5452, 21,830 and 89,558 trangular cells. The unstructured mesh results also confrm the mprovement n the solutons when the quas-2nd-order scheme s used. 6. Conclusons Htherto, the use of fnte-volume schemes for quadrature-based moment methods was lmted to the 1st-order scheme n order to guarantee realzablty. Over the years, an extensve research effort has been spent on developng hgh-order fnte-volume schemes n the feld of computatonal flud dynamcs. However, the ssue of non-realzablty has often acted

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Simulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method

Simulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method Smulaton of a Shp wth Partally Flled Tanks Rollng n Waves by Applyng Movng Partcle Sem-Implct Method Jen-Shang Kouh Department of Engneerng Scence and Ocean Engneerng, Natonal Tawan Unversty, Tape, Tawan,

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Harmonic Coordinates for Character Articulation PIXAR

Harmonic Coordinates for Character Articulation PIXAR Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Journal of Computational Physics

Journal of Computational Physics Journal of Computatonal Physcs 230 (2011) 2540 2561 Contents lsts avalable at ScenceDrect Journal of Computatonal Physcs journal homepage: www.elsever.com/locate/jcp A grd based partcle method for solvng

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Lecture 5: Probability Distributions. Random Variables

Lecture 5: Probability Distributions. Random Variables Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Order of Accuracy Study of Unstructured Grid Finite Volume Upwind Schemes

Order of Accuracy Study of Unstructured Grid Finite Volume Upwind Schemes João Luz F. Azevedo et al. João Luz F. Azevedo joaoluz.azevedo@gmal.com Comando-Geral de Tecnologa Aeroespacal Insttuto de Aeronáutca e Espaço IAE 12228-903 São José dos Campos, SP, Brazl Luís F. Fguera

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

More information

Math Homotopy Theory Additional notes

Math Homotopy Theory Additional notes Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Computer models of motion: Iterative calculations

Computer models of motion: Iterative calculations Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6) Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst

More information

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

More information

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 2 DECOMPOSITION OF GRAPHS CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

CAD and CAE Analysis for Siphon Jet Toilet

CAD and CAE Analysis for Siphon Jet Toilet Avalable onlne at www.scencedrect.com Physcs Proceda 19 (2011) 472 476 Internatonal Conference on Optcs n Precson Engneerng and Nanotechnology 2011 CAD and CAE Analyss for Sphon Jet Tolet Yuhua Wang a

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information