{"@context":{"@language":"en","Affiliation":"http:\/\/vivoweb.org\/ontology\/core#departmentOrSchool","AggregatedSourceRepository":"http:\/\/www.europeana.eu\/schemas\/edm\/dataProvider","Campus":"https:\/\/open.library.ubc.ca\/terms#degreeCampus","Creator":"http:\/\/purl.org\/dc\/terms\/creator","DateAvailable":"http:\/\/purl.org\/dc\/terms\/issued","DateIssued":"http:\/\/purl.org\/dc\/terms\/issued","Degree":"http:\/\/vivoweb.org\/ontology\/core#relatedDegree","DegreeGrantor":"https:\/\/open.library.ubc.ca\/terms#degreeGrantor","Description":"http:\/\/purl.org\/dc\/terms\/description","DigitalResourceOriginalRecord":"http:\/\/www.europeana.eu\/schemas\/edm\/aggregatedCHO","Extent":"http:\/\/purl.org\/dc\/terms\/extent","FileFormat":"http:\/\/purl.org\/dc\/elements\/1.1\/format","FullText":"http:\/\/www.w3.org\/2009\/08\/skos-reference\/skos.html#note","Genre":"http:\/\/www.europeana.eu\/schemas\/edm\/hasType","GraduationDate":"http:\/\/vivoweb.org\/ontology\/core#dateIssued","IsShownAt":"http:\/\/www.europeana.eu\/schemas\/edm\/isShownAt","Language":"http:\/\/purl.org\/dc\/terms\/language","Program":"https:\/\/open.library.ubc.ca\/terms#degreeDiscipline","Provider":"http:\/\/www.europeana.eu\/schemas\/edm\/provider","Publisher":"http:\/\/purl.org\/dc\/terms\/publisher","Rights":"http:\/\/purl.org\/dc\/terms\/rights","RightsURI":"https:\/\/open.library.ubc.ca\/terms#rightsURI","ScholarlyLevel":"https:\/\/open.library.ubc.ca\/terms#scholarLevel","Title":"http:\/\/purl.org\/dc\/terms\/title","Type":"http:\/\/purl.org\/dc\/terms\/type","URI":"https:\/\/open.library.ubc.ca\/terms#identifierURI","SortDate":"http:\/\/purl.org\/dc\/terms\/date"},"Affiliation":[{"@value":"Science, Faculty of","@language":"en"},{"@value":"Earth, Ocean and Atmospheric Sciences, Department of","@language":"en"}],"AggregatedSourceRepository":[{"@value":"DSpace","@language":"en"}],"Campus":[{"@value":"UBCV","@language":"en"}],"Creator":[{"@value":"Herrera, Paulo Andres Ricci","@language":"en"}],"DateAvailable":[{"@value":"2009-11-30T15:37:58Z","@language":"en"}],"DateIssued":[{"@value":"2009","@language":"en"}],"Degree":[{"@value":"Doctor of Philosophy - PhD","@language":"en"}],"DegreeGrantor":[{"@value":"University of British Columbia","@language":"en"}],"Description":[{"@value":"Reactive transport modeling has become an important tool to study and understand the transport and fate of solutes in the subsurface. However, the accurate simulation of reactive transport represents a formidable challenge because of the characteristics of flow, transport and chemical reactions that govern the migration of solutes in geological formations.\n\nIn particular, solute transport in natural porous media is advection-controlled and dispersion is higher in the direction of flow than in the transverse direction. Both characteristics create difficulties for traditional numerical schemes that result in numerical dispersion and\/or spurious oscillations. While these errors can often be tolerated in conservative transport simulations, they can be amplified in presence of chemical reactions resulting in much larger errors or unstable solutions.\n\nIn this thesis, new Lagrangian based methods to simulate conservative and reactive transport in porous media are investigated. First, the derivation of a new meshless approximation based on smoothed particle hydrodynamics (SPH) to simulate conservative multidimensional solute transport, including advection and anisotropic dispersion, is presented. Second, a hybrid scheme that combines some of the advantages of streamline-based simulations and meshless methods and that allows simulating longitudinal and transverse dispersion without requiring a background grid is also derived. The numerical properties of both methods are analyzed analytical and numerically. Furthermore, both formulations are compared with existing numerical techniques in a set of two- and three-dimensional benchmark problems.\n\nIt is demonstrated that the proposed schemes provide accurate and efficient solutions of physical transport processes in heterogeneous porous media and overcome most of the issues in existing numerical formulations. The new methods have the potential to remove or minimize numerical dispersion and grid orientation effects and, in the case of the hybrid streamline method, also eliminate spurious oscillations even in presence of large longitudinal to transverse dispersivity ratios.\n\nTherefore, the results presented in this thesis confirm that the Lagrangian formulations of solute transport investigated here are viable and compelling alternatives to simulate reactive transport versus more standard numerical techniques.","@language":"en"}],"DigitalResourceOriginalRecord":[{"@value":"https:\/\/circle.library.ubc.ca\/rest\/handle\/2429\/15967?expand=metadata","@language":"en"}],"Extent":[{"@value":"10878280 bytes","@language":"en"}],"FileFormat":[{"@value":"application\/pdf","@language":"en"}],"FullText":[{"@value":"PARTICLE AND STREAMLINE NUMERICAL METHODS FOR CONSERVATIVE AND REACTIVE TRANSPORT SIMULATIONS IN POROUS MEDIA by PAULO ANDRES HERRERA RICCI M.Sc., University of Illinois at Urbana-Champaign, 2003 Ingeniero Civil, Universidad de Chile, 2001 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in THE FACULTY OF GRADUATE STUDIES (Geological Engineering) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) November 2009 c \ufffdPaulo Andres Herrera Ricci, 2009 \fAbstract Reactive transport modeling has become an important tool to study and understand the transport and fate of solutes in the subsurface. However, the accurate simulation of reactive transport represents a formidable challenge because of the characteristics of flow, transport and chemical reactions that govern the migration of solutes in geological formations. In particular, solute transport in natural porous media is advection-controlled and dispersion is higher in the direction of flow than in the transverse direction. Both characteristics create di\ufb03culties for traditional numerical schemes that result in numerical dispersion and\/or spurious oscillations. While these errors can often be tolerated in conservative transport simulations, they can be amplified in presence of chemical reactions resulting in much larger errors or unstable solutions. In this thesis, new Lagrangian based methods to simulate conservative and reactive transport in porous media are investigated. First, the derivation of a new meshless approximation based on smoothed particle hydrodynamics (SPH) to simulate conservative multidimensional solute transport, including advection and anisotropic dispersion, is presented. Second, a hybrid scheme that combines some of the advantages of streamlinebased simulations and meshless methods and that allows simulating longitudinal and transverse dispersion without requiring a background grid is also derived. The numerical properties of both methods are analyzed analytical and numerically. Furthermore, both formulations are compared with existing numerical techniques in a set of two- and three-dimensional benchmark problems. It is demonstrated that the proposed schemes provide accurate and e\ufb03cient solutions of physical transport processes in heterogeneous porous media and overcome most of the issues in existing numerical formulations. The new methods have the potential to remove or minimize numerical dispersion and grid orientation e\ufb00ects and, in the case ii \fof the hybrid streamline method, also eliminate spurious oscillations even in presence of large longitudinal to transverse dispersivity ratios. Therefore, the results presented in this thesis confirm that the Lagrangian formulations of solute transport investigated here are viable and compelling alternatives to simulate reactive transport versus more standard numerical techniques. iii \fTable of Contents Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiv Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xv Dedication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvi Co-authorship Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvii 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Reactive Transport Modeling . . . . . . . . . . . . . . . . . . 1.2.1 Definition . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.2 Conceptual Model . . . . . . . . . . . . . . . . . . . . 1.2.3 Mathematical Model . . . . . . . . . . . . . . . . . . . 1.3 Numerical Solution . . . . . . . . . . . . . . . . . . . . . . . . 1.3.1 Particularities of Flow and Transport in Porous Media 1.3.2 Numerical Methods . . . . . . . . . . . . . . . . . . . . 1.3.2.1 Mesh-based numerical methods . . . . . . . . 1.3.2.2 Hybrid Eulerian-Lagrangian methods . . . . . 1.3.2.3 Random walk particle tracking methods . . . 1.3.3 Limitations of Current Numerical Methods . . . . . . . 1.3.3.1 Accuracy . . . . . . . . . . . . . . . . . . . . 1.3.3.2 Monotonicity . . . . . . . . . . . . . . . . . . 1.3.3.3 Performance . . . . . . . . . . . . . . . . . . . 1.4 Lagrangian Numerical Methods . . . . . . . . . . . . . . . . . 1.4.1 Meshless Methods . . . . . . . . . . . . . . . . . . . . . 1.4.2 Streamline-Based Simulations . . . . . . . . . . . . . . 1.5 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 3 3 4 4 6 6 10 10 12 12 13 13 15 16 17 17 18 18 \f1.6 Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.7 Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.8 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 20 22 2 A Meshless Method to Simulate Solute Transport in Heterogeneous Porous Media . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.1.2 Numerical Methods . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 Monte Carlo SPH method . . . . . . . . . . . . . . . . . . . . . . . . . 2.2.1 Time Integration . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2.2 Accuracy and Spatial Resolution . . . . . . . . . . . . . . . . . 2.2.3 Mass Conservation . . . . . . . . . . . . . . . . . . . . . . . . . 2.3 Numerical evaluation of the MC-SPH method . . . . . . . . . . . . . . 2.3.1 One-Dimensional Dispersion . . . . . . . . . . . . . . . . . . . . 2.3.2 Two-Dimensional Dispersion . . . . . . . . . . . . . . . . . . . . 2.3.2.1 Initial particle and concentration distribution . . . . . 2.3.2.2 Performance . . . . . . . . . . . . . . . . . . . . . . . . 2.3.2.3 Accuracy . . . . . . . . . . . . . . . . . . . . . . . . . 2.3.3 Advection\u2013Dispersion in Heterogeneous Porous Media . . . . . . 2.3.3.1 Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.3.3.2 Results . . . . . . . . . . . . . . . . . . . . . . . . . . 2.4 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.5 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 29 29 30 33 37 39 40 41 41 42 46 48 51 54 54 56 64 67 3 Evaluation of Particle Approximations to Simulate Anisotropic Dispersion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.2 Mathematical Formulation . . . . . . . . . . . . . . . . . . . . . . . . . 3.3 Smoothed Particle Hydrodynamics (SPH) Approximation . . . . . . . . 3.3.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.3.2 SPH Approximation for Tensorial Dispersion . . . . . . . . . . . 3.3.3 Monotonicity . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.4 Particle Strength Exchange (PSE) Approximation . . . . . . . . . . . . 3.5 Numerical Tests . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.5.1 Simulation Cases . . . . . . . . . . . . . . . . . . . . . . . . . . 3.5.2 Equispaced Particles . . . . . . . . . . . . . . . . . . . . . . . . 72 72 74 75 75 76 77 80 81 83 86 v \f3.5.2.1 3.5.2.2 3.5.2.3 3.5.2.4 E\ufb00ect of particle spacing . . . . . . Maximum concentration . . . . . . Negative concentrations . . . . . . E\ufb00ect of ratio between smoothing spacing . . . . . . . . . . . . . . . 3.5.2.5 E\ufb00ect of anisotropy ratio . . . . . . 3.5.2.6 E\ufb00ect of kernel function . . . . . . 3.5.2.7 E\ufb00ect of velocity orientation . . . . 3.5.3 Irregularly Spaced Particles . . . . . . . . . 3.5.3.1 Isotropic case . . . . . . . . . . . . 3.5.3.2 Anisotropic case . . . . . . . . . . 3.6 Conclusions . . . . . . . . . . . . . . . . . . . . . . 3.7 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . particle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 93 93 96 97 99 104 104 108 4 A Multidimensional Streamline-Based Method to Simulate Reactive Solute Transport in Heterogeneous Porous Media . . . . . . . . . . . 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.1.2 Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2 Mathematical Formulation . . . . . . . . . . . . . . . . . . . . . . . . . 4.2.1 Governing Equation . . . . . . . . . . . . . . . . . . . . . . . . 4.2.2 Streamline Formulation . . . . . . . . . . . . . . . . . . . . . . . 4.2.3 Numerical Approximation . . . . . . . . . . . . . . . . . . . . . 4.2.3.1 Advection along streamlines . . . . . . . . . . . . . . . 4.2.3.2 Dispersion . . . . . . . . . . . . . . . . . . . . . . . . . 4.3 Implementation Details . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.1 Streamline Tracing . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.2 Time Integration . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.3 Advection Solution . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.4 MC-SPH Solution . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.4.1 SPH kernel . . . . . . . . . . . . . . . . . . . . . . . . 4.3.4.2 Neighbor search . . . . . . . . . . . . . . . . . . . . . . 4.3.4.3 Time integration . . . . . . . . . . . . . . . . . . . . . 4.3.5 Longitudinal Dispersion . . . . . . . . . . . . . . . . . . . . . . 4.3.5.1 Interface coe\ufb03cients . . . . . . . . . . . . . . . . . . . 4.3.5.2 Time integration . . . . . . . . . . . . . . . . . . . . . 4.4 Numerical Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 111 111 115 116 116 117 118 119 120 122 122 124 124 125 125 125 126 127 127 127 128 vi . . . . . . . . . . . . length . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . and . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 89 89 \f4.4.1 4.4.2 Example 1: Continuous Solute Release in Uniform Flow . . . . . Example 2: Quarter Five-Spot in Heterogeneous Medium . . . . 4.4.2.1 Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.4.2.2 Simulated concentrations . . . . . . . . . . . . . . . . 4.4.2.3 Numerical oscillations . . . . . . . . . . . . . . . . . . 4.4.2.4 Performance comparison . . . . . . . . . . . . . . . . . 4.4.3 Example 3: Quarter Five-Spot in Heterogeneous Medium with Rate-Limited Sorption . . . . . . . . . . . . . . . . . . . . . . . 4.4.4 Example 4: Natural Biodegradation in Three-dimensional Heterogeneous Porous Media . . . . . . . . . . . . . . . . . . . . . . . 4.4.4.1 Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.4.4.2 Simulated concentrations . . . . . . . . . . . . . . . . 4.4.4.3 Breakthrough curves . . . . . . . . . . . . . . . . . . . 4.4.4.4 Performance . . . . . . . . . . . . . . . . . . . . . . . . 4.5 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.6 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Conclusions . . . . . . . . . . . . . . . . . . . . 5.1 Limitations of Proposed Numerical Schemes 5.2 General Conclusions . . . . . . . . . . . . . 5.3 Perspectives . . . . . . . . . . . . . . . . . . 5.4 Final Remarks . . . . . . . . . . . . . . . . . 5.5 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Appendix A Derivation of SPH Approximation for Isotropic Dispersion 130 132 132 134 140 142 143 146 146 149 156 159 166 167 172 173 175 176 177 178 181 Appendix B Derivation of SPH Approximation for Second Order Derivatives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183 Appendix C Random Walk Particle Method Appendix D Streamline Tracing . . . . . . . . . . . . . . . 188 . . . . . . . . . . . . . . . . . . . . . . . 191 vii \fList of Tables 1.1 Estimated dispersivity values from field- and laboratory-scale experiments. 2.1 2.2 2.3 2.4 2.5 Comparison of MC-SPH and RWPT methods. Parameters used in RWPT simulations. . . . . Parameters used in SPH simulations. . . . . . Parameter and results of flow model. . . . . . Parameter values used in transport model. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.1 Parameters used in all simulations. . . . . . . . . . . . . . . . . . . . . 3.2 Parameters used to define di\ufb00erent simulation scenarios to evaluate approximations for anisotropic dispersion. . . . . . . . . . . . . . . . . . 3.3 Definition of di\ufb00erent runs used to study convergence properties. . . . . 3.4 Normalized error for di\ufb00erent SPH kernels and PSE cuto\ufb00 functions. . 3.5 Error versus flow velocity direction. . . . . . . . . . . . . . . . . . . . . 4.1 Dispersivity and equivalent longitudinal (P eL ) and transverse (P eT ) grid P\u00e9clet values used in Example 1. . . . . . . . . . . . . . . . . . . . . . 4.2 Parameters used in MOC simulations. . . . . . . . . . . . . . . . . . . . 4.3 Number of nodes or cells, time step size and number of time steps used in simulations of Example 2. . . . . . . . . . . . . . . . . . . . . . . . . . 4.4 Dispersivity and equivalent longitudinal (P eL ) and transverse (P eT ) grid P\u00e9clet values used in Example 2. . . . . . . . . . . . . . . . . . . . . . 4.5 Normalized minimum simulated concentration values for Example 2. . . 4.6 Normalized maximum simulated concentration values for Example 2. . 4.7 Normalized CPU time required to simulate Example 2 for di\ufb00erent scenarios. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.8 Parameters of the rate-limited sorption model used in Example 3. . . . 4.9 Definition of three scenarios simulated in Example 4. . . . . . . . . . . 4.10 Spatial and temporal discretizations used to simulate Example 4. . . . viii 9 44 45 45 54 55 82 85 85 96 97 131 133 134 134 142 142 143 144 147 149 \f4.11 Normalized CPU time required to simulate Example 4 for the two scenarios than include biodegradation. . . . . . . . . . . . . . . . . . . . . . . D.1 Comparison of the performance of Pollock\u2019s and explicit adaptive algorithm to trace streamlines in heterogeneous quarter five-spot problem. . D.2 Comparison of alternative seed distributions to trace streamlines in the heterogeneous quarter five-spot problem. . . . . . . . . . . . . . . . . ix 162 204 209 \fList of Figures 1.1 Groundwater pollution due to tailings infiltration. . . . . . . . . . . . 2 1.2 Vertical cross-section of a synthetically generated aquifer using the estimated statistics of the sandy aquifer at Canadian Forces Base, Borden, Ontario. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.3 Solute plume migration in vertical cross-section. . . . . . . . . . . . . 8 1.4 E\ufb00ect of advection and local-scale dispersion on solute concentration. 11 1.5 Subgrid-scale segregation and cell averaged concentration values. . . . 14 2.1 SPH kernels and derivatives. . . . . . . . . . . . . . . . . . . . . . . . 34 2.2 Error versus smoothing length. . . . . . . . . . . . . . . . . . . . . . . 43 2.3 Initial distribution of particles and solute concentration in RWPT simulations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 2.4 Initial solute concentration distribution in MC-SPH simulations. . . . 47 2.5 Normalized CPU time versus number of particles in RWPT simulations. 49 2.6 Normalized CPU time versus total number of particles and average number of particles per kernel support volume in MC-SOH simulations. . 50 2.7 Maximum concentration versus time in MC-SPH and RWPT simulations. 52 2.8 Normalized global error versus total number of particles and normalized CPU time. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 Domain dimensions, square initial plume, and breakthrough observation points P1 and P2 along centerline. . . . . . . . . . . . . . . . . . . . . 55 2.9 2.10 2.11 2.12 Spatial concentration distribution for TVD, HMOC and SPH simulations at \u03c4 = U t\/IY = 62 for P e = \u221e. . . . . . . . . . . . . . . . . . . 58 Concentration versus accumulated distance along centerline at dimensionless time \u03c4 = U t\/IY = 62. . . . . . . . . . . . . . . . . . . . . . . 59 Breakthrough curve at point P1 located 26IY downstream from initial plume center. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 x \f2.13 Breakthrough curve at point P2 located 42IY downstream from initial plume center. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 2.14 Dimensionless maximum concentration versus dimensionless time. . . 63 2.15 Mean concentration versus dimensionless time. . . . . . . . . . . . . . 65 3.1 Sum of dispersion components as function of flow velocity direction. . 79 3.2 SPH kernels and PSE cuto\ufb00 functions. . . . . . . . . . . . . . . . . . 84 3.3 Error E2 as function of particle or grid spacing for equispaced particles. 87 3.4 Normalized error E\u221e as function of particle or grid spacing for equispaced particles. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 Di\ufb00erence between maximum concentration values of numerical and analytical solutions as function of time for equispaced particles. . . . . . 90 3.6 Concentration distribution for equispaced particles. . . . . . . . . . . 91 3.7 Di\ufb00erence between analytical and numerical solutions for equispaced particles. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 Error E2 versus the ratio between smoothing length or core size and particle spacing, \u03b3 = h\/\u2206x. . . . . . . . . . . . . . . . . . . . . . . . 94 3.9 Error as function of the anisotropy ratio \u03b1T \/\u03b1L . . . . . . . . . . . . . 95 3.10 Particle distortion due to flow velocity. . . . . . . . . . . . . . . . . . 98 3.11 Particle locations considering random and quasi-random distributions. 99 3.12 E2 error versus average particle spacing using equispaced, random, and quasi-random particle distributions. . . . . . . . . . . . . . . . . . . . 100 Normalized E\u221e error versus average particle spacing using equispaced, random, and quasi-random particle distributions. . . . . . . . . . . . 102 Di\ufb00erence between maximum concentration values of analytical and numerical solutions as function of time for random and quasi-random particle distributions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103 Error as function of average particle spacing for \u03b1T \/\u03b1L = 0.01 using randomly and quasi-randomly distributed particles. . . . . . . . . . . 105 Concentration distribution after 300 time steps for \u03b1T \/\u03b1L = 0.01 and quasi-randomly distributed particles. . . . . . . . . . . . . . . . . . . 106 4.1 Meshless MC-SPH method. . . . . . . . . . . . . . . . . . . . . . . . . 113 4.2 Hybrid streamline-SPH method. . . . . . . . . . . . . . . . . . . . . . 115 3.5 3.8 3.13 3.14 3.15 3.16 xi \f4.3 Flow oriented coordinate system. . . . . . . . . . . . . . . . . . . . . 118 4.4 Overall solution approach implemented in streamline-based simulator. 129 4.5 Comparison of simulated concentrations for Example 1. . . . . . . . . 131 4.6 Spatial distribution of the natural logarithm of the hydraulic conductivity and streamlines in Example 2. . . . . . . . . . . . . . . . . . . . . 132 Simulated concentration values after injection of 0.4 pore volume of contaminated fluid for Example 2. . . . . . . . . . . . . . . . . . . . . . . 135 4.8 Breakthrough curves at observation point P1 in Example 4. . . . . . . 137 4.9 Breakthrough curves at observation point P2 in Example 4. . . . . . . 138 4.10 Comparison of simulated breakthrough curves at observation point P1 for Example 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 Comparison of simulated breakthrough curves at observation point P2 for Example 2, (a) streamline simulator and (b) MOC solver using fine grid. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 4.12 Numerical oscillations in simulated concentrations for Example 2. . . 141 4.13 Breakthrough at observation point P2 for di\ufb00erent mass transfer (\u03b2) and partition (Kd ) coe\ufb03cients considered in Example 3 . . . . . . . . . . 145 Spatial distribution of natural logarithm of hydraulic conductivity and flow velocity magnitude used in Example 4 . . . . . . . . . . . . . . . 148 Simulated concentrations at nodes along streamlines after 10,000 days since the initial release of BTEX for the scenario that includes advective transport with biodegradation in Example 4. . . . . . . . . . . . . . . 151 Simulated concentrations at nodes along streamlines after 10,000 days since the initial release for the scenario that includes advection, dispersion and biodegradation in Example 4. . . . . . . . . . . . . . . . . . 152 imulated concentration values for Example 4 at vertical plane defined by y=11.5 m. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 Simulated concentration values for Example 4 at horizontal plane defined by z=2.5 m. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 Comparison of simulated concentration values for Example 4 at horizontal plane defined by z=2.5 m. . . . . . . . . . . . . . . . . . . . . . . 155 Simulated concentration values for Example 4 along the profile parallel to y direction at coordinates x=35 m and z=2.5 m. . . . . . . . . . . 157 4.7 4.11 4.14 4.15 4.16 4.17 4.18 4.19 4.20 xii \f4.21 Location of contaminant source and the two observation wells in Example 4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 Simulated BTEX concentration versus time for Example 4 assuming advective transport only. . . . . . . . . . . . . . . . . . . . . . . . . . 160 Simulated BTEX concentration versus time for Example 4 assuming advective transport and biodegradation. . . . . . . . . . . . . . . . . . 161 4.24 Distribution of cells according to the flow velocity magnitude. . . . . 163 4.25 Distribution of (a) nodes along streamlines according to the flow velocity magnitude and (b) number of streamlines based on the maximum velocity magnitude along individual streamlines. . . . . . . . . . . . . 164 Spatial distribution of nodes and number of nodes according to the number of neighboring nodes that contribute to the SPH summation to approximate dispersion. . . . . . . . . . . . . . . . . . . . . . . . . . . . 165 D.1 Scehamatic of Pollock\u2019s particle tracking method. . . . . . . . . . . . 193 D.2 Schematic of explicit particle tracking method. . . . . . . . . . . . . . 198 D.3 Comparison of Pollock\u2019s and explicit integration methods for the homogeneous quarter five-spot problem. . . . . . . . . . . . . . . . . . . . 200 Comparison of time of flight and arc length computed with Pollock\u2019s and explicit integration methods for homogeneous quarter five-spot problem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201 4.22 4.23 4.26 D.4 D.5 Spatial distribution of hydraulic conductivity used in heterogeneous quater five-spot problem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201 D.6 Comparison of Pollock\u2019s and explicit integration methods for the heterogeneous quarter five-spot problem. . . . . . . . . . . . . . . . . . 202 D.7 Comparison of time of flight and arc length computed with Pollock\u2019s and explicit integration methods for heterogeneous quarter five-spot problem. 203 D.8 Streamline distribution in heterogeneous quater five-spot problem. . . 207 D.9 Comparison of two alternative streamline distributions for the homogeneous quater five-spot problem. . . . . . . . . . . . . . . . . . . . . . 207 D.10 Comparison of four alternative streamline distributions for the heterogeneous quater five-spot problem. . . . . . . . . . . . . . . . . . . . . 208 D.11 Schematic of flow problem considering low permeability inclusion. . . 210 xiii \fD.12 Comparison of Pollock\u2019s and time of flight streamline discretization approaches. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211 D.13 Comparison of Pollock\u2019s and arc length streamline discretization approaches. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212 xiv \fAcknowledgments I especially want to thank my advisor, Prof. Roger Beckie, who gave me freedom and constant encouragement to pursue my research interests. He has been an excellent mentor not only on the technical aspects of this research, but also on the many other aspects of the academic world. I feel fortunate I have had the opportunity to collaborate with such great person. I also appreciate the interesting conversations I had with the others members of my thesis committee, Prof. Leslie Smith and Prof. Ulrich Mayer. Prof. Albert Valocchi and Dr. Marco Massab\u00f3 also provided comments that improved the text and help to clarify some of the points presented in this thesis. I am grateful to all the people that directly or indirectly have funded my education and research through the years. My PhD education and research have been founded through a University of British Columbia Graduate Fellowship and a NSERC Discovery Grant awarded to Prof. R. Beckie. I am also grateful to have received the Thomas and Marguerite MacKay Memorial Scholarship and the Hugh Nasmith Graduate Scholarship while I was a graduate student at UBC. I am deeply indebted with thousands of programmers who have generously donated their work to create free software. This thesis would not have been possible without such great tools. Finally, I wish to thank my family who has been a constant source of support and encouragement during these long years. To Fran\u00e7oise, Clara and Matias, I will never forget all the sacrifices you have made to allow me to pursue my dreams. xv \fTo Fran\u00e7oise, Clara and Matias xvi \fCo-authorship Statement This thesis has been prepared as a collection of manuscripts, either published, submitted or in preparation, that have been co-authored with individuals other than myself. In each case I am the first author and have conducted all the research work and manuscript preparation. The specific objectives of each chapter and research approach are based on my initiative in consultation with my thesis supervisor Prof. Roger Beckie. The research work, including derivation of numerical approximations, code development and numerical simulations, with the exception of the one-dimensional simulations presented in Chapter 2, have been entirely done by myself with support from the co-authors as outlined below. Dr. Marco Massab\u00f3 from CIMA Research Foundation in Savona, Italy; provided insightful comments and collaboration on the interpretation of the smoothed particle hydrodynamics (SPH) method in the context of simulations of subsurface solute transport. In addition, Dr. Massab\u00f3 provided the results of the one-dimensional SPH simulations included in Chapter 2. Prof. Beckie, Dr. Massab\u00f3, and Prof. Valocchi from the University of Illinois at Urbana-Champaign, USA, also assisted with corrections and suggestions to improve the editing of the chapters which they were involved with. xvii \fChapter 1 Introduction 1.1 Motivation Groundwater pollution has become a serious problem during recent decades. The release and infiltration into aquifers of pesticides, organic compounds, contaminants of biological origin and nuclear waste, among others, pose a risk for the human health and the environment. In 1996, the U.S. Environmental Protection Agency (EPA) identified 217,000 contaminated sites in the U.S. that required mitigation action. Another 300,000 sites were reported cleaned up or were found to no require mitigation. It was estimated that several thousands of those sites were polluted with highly radioactive nuclear waste and would require coordinated mitigation actions for several decades before been declared cleaned up. In addition, it was estimated that there were between 130,000 to 450,000 additional sites that could potentially require some mitigation action (EPA, 1996). In Canada, the Federal Contaminated Site Inventory (FCS, retrieved on August 10, 2009) lists 3,208 sites that have at least one substance in the groundwater that occurs at concentrations above natural levels and that pose an immediate or long-term hazard to human health or the environment. Those sites includes only the small proportion of cases for which the Government of Canada has accepted some or all financial responsibility. Figure 1.1 shows a common example of groundwater contamination due to tailings infiltration from a tailings impoundment. Once the tailings plume reaches the water table it migrates carried by the regional groundwater flow and it can eventually impact the 1 \fFigure 1.1: Groundwater pollution due to tailings infiltration. Once the tailings plume reaches the water table it can migrate up to several kilometers downstream from the contaminant source carried by the regional groundwater flow. water quality of wells located up to several kilometers downstream from the contaminant source. This example demonstrates the potential large spatial scale of problems related to the pollution of natural aquifers. Because of the scale of the problem, it is essential to find the most e\ufb00ective and financially sound mitigation actions. Possible mitigation actions include: natural attenuation (either due to dilution or natural biodegradation), passive containment, and active cleanup measures such as pump and treat and enhanced bioremediation (EPA, 1996). The selection of the most e\ufb00ective action requires a good understanding of the physical, chemical and biological processes that govern the migration and transformation of contaminants in the subsurface. At the same time, scientists and engineers who are involved in the remediation of contaminated sites are interested in finding answers to questions like: \u2022 How long will the contaminant plume take to reach a well or a river? \u2022 What will be the contaminant concentration at a given location and time? \u2022 Will dilution due to the advection and dispersion of the contaminant plume be enough to decrease the contaminant concentration to acceptable levels within a reasonable time frame? 2 \f\u2022 Will the contaminant of concern be retarded with respect to the groundwater flow? \u2022 Will biodegradation be an e\ufb00ective process to transform and remove the contaminant from the groundwater? Reactive transport modeling has emerged during the last decades as an instrument to answer these practical questions and as a tool to integrate fundamental knowledge of the complex processes that control flow, transport and chemical reactions in porous media (Steefel et al., 2005). In this thesis, new methods for the simulation of conservative and reactive transport are investigated. The methods focus upon accurate and e\ufb03cient solution of physical transport processes in heterogeneous porous media. This research addresses problems in existing formulations that lead to, for example, negative concentrations, which are particularly problematic because of non-linear chemical reaction rates that are common in reactive transport simulations. 1.2 1.2.1 Reactive Transport Modeling Definition Reactive transport in natural porous media is a broad term that is used to refer to complex physical and chemical processes that occur at disparate spatial and temporal scales and that involve fluid flow, mass transport and chemical reactions in the subsurface (Steefel et al., 2005). The interaction between transport, and reactions is complex. On one hand, reactions such as mineral precipitation and dissolution can change the porosity and permeability of a porous medium, hence, a\ufb00ect the fluid flow and transport properties of the medium. On the other hand, mass transport plays a key role in enabling reactions because it provides the driving force to perturb a chemical system out of equilibrium by transporting and mixing reactants and, because it sets a characteristic time scale during which reactions can take place (Valocchi, 1985). The most important transport processes for enabling reactions are advection, molecular di\ufb00usion, and mechanical dispersion (Steefel and MacQuarrie, 1996; De Simoni et al., 2005; Steefel and Maher, 2009). 3 \f1.2.2 Conceptual Model The migration and transformation of contaminants in the subsurface is the result of fluid and transport processes that occur at length scales of a single or few pores and of chemical reactions that happen at even smaller scales (molecular scale). Although, pore-scale modeling has gained considerable attraction during recent years, their use is limited to very small scale problems where they have provided insightful understanding of basic mechanisms. However, pore-scale modeling is not appropriate for studying practical field-scale problems that occur at much larger scales (Steefel et al., 2005). Therefore, most current conservative and reactive transport models used to simulate field-scale problems are based on a continuum representation of porous media, such that the system properties are averaged over a representative elementary volume (REV) with length scale equal to many pore lengths (Bear, 1988; Steefel et al., 2005). Thus, the REV scale, often called Darcy\u2019s scale or local-scale, defines the spatial scale or volume size where fluid velocity, transport properties, concentrations and reactions rates are computed. In what follows we will concentrate our discussion on the use of reactive transport modeling in hydrogeology. Furthermore, we will assume isothermal saturated groundwater flow with constant density and negligible e\ufb00ect of reactions on flow and transport properties. 1.2.3 Mathematical Model The groundwater specific discharge, q, can be calculated using Darcy\u2019s law, q = \u2212K\u2207\u03c6 (1.1) where K [L\/T] is the hydraulic conductivity tensor and \u03c6 [L] is the hydraulic head. The two main transport mechanisms at the REV scale are: advection, which involves the movement of the solute with the flow; and hydrodynamic or local-scale dispersion that includes molecular di\ufb00usion and mechanical dispersion due to variations of the flow velocity at the pore-scale (Bear, 1988). Thus, reactive solute transport at the local-scale is modeled by a system of partial di\ufb00erential equations, which is given as follows for the case of constant porosity (Bear, 1988; Steefel and MacQuarrie, 1996): 4 \f\u2202Ck = \u2207 \u00b7 (D\u2207Ck ) \u2212 \u2207 \u00b7 (vCk ) + Rk (c) \u2202t \u2202Ck = Rk (c) \u2202t k = 1, . . . , m k = m + 1, . . . M (1.2) where Ck [M\/L3 ] is the solute concentration of species or component k, D [L2 \/T] is the hydrodynamic dispersion tensor, v = q\/\u03b7 [L\/T] is the pore water velocity, \u03b7 is the porosity of the medium, Rk [M\/L3 \/T] is the total reaction rate for species or component k, c = (C1 , . . . , CM ) is the concentration vector, m is the number of species or components in the aqueous (mobile) phase, and M is the total number of species or components. The most common expression to compute the coe\ufb03cients of the dispersion tensor D for an isotropic porous medium considering a Cartesian coordinate system is (Bear, 1988) Dij = (\u03b1T q + Dm ) \u03b4ij + (\u03b1L \u2212 \u03b1T ) vi vj q (1.3) where Dm [L2 \/T] is the molecular di\ufb00usivity, \u03b4ij is Kronecker\u2019s delta, q = |v| [L\/T] is the magnitude of the pore water velocity, and \u03b1L and \u03b1T [L] are the longitudinal and transverse dispersivity of the medium, respectively. Alternative expressions for the dispersion tensor components include di\ufb00erent transverse dispersivities for the horizontal and vertical directions (Burnett and Frind, 1987; Lichtner et al., 2002), however, those models are less commonly used. The reaction term in (1.2) may include homogeneous reactions that occur in a single phase or heterogeneous reactions that include constituents in more than one phase, e.g. sorption which includes the solid and aqueous phases (Rubin, 1983; Mayer et al., 2002). From a practical point of view, sorption and biodegradation are the two most relevant reactions in groundwater, because of their role in retarding the migration of heavy metals and in the transformation of hydrocarbons, respectively; which are the two most common substances in contaminated aquifers (EPA, 1996). 5 \f1.3 Numerical Solution The system of equations in (1.2) corresponds to a set of non-linear partial di\ufb00erential equations (PDE) and, in general, must be integrated numerically. There are two di\ufb00erent numerical approaches to integrate the system of PDEs: a fully-implicit approximation or an operator splitting approach (Yeh and Tripathi, 1989; Steefel and MacQuarrie, 1996). The simplest one is based on an operator splitting formulation that allows decoupling of the transport and reaction terms. Then, equation (1.2) is split into two terms representing transport and chemical reactions. Usually, the transport component, which corresponds to a linear PDE, is solved first, then the concentrations computed as result of the transport step are used as initial conditions to compute the solution of the nonlinear set of ordinary di\ufb00erential equations that represent chemical reactions. Variations of the operator splitting approach include schemes that iterate between the solutions of the transport and reaction terms or that switch the order of the evaluation (Steefel and MacQuarrie, 1996). In the discussion that follows we will assume that an operator splitting approach is used to evaluate (1.2) and we will focus our analysis on the numerical solution of the transport term. However, we must emphasize that the analysis presented below is also valid for fully implicit implementations. 1.3.1 Particularities of Flow and Transport in Porous Media The numerical integration of the advection-dispersion-reaction (ADR) equation, (1.2), presents some unique challenges. First, because of the geological origin of aquifers, hydraulic conductivity varies by several orders of magnitudes within relatively short distances. For example, Sudicky (1986) reports di\ufb00erences of more than thirty times between hydraulic conductivity values separated by few centimeters in a shallow sandy aquifer at Canadian Forces Base in Borden, Ontario, Canada. Similar variations were also observed at the Macrodispersion Experiment (MADE) site in Mississippi, USA, where local-scale hydraulic conductivity values varied by more than four orders of magnitude within an area of approximately 250 x 300 m (Boggs et al., 1992; Zheng and Gorelick, 2003). Large variations in hydraulic conductivity produce not only important variations in flow velocity magnitude, but also in the direction of the flow (Sudicky, 1986). For example, 6 \fFigure 1.2: Vertical cross-section of a synthetically generated aquifer using the estimated statistics of the sandy aquifer at Canadian Forces Base, Borden, Ontario (Mackay et al., 1986; Sudicky, 1986; Freyberg, 1986). Natural logarithm of the hydraulic conductivity (top) and simulated groundwater velocity (bottom). The cross-section is 32 m long and 8 m high. Large variations of hydraulic conductivity within short distances result in important variation of the magnitude and direction (arrows) of the flow velocity. Figure 1.2 shows a vertical cross-section of a synthetically generated aquifer using the estimated statistics of the sandy aquifer at the Borden site (Mackay et al., 1986; Sudicky, 1986; Freyberg, 1986). The figure also shows simulated groundwater velocities, that demonstrate that variations of hydraulic conductivity within short distances result in important variations of the magnitude and direction of the flow velocity. Because of the heterogeneity of the flow velocity, adjacent fluid parcels may travel at very di\ufb00erent velocities. Such variations in travel time result in stretching and spreading of the contaminant plume, which manifests as large variations of concentration within short distances even at the order of few centimeters (Mackay et al., 1986; Molz and Widdowson, 7 \f1988; Benson and Meerschaert, 2008). Figure 1.3 shows how variations in velocity can produce dramatic changes in the shape of a initially regular plume within short travel distances. Figure 1.3: Solute plume migration in vertical cross-section shown in Figure 1.2. An idealized initial rectangular solute plume (red rectangle on top figure) migrates carried by the flow velocity. Because of the heterogeneity of the flow field, the shape of the plume becomes very irregular after the center of mass of the plume has travelled approximately 10 m (bottom). Second, local-scale dispersion is anisotropic and it is much more important in the direction of the flow than in the transverse directions. Table 1.1 lists estimated dispersivity values based on data collected in field- and laboratory-scale experiments. While longitudinal dispersivity ranges between 3 \u00b7 10\u22122 and 5 \u00b7 10\u22121 m, typical transverse dispersivity is of the order of 10\u22123 m, which is equivalent to transverse dispersion coe\ufb03cients of the order of molecular di\ufb00usion for typical pore water velocities (Cirpka et al., 2006). Note that experimental measurements of local-scale dispersion are di\ufb03cult, thus most estimated dispersivity values are based on spatial moment analysis, which measures the spreading of the plume, or e\ufb00ective parameters that measure the combined e\ufb00ect of flow heterogeneity and local-scale dispersion (Jose et al., 2004). Therefore, most of the values presented in 8 \fTable 1.1 represent upper bounds for local-scale longitudinal and transverse dispersivities. \u03b1L (m) 3 \u00b7 10\u22122 \u2212 5 \u00b7 10\u22121 4 \u00b7 10\u22121 \u2013 4 \u00b7 10\u22121 \u03b1T (m) Comments 5 \u00b7 10\u22124 \u2212 1 \u00b7 10\u22123 Based on data collected during field-scale tracer test in a shallow unconfined sand and gravel aquifer on Cape Cod, Massachusetts, USA (Hess et al., 2002) 4 \u00b7 10\u22122 Based on spatial moment analysis of data collected during the large-scale experiment conducted at the Borden site in Ontario, Canada (Freyberg, 1986) 1 \u00b7 10\u22126 \u2212 2 \u00b7 10\u22124 2 \u00b7 10\u22123 Calculated from reactive plume lengths in laboratory-scale experiments with homogeneous materials (Cirpka et al., 2006) E\ufb00ective dispersivities obtained from analysis of breakthrough curves in a 14 m long sandbox filled with four di\ufb00erent types of silica sand (Jose et al., 2004) Table 1.1: Estimated dispersivity values from field- and laboratory-scale experiments. The heterogeneity of the flow velocity field together with the small magnitude of localscale dispersion coe\ufb03cients in natural porous media, have important consequences for key transport processes such as spreading, dilution and mixing. Kitanidis (1994) discusses the di\ufb00erence between the spreading and dilution of a solute plume. Spreading is defined as the stretching of the plume and can be measured as the rate of change of the second central spatial moment. Dilution is the process by which the initial solute mass is distributed in an increasing volume. Mixing is the result of the combined action of the stretching and folding of material lines of the plume, and the mass exchange due to local-scale dispersion (Weeks and Sposito, 1998). While spreading is produced by the spatial velocity variability, dilution and mixing are due to the combined action of the heterogeneity of the flow field and most importantly local-scale dispersion. Because of the relatively small magnitude of the local-scale dispersion and in absence of sorption, mixing between a contaminant and other chemical species present in the 9 \fnatural groundwater occurs in a narrow zone located along the irregular edges of the contaminant plume (Oya and Valocchi, 1998). Figure 1.4 shows the di\ufb00erence between spreading and mixing using results of simulations included in Section 2.3.3. The figures show simulated concentrations for two conservative transport scenarios with di\ufb00erent P\u00e9clet number (P e): advection-only (P e = \u221e) and for advection and dispersion (P e = 200). Under a purely-advective scenario the solute plume becomes irregular due to variations in velocity, however initial concentration values do not change and there is a sharp interface between fluid zones with and without solute. When local-dispersion is included, there is solute mass transfer in areas of high concentrations near the plume edges that results in a thin area, relative to the typical length of the local-scale heterogeneity, with concentrations lower than the initial value. In many field situations the zone with lower concentrations would correspond to a mixing area where the solute and the natural groundwater mix enabling chemical reactions. For example, natural and enhanced attenuation of organic contaminants occur in a narrow zone close to the plume boundaries where the contaminant (substrate) and the electron acceptor (e.g. oxygen) mix (Oya and Valocchi, 1998; Cirpka et al., 1999b; Ham et al., 2004). In the next section, we will argue that the characteristics of the flow and solute transport process described above must be considered in the selection of numerical methods to simulate conservative and reactive solute transport in groundwater. 1.3.2 Numerical Methods We start this section by reviewing some of the most common numerical schemes that are used to simulate conservative and reactive solute transport. 1.3.2.1 Mesh-based numerical methods This category includes finite di\ufb00erence, finite volume or finite element methods. In finite di\ufb00erence and finite volume schemes each grid cell defines a new control volume within which parameters and variables are considered constant (Steefel and MacQuarrie, 1996). Mesh-based methods are relatively easy to implement, have convergence, stability and accuracy properties that are well understood, and it is possible to develop formulations that are mass conservative. Because of those characteristics, mesh-based approximations 10 \fFigure 1.4: E\ufb00ect of advection and local-scale dispersion on solute concentration. Figure shows a small part of the simulated solute plume in Section 2.3.3 for P\u00e9clet number, P e = \u221e (top) and P e = 200 (bottom). Advection only a\ufb00ects the shape of a contaminant plume (top). If local-dispersion is included, mass transfer occurs in areas of high concentration gradients and a mixing zone develops around the plume edges (bottom). The mixing zone is critical to enable some chemical reactions such as biodegradation. 11 \fare used in most reactive transport packages (e.g. Pruess, 1991; White et al., 1995; Mayer et al., 2002; Mills et al., 2007). Low-order mesh-based schemes to approximate advection, e.g. upstream finite di\ufb00erence, introduce large amount of artificial di\ufb00usion and mixing (Steefel and MacQuarrie, 1996). Therefore, alternative schemes based on high-order approximations that were first developed to simulate problems in computational fluid dynamics, have been adopted by reactive transport modelers. Examples of high-order schemes are flux-corrected transport (FCT) methods (Boris and Book, 1973; Zalesak, 1979), which combine high- and loworder schemes; and total variation diminishing (TVD) schemes (Harten and Lax, 1984; Yee et al., 1985; Cox and Nishikawa, 1991). 1.3.2.2 Hybrid Eulerian-Lagrangian methods Hybrid schemes are based on the same general concept, the use of particles to handle advection and a grid-based method to handle dispersion. Each time step is split into two sub-steps. First, changes in concentrations due to advection are computed by forward or backward particle tracking. Then, concentration values are interpolated onto a grid. Next, grid concentration values are used to solve for dispersion, and eventually reactions, using some traditional mesh-based solver. Multiple variations of this approach exist depending on the interpolation methods and tracking algorithm. Examples of these kinds of methods are: hybrid Eulerian-Lagrangian methods (Neuman, 1981, 1984), method of characteristics (MOC) and hybrid method of characteristics (HMOC) in the MT3DMS package (Zheng and Wang, 1999) and MOC3D (Konikow et al., 1996), and EulerianLagrangian localized adjoint methods (ELLAM) (Celia et al., 1990; Russell and Celia, 2002). 1.3.2.3 Random walk particle tracking methods Random walk particle-tracking methods (RWPT) have long been used to simulate conservative solute transport in porous media (Ahlstrom et al., 1977; Pickens and Grisak, 1981; Tompson and Gelhar, 1990; Tompson, 1993). In this type of model, solute mass is distributed among a set of particles that move carried by the flow velocity and by a random drift that models dispersive transport (Delay et al., 2005; Salamon et al., 2006). Solute concentrations are estimated by averaging the mass contained in the particles 12 \ffound in some specified volume. Therefore, concentration values depend upon the total number of particles, size of the averaging volume, and spatial particle distribution. The popularity of RWPT methods is due to its natural capacity to accurately simulate advection and ease of implementation. Because of its advantages RWPT has become the de facto standard method in numerical studies of plume spreading and dilution (e.g. see Delay et al., 2005; Salamon et al., 2006, and references therein). However, RWPT methods are less attractive for the simulation of reactive transport because: (i) it is di\ufb03cult to simulate general heterogeneous reactions that include the solid phase, (ii) a very large number of particles is required to obtain an accurate estimation of low concentration values that is crucial to approximate reactions that occur in the mixing zone along the plume edges, and (iii) simulations that include multiple species need a large number of particles to track individual species. 1.3.3 Limitations of Current Numerical Methods According to Steefel and MacQuarrie (1996) there are three main properties that a numerical method must satisfy to be used in reactive transport simulations: (i) accuracy in space and time, which includes minimizing numerical di\ufb00usion and mass conservation errors, (ii) monotonicity, which means avoiding spurious oscillations (e.g., negative concentrations); and (iii) computational e\ufb03ciency. Next, we evaluate current numerical methods based on those three criteria. 1.3.3.1 Accuracy Mesh-based numerical methods, including high resolution methods, have problems to accurately simulate multidimensional advection-dominated transport because of numerical dispersion that results in excessive artificial mixing, dilution, and overestimation of reactions rates (Steefel and MacQuarrie, 1996; Cirpka et al., 1999; Zheng and Wang, 1999). Numerical dispersion is more important when the grid is not aligned with the direction of the flow (Frind et al., 1987), which is always the case in non-uniform flows as found in heterogeneous porous media. On the other hand, hybrid schemes that require interpolating concentrations to a background grid also introduce numerical dispersion even if they provide a very accurate solution for advection. In the case of RWPT methods, concentration values can only 13 \fA! A + B! B! Figure 1.5: Subgrid-scale segregation and cell averaged concentration values. Species A and B are physically segregated at the subgrid-scale (left). However, they would appear well-mixed at the cell scale (right). If A and B are two reactants in a chemical reaction, then numerical simulations based on cell averaged concentrations would overestimate the reaction rate. be obtained after averaging the mass of particles over some control volume, which also results in numerical mixing. The use of cell average concentration values can introduce large errors in the estimation of dilution and reaction rates. For example, Figure 1.5 shows two species, A and B, which are physically segregated, however, they would appear well-mixed in numerical simulations that use cell averaged concentration values. If A and B are reactants in a chemical reaction, then the simulated reaction rate would overestimate the real reaction rate (which is zero, in this case). The errors due to numerical dispersion and cell averaging are smaller for larger values of local-scale dispersion, because concentration values within the cell volume are smoothed out by dispersion (Steefel and MacQuarrie, 1996). However, as discussed earlier, localscale dispersion in porous media, particularly in the transverse direction, is small and its e\ufb00ect to smooth out concentration fluctuations is limited. Therefore, sub-grid scale concentration fluctuations are important and the use of cell averaged concentration values is an important source of error in conservative and reactive transport simulations (Frind and Germain, 1986; Frind et al., 1987; Molz and Widdowson, 1988; Benson and Meerschaert, 2008). In evaluating the accuracy of a numerical method for simulating reactive transport, it 14 \fis also important to keep in mind that any error in the solution of the transport component can be greatly amplified by non-linear reactions. Thus, methods that perform acceptably well to simulate conservative solute transport, can produce large errors when chemical reactions are included (Steefel and MacQuarrie, 1996). For example, Cirpka et al. (1999b) demonstrated that small amounts of numerical dispersion in simulations of biodegradation controlled by transverse mixing simulated using a high-order finite volume method, can result in larger errors in the estimation of reaction rates and contaminant mass removal. 1.3.3.2 Monotonicity Spurious oscillations in simulations of conservative solute transport arise due to the use of non-linear high-order methods to control numerical dispersion (Steefel and MacQuarrie, 1996; Cirpka et al., 1999) and numerical approximations of the o\ufb00-diagonal entries (\u201ccross-terms\u201d) in the local-dispersion tensor (Herrera and Valocchi, 2006). Multidimensional high-order mesh-based solvers for advection based on the FCT and TVD schemes, which are supposed to suppress numerical oscillations, often result in small oscillations (Steefel and MacQuarrie, 1996; Herrera and Valocchi, 2006). Numerical oscillations that arise from the solution of parabolic or elliptic PDEs that include mixed derivatives or \u201ccross-terms\u201d are a well known problem and have been the subject of many research e\ufb00orts in recent years (e.g. Nordbotten and Aavatsmark, 2005; Le Potier, 2005b; Mlacnik and Durlofsky, 2006; Edwards and Zheng, 2008; Yuan and Sheng, 2008; Lipnikov et al., 2009). To this day, no single solution provides a scheme that can be used in general scenarios. Although, small oscillations can be usually tolerated in conservative transport simulations, they are unacceptable in reactive transport simulations because they can result in unstable solutions in presence of non-linear chemistry. For example, Steefel and MacQuarrie (1996) discusses the e\ufb00ect of small oscillations in a problem involving organic carbon degradation via sulfate reduction coupled to two equilibrium dissolution-precipitation reactions. They simulate solute transport using a high-order FCT method that introduces spurious oscillations that do not produce problems in a tracer simulation, but that produce unstable results when chemical reactions are included. 15 \f1.3.3.3 Performance Numerical simulations of reactive transport in porous media are computationally demanding. Although, the increasingly availability of high-performance computers has made feasible detailed simulations of reactive transport in two- and three-dimensional domains (e.g. PFLOTRAN , retrieved on August 12, 2009), it is still not possible to resolve practical problems with enough detail to capture all the scales of heterogeneity that are relevant for reactive transport (Steefel et al., 2005). Performance is also important when a large number of scenarios must be simulated. For example, because of our inability to observe all the scales of physical and chemical heterogeneity present in natural porous media, reactive transport simulations include a high degree of uncertainty. A standard way to deal with uncertainty is based on a Monte Carlo approach that involves simulating many equally probable scenarios to determine probability distributions for possible outcomes (Steefel et al., 2005). Simulating a large number of realizations is also a requirement of some methods to estimate the e\ufb00ects of variations in the input parameters on the model results (sensitivity analysis) or of some automatic parameter calibration frameworks (Hill and Tiedeman, 2007). Nowadays, high performance requires to use numerical methods that can be implemented in algorithms that are amenable to parallelization. While RWPT methods can be implemented using an embarrassingly parallel algorithm, e\ufb03cient implementations of meshbased algorithms, although possible, are more di\ufb03cult to obtain (Mills et al., 2007). On the other hand, RWPT have very low convergence and very large numbers of particles (of the order of billions (Suciu et al., 2006)) are required to obtain accurate results, which counterbalances its parallel advantages. Finally, high-order multidimensional mesh-based solvers for advection are usually implemented using explicit schemes (Steefel and MacQuarrie, 1996). Explicit solvers have stability limits on the time step size given by the Courant\u2013Friedrichs\u2013Lewy (CFL) condition, \u2206t \u2264 \u2206\/ |v|, where \u2206 is the cell size. Therefore, the stability limit is more restrictive for finer grids and finer discretizations require smaller time steps, hence, computational e\ufb00ort. Since mesh-based multidimensional solvers introduce a global coupling between concentration values, the stability limit is global and given by the maximum velocity in the grid. Thus, it is not possible to take advantage of the irregular velocity distribution to use greater time steps in slower areas of the domain. 16 \f1.4 1.4.1 Lagrangian Numerical Methods Meshless Methods Kernel interpolation methods simulate mass transport using a collection of particles that move according to the velocity field and carry and exchange solute mass with surrounding particles. Particle locations are used as quadrature points to evaluate integral interpolations of variables and their derivatives. Importantly, these schemes are able to incorporate di\ufb00usive e\ufb00ects and mixing without using a grid or mesh, so they are also called meshless methods. Some examples of this type of method are Vortex methods (Cottet and Koumoutsakos, 2000) and particle strength exchange (PSE) method (Degond and MasGallic, 1989a; Zimmermann et al., 2001). Methods based on this approach give accurate and stable results if a remeshing technique is used to control errors that result from irregular spatial particle distributions produced by non-uniform flow fields. The remeshing step introduces numerical dispersion that can be controlled but not completely avoided by using suitable interpolation schemes (Cottet and Koumoutsakos, 2000; Chaniotis et al., 2002). Smoothed Particle Hydrodynamics (SPH) methods are another type of kernel-based interpolation scheme (Gingold and Monaghan, 1977; Lucy, 1977). Cleary and Monaghan (1999) presented a SPH scheme that allows one to solve the multidimensional advectiondispersion equation, assuming isotropic dispersion, using an integral interpolation of the dispersion operator that it is supposed to be less sensitive to particle disorder than traditional kernel interpolation schemes. Since the method can handle dispersion without remapping the concentration field onto a grid, it is free of numerical dispersion and grid orientation e\ufb00ects. As discussed in Chapter 2, a key property of kernel interpolation methods is that they track concentration values, in contrast to RWPT approaches which fundamentally track particles with fixed masses. This feature allows one to evaluate reactions at individual particles (e.g. Chaniotis et al., 2003). Heterogeneous reactions that include the solid (immobile) phase can be handled by introducing additional fixed particles (Tartakovsky et al., 2007). 17 \f1.4.2 Streamline-Based Simulations Streamline-based methods have been successfully used to simulate oil migration (Thiele et al., 1996, 1997) and multidimensional solute transport (Crane and Blunt, 1999; Di Donato and Blunt, 2004; Obi and Blunt, 2004, 2006). These methods use a numerical grid that adapts to the flow field, which reduces numerical dispersion and grid orientation e\ufb00ects. Because of its adaptation to the flow and its ability to minimize numerical dispersion, the method is well suited for simulations of advection-dominated transport as found in heterogeneous porous media (Di Donato et al., 2003). Moreover, the use of streamlines allows the transformation of a multidimensional transport equation to a set of individual one-dimensional transport problems. The numerical solution of the resulting set of one-dimensional transport problems allows the use of more e\ufb03cient numerical solvers, more relaxed stability constraints and it is amenable to parallelization (Crane and Blunt, 1999; Bandilla et al., 2009). Because of the e\ufb03ciency of the method, it is possible to simulate large-scale domains with fine spatial and temporal resolution (Di Donato et al., 2003; Obi and Blunt, 2004, 2006). In addition, chemical reactions, including homogeneous and heterogeneous reactions can be easily handled (Crane and Blunt, 1999; Di Donato and Blunt, 2004). 1.5 Discussion The previous analysis demonstrated that no single traditional numerical method presents the three main features sought in reactive transport simulations. Moreover, one of the conditions, monotonicity, is not satisfied by any of the current methods if anisotropic dispersion is considered. Because of the limitations of current numerical schemes, reactive transport simulations must make some trade-o\ufb00s to obtain practical results. For example, low-order approximations for advection are preferred over more accurate high-order approximations, because they do not su\ufb00er numerical oscillations. Similarly, simulations that include localdispersion assume isotropic dispersion or remove the cross-terms to avoid introducing non-physical artifacts, e.g. negative concentrations. In both cases, monotonicity comes at the cost of tolerating additional numerical errors. In our opinion, most of the problems that a\ufb00ect current numerical methods are caused by the use of a grid or mesh, either to compute approximations of concentrations derivatives 18 \fas in finite di\ufb00erence or finite element methods or, to compute cell averaged concentration values as in RWPT, MOC and other hybrid approaches. As discussed, the use of a single multidimensional grid introduces grid orientations e\ufb00ects due to the non-uniform flow direction, artificial mixing because of the computation of cell averaged concentrations, and global stability restrictions. Therefore, it seems that to overcome many of the problems that plague current numerical schemes, one should develop numerical methods that do not require a rigid multidimensional grid. Numerical methods based on a Lagrangian description of solute transport satisfy that condition and are attractive alternatives to simulate reactive solute transport. Because of their ability to control numerical dispersion and grid orientation e\ufb00ects and their e\ufb03ciency, meshless methods and streamline-based simulations are attractive alternatives for the simulation of reactive transport in natural porous media. However, they also present some deficiencies that can be problematic for their use in reactive transport codes. The standard SPH approximation for di\ufb00usion (Cleary and Monaghan, 1999) can only be used to simulate isotropic dispersion. Therefore, the use of this type of methods in reactive transport modeling in porous media requires deriving new expressions to simulate anisotropic dispersion. Although, approximations for longitudinal dispersion along individual streamlines are straightforward, transverse mixing between streamlines is more di\ufb03cult to simulate. Two approaches have been used to incorporate transverse dispersion in streamline-based simulations. In the first one, solute transport is solved using a flow-oriented grid and transverse dispersion is included as a flux component perpendicular to the streamlines (Frind and Germain, 1986; Frind et al., 1987; Cirpka et al., 1999). This approach has been successfully used in two-dimensional simulations (Frind et al., 1987; Cirpka et al., 1999b), but it has not been extended to three-dimensions. A second alternative consists in using a hybrid approach (Obi and Blunt, 2004). First, advection is solved along streamlines. Then, concentration values are mapped onto a grid where a mesh-based solver is used to solve for dispersion. Finally, concentration values are interpolated back from the grid to the streamlines. The interpolation from and to streamlines introduces some numerical error that is di\ufb03cult to quantify (Obi and Blunt, 2004). Because the interpolation must be done at each time step, the cumulative e\ufb00ect can be important even if an accurate interpolation scheme is used. The limitations of the meshless SPH and streamline-based methods for the simulation 19 \fof multidimensional reactive transport in porous media provide the motivation for the research in this thesis. 1.6 Objectives The main objective of this thesis is to develop, implement, and evaluate new numerical schemes based on meshless methods and streamline-based simulations to simulate reactive transport. The main objective includes the following specific objectives: 1. To derive and implement a meshless approximation for conservative transport in heterogeneous porous media. This includes deriving expressions to approximate isotropic and anisotropic local-scale dispersion. 2. To devise schemes to incorporate local-scale dispersion (longitudinal and transverse) in multidimensional streamline-based simulations. 3. To evaluate the newly derived numerical schemes in terms of accuracy, monotonicity and performance. 4. To compare the new schemes with others current numerical methods such as: highorder finite volume, method of characteristics and random-walk particle tracking methods. 5. To evaluate the suitability of using the new meshless and streamline-based schemes in reactive transport simulations. 1.7 Organization This thesis is organized in four additional chapters and four appendices. Chapters 2, 3, and 4 correspond to manuscripts that have been published or will be submitted for publication. Chapter 2 presents the application of a meshless numerical method based on smoothed particle hydrodynamics (SPH) for the simulation of conservative transport in heterogeneous geological formations assuming isotropic dispersion. The chapter includes analytical and numerical results that demonstrate that the new proposed scheme is stable, 20 \faccurate, and conserves global mass. Appendix A presents details of the derivation of the SPH-based numerical approximation. In Chapter 3, we extend the SPH-based approximation implemented in Chapter 2 to simulate anisotropic dispersion. In addition, we compare the new approximation with another meshless method (particle strength exchange) and a mesh-based finite volume scheme to simulate the dispersion of a two-dimensional contaminant plume under di\ufb00erent scenarios. We conclude that, although attractive to simulate conservative transport, the new SPH-based approximation is unsuitable for reactive transport simulations because of spurious oscillations that arise if the dispersion tensor is anisotropic. The new numerical approximation is based on a SPH approximation for mixed second order derivatives, which is derived in detail in Appendix B. Chapter 4 presents the derivation of a new numerical scheme to incorporate dispersion \u2013 including transverse dispersion \u2013 in streamline simulations. A key element of the method is that dispersion is approximated in a flow oriented grid using a combination of a one-dimensional finite di\ufb00erence scheme and a meshless approximation for isotropic dispersion. We demontrate through analytical and numerical results that the resulting approximation is always monotonic and, hence, suitable for reactive transport simulations. Some key issues that arise in streamline-based simulations such as: streamline tracing, streamline spatial distribution and streamline discretization, are discussed in Appendix D. Finally, Chapter 5 summarizes the main conclusions of the three preceding chapters and includes recommendations for future research directions. 21 \f1.8 References Cleaning Up the Nation\u2019s Wastes Sites: Markets and Technology Trends, Tech. Rep. 542R96005A, U.S. Environmental Protection Agency, 1996. Federal Contaminated Sites Inventory, http:\/\/www.tbs-sct.gc.ca\/fcsi-rscf\/homeaccueil.aspx, retrieved on August 10, 2009. Ahlstrom, S., H. Foote, R. Arnett, C. Cole, and R. Serne, Multicomponent mass transport model: theory and numerical implementation (discrete-parcel-random-walk version), Tech. rep., BNWL-2127, Battelle Pacific Northwest Labs., Richland, Wash.(USA), 1977. Bandilla, K., A. Rabideau, and I. Jankovi\u0107, A parallel mesh-free contaminant transport model based on the Analytic Element and Streamline Methods, Adv. Water Resour., 32 , 1143\u20131153, 2009. Bear, J., Dynamics of fluids in porous media, Dover, 1988. Beckie, R., Scale dependence and scale invariance in hydrology, chap. Analysis of scale e\ufb00ects in large-scale solute-transport models, pp. 314\u2013334, Cambridge University Press, 1998. Benson, D., and M. Meerschaert, Simulation of chemical reaction via particle tracking: Di\ufb00usion-limited versus thermodynamic rate-limited regimes, Water Resour. Res., 44 , 12, 2008. Boggs, J., S. Young, L. Beard, L. Gelhar, K. Rehfeldt, and E. Adams, Field study of dispersion in a heterogeneous aquifer 1. Overview and site description, Water Resour. Res., 28 , 3281\u20133291, 1992. Boris, J., and D. Book, Flux-corrected transport. I. SHASTA, A fluid transport algorithm that works, J. Comput. Phys., 11 , 172\u2013186, 1973. Burnett, R., and E. Frind, Simulation of contaminant transport in three dimensions: 2. Dimensionality e\ufb00ects, Water Resour. Res. WRERAQ, 23 , 695\u2013705, 1987. Celia, M., T. Russell, I. Herrera, and R. Ewing, An Eulerian-Lagrangian localized adjoint method for the advection-di\ufb00usion equation, Water Resour., 13 , 187, 1990. 22 \fChaniotis, A., D. Poulikakos, and P. Koumoutsakos, Remeshed smoothed particle hydrodynamics for the simulation of viscous and heat conducting flows, J. Comput. Phys., 182 , 67\u201390, 2002. Chaniotis, A. K., C. E. Frouzakis, J. C. Lee, A. G. Tomboulides, and K. Poulikakos, D. AU Boulouchos, Remeshed smoothed particle hydrodynamics for the simulation of laminar chemically reactive flows, J. Comput. Phys., 191 , 1\u201317, 2003. Cirpka, O., E. Frind, and R. Helmig, Numerical methods for reactive transport on rectangular and streamline-oriented grids., Adv. Water Res., 22 , 711\u2013728, 1999a. Cirpka, O., E. Frind, and R. Helmig, Numerical simulation of biodegradation controlled by transverse mixing, J. Contam. Hydrol., 40 , 159\u2013182, 1999b. Cirpka, O. A., A. Olsson, Q. S. Ju, M. A. Rahman, and P. Grathwohl, Determination of transverse dispersion coe\ufb03cients from reactive plume lengths, Ground Water, 44 , 212\u2013221, 2006. Cleary, P. W., and J. J. Monaghan, Conduction modelling using smoothed particle hydrodynamics, J. Comput. Phys., 148 , 227\u2013264, 1999. Cottet, G., and P. Koumoutsakos, Vortex methods: Theory and practice., Cambridge University Press, 2000. Cox, R., and T. Nishikawa, A new Total Variation Dimishing scheme for the solution of advective-dominant solute transport, Water Resour. Res., 27 , 2645\u20132654, 1991. Crane, M., and M. Blunt, Streamline-based simulation of solute transport, Water Resour. Res., 35 , 3061\u20133078, 1999. De Simoni, M., J. Carrera, X. S\u00e1nchez-Vila, and A. Guadagnini, A procedure for the solution of multicomponent reactive transport problems, Water Resour. Res., 41 , W11,410, 2005. Degond, P., and S. Mas-Gallic, The weighted particle method for convection-di\ufb00usion equations. Part 1: The case of an isotropic viscosity, Math. Comput., 53 , 485\u2013507, 1989a. Degond, P., and S. Mas-Gallic, The weighted particle method for convection-di\ufb00usion equations. II: The anisotropic case, Math. Comp, 53 , 485,508, 1989b. 23 \fDelay, F., P. Ackerer, and C. Danquigny, Simulating Solute Transport in Porous or Fractured Formations Using Random Walk Particle Tracking: A Review, Vadose Zone J., 4 , 360\u2013379, 2005. Di Donato, G., and M. Blunt, Streamline-based dual-porosity simulation of reactive transport and flow in fractured reservoirs, Water Resour. Res., 40 , 2004. Di Donato, G., E. Obi, and M. Blunt, Anomalous transport in heterogeneous media demonstrated by streamline-based simulation, Geophys. Res. Lett., 30 , 1608, 2003. Edwards, M., and H. Zheng, A quasi-positive family of continuous Darcy-flux finitevolume schemes with full pressure support, J. Comput. Phys., 2008. Freyberg, D., A natural gradient experiment on solute transport in a sand aquifer: 2. Spatial moments and the advection and dispersion of nonreactive tracers, Water Resour. Res, 22 , 2031\u20132046, 1986. Frind, E., and D. Germain, Simulation of contaminant plumes with large dispersive contrast: Evaluation of alternating direction galerkin models, Water Resour. Res. WRERAQ, 22 , 1986. Frind, E., E. Sudicky, and S. Schellenberg, Micro-scale modelling in the study of plume evolution in heterogeneous media, Stoch. Hydrol. Hydraul., 1 , 263\u2013279, 1987. Gingold, R. A., and J. J. Monaghan, Smoothed particle hydrodynamics: Theory and application to non-spherical stars, Mon. Not. R. Astron. Soc., 181 , 375\u2013389, 1977. Ham, P., R. Schottinga, H. Prommerb, and G. Davisc, E\ufb00ects of hydrodynamic dispersion on plume lengths for instantaneous bimolecular reactions, Adv. Water Resour., 27 , 803\u2013813, 2004. Harten, A., and P. Lax, On a class of high resolution total-variation-stable finite-di\ufb00erence schemes, SIAM J. Numer. Anal., pp. 1\u201323, 1984. Herrera, P., and A. Valocchi, Positive solution of two-dimensional solute transport in heterogeneous aquifers, Ground Water, 44 , 803\u2013813, 2006. Hess, K., J. Davis, D. Kent, and J. Coston, Multispecies reactive tracer test in an aquifer with spatially variable chemical conditions, Cape Cod, Massachusetts: Dispersive transport of bromide and nickel, Water Resour. Res., 38 , 1161\u20131177, 2002. 24 \fHill, M., and C. Tiedeman, E\ufb00ective groundwater model calibration: With analysis of data, sensitivities, predictions, and uncertainty, Wiley-Interscience, 2007. Jose, S. C., M. A. Rahman, and O. A. Cirpka, Large-scale sandbox experiment on longitudinal e\ufb00ective dispersion in heterogeneous porous media, Water Resour. Res., 40 , W12,415, 2004. Kitanidis, P. K., The concept of the dilution index, Water Resour. Res., 30 , 2011\u20132026, 1994. Konikow, L., D. Goode, G. Hornberger, and G. Survey, A Three-dimensional Method-ofcharacteristics Solute-transport Model (MOC3D), US Geological Survey, 1996. Le Potier, C., Finite volume monotone scheme for highly anisotropic di\ufb00usion operators on unstructured triangular meshes, Comptes Rendus Math\u00e9matique, 341 , 787\u2013792, 2005. Lichtner, P., S. Kelkar, and B. Robinson, New form of dispersion tensor for axisymmetric porous media with implementation in particle tracking., Water Resour. Res., 38 , 1146, 2002. Lipnikov, K., D. Svyatskiy, and Y. Vassilevski, Interpolation-free monotone finite volume method for di\ufb00usion equations on polygonal meshes, J. Comput. Phys., 228 , 703\u2013716, 2009. Lucy, L., A numerical approach to the testing of the fission hypothesis, Astron. J., 82 , 1013\u20131024, 1977. Mackay, D., D. Freyberg, P. Roberts, and J. Cherry, Natural Gradient Experiment on Solute Transport in a Sand Aquifer: 1. Approach and Overview of Plume Movement, Water Resour. Res. WRERAQ, 22 , 1986. Mayer, K., E. Frind, and D. Blowes, Multicomponent reactive transport modeling in variably saturated porous media using a generalized formulation for kinetically controlled reactions, Water Resour. Res., 38 , 1174, 2002. Mills, R., C. Lu, P. Lichtner, and G. Hammond, Simulating subsurface flow and transport on ultrascale computers using PFLOTRAN, in Journal of Physics: Conference Series, vol. 78, p. 012051, Institute of Physics Publishing, 2007. 25 \fMlacnik, M., and L. Durlofsky, Unstructured grid optimization for improved monotonicity of discrete solutions of elliptic equations with highly anisotropic coe\ufb03cients, J. Comput. Phys., 216 , 337\u2013361, 2006. Molz, F., and M. Widdowson, Internal inconsistencies in dispersion-dominated models that incorporate chemical and microbial kinetics, Water Resour. Res., 24 , 1988. Neuman, S., A Eulerian-Lagrangian numerical scheme for the dispersion-convection equation using conjugate space-time grids, J. Comput. Phys., 41 , 1981. Neuman, S., Adaptive Eulerian-Lagrangian finite element method for advectiondispersion, Int. J. Numer. Meth. Engng., 20 , 321\u201337, 1984. Nordbotten, J., and I. Aavatsmark, Monotonicity conditions for control volume methods on uniform parallelogram grids in homogeneous media, Computat. Geosci., 9 , 61\u201372, 2005. Obi, E., and M. Blunt, Streamline-based simulation of advective-dispersive solute transport, Adv. Water Resour., 27 , 913\u2013924, 2004. Obi, E. I., and M. J. Blunt, Streamline-based simulation of carbon dioxide storage in a North Sea aquifer, Water Resour. Res., 42 , W03,414, 2006. Oya, S., and A. J. Valocchi, Transport and biodegradation of solutes in stratified aquifers under enhanced in situ bioremediation conditions, Water Resour. Res., 34 , 3323\u20133334, 1998. PFLOTRAN, Scaling application parallel performance, http:\/\/ees.lanl.gov\/source\/orgs\/ees\/pflotran\/simscaling.shtml, retrieved on August 12, 2009. Pickens, J., and G. Grisak, Scale-dependent dispersion in stratified granular aquifer., Water Resour. Res., 17 , 1191\u20131211, 1981. Pruess, K., TOUGH2: A general-purpose numerical simulator for multiphase fluid and heat flow, Tech. Rep. LBL-29400 , Lawrence Berkeley National Laboratory, 1991. Rubin, J., Transport of reacting solutes in porous media: Relation between mathematical nature of problem formulation and chemical nature of reactions, Water Resour. Res., 19 , 1983. 26 \fRussell, T., and M. Celia, An overview of research on Eulerian-Lagrangian localized adjoint methods (ELLAM), Adv. Water Resour., 25 , 1215\u20131231, 2002. Salamon, P., D. Fern\u00e0ndez-Garcia, and J. G\u00f3mez-Hern\u00e1ndez, A review and numerical assessment of the random walk particle tracking method., J. Contam. Hydrol., 87 , 277\u2013305, 2006. Steefel, C., and K. MacQuarrie, Approaches to modeling of reactive transport in porous media, Reviews in Mineralogy and Geochemistry, 34 , 85\u2013129, 1996. Steefel, C., and K. Maher, Fluid-rock interaction: A reactive transport approach, Tech. Rep. LBNL1798E, Lawrence Berkeley National Laboratory, 2009. Steefel, C., D. DePaolo, and P. Lichtner, Reactive transport modeling: An essential tool and a new research approach for the Earth sciences, Earth Planet. Sci. Lett., 240 , 539\u2013558, 2005. Suciu, N., C. Vamos, J. Vanderborght, H. Hardelauf, and H. Vereecken, Numerical investigations on ergodicity of solute transport in heterogeneous aquifers, Water Resour. Res, 42 , 1\u201317, 2006. Sudicky, E., A natural gradient experiment on solute transport in a sand aquifer: Spatial variability of hydraulic conductivity and its role in the dispersion process, Water Resour. Res., 22 , 2069\u20132082, 1986. Tartakovsky, A., P. Meakin, T. Scheibe, and B. Wood, A smoothed particle hydrodynamics model for reactive transport and mineral precipitation in porous and fractured porous media, Water Resour. Res., 43 , W05,437, 2007. Thiele, M., R. Batycky, and M. Blunt, Simulating flow in heteroneous systems using streamtube and streamlines, SPE Reservoir Engineering, pp. 5\u201312, 1996. Thiele, M., R. Batycky, and M. Blunt, A streamline-based 3D field-scale compositional reservoir simulator, Soc. Petrol. Eng. J., 1997. Tompson, A., Numerical simulation of chemical migration in physically and chemically heterogeneous porous media, Water Resour. Res., 29 , 3709\u20133726, 1993. Tompson, A., and L. Gelhar, Numerical simulation of solute transport in randomly heterogeneous porous media, Water Resour. Res., 26 , 2541\u20132562, 1990. 27 \fValocchi, A., Validity of the local equilibrium assumption for modeling sorbing solute transport through homogeneous soils, Water Resour. Res., 21 , 1985. Weeks, S., and G. Sposito, Mixing and stretching e\ufb03ciency in steady and unsteady groundwater flows, Water Resour. Res., 34 , 3315\u20133322, 1998. White, M., M. Oostrom, and R. Lenhard, Modeling fluid flow and transport in variably saturated porous media with the STOMP simulator. 1. Nonvolatile three-phase model description, Adv. Water Resour., 18 , 353\u2013364, 1995. Yee, H., R. Warming, and A. Harten, Implicit total variation diminishing (TVD) schemes for steady-state calculations, J. Comput. Phys, 57 , 327\u2013360, 1985. Yeh, G., and V. Tripathi, A critical evaluation of recent developments in hydrogeochemical transport models of reactive multichemical components, Water Resour. Res., 25 , 93\u2013108, 1989. Yuan, G., and Z. Sheng, Monotone finite volume schemes for di\ufb00usion equations on polygonal meshes, J. Comput. Phys., 2008. Zalesak, S., Fully multidimensional flux-corrected transport algorithms for fluids, J. Comput. Phys., 31 , 335\u2013362, 1979. Zheng, C., and S. M. Gorelick, Analysis of solute transport in flow fields influenced by preferential flowpaths at the decimeter scale, Ground Water, 41 , 142\u2013155, 2003. Zheng, C., and P. Wang, MT3DMS: A Modular Three-Dimensional Multispecies Transport Model for Simulation of Advection, Dispersion, and Chemical Reactions of Contaminants in Groundwater Systems; Documentation and User\u2019s Guide, Contract Report SERDP-99-1, US Army Engineer Research and Development Center, Vicksburg, MS , 1999. Zimmermann, S., P. Koumoutsakos, and W. Kinzelbach, Simulation of pollutant transport using a particle method, J. Comput. Phys., 173 , 322\u2013347, 2001. 28 \fChapter 2 A Meshless Method to Simulate Solute Transport in Heterogeneous Porous Media1 2.1 2.1.1 Introduction Background Contaminant transport in natural aquifers is a complex, multiscale process that is frequently studied using numerical methods. Conservative solute transport is typically modeled using the advection-dispersion equation (ADE). Despite the large number of available numerical methods that have been developed to solve it, the accurate numerical solution of the ADE still presents formidable challenges. In particular, current numerical solutions of multidimensional advection-dominated transport in non-uniform velocity fields are a\ufb00ected by one or all of the following problems: numerical dispersion that introduces artificial mixing and dilution, grid orientation e\ufb00ects, and unphysical numerical oscillations (Herrera and Valocchi, 2006). To correctly capture the basic mechanisms that control conservative solute transport in natural aquifers an ideal numerical method should be able to: (i) accurately capture 1 A version of this chapter has been published. P. Herrera, M. Massabo, and R. Beckie (2009) A meshless method to simulate solute transport in heterogeneous porous media. Adv. Water Resour., 32:413\u2013429. 29 \fthe e\ufb00ect of small-scale velocity fluctuations upon solute distribution, (ii) simulate the e\ufb00ect of small values of local-scale dispersion in advection-dominated transport, (iii) reproduce small-scale concentration fluctuations and (iv) allow the e\ufb03cient simulation of problems at moderate to large scales. In what follows we only discuss numerical methods to simulate conservative solute transport but the same set of requirements should be satisfied by any successful numerical method used to simulate reactive transport. The objective of this paper is to develop and test a meshless method to simulate contaminant transport in porous media. This work was primarily motivated by our experience in theoretical investigations of solute mixing and plume dilution in heterogeneous porous media. Those investigations require an e\ufb03cient numerical method that is able to accurately simulate solute transport in multidimensional non-uniform velocity fields. We are also interested in developing a meshless method that can be used to simulate conservative and non-conservative solute transport with minimum modification. The main contributions of this paper are: (i) to derive a meshless approximation for the dispersion operator in heterogeneous porous media flow, (ii) to compare the meshless approximation with other numerical methods traditionally used to simulate conservative solute transport in heterogeneous multidimensional velocity fields, (iii) to study the convergence properties of the meshless approximation of the dispersion operator for di\ufb00erent spatial node distributions, and (iv) to demonstrate that the proposed meshless approximation can be used to solve the ADE in di\ufb00erent scenarios ranging from advection-dominated to dispersion-dominated solute transport with accuracy better than or comparable to standard numerical methods. Although we address only conservative transport in this paper we highlight the advantages of the proposed scheme for simulating reactive transport. 2.1.2 Numerical Methods A detailed discussion of every numerical method used to solved the ADE is beyond the scope of this manuscript, however we briefly discuss some of them to motivate the development of our new meshless method. Grid or mesh-based methods such as finite di\ufb00erence, finite volume or finite element methods are relatively easy to implement, their convergence, stability and accuracy properties are well understood, and it is possible to develop formulations that are mass conservative. On the other hand, mesh-based methods have di\ufb03culty in accurately simulating 30 \fmultidimensional advection-dominated problems because of numerical dispersion that introduces excessive artificial mixing and dilution of the contaminant plume. Therefore, grid-based methods are only advised for problems with low P\u00e9clet number (Zheng and Wang, 1999). Hybrid schemes were developed to address the limitations of grid-based methods. The following hybrid schemes are based on the same general concept \u2013 the use of streamlines or particles to handle advection and a grid-based method to handle dispersion: hybrid Eulerian-Lagrangian methods (Neuman, 1981, 1984), method of characteristics (MOC) and hybrid method of characteristics (HMOC) in the popular MT3DMS (Zheng and Wang, 1999) and MOC3D (Konikow et al., 1996), Eulerian-Lagrangian localized adjoint methods (ELLAM) (Celia et al., 1990; Russell and Celia, 2002), and three-dimensional hybrid streamline-grid approaches (Obi and Blunt, 2004). At each time step, these methods solve the advection\u2013dispersion equation in two steps. First, changes in concentrations due to advection are computed using some suitable scheme such as particle-tracking or by solving the transport equation along streamlines. Then, concentration values are interpolated onto a grid. Next, grid concentration values are used to solve for dispersion, and eventually reactions, using some traditional mesh-based solver. Multiple variations of this approach exist depending on the interpolation methods and tracking algorithm. However, all of them require mapping concentrations between cell centers and particle locations or streamline nodes. This remapping step introduces numerical dispersion that is di\ufb03cult to quantify and control in multidimensional simulations. Moreover, the numerical dispersion due to the remapping step is more important in simulations with large grid P\u00e9clet number where the e\ufb00ect of dispersion is not enough to smooth the sub-grid scale concentration distribution. The limitations of grid-based and hybrid methods to simulate advection dominated problems have motivated the development of Lagrangian and meshless methods including those based on a random-walk and those based on integral interpolations. Random-walk particle-tracking methods (RWPT) have long been used to simulate conservative solute transport in porous media (Ahlstrom et al., 1977; Smith and Schwartz, 1980; Pickens and Grisak, 1981). In this type of model, solute mass is distributed among a set of particles that move carried by the flow velocity and by a random drift that models dispersive transport (Delay et al., 2005; Salamon et al., 2006). Solute concentrations are estimated by averaging the mass contained in the particles found in some specified volume. Therefore, concentration values depend upon the total number of particles, size of the averaging volume, and spatial particle distribution. The numerical precision of 31 \fthe computed concentration is limited by the finite number of particles used in a simulation and the calculated concentration usually exhibits numerical oscillations that can be amplified in presence of non-linear reactions (Tompson and Dougherty, 1992; Tompson, 1993). Therefore, the use of the method is limited to conservative transport or to reactive transport simulations with simple reactions that can be modeled by changing the state or phase of individual particles, e.g. sorption (Valocchi and Quinodoz, 1989). The popularity of RWPT is due to its natural capacity to accurately simulate advection, ease of implementation, and relatively moderate computational requirements. Because of its advantages RWPT has become the de facto standard method used in numerical studies of plume spreading and dilution. In contrast to RWPT methods that simulate dispersion in a fluid by a random movement of particles that carry solute mass, kernel interpolation methods simulate mass transport using a collection of particles that move according to the velocity field and carry and exchange solute mass with surrounding particles. Particle locations are used as quadrature points to evaluate integral interpolations of variables and their derivatives. Importantly, these schemes are able to incorporate di\ufb00usive e\ufb00ects and mixing without using a grid or mesh, so they are also called meshless methods. Some examples of this type of method are vortex methods (Cottet and Koumoutsakos, 2000) and particle strength exchange (PSE) method (Degond and Mas-Gallic, 1989a). Zimmermann et al. (2001) present, to the best of our knowledge, the only application of this type of method to simulate solute transport in porous media at the continuum scale. Their results indicate that the method gives accurate and stable results for the flow configuration considered if a remeshing technique is used to control errors that result from irregular spatial particle distributions. As in other methods, the remeshing step introduces numerical dispersion that can be controlled but not completely avoided by using a suitable interpolation scheme (Cottet and Koumoutsakos, 2000; Chaniotis et al., 2002). Smoothed particle hydrodynamics (SPH) methods are another type of kernel-based interpolation scheme (Gingold and Monaghan, 1977; Lucy, 1977). Cleary and Monaghan (1999) presented a SPH scheme that allows one to solve the multidimensional ADE using an integral interpolation of the dispersion operator that is less sensitive to particle disorder than traditional kernel interpolation schemes. Since the method can handle dispersion without remapping the concentration field onto a grid, it is free of numerical dispersion and grid orientation e\ufb00ects. As we show later, a key property of SPH is that the method tracks concentration values, in contrast to RWPT approaches which fundamentally track particles with fixed masses. This feature of SPH allows one to simulate 32 \freactive transport directly with individual particles (e.g. Chaniotis et al., 2003). We next propose a method to simulate solute transport in porous media based on the SPH formalism. We show that this SPH-based method is advantageous because of its inherent ability to solve advection, its capacity to approximate dispersion in a meshless fashion, and its ability to reproduce smooth fine-scale concentration distributions appropriate for reactive transport simulations. After deriving the method in Section 2.2, we compare and contrast it to a conventional RWPT method and other traditional mesh-based methods in Section 2.3. 2.2 Monte Carlo SPH method In application of meshless methods such as SPH it is appropriate to reformulate the ADE in terms of a Lagrangian coordinate system as \ufffd dr = v (r) dt dC \ufffd\ufffd \ufffd = \u2207 \u00b7 (D\u2207C)|r dt \ufffdr (2.1) (2.2) where C is the solute concentration, D is the local-scale dispersion tensor, v is the pore water velocity, and r is the position vector of a small fluid volume or material point. As we describe next, in SPH methods the concentration field is represented using a set of particles that carry concentration information and are distributed through the domain \u2013 even in areas where solute concentration is zero. Practically all meshless methods including SPH use a particle-tracking approach to integrate (2.1) in the same way as done in RWPT (Delay et al., 2005; Salamon et al., 2006). The key distinction between SPH and RWPT is how dispersion is approximated. In SPH methods, dispersion \u2013 the solution of equation (2.2) \u2013 is evaluated using a kernel interpolation approximation. The \u201csmoothed\u201d in SPH comes from the representation of a scalar or vector field by a smoothed integral interpolation. The smoothed interpolation AS (r) of a field A(r) is defined as the integral (Gingold and Monaghan, 1977) AS (r) = \u02c6 A(r\ufffd )W (r \u2212 r\ufffd , h) dr\ufffd 33 (2.3) \fwhere W (r \u2212 r\ufffd , h) is a kernel function with compact support around r and smoothing length h that satisfies some normalization properties (Gingold and Monaghan, 1977). Spline polynomials with finite support are usually used as kernel functions because of their practical advantages (Price, 2004). For those functions the compact support volume of the kernel depends upon h. Figure 2.1 shows values of the Gaussian and cubic-spline kernels and their derivatives as function of the smoothing length. 0.0 0.6 \u22120.2 W(r\/h) W\u2019(r\/h) 0.8 0.4 \u22120.4 0.2 \u22120.6 0.0 \u22120.8 \u22123 \u22122 \u22121 0 1 2 3 \u22123 \u22122 \u22121 r\/h 0 1 2 3 1 2 3 r\/h 1.0 0.5 0.0 \u22120.5 \u22121.0 \u22121.5 \u22122.0 W\u2019\u2019(r\/h) 0.0 F(r\/h) \u22120.5 \u22121.0 \u22121.5 \u22122.0 \u22123 \u22122 \u22121 0 1 2 3 \u22123 \u22122 r\/h \u22121 0 r\/h Figure 2.1: Kernel function W, first derivative W\u2019, second derivative W\u2019\u2019 and symmetric F function defined in Appendix A, for Gaussian (solid line) and cubic spline (dashed line) kernels. The numerical approximation of AS can be evaluated using a Monte Carlo integration scheme by sampling the integrand A(r)W (r) at a limited set of disordered points or particle locations. To evaluate the integral one must consider that the set of scattered points is not uniformly distributed, therefore their spatial distribution must be explicitly taken into account in the integral evaluation to get the following modified form of (2.3), As (r) = \u02c6 A(r\ufffd ) W (r \u2212 r\ufffd ) p(r\ufffd )dr\ufffd \ufffd p(r ) 34 (2.4) \fwhere p(r) is the probability density of finding a particle in a given unit volume with units of one over volume [1\/L3 ] (Gingold and Monaghan, 1982; Tartakovsky and Meakin, 2005). Thus, p(r)dr can be interpreted as a non-uniform density to sample the modified integrand A(r)W (r)\/p(r) (Press et al., 1992, p. 316). The exact evaluation of p(r) for a set of scattered points in multiple dimensions is a very di\ufb03cult task, but it can be estimated using a density estimation by kernels approach (Schaback and Wendland, 2006), which yields, Np 1 \ufffd p(r) = W (r \u2212 rj ) Np j=1 (2.5) Finally, the Monte Carlo approximation of (2.4) is \uf8eb \uf8f6 Np 1 \ufffd A(rj )W (r \u2212 rj ) 1 AN (r) = \u00b1 O \uf8ed\ufffd \uf8f8 Np j p(rj ) Np (2.6) where Np is the total number of points that e\ufb00ectively contribute to the integral. This last expression is a valid approximation of the integral for any set of scattered points. We note that in practice the error estimate in (2.6) is an upper bound and that the actual error also depends upon p(r), i.e. the spatial distribution of the points, and the local smoothness properties of A. For example, numerical studies have shown that the actual error is much smaller for points that are reasonably well distributed (Cleary and Monaghan, 1999; Monaghan, 2005). Traditional SPH simulations used to solve hydrodynamics equations consider that the set of locations rj represent the positions of a set of fluid particles with constant mass mj . In that case, the fluid mass density \u03c1(r) is proportional to the particle density p(r) and it can be estimated by using an expression similar to (2.5) where the mass of individual particles appears explicitly (Monaghan, 1992, 2005). We note that the formulation given by (2.5) and (2.6) is equivalent to the standard SPH formulation if the total mass in the system is one and it is uniformly distributed among particles. This is consistent with SPH simulations where, in general, the fluid mass assigned to each particle is considered as a constant scaling parameter that is set at the beginning of individual simulations to tune the spatial fluid density distribution (Dilts, 1999). 35 \fThere are two SPH approaches to approximate transport equations involving second order derivatives. First, second order derivatives can be easily evaluated by di\ufb00erentiating (2.6). The resulting expression involves the second derivative of the kernel, so it is very sensitive to particle disorder (Cleary and Monaghan, 1999). In that case particle positions must be periodically reinitialized on a regular lattice to achieve acceptable accuracy (Chaniotis et al., 2002). A second approach is based on an integral approximation of the dispersive fluxes that depends only upon the first derivative of the kernel (Brookshaw, 1985; Cleary and Monaghan, 1999). Considering isotropic dispersion, i.e. D(r) = D(r)I, where I is the identity matrix, the approximation of (2.2) is Np dCi 1 \ufffd 1 (Dj + Di ) (Cj \u2212 Ci ) F (rj \u2212 ri ) = dt Np j=1 pj (2.7) where Ci is the solute concentration at position ri and F (rj \u2212 ri ) is a function of the separation vector and first derivative of the kernel that has spherical symmetry. Appendix A presents the derivation of (2.7). Equation (2.7) indicates that the magnitude of the contribution of solute from particle j to particle i is equal to the contribution of particle j to particle i, i.e. the mass flux is antisymmetric fij = \u2212fji , only if pi = pj . In general, for a set of irregularly spaced particles pi \ufffd= pj , so (2.7) does not satisfy a basic property of the dispersion operator (Kuzmin and Turek, 2002). Thus, it is necessary to replace the denominator by a symmetric approximation of the form p\u02c6ij = g(pi , pj ), e.g. arithmetic or harmonic average. In general, this correction is relatively small because particles that e\ufb00ectively contribute to the summation are within few smoothing lengths due to the compact support property of the kernel. Similar corrections to recover symmetry are used in standard SPH simulations that consider variable smoothing lengths (Monaghan, 2005). Our MC-SPH method is based upon this formulation to approximate dispersive fluxes that results in Np dCi 1 \ufffd 1 (Dj + Di ) (Cj \u2212 Ci ) F (rj \u2212 ri ) = dt Np j=1 p\u02c6ij (2.8) We refer to this approximation as the Monte Carlo SPH (MC-SPH) formulation for dispersion. Equation (2.8) satisfies two important physical constraints. First, dispersive fluxes are anti-symmetric. Second, mass transfer occurs from higher to lower concentrations because for typical kernels, F (rj \u2212 ri ) < 0 as shown in Figure 2.1. 36 \fIn standard SPH simulations there is another approach to recover the symmetry of the fluxes that consists in including the fluid density on the right hand side of (2.2). In this case, density is placed inside operators following the \u201csecond golden rule of SPH\u201d (Monaghan, 1992). The resulting numerical approximation is N p dCi \ufffd mj (\u03c1j Dj + \u03c1i Di ) (Cj \u2212 Ci ) F (rj \u2212 ri ) = dt j=1 \u03c1i \u03c1j (2.9) where \u03c1i is the numerical approximation of the fluid mass density at position ri . Equation (2.9) is the standard SPH approximation for dissipative or dispersive transport and it has been used to simulate heat conduction in compressible gases (Cleary and Monaghan, 1999; Espa\u00f1ol and Revenga, 2003; Jubelgas et al., 2004); to simulate viscous e\ufb00ects in low Reynolds number flows (Morris et al., 1997; Zhu et al., 1999); and to simulate solute dispersion at the pore scale (Zhu and Fox, 2002; Tartakovsky and Meakin, 2005). In what follows we refer to this approximation as weakly compressible SPH (WC-SPH) formulation for dispersion. Although this approach is reasonable in simulations that consider variable fluid density so that density must be explicitly incorporated inside the dispersion operator, its use in incompressible flow simulations with constant density is, at least, questionable. Moreover, as shown by equation (2.8), it is not necessary to use such a pragmatic approach to develop a numerical formulation that satisfies basic physical principles and conserves solute mass. We close this section by summarizing the main distinctive properties of the MC-SPH formulation. The approach considers that fluid particles represent a constant fluid volume larger than a representative elementary volume (REV) such that Darcy\u2019s velocities can be defined and that particle trajectories can be computed by integrating (2.1). Solute mass is distributed among a set of particles that carry concentration values. Local-scale dispersion that occurs at scales much smaller than the REV, is modeled as a Fickian solute mass transfer process between particles. Numerically, local-dispersion is approximated by a local integral interpolation of the dispersion operator in (2.2). We note that the particle fluid volume does not explicitly appear in the numerical formulation and that, from a practical point of view, fluid particles can be regarded as numerical nodes. 2.2.1 Time Integration The time integration of the system of equations (2.1) and (2.2) requires the use of a sequential procedure. First, at the beginning of each time step node locations and con37 \fcentrations are recorded. Then, new locations are calculated by integrating (2.1) using an explicit time-marching scheme (e.g. Runge\u2013Kutta methods) or a particle-tracking algorithm (e.g. Pollock, 1988). After the new locations are computed, new concentrations are calculated by integrating (2.2). This term can be integrated using explicit or implicit schemes. For example, using a first-order approximation it can be approximated by \ufffd \ufffd Cit+\u2206t \u2212 Cit \ufffd = \u03b1ij Cj\u2217 \u2212 Ci\u2217 \u2206t j (2.10) where \u03b1ij = 1 (Di + Dj ) F (rj \u2212 ri ) \u2265 0 p\u02c6j (2.11) where Ci\u2217 = Cit or Ci\u2217 = Cit+\u2206t for explicit and implicit time integration, respectively. Then, the first-order implicit approximation is given by \uf8eb \uf8ed1 + \u2206t \ufffd j \uf8f6 \u03b1ij \uf8f8 Cit+\u2206t \uf8eb \u2212 \uf8ed\u2206t \ufffd j \uf8f6 \u03b1ij \uf8f8 Cjt+\u2206t = Cit (2.12) It is easy to demonstrate that this integration scheme is unconditionally stable and positivity preserving. Although possible, implicit schemes are seldom used because of computational overhead. Since nodes move with the flow, the connectivity list, i.e. the number of nodes within the kernel support volume of a given node changes at each time step. The memory requirements to store the associated matrix and the computational cost to generate it and computing its inverse can be quite large, depending upon the average number of nodes per smoothing length. That is why we used conditionally stable explicit time integration schemes in the simulations presented in Section 2.3. We motivate the discussion about the stability of explicit schemes by writing the first-order explicit approximation of (2.10) \uf8eb Cit = \uf8ed1 \u2212 \u2206t \ufffd j \uf8f6 \uf8eb \u03b1ij \uf8f8 Cit + \uf8ed\u2206t \ufffd \ufffd j \uf8f6 \u03b1ij \uf8f8 Cjt (2.13) which is stable and positivity preserving if 1\/ \u03b1ij \u2265 \u2206t. Empirical tests have shown that other explicit solutions are stable for time steps \u2206t such that (Cleary and Monaghan, 1999) 38 \f\u2206t \u2264 \ufffdh2 D (2.14) where \ufffd is a coe\ufb03cient that depends upon the kernel function. In our simulations we used a cubic-spline kernel and \ufffd = 0.1 to get stable results using an explicit second-order Runge\u2013Kutta scheme. From a physical point of view, equation (2.12) indicates that the time step must be smaller than a dispersion time scale given by the dispersion coe\ufb03cient and the kernel support volume. 2.2.2 Accuracy and Spatial Resolution Errors in meshless approximations based on kernel interpolants come from two sources (Brackbill, 2005; Quinlan et al., 2006). The integral interpolation in (2.3) introduces a smoothing error that depends on the shape and smoothing length of the kernel. Additionally, there is a numerical integration error that depends upon the number and location of the nodes and the smoothness of the real function (Schaback and Wendland, 2006). There is a tradeo\ufb00 between both sources of error because the accuracy of the smoothed quantity increases as the smoothing length decreases, while the numerical integration error increases as the number of nodes per support volume decreases. Therefore, the only way to simultaneously reduce both sources of error is to decrease the smoothing length while increasing the total number of nodes to keep the same average number of nodes per support volume. In general, for a given function and node distribution there is a critical smoothing length hc such that for h > hc the smoothing error dominates and that for h < hc the integration error is more important. The determination of hc for irregularly spaced points is very di\ufb03cult, if not impossible. The numerical integration error also depends upon the regularity of the node distribution. Meshless approximations such as SPH methods produce very accurate results in situations where particles are regular or uniformly distributed (Monaghan, 2005). In those situations the error a\ufb00ecting the simulation is much smaller than the theoretical error estimate of (2.6) which considers a random particle distribution (Monaghan, 2005). When particles are uniformly distributed the leading error term is due to the interpolation error and is controlled by the kernel smoothing length that sets the spatial resolution. For example, numerical studies have shown that for a set of equispaced particles the error for (2.9) converges with h2 (Cleary and Monaghan, 1999). 39 \fThe previous discussion indicates that the accuracy of the MC-SPH method to simulate local-dispersion will evolve during the simulation. At early times the node distribution is similar to the initial regular distribution, so the leading error term is due to the interpolation approximation. As nodes are redistributed in space by the non-uniform flow velocity, they become clustered in di\ufb00erent zones, so the numerical integration error becomes much more important. Then, the accuracy of the method during the simulation must be controlled by an appropriate choice of the kernel smoothing length and the number of nodes per kernel support volume or initial average spacing. The choice of those parameters is not trivial, particularly in multidimensional simulations, and requires some trial and error. In the simulations presented below, we selected those parameters using the following steps: (i) setup an initial node configuration, (ii) simulate advection only, (iii) check node distribution and, particularly, number of nodes per kernel support volume, (iv) if node distribution was considered too sparse, increase the initial number of nodes, (v) repeat until an acceptable final node distribution is produced. Because particle tracking is very e\ufb03cient, the determination of the optimum initial node configuration demanded little time and e\ufb00ort relative to the overall simulation time. 2.2.3 Mass Conservation In the proposed MC-SPH scheme solute mass is distributed in space as a finite set of concentration values at node positions, thus the total mass in the system equal to the integral of the concentration over the domain can be approximated as M= \u02c6 \u2126 \uf8eb \uf8f6 1 C(r)dr \u2248 \ufffdC\ufffd V + O \uf8ed \ufffd \uf8f8 Np (2.15) where we have used a Monte Carlo integration approach and V is the volume of the domain \u2126. As discussed above, the accuracy of the integral depends upon the total number of points Np and their spatial distribution. In most practical SPH simulations the number of particles is quite large and (2.15) is a good approximation. Therefore, we can study the evolution of the total solute mass in the system by writing Np dM d \ufffdC\ufffd V \ufffd dCi \u2248V = dt dt Np i=1 dt 40 (2.16) \fFinally, substituting expression (2.10) used to compute the temporal derivative of the concentration, we get dM V \ufffd\ufffd = \u03b1ij (Cj \u2212 Ci ) = 0 dt Np i j (2.17) since \u03b1ij = \u2212\u03b1ji , and thus solute mass is globally conserved. In the analyses that follow we use this expression to characterize mass balance. 2.3 Numerical evaluation of the MC-SPH method To test the capacity of the MC-SPH method to provide reasonably accurate solutions for dispersive transport we compare it with the analytical solutions of simple one- and two-dimensional dispersion problems and with other numerical solutions for simulating advective-dispersive transport in non-uniform velocity fields. 2.3.1 One-Dimensional Dispersion We consider a simple one-dimensional problem to illustrate the behavior of the error a\ufb00ecting our new MC-SPH approximation in (2.8) as function of the particle distribution and smoothing length. We simulate the dispersion of a one-dimensional Gaussian plume where the concentration as function of position and time is given by C(x, t) = C0 s0 \u2212(x\u2212x2 0 )2 e 2s s (2.18) \ufffd where s = s20 + 2Dt, C0 is the maximum initial concentration, s0 is a constant that controls the size of the initial plume, and x0 is the position of the plume center. Particles were initially distributed over a regular equispaced grid with spacing \u2206x. To study the e\ufb00ect of the particle distribution, we generated a non-uniform particle distribution by adding a normally distributed perturbation with standard deviation \u03c3. Then, we computed the numerical solution using a Gaussian kernel with cuto\ufb00 at 4h, i.e. only particles within 4h contribute to the kernel summation. The error introduced by this approximation is small because of the rapid fallo\ufb00 of the Gaussian function. 41 \fFigure (2.2) shows the maximum normalized error defined as error = \ufffdCN umerical \u2212 CAnalytical \ufffd2 \/N (2.19) where N = Np is the number of particles, versus h for two di\ufb00erent ratios \u2206x\/h for solutions computed using our MC-SPH and the traditional WC-SPH, formulations. For uniform particle distribution (i.e., \u03c3\/\u2206x = 0) and \u2206x\/h = 0.66 the error increases as h2 . As particles become disordered the error increases for any value of h. Particle disorder is less important for large smoothing lengths and errors for di\ufb00erent \u03c3 are similar. Larger values of the ratio \u2206x\/h, which is equivalent to fewer particles per support volume, produces larger error even for the uniform particle distribution. For large particle disorder (\u03c3\/\u2206x = 1) the interpolation error is dominant and the error of the numerical solutions is almost independent of h. Figure (2.2) also shows that the use of the new MC-SPH approximation instead of the standard WC-SPH does not make a di\ufb00erence as both solutions produce results with similar accuracy. 2.3.2 Two-Dimensional Dispersion In this section we consider the simulation of the dispersion of a two-dimensional Gaussian plume using the RWPT and MC-SPH numerical methods. Despite the fact that both methods are based on a Lagrangian formulation of the solute transport problem and use a particle-tracking algorithm to integrate the advection equation, there are important di\ufb00erences in their conceptual approaches, accuracy, numerical implementation, and computational performance that must be considered to evaluate their merits. Table 2.1 summarizes the main di\ufb00erences between both methods and Appendix C gives details about our implementation of the RWPT method. To make things simple we assume that the Gaussian plume is within a square twodimensional domain and that the maximum concentration, C0 , occurs at the center of the domain. In this case, the concentration as function of position and time is given by C(x, y, t) = C0 s20 \u2212(x\u2212x2 0 )2 \u2212 (y\u2212y20 )2 2s e 2s s2 (2.20) To calculate a reasonable value for the local-dispersion coe\ufb03cient we assume a pore water velocity v = 10\u22127 m\/s and dispersivity \u03b1 = 1 cm which results in a local-dispersion 42 \f\u22121 10 \u22122 10 \u22123 Error 10 \u22124 10 MC \u03c3\/\u0394x = 1 WC \u03c3\/\u0394x = 1 MC \u03c3\/\u0394x = 0.3 WC \u03c3\/\u0394x = 0.3 MC \u03c3\/\u0394x = 0.1 WC \u03c3\/\u0394x = 0.1 \u03c3\/dx = 0 \u22125 10 \u22126 10 \u0394x\/h=1.0 \u22127 10 \u22123 10 \u22122 10 h \u22121 10 \u22121 10 \u22122 10 \u22123 Error 10 \u22124 10 MC \u03c3\/\u0394x = 1 WC \u03c3\/\u0394x = 1 MC \u03c3\/\u0394x = 0.3 WC \u03c3\/\u0394x = 0.3 MC \u03c3\/\u0394x = 0.1 WC \u03c3\/\u0394x = 0.1 \u03c3\/\u0394x = 0 \u22125 10 \u22126 10 \u22127 10 \u22123 10 \u0394x\/h=0.66 \u22122 10 h \u22121 10 Figure 2.2: Error for one-dimensional simulations as a function of the smoothing length h for Monte Carlo (MC) and Weakly Compressible (WC) formulations defined by equations (2.8) and (2.9), respectively. Error magnitude is shown for di\ufb00erent ratios of particle spacing over smoothing length \u2206x\/h and for di\ufb00erent perturbations over particle spacing, \u03c3\/\u2206x. Uniform particle spacing corresponds to \u03c3\/\u2206x = 0. 43 \fMC-SPH Particles carry solute concentration It is possible to compute chemical reactions at individual particles It is more complex to implement full dispersion tensor Numerical precision to represent concentration values up to hardware representation Simulates solute mass transfer between particles It demands more computational e\ufb00ort but it is possible to get very good accuracy with moderate use of memory RWPT Particles carry solute mass Chemical reactions must be evaluated at some cell scale It is easy to implement full dispersion tensor Numerical precision to represent concentration values given by number of particles Simulates solute mass transfer at cell scale It demands less computational e\ufb00ort but it requires more memory to get higher accuracy Table 2.1: Comparison of MC-SPH and RWPT methods. coe\ufb03cient equal to D = v \u00b7 \u03b1 = 10\u22129 m2 \/s. We consider that the plume is centered in a square domain of side L = 100 m and that s0 = 5 m, so that boundary e\ufb00ects are negligible. To integrate the solution in time we use a time step \u2206t = 11.6 days and we consider a total simulation time T = 500\u2206t = 15.9 years. We performed a series of simulations to evaluate the relative performance and convergence properties of the RWPT and our MC-SPH methods. First, we solved the problem using a RWPT method with di\ufb00erent combinations of averaging volumes and number of particles to represent the mass in the cell with the maximum concentration as summarized in Table 2.2. Then, we simulated the same situation using MC-SPH considering di\ufb00erent combinations of number of particles and kernel smoothing length which defines the average number of particles per kernel support volume as summarized in Table 2.3. We note that the direct comparison of both methods is di\ufb03cult because of the di\ufb00erences in the way they calculate concentrations that result in di\ufb00erent spatial resolutions and accuracies for the same number of particles. For example, particles in the RWPT simulations are only located within the plume edges while in MC-SPH simulations particles, as explained below, must cover a larger area. In the MC-SPH simulations presented here particles are quasi-randomly distributed in all the domain. However, it would be possible to improve the spatial resolution by distributing the same number of particles in a smaller area. Nevertheless, we believe that the results presented next constitute a fair comparison of both methods. 44 \fSimulation # cells Nr Np RW1 50 x 50 10 329 RW2 50 x 50 100 3,957 RW3 50 x 50 1000 40,713 RW4 100 x 100 10 1,257 RW5 100 x 100 100 15,345 RW6 100 x 100 1000 157,972 RW7 200 x 200 10 4,993 RW8 200 x 200 100 60,965 RW9 200 x 200 1000 627,153 Table 2.2: Parameters used in RWPT simulations: number of cells used to calculate concentrations, number of particles used to represent the mass within the cell with maximum concentration Nr , and total number of particles Np . Simulation h Np Nk SPH1 0.5 10,000 3 SPH2 0.5 20,000 6 SPH3 0.5 40,000 13 SPH4 0.5 60,000 19 SPH5 0.5 80,000 25 SPH6 1.0 10,000 13 SPH7 1.0 20,000 25 SPH8 1.0 40,000 50 SPH9 1.0 60,000 75 SPH10 1.0 80,000 101 SPH11 2.0 10,000 50 SPH12 2.0 20,000 101 SPH13 2.0 40,000 201 SPH14 2.0 60,000 302 SPH15 2.0 80,000 402 Table 2.3: Parameters used in SPH simulations: smoothing length h, total number of particles Np , and average number of particles per kernel support volume Nk . 45 \f2.3.2.1 Initial particle and concentration distribution To apply the RWPT method to this problem we must first map the spatial concentration distribution to a regular Cartesian grid. Next, we must set the number of particles that represent a given mass to compute the equivalent particle distribution. In this example we use di\ufb00erent numbers of particles to represent the mass contained in the cells with highest concentration value. Particles within each cell are initially distributed using a quasi-random distribution to generate a uniform spatial coverage. Figure 2.3 shows the corresponding particle distribution and the equivalent cell concentrations for some example configuration. We note that particles are only present in cells where concentration values are greater than some numerical threshold equal to the ratio between the mass of individual particles and the cell volume (see Appendix C for details). Because of the averaging procedure used to compute cell concentrations, the maximum cell concentration value is less than C0 . Similar di\ufb00erences between cell values and actual concentrations occur in the rest of the domain and they are relatively more important near the plume edges where cells contain fewer particles. Figure 2.3: In RWPT simulations concentration values are approximated according to the spatial distribution of particles. The left figure show the initial particle distribution corresponding to a Gaussian plume with maximum concentration C0 at the domain center. The right figure shows concentration values computed according to the number of particles in each cell. The initialization of particle positions and concentration values in SPH simulations are independent. Particle positions are assigned such that the resulting particle distribution covers the region of interest. For example, given an initial Gaussian plume and the same number of particles as used in Figure 2.3, particles can be quasi-randomly distributed in a 46 \frectangular volume or distributed in a uniform rectangular lattice within a circular region as shown in Figure 2.4. We observe that the maximum concentration value is within 0.1% of the actual maximum concentration value C0 in both cases. This shows that the MCSPH method provides a better numerical resolution to represent concentration values than the RWPT using the same number of particles. In this simple example, particles are only created within a region of the numerical domain where concentrations are greater than a given threshold value plus a surrounding bu\ufb00er zone. The bu\ufb00er zone is necessary to provide additional space to allow dispersion to distribute the initial solute mass in a larger volume. In real simulations it is important to prevent the existence of isolated particles with non-negligible concentration at the edge of the particle cloud to avoid numerical errors. There are three possible alternatives to control this source of error: (i) generate a particle distribution that covers all the domain, (ii) use a dynamical scheme that inserts particles as needed, (iii) generate an initial particle distribution with a bu\ufb00er zone large enough to guarantee an appropriate particle distribution during the simulation. The first alternative is very simple to implement but it can become prohibitively expensive in large-scale simulations or in simulations that require fine-spacing between particles. The second solution works well but it is more di\ufb03cult to implement and introduces some computational overhead because it requires more sophisticated data structures to store and manage the particle set. The third alternative combines the advantages of the other two because it is very easy to implement and requires fewer particles than the first option. Figure 2.4: In MC-SPH simulations concentration values are directly assigned to each particle. Figures show two possible initial particle distributions and corresponding concentration values equivalent to a Gaussian plume with maximum concentration C0 at the domain center. 47 \f2.3.2.2 Performance The overall number of floating operations and memory requirements of the RWPT method using a background grid to compute concentration scales linearly with the total number of particles, i.e. it is O(N ). However, the application of (C.3) to compute smoother concentration distributions requires O(N 2 ) operations. On the other hand, the evaluation of the summation in (2.6) corresponds to an n-body problem which naive implementation scales as O(N 2 ) (Greengard, 1994). However, because the compact support of the kernel the actual work required to compute the summation can be reduced to O(N Nk ), where Nk corresponds to the average number of particles per kernel support volume. The implementation of such algorithms requires an e\ufb03cient method for searching near-neighbor particles. Such algorithms are based on data structures used to classify particles according to their spatial coordinates. For constant smoothing length implementations as presented in this paper, the background grid algorithm is the most e\ufb03cient method (Viccione et al., 2008). For spatially varying smoothing lengths, more sophisticated data structures based on octrees or binary trees must be used (e.g. Barnes and Hut, 1986; Waltz et al., 2002). An explicit implementation of the proposed meshless method as discussed in Section 2.2.1 requires an amount of memory that scales with the number of particles (O(N )). Figure 2.5 shows the CPU time required to complete a single time step as function of the total number of particles in RWPT simulations. As expected the computational cost of the method grows linearly with the total number of particles. On the other hand, Figure 2.6 shows that in SPH simulations the CPU time depends in a non-linear fashion on the total number of particles and the kernel smoothing length. Larger smoothing lengths, equivalent to more particles per kernel support volume, result in longer simulation times for the same total number of particles. Figure 2.6 also shows that, as expected, the CPU time required to complete a single time step scales linearly with the product of the total number of particles and the average number of particles per kernel support, N P K = Np Nk . The di\ufb00erences observed between the curves corresponding to di\ufb00erent smoothing lengths for the same product N P K are due to di\ufb00erences in performance of the routine that evaluates the changes in concentration at each time step as result of di\ufb00erent combinations of Np and Nk . 48 \fNormalized CPU Time 1200 1000 800 600 400 200 0 0 1 2 3 Np 4 5 6 7 x 10 Figure 2.5: Normalized CPU time required to solve one time step using RWPT as function of the total number of particles Np . Computational cost of RWPT simulations is proportional to the total number of particles Np . 49 5 \f300 Normalized CPU Time 250 h = 0.5 h = 1.0 h = 2.0 200 150 100 50 0 1 300 Normalized CPU Time 250 2 3 4 Np 5 6 7 8 x 10 4 h = 0.5 h = 1.0 h = 2.0 200 150 100 50 0 0 0.5 1 1.5 Np Nk 2 2.5 3 3.5 7 x 10 Figure 2.6: Normalized CPU time required to solve a single time step as function of the total number of particles Np , kernel smoothing lenght h, and average number of particles per kernel support volume Nk . Computational cost of MC-SPH simulations is proportional to the product of Np and Nk . 50 \f2.3.2.3 Accuracy We used two criteria to compare the accuracy and convergence properties of RWPT and MC-SPH. Figure 2.7 compares the temporal evolution of the simulated maximum concentration with the theoretical result according to (2.20). The simulated RWPT results exhibit unphysical oscillations and large errors. Such unphysical oscillations would create serious problems if an operator splitting approach was used to simulate reactive transport simulations where these errors would be amplified by non-linear reactions. Local errors in RWPT simulations do not only depend upon the total number of particles but also on the number of particles at each cell and the cell volume. For example, simulation RW3 with Np = 40713 produces maximum concentration values that are closer to the true value than the results of RW6 and RW9 with Np =157972 and Np = 627153, respectively. Simulations with lower Nr as defined in Appendix C, not shown in the figure, produced results with even larger errors. Figure 2.7 also shows a comparison of the maximum concentration simulated with MC-SPH considering Np = 40, 000 and the analytical solution. All of the simulations give solutions that are free of unphysical oscillations, however, simulations with low average number of particles per kernel support volume such as SPH3 (Nk = 13) can result in considerable local errors. Local errors can be made negligible by choosing an appropriate combination of total number of particles and kernel smoothing length to obtain larger average number of particles that e\ufb00ectively contribute to the numerical integration, e.g. simulations SPH8 (Nk = 50) and SPH13 (Nk = 201). Results of other simulations with larger number of particles, not shown in the figure, produced smaller errors. Figure 2.8 shows the global error as function of the total number of particles in the simulation and CPU time per time step. It is clear that using these metrics numerical solutions computed using MC-SPH converge faster to the true solution than the RWPT solutions. Figure 2.8 also shows that MC-SPH solutions have di\ufb00erent convergence rates depending upon the kernel smoothing length used. Moreover, curves corresponding to di\ufb00erent smoothing lengths intersect indicating the transition between regions where the error is controlled by the average number of particles per kernel support volume Nk (small Np ) and the region where the error depends upon the spatial resolution given by the kernel smoothing length (large Np ). For simulations that require low CPU time, the convergence rate for MC-SPH simulations is faster than the one for RWPT simulations. However, the convergence rate of both methods becomes similar for simulations with larger number of particles that require longer CPU times to complete a single time step. 51 \fAnalytical RW3 RW6 RW9 1 Cmax\/C0 0.9 0.8 0.7 0.6 0 50 100 150 200 250 300 Time Step 350 400 1 450 500 Analytical SPH3 SPH8 SPH13 0.95 0.9 Cmax\/C0 0.85 0.8 0.75 0.7 0.65 0.6 0 50 100 150 200 250 300 Time Step 350 400 450 500 Figure 2.7: Maximum simulated concentration versus time step. RWPT simulations with resolution number Nr = 1000 and MC-SPH simulations with Np = 40000. Estimated concentrations in RWPT simulations present numerical oscillations due to representing the solute mass distribution as a finite set of particles. MC-SPH simulations compute concentrations that are free of numerical oscillations. 52 \f\u22123 10 RWPT SPH h = 0.5 SPH h = 1.0 SPH h = 2.0 \u22124 Error 10 \u22125 10 \u22126 10 2 3 10 4 10 5 10 6 10 N 10 p \u22123 10 RWPT SPH h= 0.5 SPH h = 1.0 SPH h = 2.0 \u22124 Error 10 \u22125 10 \u22126 10 0 10 1 10 2 3 10 10 Normalized CPU Time 4 10 5 10 Figure 2.8: Normalized global error versus total number of particles and normalized CPU time. Error computed as defined in (2.19) substituting N by the number of cells for RWPT and the total number of particles for MC-SPH simulations. The convergence rate, measured as function of the total number of particles Np or the CPU time required to complete a single time step, is faster for MC-SPH simulations than for RWPT simulations. However, the convergence rate of both methods become similar for simulations that use more particles and demands longer CPU times. 53 \f2.3.3 Advection\u2013Dispersion in Heterogeneous Porous Media The objective of this section is to evaluate the performance of the MC-SPH approach to simulate solute transport in two-dimensional heterogeneous porous media. To verify our MC-SPH code we compared it with the ULTIMATE total variation diminishing (TVD) finite di\ufb00erence solver and the hybrid method of characteristics (HMOC) particle-mesh solver included in the popular MT3DMS package (Zheng and Wang, 1999). We focus our analysis on verifying if the numerical results satisfy some basic physical requirements such as: avoiding numerical dispersion, providing positive solution free of oscillations, and mass conservation. 2.3.3.1 Setup Before solving the solute transport problem we generated a velocity field as follows: (i) generate a moderately heterogeneous random hydraulic conductivity field, (ii) calculate a velocity field by solving the saturated flow problem using MODFLOW (Harbaugh, 2000) considering a constant hydraulic head gradient from left to right, and no-flow boundaries at top and bottom. Table 2.4 shows the parameters used to generate the random hydraulic conductivity field and to solve the flow problem. We used the resulting velocity field to simulate conservative transport of a square initial plume with constant concentration, C0 . Table 2.5 shows the parameters used to solve the transport problem. Figure 2.9 shows a schematic of the simulation setup. In all the simulations discussed below we only considered constant isotropic dispersion. Description Symbol Value Variance of ln(K) \u03c3Y 1.4 Correlation length of ln(k) IY 2.5 Domain dimension (Lx , Ly ) (200IY , 50IY ) Grid size \u2206 IY \/5 Mean velocity in x U 0.81 Max. velocity in x umax 6.22 Table 2.4: Parameter and results of flow model. For the TVD simulations we used the same grid discretization that was used to solve the flow problem. For the HMOC simulations the allowed total maximum number of 54 \fDescription Symbol Value Initial plume size (Lpx , Lpy ) (20IY , 20IY ) Initial plume center (Xp , Yp ) (36IY , 25IY ) P\u00e9clet number P e = U IY \/D Dimensionless time step \u03c4 = U \u2206t\/\u2206 [20, 200, \u221e] Mean CFL number CF Lmean = U \u2206t\/\u2206 Max. CFL number CF Lmax = umax \u2206t\/\u2206 6.5 \u00b7 10\u22123 0.03 0.25 Table 2.5: Parameter values used in transport model. Figure 2.9: Domain dimensions, square initial plume, and breakthrough observation points P1 and P2 along centerline. 55 \fparticles was 6 \u00b7 105 and the number of particles per cell in cells where the relative concentration gradient (Zheng and Wang, 1999, p. 65) was higher than 1 \u00b7 10\u22125 was 15. The threshold value, DCHMOC, which controls if the forward or backward MOC method is used for an individual cell according to its relative concentration gradient was set equal to 1 \u00b7 10\u22124 (Zheng and Wang, 1999, p. 73). In the MC-SPH simulations the total number of particles was constant during the simulation and equal to 3.8 \u00b7 105 which was equivalent to an initial number of particles per grid cell equal to 8. Particles where initially distributed in a rectangular lattice within a rectangular region of size 68IY in the direction of the flow and 28IY in the transverse direction centered at the initial plume center. The kernel smoothing length was constant and equal to half the grid size used in the MT3DMS models, so the spatial resolution of the three methods was comparable. The results of both, TVD and HMOC, methods correspond to concentration values at the center of grid cells. We interpolated the MC-SPH results which correspond to concentration values at scattered points onto a similar grid to compare them. We stress that this interpolation was needed only for comparison purposes and it is usually not necessary in SPH simulations. We used the following expression to compute interpolated values AI , \ufffd \u02c6 (|ri \u2212 rj |) Aj W AI (ri ) = \ufffd = \u02c6 (|ri \u2212 rj |) W j j \ufffd Aj \u03c8ij (2.21) j where \u03c8ij are Shepard functions (Shepard, 1968) and summations are over all particles. \u02c6 , we used the same Although the interpolation in (2.21) is valid for any kernel function W kernel used in MC-SPH simulations to get interpolated quantities with similar spatial resolution. 2.3.3.2 Results Figure 2.10 shows the spatial concentration distribution at the end of the simulation for the advection-only case. Solutions given by the three methods are very di\ufb00erent. The TVD solver is not able to avoid numerical dispersion so the plume exhibits large dilution and the initial plume mass is distributed within a much larger volume. There are only few areas where the solute concentration is similar to the initial concentration. The 56 \fHMOC produces less numerical dispersion and the plume edges are clearly distinguishable. However, the e\ufb00ects of numerical dispersion are clear in zones located between fast or slower fingers and in front and behind the main plume. The existence of those artificial low concentration zones has some important practical implications. For example, in presence of reactions controlled by mixing such as biodegradation those low concentration zones could potentially extend the reactive zone near the plume edge (Cirpka et al., 1999b). The concentration distribution generated by the MC-SPH code is free of numerical dispersion and the plume edges are very sharp as expected in absence of local-dispersion. Zones without contaminant located between fast and slow fingers are observable surrounding all the plume volume. It is interesting to notice some isolated high concentration spots in the front and back of the plume as result of connected high and low permeability regions. Figure 2.11 shows concentration values along the domain centerline at the end of the simulation, i.e., after the plume center has traveled 62 integral scales. The three methods produce very similar results for low P\u00e9clet numbers. As expected, the results produced by TVD and HMOC methods are identical considering that both methods share the same dispersion solver routine. It is more interesting to notice the good agreement between MC-SPH and the other two methods for low P\u00e9clet values. It is di\ufb03cult to say if the small di\ufb00erences observed at the plume edges are due to di\ufb00erences between the methods or the interpolation method used to map the MC-SPH results onto a grid. More important di\ufb00erences are observed for the more strongly advection-dominated scenarios. For P\u00e9clet number equal to 200, the two Lagrangian based methods, HMOC and MCSPH, perform similarly while the TVD solution is smoothed by numerical dispersion. This comparison clearly shows that even high-order Eulerian mesh-based methods such as TVD cannot compete with particle-based methods for advection-dominated problems. For the advection-only case the three methods give solutions that are clearly distinguishable. TVD results show little di\ufb00erence with respect to the situation for P e = 200. On the other hand, HMOC and MC-SPH results are closer to the expected sharp profile with concentration values equal to the initial concentration or zero. The MC-SPH solution seems to perform better close to the plume edges where the HMOC solution gives a smoother profile as consequence of the accumulated numerical dispersion due to the interpolation of concentration values from scattered points to the cell centers at each time step. Figures 2.12 and 2.13 show breakthrough curves for points P1 and P2 located along the domain centerline at 26IY and 42IY downstream from the initial plume center, respec57 \fFigure 2.10: Spatial concentration distribution at dimensionless time \u03c4 = U t\/IY = 62 for P e = \u221e. TVD solver (top), HMOC solver (middle), and SPH solution mapped onto rectangular grid (bottom). Only dimensionless values C\/C0 > 0.001 are shown. 58 \f1 C \/ C0 0.8 TVD HMOC SPH Pe = 20 0.6 0.4 0.2 0 0 10 20 30 40 50 60 70 80 20 30 40 50 60 70 80 20 30 40 50 60 70 80 1 C \/ C0 0.8 Pe = 200 0.6 0.4 0.2 0 0 10 1 C \/ C0 0.8 Pe = \u221e 0.6 0.4 0.2 0 0 10 d \/ IY Figure 2.11: Concentration versus accumulated distance along centerline at dimensionless time \u03c4 = U t\/IY = 62. 59 \ftively. Breakthrough curves for low P\u00e9clet values equal to 20 given by the three methods are almost identical. This confirms that the MC-SPH method is able to simulate situations where dispersion is important with accuracy that is comparable to well-tested mesh-based methods as used in MT3DMS. As observed in the longitudinal profile comparison, the di\ufb00erence between HMOC and MC-SPH solutions and the TVD solution increases as the transport process becomes controlled by advection. For P\u00e9clet number equal to 200, HMOC and MC-SPH produces similar results while the corresponding TVD breakthrough curves have a completely di\ufb00erent shape typical of much higher dispersion coe\ufb03cients. Finally, for the purely-advective case the breakthrough curves corresponding to each method become very di\ufb00erent. For the point located closer to the plume center, P1, HMOC and TVD predict a much earlier arrival time and longer tail. The earlier arrival time is due to the lateral mixing produced by the numerical dispersion, which transfers solute concentration from faster plume fingers that pass close to point P1. The longer tail is also due to lateral and longitudinal numerical mixing. The breakthrough curve corresponding to the MC-SPH solution is not a\ufb00ected by numerical dispersion, thus it exhibits a rectangular shape as expected. For point P2, the three breakthrough curves have similar arrival time indicating that a set of fast streamlines forming a fast advancing front passes through P2, so the lateral mixing does not have a significant effect. However, lateral and longitudinal numerical dispersion produce much longer tails in the corresponding HMOC and TVD curves. The analysis of the breakthrough curves at both points indicates that neither the HMOC nor TVD schemes are able to correctly predict mixing and dilution in situations where advection is much more important than dispersion. The value of the maximum plume concentration is an important parameter because it is usually used as criteria for regulatory purposes. It has also been used in theoretical studies to characterize and measure mixing and dilution processes. Figure 2.14 shows the maximum plume concentration value as a function of time. It contains two curves that correspond to the MC-SPH solution. SPH-particles correspond to the maximum concentration value observed at any particle position while SPH-mesh corresponds to the maximum concentration value after interpolation onto a grid. For P\u00e9clet value equal to 20 the three methods predict the same maximum concentration confirming the previously observed behavior. For higher P\u00e9clet values the TVD solution predicts lower maximum values than the other two methods, thus it over-predicts the dilution of the plume. As discussed above it is di\ufb03cult to directly compare the mass balance properties of meshbased methods like TVD, Eulerian\u2013Lagrangian methods such as HMOC, and meshless 60 \f1 C \/ C0 0.8 TVD HMOC SPH Pe = 20 0.6 0.4 0.2 0 0 10 20 30 40 50 60 10 20 30 40 50 60 10 20 30 40 50 60 1 C \/ C0 0.8 Pe = 200 0.6 0.4 0.2 0 0 1 C \/ C0 0.8 Pe = \u221e 0.6 0.4 0.2 0 0 \u03c4 = U t \/ IY Figure 2.12: Breakthrough curve at point P1 located 26IY downstream from initial plume center. 61 \f1 C \/ C0 0.8 TVD HMOC SPH Pe = 20 0.6 0.4 0.2 0 0 10 20 30 40 50 60 10 20 30 40 50 60 10 20 30 40 50 60 1 C \/ C0 0.8 Pe = 200 0.6 0.4 0.2 0 1 C \/ C0 0.8 Pe = \u221e 0.6 0.4 0.2 0 0 \u03c4 = U t \/ IY Figure 2.13: Breakthrough curve at point P2 located 42IY downstream from initial plume center. 62 \fTVD HMOC SPH\u2212Mesh SPH\u2212Particles C \/ C0 1 0.95 0.9 Pe = 20 0.85 0.8 0 10 20 30 40 50 60 10 20 30 40 50 60 10 20 30 40 50 60 C \/ C0 1 0.95 0.9 Pe = 200 0.85 0.8 0 C \/ C0 1 0.95 0.9 Pe = \u221e 0.85 0.8 0 \u03c4 = U t \/ IY Figure 2.14: Dimensionless maximum concentration versus dimensionless time. Because of numerical dispersion, the maximum concentration for simulations with large P e is smaller in TVD than in HMOC and MC-SPH solutions. 63 \fmethods such as MC-SPH. In general, the only comparison that can be made consists in looking at the total solute mass distributed in the domain volume. For grid-based methods with equispaced grid and uniform cell concentration, Ci , as used in the simulations \u00b4 \ufffd discussed here, the total mass in the domain is equal to M = C dV = \u2206V i Ci , where \u2206V is the cell volume. In that case the mean concentration defined as C\u00af = M\/V is equal \ufffd 1 \ufffd to the arithmetic average of the cell concentrations, i.e. C\u00af = \u2206V i Ci = ncells i Ci . V Since the total domain volume is constant, the total solute mass is conserved only if the mean concentration C\u00af is constant. Figure 2.15 shows the mean solute concentration versus dimensionless time for the three P\u00e9clet number considered. In the three scenarios the mean concentration computed using the TVD and MC-SPH solution at particle positions is constant, indicating that the total mass in the domain is conserved. On the other hand, the mean concentration given by the HMOC method presents small fluctuations (<1%) which are more important for the advection-dominated case. Small mass di\ufb00erences due to the interpolation scheme used in HMOC are expected and this error is often cited as the main disadvantage of the method (Zheng and Wang, 1999). There is a temporal change in the mean concentration computed using interpolated values given by the MC-SPH solution. The change increases with time and it is higher for higher dispersion coe\ufb03cients. The temporal variation is probably due to the increasing interpolation error due to the more irregular particle distribution. On the other hand, higher dispersion coe\ufb03cients increase the dilution of the plume, so the total solute mass is distributed among a larger number of particles with lower concentration values which are more sensible to interpolation errors. 2.4 Conclusions We derived a new SPH formulation based on the Monte Carlo nature of the original SPH method to simulate solute transport in heterogeneous porous media. We demonstrated that the new MC-SPH method is able to accurately simulate scenarios of practical and theoretical interest where the combined action of flow heterogeneity and local-scale dispersion a\ufb00ects the plume movement, mixing and dilution. The study of those situations using traditional numerical methods is very di\ufb03cult if not impossible due to numerical dispersion and other numerical artifacts such as unphysical oscillations, that not only degrade the accuracy of the numerical solution but also modify the basic physical mechanisms that control solute transport in porous media. 64 \f1.03 C \/ C0 1.02 TVD HMOC SPH\u2212Mesh SPH\u2212Particles Pe = 20 1.01 1 0.99 0 10 20 30 40 50 60 1.03 Pe = 200 C \/ C0 1.02 1.01 1 0.99 0 10 20 30 40 50 60 1.03 Pe = \u221e C \/ C0 1.02 1.01 1 0.99 0 10 20 30 \u03c4 = U t \/ IY 40 50 60 Figure 2.15: Mean concentration versus dimensionless time. While the mean concentration value of SPH-Mesh (concentrations interpolated onto grid) is not constant, the mean concentration at particle locations (SPH-Particles) is constant throughout the simulation which demonstrates that the MCSPH formulation conserves total mass. 65 \fWe demonstrated through numerical benchmarks that the numerical error of the MCSPH method behaves in a complex way and it depends upon several factors such as smoothing length, particle spacing and solution smoothness. However, numerical results indicate that the overall accuracy of the method can be controlled with an adequate choice of those parameters. The overall performance of the proposed method compares favorably with existent numerical methods such as RWPT, higher-order Eulerian and hybrid Eulerian\u2013Lagrangian schemes for the set of simulations discussed in this paper. Due to its Lagrangian nature the MC-SPH method performs very well for advection-dominated problems. However, in contrast to other Lagrangian schemes, it is also able to simulate scenarios where dispersion is important with accuracy comparable to Eulerian meshbased methods. Moreover, for the large range of P\u00e9clet numbers considered the MC-SPH method provided solutions that are physically correct, e.g. sharp-fronts with negligible numerical dispersion for advection dominated problems, or correct amount of mixing and dilution in cases where dispersion is important. We have also demonstrated through theory and numerical simulations that for practical problems the MC-SPH method satisfies total mass conservation within reasonable accuracy. Encouraging results of ongoing research to extend the MC-SPH method to simulate anisotropic dispersion and chemical reactions considering more general boundary conditions will be reported on due course. 66 \f2.5 References Ahlstrom, S., H. Foote, R. Arnett, C. Cole, and R. Serne, Multicomponent mass transport model: theory and numerical implementation (discrete-parcel-random-walk version), Tech. rep., BNWL-2127, Battelle Pacific Northwest Labs., Richland, Wash.(USA), 1977. Bagtzoglou, A., A. Tompson, and D. Dougherty, Projection functions for particle-grid methods, Num. Meth. Part. Di\ufb00. Eq., 8 , 325\u2013340, 1992. Barnes, J., and P. Hut, A hierarchical O (N log N) force-calculation algorithm, Nature, 324 , 446\u2013449, 1986. Brackbill, J., Particle methods, Int. J. Numer. Meth. Fl., 47 , 693\u2013705, 2005. Brookshaw, L., A method of calculating radiative heat di\ufb00usion in particle simulations, Astronomical Society of Australia, Proceedings (ISSN 0066-9997), 6 , 207\u2013210, 1985. Celia, M., T. Russell, I. Herrera, and R. Ewing, An Eulerian-Lagrangian localized adjoint method for the advection-di\ufb00usion equation, Water Resour., 13 , 187, 1990. Chaniotis, A., D. Poulikakos, and P. Koumoutsakos, Remeshed smoothed particle hydrodynamics for the simulation of viscous and heat conducting flows, J. Comput. Phys., 182 , 67\u201390, 2002. Chaniotis, A. K., C. E. Frouzakis, J. C. Lee, A. G. Tomboulides, and K. Poulikakos, D. AU Boulouchos, Remeshed smoothed particle hydrodynamics for the simulation of laminar chemically reactive flows, J. Comput. Phys., 191 , 1\u201317, 2003. Cirpka, O., E. Frind, and R. Helmig, Numerical methods for reactive transport on rectangular and streamline-oriented grids., Adv. Water Res., 22 , 711\u2013728, 1999a. Cirpka, O., E. Frind, and R. Helmig, Numerical simulation of biodegradation controlled by transverse mixing, J. Contam. Hydrol., 40 , 159\u2013182, 1999b. Cleary, P. W., and J. J. Monaghan, Conduction modelling using smoothed particle hydrodynamics, J. Comput. Phys., 148 , 227\u2013264, 1999. Cottet, G., and P. Koumoutsakos, Vortex methods: Theory and practice., Cambridge University Press, 2000. 67 \fDegond, P., and S. Mas-Gallic, The weighted particle method for convection-di\ufb00usion equations. Part 1: The case of an isotropic viscosity, Math. Comput., 53 , 485\u2013507, 1989. Delay, F., P. Ackerer, and C. Danquigny, Simulating Solute Transport in Porous or Fractured Formations Using Random Walk Particle Tracking: A Review, Vadose Zone J., 4 , 360\u2013379, 2005. Dilts, G., Moving-least-squares-particle hydrodynamics I. Consistency and stability, Int. J. Numer. Meth. Engng., 44 , 1115\u20131155, 1999. Espa\u00f1ol, P., and M. Revenga, Smoothed dissipative particle dynamics, Phys. Rev. E, 67 , 026,705\u201312, 2003. Gardiner, C., Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences, 1990. Gingold, R., and J. Monaghan, Kernel estimates as a basis for general particle methods in hydrodynamics, J. Comput. Phys., 46 , 429\u2013453, 1982. Gingold, R. A., and J. J. Monaghan, Smoothed particle hydrodynamics: Theory and application to non-spherical stars, Mon. Not. R. Astron. Soc., 181 , 375\u2013389, 1977. Greengard, L., Fast Algorithms for Classical Physics, Science, 265 , 909\u2013914, 1994. Harbaugh, A., MODFLOW-2000, the US Geological Survey Modular Ground-water Model: User Guide to Modularization Concepts and the Ground-water Flow Process, US Geological Survey, 2000. Herrera, P., and A. Valocchi, Positive solution of two-dimensional solute transport in heterogeneous aquifers, Ground Water, 44 , 803\u2013813, 2006. Jubelgas, M., V. Springel, and K. Dolag, Thermal conduction in cosmological SPH simulations, Mon. Not. R. Astron. Soc., 351 , 423\u2013435, 2004. Kitanidis, P. K., The concept of the dilution index, Water Resour. Res., 30 , 2011\u20132026, 1994. Konikow, L., D. Goode, G. Hornberger, and G. Survey, A Three-dimensional Method-ofcharacteristics Solute-transport Model (MOC3D), US Geological Survey, 1996. Kuzmin, D., and S. Turek, Flux correction tools for Finite Elements, J. Comput. Phys., 175 , 525\u2013558, 2002. 68 \fLaBolle, E. M., G. E. Fogg, and A. F. B. Tompson, Random-walk simulation of transport in heterogeneous porous media: Local mass-conservation problem and implementation methods, Water Resour. Res., 32 , 583\u2013594, 1996. Labolle, E. M., J. Quastel, G. E. Fogg, and J. Gravner, Di\ufb00usion processes in composite porous media and their numerical integration by random walks: Generalized stochastic di\ufb00erential equations with discontinuous coe\ufb03cients, Water Resour. Res., 36 , 651, 2000. LeVeque, R., Finite Volume Methods for Conservation Laws, Cambridge University Press, Cambridge, UK, 2002. Lichtner, P., S. Kelkar, and B. Robinson, New form of dispersion tensor for axisymmetric porous media with implementation in particle tracking., Water Resour. Res., 38 , 1146, 2002. Lucy, L., A numerical approach to the testing of the fission hypothesis, Astron. J., 82 , 1013\u20131024, 1977. Monaghan, J., Smoothed particle hydrodynamics, Rep. Prog. Phys., 68 , 1703\u20131759, 2005. Monaghan, J. J., Smoothed particle hydrodynamics, Annu. Rev. Astron. Astrophys., 30 , 543\u2013574, 1992. Morris, J., P. Fox, and Y. Zhu, Modeling Low Reynolds Number Incompressible Flows Using SPH, J. Comput. Phys., 136 , 214\u2013226, 1997. Neuman, S., A Eulerian-Lagrangian numerical scheme for the dispersion-convection equation using conjugate space-time grids, J. Comput. Phys., 41 , 1981. Neuman, S., Adaptive Eulerian-Lagrangian finite element method for advectiondispersion, Int. J. Numer. Meth. Engng., 20 , 321\u201337, 1984. Obi, E., and M. Blunt, Streamline-based simulation of advective-dispersive solute transport, Adv. Water Resour., 27 , 913\u2013924, 2004. Oya, S., and A. J. Valocchi, Transport and biodegradation of solutes in stratified aquifers under enhanced in situ bioremediation conditions, Water Resour. Res., 34 , 3323\u20133334, 1998. Pickens, J., and G. Grisak, Scale-dependent dispersion in stratified granular aquifer., Water Resour. Res., 17 , 1191\u20131211, 1981. 69 \fPollock, D., Semianalytical computation of path lines for Finite-Di\ufb00erence models, Ground Water, 26 , 743\u2013750, 1988. Press, W., S. Teukolsky, W. Vetterling, and B. Flannery, Numerical recipes in C: The art of scientific computing, Cambridge University Press New York, NY, USA, 1992. Price, D. J., Magnetic Fields in Astrophysics, Phd thesis, Institute of Astronomy, University of Cambridge, 2004. Quinlan, N. J., M. Basa, and M. Lastiwka, Truncation error in mesh-free particle methods, Int. J. Numer. Meth. Engng., 66 , 2064\u20132085, 2006. Russell, T., and M. Celia, An overview of research on Eulerian-Lagrangian localized adjoint methods (ELLAM), Adv. Water Resour., 25 , 1215\u20131231, 2002. Salamon, P., D. Fern\u00e0ndez-Garcia, and J. G\u00f3mez-Hern\u00e1ndez, A review and numerical assessment of the random walk particle tracking method., J. Contam. Hydrol., 87 , 277\u2013305, 2006. Schaback, R., and H. Wendland, Kernel techniques: From machine learning to meshless methods, Acta Numerica, pp. 1\u201397, 2006. Shepard, D., A two-dimensional interpolation function for irregularly-spaced data, Proceedings of the 1968 23rd ACM national conference, pp. 517\u2013524, 1968. Smith, L., and F. W. Schwartz, Mass transport. 1. A stochastic analysis of macroscopic dispersion, Water Resour. Res., 16 , 303\u2013313, 1980. Tartakovsky, A., and P. Meakin, A smoothed particle hydrodynamics model for miscible flow in three-dimensional fractures and two-dimensional Rayleigh-Taylor instability, J. Comput. Phys., 207 , 610\u2013624, 2005. Tompson, A., Numerical simulation of chemical migration in physically and chemically heterogeneous porous media, Water Resour. Res., 29 , 3709\u20133726, 1993. Tompson, A., and D. Dougherty, Particle-grid methods for reacting flows in porous media with applications to Fisher\u2019s equation, Appl. Math. Modelling, 16 , 374\u2013383, 1992. Valocchi, A., and A. Quinodoz, Application of the random walk method to simulate the transport of kinetically sorbing solutes. Groundwater Contamination, IAHS Publ, pp. 35\u201342, 1989. 70 \fViccione, G., V. Bovolin, and E. Pugliese, Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations, Int. J. Numer. Meth. Fl., 58 , 625\u2013638, 2008. Waltz, J., G. L. Page, S. D. Milder, J. Wallin, and A. Antunes, A performance comparison of tree data structures for N-Body simulation, J. Comput. Phys., 178 , 1\u201314, 2002. Zheng, C., and S. M. Gorelick, Analysis of solute transport in flow fields influenced by preferential flowpaths at the decimeter scale, Ground Water, 41 , 142\u2013155, 2003. Zheng, C., and P. Wang, MT3DMS: A Modular Three-Dimensional Multispecies Transport Model for Simulation of Advection, Dispersion, and Chemical Reactions of Contaminants in Groundwater Systems; Documentation and User\u2019s Guide, Contract Report SERDP-99-1, US Army Engineer Research and Development Center, Vicksburg, MS , 1999. Zhu, Y., and P. Fox, Smoothed Particle Hydrodynamics Model for Di\ufb00usion through Porous Media, Transport Porous Med., 43 , 441\u2013471, 2001. Zhu, Y., and P. Fox, Simulation of pore-scale dispersion in periodic porous media using smoothed particle hydrodynamics, J. Comput. Phys., 182 , 622\u2013645, 2002. Zhu, Y., P. Fox, and J. Morris, A pore-scale numerical model for flow through porous media, Int. J. Numer. Anal. Meth. Geomech., 23 , 881\u2013904, 1999. Zimmermann, S., P. Koumoutsakos, and W. Kinzelbach, Simulation of pollutant transport using a particle method, J. Comput. Phys., 173 , 322\u2013347, 2001. 71 \fChapter 3 Evaluation of Particle Approximations to Simulate Anisotropic Dispersion1 3.1 Introduction Solute transport in natural porous media is commonly modeled using an advectiondispersion equation (ADE). In most real situations, the transport process is advectioncontrolled and the resulting parabolic partial di\ufb00erential equation exhibits more of a hyperbolic character. On the other hand, the natural heterogeneity of geological formations results in rapid changes of the magnitude and direction of the flow velocity. Those features make the numerical solution of the resulting transport equation with traditional mesh based methods very challenging. The numerical solution of ADE that represents solute transport in porous media is further complicated by the fact that the dispersion coe\ufb03cient is a second-order tensor with principal axes that are oriented parallel and perpendicular to the flow velocity (Bear, 1988), so that the spreading of a contaminant plume is anisotropic: faster in the flow direction than in the transverse direction. Particles methods o\ufb00er advantages for the simulation of solute transport in natural porous media because of their natural ability to adapt to the flow velocity and to simulate solute advection without introducing numerical dispersion and artificial mixing. Thus, there 1 A version of this chapter will be submitted for publication. P. Herrera, M. Massab\u00f3, and R. Beckie. Evaluation of Particle Approximations to Simulate Anisotropic Dispersion. 72 \fhas been a long dated interest in the use of particle methods to simulate solute transport in the subsurface, e.g. (Kinzelbach, 1988) and references therein. The main challenge for the use of particle methods is to derive an accurate approximation for dispersion that can simulate solute mixing and dilution, while avoiding numerical oscillations that plague most traditional numerical approximations of parabolic or elliptic equations that include mixed derivatives or \u201ccross-terms\u201d (Crumpton et al., 1995; Le Potier, 2005b; Nordbotten and Aavatsmark, 2005; Mlacnik and Durlofsky, 2006; Yuan and Sheng, 2008; Edwards and Zheng, 2008; Lipnikov et al., 2009). Recent approaches to incorporate di\ufb00usion or viscous e\ufb00ects in particle simulations are based on a integral approximation of second order derivatives (Degond and Mas-Gallic, 1989a; Cleary and Monaghan, 1999; Eldredge et al., 2002). Particle locations are used as quadrature points to discretize the integral approximation. When used to simulate solute transport, these types of methods approximate the local dispersion operator using concentration values at a set of scattered particles or nodes (Zimmermann et al., 2001; Herrera et al., 2009b). The e\ufb00ects of dispersion are incorporated by modifying concentration values of individual particles as the result of mass exchange between neighboring particles. Therefore, important physical mechanisms such as dilution and solute mixing are easily incorporated. Zimmermann et al. (2001) investigated the use of the particle strength exchange (PSE) method (Degond and Mas-Gallic, 1989a,?) to simulate solute transport in homogeneous porous media considering anisotropic dispersion and uniform and non-uniform flow conditions. Their results showed that the PSE approximation provides accurate results for a set of benchmark problems if a remeshing procedure was used to control the irregular particle distribution due to the flow velocity. Herrera et al. (2009b) compared a smoothed particle hydrodynamics (SPH) approximation to simulate conservative transport in heterogeneous porous media with a highorder finite volume and a hybrid method of characteristics (HMOC) solvers considering isotropic dispersion. Herrera et al. (2009b) used a SPH approximation for isotropic dispersion, first introduced by Cleary and Monaghan (1999) to simulate thermal conduction, that only involves the first derivative of the kernel, so it is less sensitive to particle disorder than other SPH approximations for second derivatives that require remeshing (Chaniotis et al., 2002). The results presented in (Herrera et al., 2009b) clearly show the advantages of the SPH approximation for simulating advection-dominated solute transport in heterogeneous porous media. 73 \fThe first objective of this paper is to derive a SPH expression to approximate anisotropic dispersion to extend our previous work presented in (Herrera et al., 2009b). The second objective is to evaluate the accuracy with which the two particle methods, SPH and PSE, and a standard finite volume formulation can simulate isotropic and anisotropic dispersion under di\ufb00erent conditions. In particular, we are interested in understanding the convergence properties of both particle methods, the factors that control their accuracy, and their relative performance in comparison with a well established mesh-based solver. Additionally, we discuss the monotonicity properties of both particle approximations for di\ufb00erent degrees of anisotropy of the dispersion tensor. 3.2 Mathematical Formulation The Lagrangian formulation of conservative solute transport in porous media involves the following system of di\ufb00erential equations, dr = v(r, t) dt (3.1) dC(r, t) = \u2207 \u00b7 (D(r)\u2207C(r, t)) dt (3.2) where r is the position of a fluid particle, C(r, t) is the solute concentration [M\/L3 ] and D(r) is the hydrodynamic dispersion coe\ufb03cient [L2 \/T]. The first equation describes the movement of a fluid particle due to the flow velocity, while the second equation describes the change in concentration due to dispersion. Generally, the flow field is computed externally and it is an input parameter for the transport simulation. In isotropic porous media the components of the tensor D are given by (Bear, 1988) Dij = (\u03b1T |v| + Dm ) \u03b4ij + (\u03b1L \u2212 \u03b1T ) vi vj |v| (3.3) where \u03b1L and \u03b1T are the longitudinal and transverse dispersivity [L], respectively; Dm is the molecular di\ufb00usivity [L2 \/T], and v is the pore water velocity [L\/T]. In general, the longitudinal dispersivity is at least one order of magnitude larger than the transverse dispersivity, i.e. \u03b1T \/\u03b1L \ufffd 1. 74 \fThe solution of (3.1) can be easily evaluated using a semi-analytical particle-tracking scheme (Pollock, 1988) or an explicit time integration scheme. In the rest of this manuscript we focus our discussion on the numerical solution of (3.2), which represents a much more challenging problem in the context of particle methods. 3.3 Smoothed Particle Hydrodynamics (SPH) Approximation 3.3.1 Background In the standard SPH formulation the smoothed interpolation AS (r) of a variable A(r) is defined as the integral (Gingold and Monaghan, 1977; Lucy, 1977) AS (r) = \u02c6 A(r\ufffd )W (r \u2212 r\ufffd , h) dr\ufffd (3.4) where W (r \u2212 r\ufffd , h) is a kernel function with smoothing length h that satisfies (Monaghan, 1992) \u02c6 W (r \u2212 r\ufffd , h) dr\ufffd = 1 lim W (r \u2212 r\ufffd , h) = \u03b4(r \u2212 r\ufffd ) h\u21920 (3.5) (3.6) Spline polynomials with compact support are usually used as kernel functions because of their practical advantages (Monaghan, 1992). In the standard SPH formulation the numerical approximation of the integral in (3.4) is evaluated as A(ra ) = \ufffd b 1 A(rb )W (|ra \u2212 rb |) pb 75 (3.7) \fwhere the numerical density pb is a measurement of the spatial particle distribution. In most cases, it is approximated as pa = \ufffd b W (|ra \u2212 rb |) (3.8) When computing approximations for first and second order derivatives it is also useful to introduce the scalar function F (r) such that the gradient of a spherically symmetric kernel can be evaluated as (Cleary and Monaghan, 1999; Jubelgas et al., 2004) \u2207W (r) = rF (r) 3.3.2 (3.9) SPH Approximation for Tensorial Dispersion To derive a SPH expression to approximate the dispersion term (3.2), we use the following identity \ufffd\ufffd i j \ufffd \u2202 \u2202C 1 \ufffd\ufffd \u22022 \u2202 2 Dij \u22022C (Dij C) \u2212 C Dij = + Dij \u2202xi \u2202xj 2 i j \u2202xi \u2202xj \u2202xi \u2202xj \u2202xi \u2202xj \ufffd (3.10) that is valid for any symmetric tensor D. This expression is the generalization of the identity used by Jubelgas et al. (2004) to derive a SPH approximation for thermal conduction. Second derivatives of a scalar field A can be evaluated using (Espa\u00f1ol and Revenga, 2003; Monaghan, 2005) \ufffd \ufffd \ufffd 1 \u2202 2 A \ufffd\ufffd (r\ufffd \u2212 r)i (r\ufffd \u2212 r)j (Aa \u2212 Ab ) F (ra \u2212 rb ) \u0393 \ufffd = \u2212 \u03b4ij \u2202xi \u2202xj \ufffda |r\ufffd \u2212 r|2 b pb \ufffd (3.11) where \u0393 = 4 in two dimensions and \u0393 = 5 in three dimensions. Finally, substituting (3.11) into (3.10), we arrive at our SPH approximation for equation (3.2), 76 \fdCa 1\ufffd 1 (Ca \u2212 Cb ) F (|ra \u2212 rb |)D (ra , rb ) = dt 2 b pab (3.12) where D (ra , rb ) = \ufffd\ufffd\ufffd i a Dij + b Dij j \ufffd \ufffd \ufffd \ufffd\ufffd (rb \u2212 ra )i (rb \u2212 ra )j ab 4 \u2212 \u03b4ij = Dij \u0398ij (rb \u2212 ra ) 2 |rb \u2212 ra | i j where Da is the dispersion tensor at position ra and we have replaced the density pb by a symmetric expression pab = f (pa , pb ), e.g. the arithmetic average of pa and pb , to ensure a symmetric approximation (Herrera et al., 2009b). This expression reduces to the standard SPH approximation for di\ufb00usion (Tartakovsky and Meakin, 2005; Herrera et al., 2009b) or thermal conduction (Cleary and Monaghan, 1999; Jubelgas et al., 2004), if D = DI, where I is the identity matrix. In simulations that consider variable coe\ufb03cients, ab b a the term Dij = (Dij + Dij ) can be substituted by an e\ufb00ective coe\ufb03cient of the form ab a b a b Dij = 2Dij Dij \/(Dij + Dij ) , which has given more robust results in thermal conduction simulations(Cleary and Monaghan, 1999; Jubelgas et al., 2004). The approximation (3.12) has two sources of error. First, the SPH integral interpolant (3.4) introduces an error that grows with the smoothing length (O(h2 )). Second, the numerical discretization of the integral introduces an error that depends on the number and position of the particles that contribute to the summation in (3.7). This source of error is related to the ratio between the average number of particles per kernel smoothing length \u03b3, which is equivalent to the ratio between the smoothing length and the average particle spacing \u2206x, i.e. \u03b3 = h\/\u2206x. In general, a larger number of particles per kernel support volume (larger \u03b3), results in a better approximation of the integral. However, the use of large \u03b3 values while controlling h to minimize the interpolant error requires an increasingly small particle spacing and, hence, a large number of particles. Therefore, one must make a trade-o\ufb00 between \u03b3 and h to obtain reasonable error while controlling the number of particles and computational e\ufb00ort (Cleary and Monaghan, 1999). 3.3.3 Monotonicity It is well known that traditional numerical approximations of parabolic or elliptic equations of the form (3.2) that consider the o\ufb00-diagonal terms of the dispersion tensor do not 77 \fsatisfy the monotonicity properties of the solution, e.g. see (Herrera and Valocchi, 2006) and references therein for details. The development of numerical approximations that overcome those numerical issues is still the object of intense research (Le Potier, 2005b; Mlacnik and Durlofsky, 2006; Nakshatrala and Valocchi, 2008; Yuan and Sheng, 2008; Lipnikov et al., 2009). Therefore, it is important to study the monotonicity properties of the SPH approximation derived above. First, we notice that (3.12) has the form \ufffd dCi \ufffd = \u03b2ij (Cj \u2212 Ci ) = \u03b2\u02c6ij Cj dt j j\ufffd=i (3.13) \ufffd \ufffd with \u03b2\u02c6ii = \u2212 j\ufffd=i \u03b2ij , thus j \u03b2\u02c6ij = 0. Then, we can use the local extremum diminishing (LED) criteria (Jameson, 1995) to study the monotonicity of this type of numerical discretization. A numerical approximation such (3.13) satisfies the LED criteria if \u03b2ij \u2265 0, i \ufffd= j (Kuzmin and Turek, 2002), which is a su\ufb03cient condition to obtain monotonic solutions as can be easily demonstrated by the following rationale. If the concentration at node i, Ci , is a minimum the temporal derivative of the concentration at that node is positive or zero. Therefore, a minimum concentration can only increase or stay constant. Similar arguments can be used to prove that a maximum value cannot increase. In the case of (3.12), we have that \u03b2ab = \u2212 1\ufffd 1 F (|ra \u2212 rb |)D(ra , rb ) a \ufffd= b 2 b pab (3.14) with F (r) \u2264 0 because of the kernel properties. Then, the LED criteria requires that D(ra , rb ) \u2265 0. This condition cannot be demonstrated for the general case of an irregular node distribution or non-uniform flow, but it can be studied for the simple case of equispaced nodes in a square lattice in uniform flow field. To make the analysis simpler we use a polar coordinate system such that \u03b8 is the angle formed by the vector connecting two nodes located at ra and rb and the x axis. Then, we obtain that \u0398xx = 4 cos2 \u03b8 \u2212 1, \u0398yy = 4 sin2 \u03b8 \u2212 1, and \u0398xy = 4 sin \u03b8 cos \u03b8. In a square lattice, \u03b8 = [0, \u03c0\/4, \u03c0\/2] or a multiple of those numbers. For \u03b8 = 0 or \u03b8 = \u03c0\/2 there is only one term that is not zero and it is positive. If \u03b8 = n\u03c0\/4 with n 78 \fab ab ab integer, we have that D(ra , rb ) = Dxx + Dyy + 4Dxy , which can be positive or negative because of the change in sign of Dxx , Dyy , and Dxy with the flow orientation according to (3.3). Figure 3.1 shows the value of D(ra , rb ) as a function of the velocity direction for \u03b8 = n\u03c0\/4. The figure shows that D(ra , rb ) \ufffd 0 for all possible flow orientations. This implies that the SPH discretization with nodes distributed in a square lattice does not satisfy the LED criteria and that the numerical solution of (3.12) might exhibit negative concentrations depending upon the flow orientation. This is confirmed by the results of numerical simulations presented below. y & %#$ * ! x % '() !#$ ! \"#$ \" \",+\"-*.*!#\" \",+\"-*.*\"#! !\"#$ !! * \" \",+\"-*.*\"#\"! !+% &+%! ! %! Figure 3.1: Coe\ufb03cient D(ra , rb ) = Dxx + Dyy + 4Dxy for |v| = 1 and such that r =rb \u2212 ra forms an angle of 45\u25e6 with the x axis as function of the angle \u03b2 formed by the flow velocity and the x axis. 79 \f3.4 Particle Strength Exchange (PSE) Approximation The PSE approximation of (3.2) is also based on an integral expression to compute the dispersion operator (Degond and Mas-Gallic, 1989a). An approximation for anisotropic dispersion derived in (Degond and Mas-Gallic, 1989) and used in (Zimmermann et al., 2001) is \uf8ee \uf8f9 \ufffd\ufffd dCa (\u2206x)2 \ufffd \uf8f0 (C ) = \u2212 C K(r , \u03b5) Mij (ra , rb )(ra \u2212 rb )i (ra \u2212 rb )j \uf8fb b a ab dt \u03b56 i j b (3.15) where \u2206x is the representative inter-particle spacing, K(rab , \u03b5) is a cuto\ufb00 function that satisfies so-called moment conditions, \u03b5 is known as the core size which defines the size of the area of influence of each particle, and the components of the matrix M(ra , rb ) are given by Mij (ra , rb ) = 1 (mij (ra ) + mij (rb )) 2 (3.16) where 1 m(r) = D(r) \u2212 tr(D(r))I 4 (3.17) \ufffd with tr(D) = i Dii . Zimmermann et al. (2001) provide expressions for second, fourth and sixth order cuto\ufb00 kernels and Eldredge et al. (2002) discuss the details of the kernel properties and provide expressions to compute kernels that are up to eighth order in one and two dimensions. The same analysis used in the previous section to study the monotonicity properties of the SPH approximation can be used to demonstrate that (3.15) does not guarantee the monotonicity of the solution when the full dispersion tensor is considered as discussed by Degond and Mas-Gallic (1989) and confirmed through numerical simulations by Zimmermann et al. (2001). 80 \fBecause of the similarities between the SPH and PSE methods it is possible to establish a direct parallel between the kernel and cuto\ufb00 functions and between the smoothing length and core size in SPH and PSE, respectively. In the rest of this manuscript, we will use the terms kernel or cuto\ufb00 function to refer to the function K and the terms core size or smoothing length to refer to \u03b5. We will also use W to refer to the cuto\ufb00 K and h instead of \u03b5 to refer to the core size whenever such change helps to simplify notation. 3.5 Numerical Tests We next evaluate the accuracy of our SPH anisotropic dispersion approximation and the PSE method from (Degond and Mas-Gallic, 1989) and (Zimmermann et al., 2001). We use the simulation of the instantaneous release of a solute mass \u2206M in an unbounded domain with a temporally and spatially constant velocity as benchmark problem to study the accuracy and controls on error of the dispersion approximations for SPH and PSE. We also use a standard 9-points finite volume scheme (FV) in a Cartesian grid (Zheng and Bennet, 1995; Herrera and Valocchi, 2006) to define a base case to compare the relative performance of both particle methods. A similar problem has been previously used to study the convergence properties of the PSE (Zimmermann et al., 2001) and di\ufb00usion velocity methods (Beaudoin et al., 2003). Since we are interested in numerical approximations of dispersion, we simplify the problem and neglect the contribution of advection. In this case, the transport process depends on the flow only through the relation of the dispersion tensor and the flow velocity given by (3.3). Because advection can be easily incorporated within a particle framework without introducing additional errors, the results of our analysis can be directly extrapolated to more realistic situations. The analytical solution for the solute concentration as function of position and time is given by, \ufffd C1 \u2212X 2 (2tDyy + w2 ) \u2212 Y 2 (2tDxx + w2 ) + 4XY tDxy c(x, t) = exp C4 8t2 C2 + 4w2 tC3 + 2w4 \ufffd (3.18) where X = x \u2212 x0 and Y = y \u2212 y0 , (x0 , y0 ) is the position of the initial solute release, w is a measure of the size of the initial input, the constant C1 is related to the initial 2 mass \u2206M , and the other constants are C2 = Dxx Dyy \u2212 Dxy , C3 = Dxx + Dyy and 81 \f\u221a C4 = 4t2 C2 + 2twC3 + w4 . To simplify the presentation of the results, we choose C1 = C0 w2 such that the maximum initial concentration is equal to C0 . Table 3.1 shows a summary of the parameters used to setup the test problem. Parameter Symbol Value Unit \u2206M 107 g Initial plume width w 44 m Maximum initial concentration C0 320 mg\/L Length numerical domain L 2000 m Long. Dispersivity \u03b1L 10 m Time step \u2206t 1 day Total time T 300 days Released mass Table 3.1: Parameters used in all simulations. The three solutions are computed using an explicit fourth-order Runge-Kutta solver to integrate in time. The use of an explicit solver imposes restrictions on the size of the time step to obtain stable solutions. The three methods have stability limits of the form \u2206t \u2264 CT \u22062 Dxx + Dyy (3.19) where \u2206 is the grid size for the finite volume, core size for the PSE (Zimmermann et al., 2001), and smoothing length for the SPH approximations(Cleary and Monaghan, 1999), respectively. The constant CT is equal to 0.5 for the finite volume approximation, and it depends upon the kernel or cuto\ufb00 functions for the SPH and PSE. Higher order cuto\ufb00 functions result in slightly more restrictive stability conditions, for example Zimmermann et al. (2001) found that CT \u2248 2.5 and CT \u2248 1.2 for second and fourth order cuto\ufb00 functions, respectively. Additionally, the stability limits of both particle methods depends upon the particle distribution. We found through numerical experiments that the SPH solution is stable if CT = 0.1 and use this value to compute a time step that satisfies the stability restrictions of three methods for the case of equispaced particles. The PSE and SPH approximations require that the area of influence or support of particles overlap. Thus, one must use a core size for PSE or smoothing length for SPH that is larger than the average particle spacing. Additionally, the error of the solution 82 \fgiven by both methods depends upon the ratio of the smoothing length to the average particle spacing. In our simulations, we used di\ufb00erent ratios to test the influence of that parameter on the error of the solution. On other hand, higher order kernels and cuto\ufb00 functions have larger support volume as shown in Figure 3.2, which results in larger areas of influence and number of neighboring particles for a given smoothing length or core size. E\ufb03cient implementations of the PSE and SPH solvers require a fast algorithm to identify near neighbor particles. The SPH implementation is based on kernels that have compact support, so an individual particle interacts only with particles that are within the kernel support volume. In that case it is easy to use a background grid to classify particles in space. The cell size of that grid is related to the kernel smoothing length such that neighbor particles are always at most one cell apart (Welton, 1998). Kernels used in the PSE approximation are modified Gaussian functions which have infinite support. Therefore, in theory, all particles interact with each other. However, PSE kernels fall rapidly with distance and one can assume that they have an e\ufb00ective compact support that is few times the core size as shown in Figure 3.2. In our implementation, we have assumed that the e\ufb00ective compact support of the PSE kernels is equal to five times the kernel core size and we have applied the same strategy as in SPH to search for neighbor particles. 3.5.1 Simulation Cases To test the performance of the three numerical methods we define di\ufb00erent scenarios based on the values of the parameters summarized in Table 3.2. The ranges of values of those parameters are similar to the ones used in previous studies or were selected based on reasonable physical assumptions. For example, we use \u03b1T \/\u03b1L in the range [0.001, 1.0] with \u03b1L = 10 m and \u03b2 equal to [0\u25e6 , 45\u25e6 , 53\u25e6 ], which are similar to the values reported in (Zimmermann et al., 2001; Beaudoin et al., 2003). We use value for h\/\u2206x and \u03b5\/\u2206x in the range [1.0, 1.6], which is similar to values used in other numerical studies to study the convergence properties of the SPH approximation for thermal conduction (Cleary and Monaghan, 1999) and PSE for solute dispersion (Zimmermann et al., 2001). 83 \fFigure 3.2: Cubic, quartic, and quintic SPH kernels, W, with finite compact support (Price, 2004) and second-, fourth-, and sixth-order cuto\ufb00 functions, K, used in PSE simulations (Zimmermann et al., 2001) as function of the ratio between distance and kernel core size or smoothing length, h. All kernels fall rapidly with distance and have an e\ufb00ective support equal to few smoothing lengths. 84 \fParameter Explanation \u03b1T \/\u03b1L Dispersivity ratio h\/\u2206x Smoothing length or core size over average particle spacing \u03b2 Angle formed by velocity and x axis SPH Kernel Three di\ufb00erent SPH kernels: cubic, quartic and quintic PSE Cuto\ufb00 Three di\ufb00erent cuto\ufb00 functions: 2nd, 4th and 6th order Table 3.2: Parameters used to define di\ufb00erent simulation scenarios to evaluate approximations for anisotropic dispersion. To study the convergence of the three methods with respect to the particle or grid spacing, we define a set of runs with di\ufb00erent number of cells or particles as summarized in Table 3.3. To assign the position of particles and cells we assume a large square domain with side L. We assign the same number of particles and cells in each direction, Nc , for simulations that consider equispaced particles. For simulations that consider random or quasi-random particle distributions, the total number of particles, N , is calculated such that the average number of particles in each direction is equal to Nc . We compute two \ufffd\ufffd 2 errors, E2 = j ej \/N and E\u221e = max(|ei |), where ej is the di\ufb00erence between analytical and numerical solutions at node j, to measure the accuracy of the numerical solutions. We also look at the temporal evolution of the di\ufb00erence between the maximum concentration values of the numerical and analytical solutions. In the discussion that follows we report errors after 200 time steps unless explicitly indicated. Run Nc \u2206x R1 40 50.0 R2 60 33.3 R3 80 25.0 R4 100 20.0 R5 120 16.7 R6 140 14.3 R7 160 12.5 Table 3.3: Definition of di\ufb00erent runs used to study convergence properties. Each run is defined by the number of cells or average number of particles in each direction, Nc , which results in a grid or average particle spacing, \u2206x. 85 \f3.5.2 Equispaced Particles We first consider the case of equispaced particles in a square lattice. This scenario is useful because it allows the direct comparison of the particle methods and the finite volume approximation. Besides, the accuracy of both particle methods is expected to be optimal for this configuration, thus the results of this section provide a best case estimate of the error of the SPH and PSE methods. Unless explicitly specified, all the results reported for equispaced particles were computed using a cubic spline SPH kernel and second order PSE cuto\ufb00 functions. 3.5.2.1 E\ufb00ect of particle spacing Figure 3.3 shows the error E2 versus the particle or grid spacing. For isotropic dispersion (\u03b1T \/\u03b1L = 1.0), the convergence rate of the three methods is similar, but the mesh based FV approximation has in average an error that is one order of magnitude smaller than the SPH approximation and almost two orders of magnitude smaller than the PSE approximation for the range of particle or grid spacing considered. For \u03b1T \/\u03b1L = 0.01 (anisotropic case) the analysis is more complicated. For all the cases the mesh-based FV solver is more accurate than both particle methods but the di\ufb00erence is smaller than for the isotropic case. The PSE and FV methods exhibit good convergence in all cases, while the SPH approximation is very sensitive to the value of the ratio h\/\u2206x. The SPH solution converges much faster for larger number of particles per kernel support volume (larger h\/\u2206x). Nevertheless, the convergence rate of the SPH solution for small \u2206x is lower than for the other two methods. Figure 3.4 shows the error E\u221e divided by the maximum initial concentration versus the particle or grid spacing. The situation is similar to the previously discussed for the error E2 . The three methods have smaller errors for the isotropic case than for the anisotropic one. The approximation FV has consistently lower error than the two particle methods for all the situations analyzed, however the di\ufb00erence is smaller in the anisotropic case. For the isotropic situation the maximum absolute error is around 1% of C0 for the PSE approximation and less than 1% for the SPH and FV methods. For the anisotropic case the error is around 1% of the initial maximum concentration for the two particle methods and less than that for FV solution. For small \u2206x the convergence rates of the PSE and FV approximations are comparable, while the SPH solution has a lower rate. 86 \f2 10 \u03b1T\/\u03b1L=1.0 1 10 0 E2 10 \u22121 10 \u22122 10 FV SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 \u22123 10 \u22124 10 10 15 20 25 30 35 40 45 50 \u2206x 2 10 \u03b1T\/\u03b1L=0.01 1 E2 10 0 10 \u22121 10 FV SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 \u22122 10 10 15 20 25 30 35 40 45 50 \u2206x Figure 3.3: Error E2 as function of particle or grid spacing for equispaced particles. The three methods exhibit good convergence for the isotropic case independently of the ratio h\/\u2206x. For the anisotropic case, the PSE and FV solutions exhibit good convergence in all cases. However, the SPH approximation is very sensitive to the value of h\/\u2206x. The convergence rate of the FV and PSE methods for small \u2206x is higher than the SPH one for the anisotropic case. 87 \f0 10 \u03b1T\/\u03b1L=1.0 \u22121 E\u221e\/C0 10 \u22122 10 FV SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 \u22123 10 10 15 20 25 30 35 40 45 50 \u2206x 0 10 \u03b1T\/\u03b1L=0.01 \u22121 E\u221e\/C0 10 \u22122 10 FV SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 \u22123 10 10 15 20 25 30 35 40 45 50 \u2206x Figure 3.4: Normalized error E\u221e as function of particle or grid spacing for equispaced particles. The three methods exhibit good convergence for the isotropic case independently of the ratio h\/\u2206x. For the anisotropic case, the PSE and FV solutions exhibit good convergence in all cases. However, the SPH approximation is versy sensitive to the value of h\/\u2206x. The convergence rate of the FV and PSE methods for small \u2206x is higher than the SPH one for the anisotropic case. 88 \f3.5.2.2 Maximum concentration Figure 3.5 shows the di\ufb00erence between the maximum concentration values of the analytical and numerical solutions as function of the number of time steps. For the isotropic and anisotropic cases the di\ufb00erence increases at early time until reaching a maximum value. For later times, as the initial plume smooths out, the error decreases to an asymptotic value. The SPH solution with h\/\u2206x = 1.2 is the exception to this pattern since the error grows unboundedly with time. The di\ufb00erence between the numerical and analytical solutions after 300 time steps is less than 1% for the FV and the best SPH run and around 1% for the PSE solution. 3.5.2.3 Negative concentrations Figure 3.6 shows a comparison of the analytical and numerical solutions after 300 days for run R7 and \u03b1T \/\u03b1L = 0.01. The three numerical solutions are similar to the analytical solution. However, the three numerical solutions exhibit negative concentrations in bands that tend to be aligned with the main direction of the flow. Figure 3.7 shows the spatial distribution of the di\ufb00erence between the analytical and numerical solutions. In general, the FV and SPH approximations overestimate the concentration values in the center of the plume in a region parallel to the flow direction and they underestimate the concentration in areas outside the plume center along a line that is perpendicular to the flow. The spatial distribution of the error of the PSE solution follows a di\ufb00erent pattern. Concentration values are underestimated in the central region of the plume and they are overestimated in two separate regions that are located near the plume edge along the plume center line. Therefore, the spatial distribution of the error of the three methods depends upon the flow orientation. 89 \f0.05 \u03b1T\/\u03b1L=1.0 FV SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 (CN \u2212 CA )\/C0 max max 0.04 0.03 0.02 0.01 0 \u22120.01 0 50 100 150 200 250 300 200 250 300 Time Step 0.04 \u03b1T\/\u03b1L=0.01 0.03 (CN \u2212 CA )\/C0 max max 0.02 0.01 0 \u22120.01 \u22120.02 \u22120.03 \u22120.04 0 FV SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 50 100 150 Time Step Figure 3.5: Di\ufb00erence between maximum concentration values of numerical and analytical solutions as function of time for equispaced particles and run R7. For the isotropic case the error of the three methods increases at early time. As the concentration field smooths out the error decreases at later times. For the anisotropic case the error of the SPH approximation for h\/\u2206x = 1.2 grows unboundedly. However, the SPH solution for h\/\u2206x = 1.6 performs similar to the FV approximation. 90 \fFigure 3.6: Concentration distribution after 300 time steps for run R7, \u03b1T \/\u03b1L = 0.01, and \u03b2 = 45\u25e6 . All three methods exhibit negative concentrations (dark bands). Minimum concentration values are \u22121.8\u00b710\u22122 for FV, \u22126.9\u00b710\u22124 for SPH, and \u22123.2 \u00b7 10\u22121 for PSE. 91 \fFigure 3.7: Di\ufb00erence between analytical and numerical solutions (Error = CN \u2212CA ) after 300 time steps for run R7, \u03b1T \/\u03b1L = 0.01, and \u03b2 = 45\u25e6 . The spatial pattern of the error of the three methods depends upon the flow velocity direction. 3.5.2.4 E\ufb00ect of ratio between smoothing length and particle spacing As discussed above, the error of the SPH approximation for the integral in 3.4 depends upon the number of particles per support volume, which is related to the ratio between the smoothing length and the average particle spacing, \u03b3 = h\/\u2206x. Previous numerical studies have shown that the SPH approximation for scalar di\ufb00usion (isotropic case) provides accurate results even for small values of \u03b3 in the case of reasonably distributed particles(Cleary and Monaghan, 1999). On the other hand, the stability of the PSE approximation requires that particles overlap, i.e. the core size must be always larger than the representative particle spacing. However, the accuracy of the approximation decreases as the core size increases, thus it provides optimal solutions for small h such that h\/\u2206x > 1. Figure 3.8 shows errors E2 and E\u221e of the SPH and PSE solutions for run R6 as function of \u03b3. We observe that as expected the error of the PSE solution increases monotonically with \u03b3 for the isotropic and anisotropic cases. In contrast, the SPH solution exhibits a more interesting behavior. The error of the SPH solution for the anisotropic case decreases with \u03b3, which indicates that the error of the integral 92 \fapproximation controls the overall error in that case. 3.5.2.5 E\ufb00ect of anisotropy ratio Figure 3.9 shows E2 and normalized E\u221e versus the anisotropy ratio for run R7. The error of the SPH and FV approximations is larger for smaller \u03b1T \/\u03b1L ratio, while the error of the PSE method is almost constant for the range of dispersivity ratios considered. The FV approximation has the smallest error in all the cases, while the PSE solution is more accurate than the SPH solution for all the situations that consider anisotropic dispersion (i.e. \u03b1T \/\u03b1L \ufffd= 1). We note that these results consider \u03b3 = 1.2 and that according our previous discussion, one would expect that the SPH solution would behave better if a larger \u03b3 is used. However, the results of our simulations indicate that the trend of increasing error for larger anisotropy ratios of the SPH and FV methods is independent of the other parameters considered in this study. 3.5.2.6 E\ufb00ect of kernel function Table 3.4 presents a summary of the E2 and E\u221e errors for run R5 for scenarios that consider di\ufb00erent SPH kernels and PSE cuto\ufb00 functions. For the isotropic case, the use higher-order SPH kernels does not have a clear impact on the accuracy of the solution, while the use of higher-order PSE cuto\ufb00 functions results in smaller errors. In particular, the di\ufb00erence between the second and fourth order cuto\ufb00 functions is quite important and it confirms that the error of the PSE approximation can be e\ufb00ectively improved using higher-order cuto\ufb00 functions as discussed by Eldredge et al. (2002). For the anisotropic case, the use of higher-order SPH kernels improve the solution but the e\ufb00ect is less important than one observed using di\ufb00erent cuto\ufb00 functions in the PSE case. Moreover, the use of higher-order cuto\ufb00 functions improve the PSE approximation and makes it more accurate than the FV method for the anisotropic case. 93 \f1 10 0 10 \u22121 10 SPH \u03b1T\/\u03b1L=1.0 SPH \u03b1T\/\u03b1L=0.01 E2 PSE \u03b1T\/\u03b1L=1.0 PSE \u03b1T\/\u03b1L=0.01 \u22122 10 \u22123 10 \u22124 10 1 1.1 1.2 1.3 1.4 1.5 1.6 1.4 1.5 1.6 h\/\u2206x 0.06 0.05 E\u221e \/ C0 0.04 0.03 SPH \u03b1T\/\u03b1L=1.0 SPH \u03b1T\/\u03b1L=0.01 0.02 PSE \u03b1T\/\u03b1L=1.0 PSE \u03b1T\/\u03b1L=0.01 0.01 0 1 1.1 1.2 1.3 h\/\u2206x Figure 3.8: Error E2 for run R6 versus the ratio between smoothing length or core size and particle spacing, \u03b3 = h\/\u2206x. While the error of the PSE solution grows monotonically with \u03b3 for the isotropic and anisotropic cases, the error of the SPH solution for the anisotropic case decreases with it. 94 \f0 10 \u22121 E2 10 \u22122 10 \u22123 10 \u22124 10 \u22123 \u22122 10 10 \u22121 \u03b1 \/\u03b1 T 10 0 10 L \u22121 E\u221e \/ C0 10 \u22122 10 FV SPH PSE \u22123 10 \u22123 10 \u22122 10 \u22121 \u03b1T \/ \u03b1L 10 0 10 Figure 3.9: Error as function of the anisotropy ratio \u03b1T \/\u03b1L for run R7 and h\/\u2206x = 1.2. FV and SPH methods are less accurate for higher levels of anisotropy (lower \u03b1T \/\u03b1L ). The error of the PSE solution is almost constant for the range of anisotropy ratios tested. 95 \f\u03b1T \/\u03b1L 1 1 1 0.01 0.01 0.01 Kernel Cubic Quartic Quintic Cubic Quartic Quintic SPH E2 7.0 4.1 7.6 17.4 7.1 4.7 E\u221e 2.7 2.1 2.9 3.9 2.6 2.2 Kernel 2nd order 4th order 6th order 2nd order 4th order 6th order PSE E2 103.4 4.1 2.6 5.2 0.2 0.1 E\u221e 11.1 2.1 1.5 2.5 0.5 0.3 Table 3.4: Normalized error for di\ufb00erent SPH kernels and PSE cuto\ufb00 functions. Error of the SPH and PSE numerical solutions divided by the error of the FV approximation for run R5 and h\/\u2206x = 1.2 considering di\ufb00erent SPH kernels and PSE cuto\ufb00 functions. One would expect that higher order polynomials used as SPH kernels have the advantage of smoother derivatives which, in combination with the increased size of support volume, could decrease the sensitivity of the kernel to the degree of particle disorder (Price, 2004). However, the results of our simulations show that the use of higher-order kernels does not provide a significant improvement of the numerical solution in the simple case of equispaced particles. 3.5.2.7 E\ufb00ect of velocity orientation It is well known that the error of numerical methods based on grids or meshes used to solve (3.2) that include the o\ufb00-diagonal terms of the dispersion tensor exhibit numerical artifacts that depend upon the flow orientation with respect to the grid axes (Herrera and Valocchi, 2006). Therefore, it is interesting to test if the error of the two particle methods changes for di\ufb00erent flow orientations. Table 3.5 summarizes the results for run R6 assuming di\ufb00erent flow orientations. As expected, all three methods are not sensitive to the flow direction for the isotropic case. However, for the anisotropic case the mesh based FV method exhibits di\ufb00erences of up to two orders of magnitude in the E2 error and one order of magnitude in the E\u221e depending on the flow direction. The error of the SPH solution also depends upon the flow direction but it only shows small di\ufb00erences for di\ufb00erent velocity directions. On the other hand, the error of the PSE solution is almost independent of the flow direction. 96 \f\u03b1T \/\u03b1L 1 1 1 0.01 0.01 0.01 \u03b2\u25e6 45 0 53 45 0 53 SPH E2 E\u221e 0.0061 1.8051 0.0061 1.8051 0.0061 1.8051 0.5062 10.4855 0.6919 14.9257 0.4495 9.7445 PSE E2 E\u221e 0.0728 6.6221 0.0728 6.6221 0.0728 6.6221 0.0880 5.1519 0.0880 5.0957 0.0880 5.2464 FV E2 E\u221e 0.0007 0.5964 0.0007 0.5964 0.0007 0.5964 0.0172 2.1333 0.0006 0.5552 0.0154 1.9997 Table 3.5: Error versus flow velocity direction for R5 and h\/\u2206x = 1.2. The error of the numerical solutions is independent of the flow direction if isotropic dispersion is considered. However, the error of the FV and SPH solution depends on the flow velocity direction if anisotropic dispersion is simulated. 3.5.3 Irregularly Spaced Particles It is well known that the accuracy and stability of the PSE and SPH methods depends upon the spatial distribution of particles (Cleary and Monaghan, 1999; Zimmermann et al., 2001; Chaniotis et al., 2002). In general, at the beginning of a simulation particles are distributed in a uniform fashion, e.g. rectangular lattice. As particles move carried by the flow, high velocity gradients result in the distortion of the initial regular distribution as shown in Figure 3.10. In general, the continuity property of the flow prevents particles from moving randomly and the particle set maintains some regularity (Monaghan, 2005). However, some non-uniform flows can result in very irregular particle distributions. 97 \fFigure 3.10: Particle distortion due to flow velocity. High gradients in fluid velocity (arrows) result in distortion of the initial regular particle distribution (black circles). However, the continuity property of the flow prevents that particles become randomly distributed. To evaluate e\ufb00ect of the particle disorder on the accuracy and stability of the SPH and PSE solutions, we set up a set of simulations that evaluate the numerical solution using randomly and quasi-randomly distributed particles. An example of the di\ufb00erence between the distributions is shown in Figure 3.11. A random distribution results in large contrasts in the spatial density of particles in di\ufb00erent areas of the domain. On the other hand, a quasi-random distribution results in an irregular but uniform spatial particle 98 \fFigure 3.11: Particle locations for run R1 considering random and quasi-random distributions. The random distribution has large contrasts in particle density, while the quasi-random distribution has an irregular but uniform spatial particle density. density. Based on our experience, particle distributions as result of real flow fields fall between these two extreme cases. Therefore, simulations that consider these two spatial distributions allow us to estimate upper and lower bounds for the performance of the PSE and SPH approximations for more realistic simulations. For the simulations that consider irregularly distributed particles, we used a cubic SPH kernel and a sixth order PSE cuto\ufb00 function. 3.5.3.1 Isotropic case Figure 3.12 shows the error E2 versus the average particle spacing for the same scenario but di\ufb00erent particle spatial distribution. As expected the error increases with the degree of disorder. As seen by the slope of the curves in Figure 3.12, the convergence rate of the two methods decreases as particles become more disordered. Both methods converge very slowly for the case of randomly distributed particles and the convergence rate is not monotonic. It is interesting to notice that while a larger ratio h\/\u2206x results in larger error for the case of equispaced particles, it actually helps to control the error in the case of random and quasi-random particle distributions. Overall, the PSE method is less sensitive to the disorder of the nodes than the SPH approximation. 99 \f2 10 a 1 10 0 E2 10 \u22121 10 Equispaced h\/\u2206x=1.2 Equispaced h\/\u2206x=1.6 Random h\/\u2206x=1.2 Random h\/\u2206x=1.6 Quasi\u2212Random h\/\u2206x=1.2 Quasi\u2212Random h\/\u2206x=1.6 \u22122 10 \u22123 10 10 15 20 25 30 35 40 45 50 \u2206x 1 10 b 0 E2 10 \u22121 10 Equispaced h\/\u2206x=1.2 Equispaced h\/\u2206x=1.6 Random h\/\u2206x=1.2 Random h\/\u2206x=1.6 Quasi\u2212Random h\/\u2206x=1.2 Quasi\u2212Random h\/\u2206x=1.6 \u22122 10 \u22123 10 10 15 20 25 30 35 40 45 50 \u2206x Figure 3.12: E2 error of (a) SPH and (b) PSE numerical solutions versus average particle spacing for \u03b1T \/\u03b1L = 1.0 using equispaced, random, and quasirandom particle distributions. The convergence rate of boths methods is lower for irregular particle distributions. In both cases, the error increases with the degree of particle disorder. 100 \fThe previous observations are confirmed by Figure 3.13, which shows the normalized E\u221e error as function of the average particle spacing. As a first approximation, we can say that for small particle spacing the error increases by one order of magnitude between the equispaced and quasi-random distribution and by another order of magnitude between the quasi-random and random distributions. Figure 3.14 shows the temporal evolution of the di\ufb00erence between the maximum concentration of the analytical and numerical solutions. The error of the PSE solution is much smaller than the error of the SPH approximation for the case of randomly distributed particles. The error of both methods is smaller for quasi-randomly distributed particles. This figure confirms that the use of larger ratios between smoothing length or core size and particle spacing result in smaller errors when particles are irregularly distributed. In particular, the error of the PSE method is almost constant and less than 1% of the initial concentration if a ratio h\/\u2206x = 1.6 is used. This error is comparable to the maximum error of the PSE approximation for the case of equispaced particles with a second-order cuto\ufb00 function (see Figure 3.5). 101 \f0 10 a \u22121 E\u221e\/C0 10 \u22122 Equispaced h\/\u2206x=1.2 Equispaced h\/\u2206x=1.6 Random h\/\u2206x=1.2 Random h\/\u2206x=1.6 Quasi\u2212Random h\/\u2206x=1.2 Quasi\u2212Random h\/\u2206x=1.6 10 \u22123 10 10 15 20 25 30 35 40 45 50 \u2206x 0 10 b \u22121 E\u221e\/C0 10 \u22122 10 Equispaced h\/\u2206x=1.2 Equispaced h\/\u2206x=1.6 Random h\/\u2206x=1.2 Random h\/\u2206x=1.6 Quasi\u2212Random h\/\u2206x=1.2 Quasi\u2212Random h\/\u2206x=1.6 \u22123 10 10 15 20 25 30 35 40 45 50 \u2206x Figure 3.13: Normalized E\u221e error of (a) SPH and (b) PSE numerical approximations versus average particle spacing for \u03b1T \/\u03b1L = 1.0 using equispaced, random, and quasi-random particle distribution. The convergence rate of both methods is lower for irregular particle distributions. 102 \f0.16 a 0.14 0.12 (CN \u2212 CA )\/C0 max max 0.1 0.08 0.06 0.04 0.02 0 SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 \u22120.02 \u22120.04 0 50 100 150 200 250 300 Time Step 0.08 SPH h\/\u2206x=1.2 SPH h\/\u2206x=1.6 PSE h\/\u2206x=1.2 PSE h\/\u2206x=1.6 b 0.07 (CN \u2212 CA )\/C0 max max 0.06 0.05 0.04 0.03 0.02 0.01 0 \u22120.01 0 50 100 150 200 250 300 Time Step Figure 3.14: Di\ufb00erence between maximum concentration values of analytical and numerical solutions as function of the number of time steps for run R7, \u03b1T \/\u03b1L = 1.0, and (a) random and (b) quasi-random particle distributions. 103 \f3.5.3.2 Anisotropic case Both particle approximations proved to be much more sensitive to particle disorder when simulating anisotropic dispersion than for the isotropic case. SPH simulations with random and quasi-random distributions and h\/\u2206x = 1.2 became unstable after few time steps. For the other scenarios, the errors of both methods stay almost constant as the average particle spacing decreases, as shown in Figure 3.15. The use of larger smoothing lengths or core sizes results in lower errors, but it does not significantly improve the convergence rate of the numerical approximations. The minimum E\u221e corresponds to the PSE solution for quasi-randomly distributed particles and h\/\u2206x = 1.6 is approximately 7% of the initial maximum concentration C0 . Figure 3.16 shows the concentration field for run R7 and quasi-randomly distributed particles at the end of the simulation. Both solutions exhibit negative concentrations (dark bands) that, as for equispaced particles, are located in regions almost parallel to the flow direction. While the maximum magnitude of the negative values in the PSE solution (\u22120.28) is very similar to the one observed for equispaced particles (\u22120.32), it is five orders of magnitude larger for the SPH solution, \u221216.86 for quasi-random and \u22126.9 \u00b7 10\u22124 for equispaced particles. 3.6 Conclusions We present the derivation of SPH approximation to simulate anisotropic dispersion. We also present an analytical analysis of the monotonicity properties of the new approximation. In addition, we compare the new approximation to the particle strength exchange method and a standard 9-point finite volume scheme to simulate the dispersion of a contaminant plume in two-dimensions under di\ufb00erent dispersivity ratios and flow orientations. Furthermore, we test the numerical properties of the three methods by evaluating the sensitivity of the solution to a variety of numerical parameters such as particle and grid spacing, kernel and cuto\ufb00 functions, and ratio of smoothing length or core size to particle spacing. Based on the results of the numerical simulations presented above, we conclude the following: 1. Simulations that consider anisotropic dispersion are troublesome for all three methods. The error of the numerical solution is larger and the convergence rate lower 104 \f2 10 1 E2 10 0 10 SPH Random h\/\u2206x=1.6 SPH Quasi\u2212Random h\/\u2206x=1.6 PSE Random h\/\u2206x=1.2 PSE Quasi\u2212Random h\/\u2206x=1.2 PSE Random h\/\u2206x=1.6 PSE Quasi\u2212Random h\/\u2206x=1.6 \u22121 10 \u22122 10 10 15 20 25 30 35 40 45 50 \u2206x 0.7 SPH Random h\/\u2206x=1.6 SPH Quasi\u2212Random h\/\u2206x=1.6 PSE Random h\/\u2206x=1.2 PSE Quasi\u2212Random h\/\u2206x=1.2 PSE Random h\/\u2206x=1.6 PSE Quasi\u2212Random h\/\u2206x=1.6 0.6 E\u221e\/C0 0.5 0.4 0.3 0.2 0.1 0 10 15 20 25 30 35 40 45 50 \u2206x Figure 3.15: Error as function of average particle spacing for \u03b1T \/\u03b1L = 0.01 using randomly and quasi-randomly distributed particles. The use of larger ratio h\/\u2206x decreases the error, but convergence rates of both methods are much lower than for equispaced particles or for the isotropic case. 105 \fFigure 3.16: Concentration distribution after 300 time steps for run R7, \u03b1T \/\u03b1L = 0.01 and quasi-randomly distributed particles. Dark bands indicate areas of negative concentrations. Minimum concentration values are -16.86 for SPH and -0.28 for PSE. than for the corresponding isotropic case. Furthermore, the numerical solutions computed with any of the three methods independent of the particle distribution exhibit artificial oscillations and negative concentrations. 2. For equispaced particles, the convergence rate of both particle methods is similar to that of the standard 9-point finite volume scheme. However, in contrast to the finite volume scheme, the convergence rate and the overall accuracy of the SPH and PSE methods does not only depend on the number of particles or average particle spacing used, but also on other additional parameters such as kernel function and smoothing length. 3. The spatial distribution of particles is the most important factor that controls the accuracy of the numerical solutions computed with the PSE or SPH approximations. The accuracy of the solution decreases as the degree of disorder of the particles increases. This e\ufb00ect is more important for simulations that include anisotropic dispersion than for simulations of isotropic dispersion. To a certain extent, the loss of accuracy of the numerical solution can be controlled by using larger ratios between smoothing length or core size to average particle spacing. Overall, the PSE method is less sensitive to particle disorder than the SPH method. 106 \fPrevious studies (Zimmermann et al., 2001; Chaniotis et al., 2002) have demonstrated that the periodic remeshing of particles can help to control the loss of accuracy of particle formulations due to the particle disorder caused by the flow velocity. Our numerical results indicate that using a remeshing step is likely beneficial in simulations that consider anisotropic dispersion. However, the loss of accuracy of the particle methods for isotropic dispersion is less important, thus the benefits of remeshing could be counter balanced by the additional computational cost and artificial di\ufb00usion that it introduces. Moreover, the remeshing procedure would not prevent the occurrence of negative concentrations. Those numerical oscillations can be particularly troublesome if particle methods are used to simulate reactive transport. In that case, negative values can be amplified by non-linear chemical reactions. Therefore, although the PSE and SPH schemes may be compelling alternatives to simulate conservative solute transport in porous media, they may not be appropriate for reactive solute transport simulations. 107 \f3.7 References Bear, J., Dynamics of fluids in porous media, Dover, 1988. Beaudoin, A., S. Huberson, and E. Rivoalen, Simulation of anisotropic di\ufb00usion by means of a di\ufb00usion velocity method, J. Comput. Phys., 186 , 122\u2013135, 2003. Chaniotis, A., D. Poulikakos, and P. Koumoutsakos, Remeshed smoothed particle hydrodynamics for the simulation of viscous and heat conducting flows, J. Comput. Phys., 182 , 67\u201390, 2002. Cleary, P. W., and J. J. Monaghan, Conduction modelling using smoothed particle hydrodynamics, J. Comput. Phys., 148 , 227\u2013264, 1999. Crumpton, P., G. Shaw, and A. Ware, Discretisation and Multigrid Solution of Elliptic Equations with Mixed Derivative Terms and Strongly Discontinuous Coe\ufb03cients, J. Comput. Phys., 116 , 343\u2013358, 1995. Degond, P., and S. Mas-Gallic, The weighted particle method for convection-di\ufb00usion equations. Part 1: The case of an isotropic viscosity, Math. Comput., 53 , 485\u2013507, 1989a. Degond, P., and S. Mas-Gallic, The weighted particle method for convection-di\ufb00usion equations. II: The anisotropic case, Math. Comp, 53 , 485,508, 1989b. Edwards, M., and H. Zheng, A quasi-positive family of continuous Darcy-flux finitevolume schemes with full pressure support, J. Comput. Phys., 2008. Eldredge, J. D., A. Leonard, and T. Colonius, A General Deterministic Treatment of Derivatives in Particle Methods, J. Comput. Phys., 180 , 686\u2013709, 2002. Espa\u00f1ol, P., and M. Revenga, Smoothed dissipative particle dynamics, Phys. Rev. E, 67 , 026,705\u201312, 2003. Gingold, R. A., and J. J. Monaghan, Smoothed particle hydrodynamics: Theory and application to non-spherical stars, Mon. Not. R. Astron. Soc., 181 , 375\u2013389, 1977. Herrera, P., and A. Valocchi, Positive solution of two-dimensional solute transport in heterogeneous aquifers, Ground Water, 44 , 803\u2013813, 2006. Herrera, P., M. Massabo, and R. Beckie, A meshless method to simulate solute transport in heterogeneous porous media, Adv. Water Resour., 32 , 413\u2013429, 2009. 108 \fJameson, A., Positive schemes and shock modelling for compressible flows, Int. J. Numer. Methods Fluids, 20 , 1995. Jubelgas, M., V. Springel, and K. Dolag, Thermal conduction in cosmological SPH simulations, Mon. Not. R. Astron. Soc., 351 , 423\u2013435, 2004. Kinzelbach, W., The random walk method in pollutant transport simulation, in Groundwater flow and quality modelling, edited by E. Custodio, A. Gurgui, and J. P. Lobo, pp. 227\u2013246, 1988. Kuzmin, D., and S. Turek, Flux correction tools for Finite Elements, J. Comput. Phys., 175 , 525\u2013558, 2002. Le Potier, C., Finite volume monotone scheme for highly anisotropic di\ufb00usion operators on unstructured triangular meshes, Comptes Rendus Math\u00e9matique, 341 , 787\u2013792, 2005b. Lipnikov, K., M. Shashkov, D. Svyatskiy, and Y. Vassilevski, Monotone finite volume schemes for di\ufb00usion equations on unstructured triangular and shape-regular polygonal meshes, J. Comput. Phys., 227 , 492\u2013512, 2007. Lipnikov, K., D. Svyatskiy, and Y. Vassilevski, Interpolation-free monotone finite volume method for di\ufb00usion equations on polygonal meshes, J. Comput. Phys., 228 , 703\u2013716, 2009. Lucy, L., A numerical approach to the testing of the fission hypothesis, Astron. J., 82 , 1013\u20131024, 1977. Mlacnik, M., and L. Durlofsky, Unstructured grid optimization for improved monotonicity of discrete solutions of elliptic equations with highly anisotropic coe\ufb03cients, J. Comput. Phys., 216 , 337\u2013361, 2006. Monaghan, J., Smoothed particle hydrodynamics, Rep. Prog. Phys., 68 , 1703\u20131759, 2005. Monaghan, J. J., Smoothed particle hydrodynamics, Annu. Rev. Astron. Astrophys., 30 , 543\u2013574, 1992. Nakshatrala, K., and A. Valocchi, Non-negative mixed finite element formulations for a tensorial di\ufb00usion equation, Arxiv preprint arXiv:0810.0322 , 2008. Nordbotten, J., and I. Aavatsmark, Monotonicity conditions for control volume methods on uniform parallelogram grids in homogeneous media, Computat. Geosci., 9 , 61\u201372, 2005. 109 \fPollock, D., Semianalytical computation of path lines for Finite-Di\ufb00erence models, Ground Water, 26 , 743\u2013750, 1988. Price, D. J., Magnetic Fields in Astrophysics, PhD thesis, Institute of Astronomy, University of Cambridge, 2004. Tartakovsky, A., and P. Meakin, A smoothed particle hydrodynamics model for miscible flow in three-dimensional fractures and two-dimensional Rayleigh-Taylor instability, J. Comput. Phys., 207 , 610\u2013624, 2005. Tompson, A., Numerical simulation of chemical migration in physically and chemically heterogeneous porous media, Water Resour. Res., 29 , 3709\u20133726, 1993. Welton, W., Two-dimensional PDF\/SPH simulations of compressible turbulent flows, J. Comput. Phys., 139 , 410\u2013443, 1998. Yuan, G., and Z. Sheng, Monotone finite volume schemes for di\ufb00usion equations on polygonal meshes, J. Comput. Phys., 2008. Zheng, C., and G. Bennet, Applied Contaminant Transport Modelling: Theory and Practice, Van Nostrand Reinhold, New York, 1995. Zimmermann, S., P. Koumoutsakos, and W. Kinzelbach, Simulation of pollutant transport using a particle method, J. Comput. Phys., 173 , 322\u2013347, 2001. 110 \fChapter 4 A Multidimensional Streamline-Based Method to Simulate Reactive Solute Transport in Heterogeneous Porous Media1 4.1 4.1.1 Introduction Motivation Despite considerable e\ufb00orts made during the last decades to advance the state of the art in numerical modeling of conservative and reactive solute transport in porous media, current numerical methods still have serious limitations to provide accurate and e\ufb03cient simulations of situations of practical interest. The use of grid-based methods such as finite di\ufb00erence or finite elements to simulate conservative and reactive transport in porous media is problematic for several reasons. Solute transport in porous media is typically advection-dominated, thus grid-based methods are a\ufb04icted by numerical dispersion that can be mitigated but not avoided by using high-order numerical schemes. In addition, spurious oscillations arise because of the application of non-linear high-order methods 1 A version of this chapter will be submitted for publication. P. Herrera, A. Valocchi, and R. Beckie. A Multidimensional Streamline-Based Method to Simulate Reactive Solute Transport in Heterogeneous Porous Media. 111 \fto solve advection (Steefel and MacQuarrie, 1996; Cirpka et al., 1999) and numerical approximations of o\ufb00-diagonal entries in the dispersion tensor (Herrera and Valocchi, 2006; Lipnikov et al., 2007). Finally, explicit time integration schemes can result in very restrictive global stability criteria, especially in highly heterogeneous velocity fields (Thiele et al., 1997; Crane and Blunt, 1999). Particle methods based on random-walk schemes are an attractive alternative to simulate solute transport in porous media because of their natural ability to simulate advectiondominated transport, their simplicity, and their inherent advantages for scalable and e\ufb03cient parallel implementations. However, those methods also have important disadvantages. First, they have problems in tracking low concentrations and producing smooth concentration distributions (Tompson, 1993; Obi and Blunt, 2004; Herrera et al., 2009b). Second, they require a background grid to simulate the e\ufb00ects of local-scale dispersion on the mixing of di\ufb00erent chemical compounds and to compute concentrations to estimate reaction rates. The computation of averaged concentration values over the cell volumes can introduce artificial mixing that can compromise the original advantages of the method. Third, their performance can be degraded in situations that include multiple chemical species because of the large number of particles required to track multiple concentrations. Reactive solute transport simulations impose even more severe restrictions on the performance of numerical methods than do conservative solute transport simulations. First, numerical artifacts such as spurious oscillations and numerical dispersion can be amplified in presence of non-linear reactions (Cirpka et al., 1999b). Second, in many situations of practical interest \u2014 e.g. biodegradation of contaminant plumes \u2014 chemical reactions mainly occur in areas of low solute concentrations that can be di\ufb03cult to model accurately with methods that have been successfully applied to simulate conservative solute transport, e.g. random-walk methods (Tompson, 1993). Last, numerical methods applied to simulate reactive transport must be computationally e\ufb03cient to allow for the simulation of multiple species at fine spatial and temporal scales. Recently, Herrera et al. (2009b) presented a meshless approach based on smoothed particle hydrodynamics (SPH) (Gingold and Monaghan, 1977; Lucy, 1977), hereafter referred to as the Monte-Carlo SPH (MC-SPH) method, to simulate conservative solute transport in heterogeneous porous media. MC-SPH is a Lagrangian method that uses a kernel-based interpolation scheme to represent dispersion (Cleary and Monaghan, 1999; Jubelgas et al., 2004). In MC-SPH simulations, individual particles move along instantaneous streamlines carrying solute concentration and exchanging solute mass with nearby particles, as 112 \fshown in Figure 4.1. Since the method can handle dispersion without remapping the concentration field onto a grid, it is free of numerical dispersion and grid orientation e\ufb00ects. In addition, because particles carry concentration information and not mass, the method accurately resolves low concentration values and produces smooth concentration distributions. Figure 4.1: Meshless MC-SPH method. In MC-SPH simulations a given particle (black circle) moves along an instantaneous streamline (dashed line) while exchanging solute mass with particles that are within its \u201carea of influence\u201d defined by the support volume of the kernel function (shaded circles). Although promising, MC-SPH also presents problems. Because it is based on an integral interpolation scheme, the accuracy of the solution depends on the spatial distribution of the particles, which can become a problem in presence of heterogeneous flow fields where particles accumulate in stagnant zones (Herrera et al., 2009a). The evaluation of the interpolation scheme requires identifying near neighbor particles at each time step, which introduces a computational overhead in comparison with other numerical schemes. Moreover, the method had been only used to simulate isotropic dispersion until the recent work of Herrera et al. (2009a) who introduced a method to handle the full dispersion tensor in three dimensions. They demonstrated that their approximation worked well for anisotropic dispersion, but can produce negative concentrations for the full tensor dispersion with o\ufb00-diagonal terms. Therefore, this approximation is not suitable for reactive transport simulations and this motivates us to turn to a new approach based 113 \fupon streamline methods. Streamline methods have been successfully used to simulate oil migration (Thiele et al., 1996, 1997) and multidimensional solute transport (Crane and Blunt, 1999; Di Donato and Blunt, 2004; Obi and Blunt, 2004, 2006). These methods use a numerical grid that adapts to the flow field, which reduces numerical dispersion and grid orientation e\ufb00ects. The use of streamlines allows the transformation of a multidimensional transport equation to a set of individual one-dimensional transport problems. Because of its adaptation to the flow and its ability to minimize numerical dispersion, the method is well suited for simulations of advection-dominated transport as found in heterogeneous porous media (Di Donato et al., 2003). In addition, the numerical solution of the resulting one-dimensional transport problem also allows the use of more e\ufb03cient numerical solvers and more relaxed stability constraints (Crane and Blunt, 1999). Because of the e\ufb03ciency of the method, it is possible to simulate large-scale domains with fine spatial and temporal resolution (Di Donato et al., 2003; Obi and Blunt, 2004, 2006). Although longitudinal dispersion along individual streamlines can be easily incorporated, transverse mixing between streamlines is more di\ufb03cult to simulate. Since many important reactions in situations of practical interest occur along the fringes of contaminant plumes and are controlled by transverse dispersion (Ham et al., 2004), it is crucial to incorporate transverse mixing in a streamline-based formulation to obtain a general simulation framework that can be applied to a wide range of reactive transport problems. To best of our knowledge, two approaches have been used to incorporate transverse dispersion in streamline-based simulations. In the first, solute transport is solved using a flow-oriented grid and transverse dispersion is included as a flux component perpendicular to the streamlines (Cirpka et al., 1999). This approach has been successfully used in twodimensional simulations (Cirpka et al., 1999b), but it has not been extended to threedimensions. A second alternative employs a hybrid approach Obi and Blunt (2004). First, advection is solved along streamlines. Then, concentration values are mapped onto a grid where a mesh-based solver is used to solve for dispersion. Finally, concentration values are interpolated back from the grid to the streamlines. The interpolation from and to streamlines introduces some numerical error that is di\ufb03cult to quantify (Obi and Blunt, 2004). Because the interpolation must be done at each time step, the cumulative e\ufb00ect can be important even if an accurate interpolation scheme is used. 114 \fFigure 4.2: Hybrid streamline-SPH method. The method combines ideas taken from streamlines simulations and MC-SPH. Solute advection and longitudinal dispersion are handled as in traditional streamline simulations. Nodes along streamlines are used as interpolations points to apply the same meshless approximation for local-scale dispersion as the one used in MCSPH, so an individual node (black circle) exchanges solute mass with other nodes (grey circles) that are within the support volume of the kernel function (shaded region). 4.1.2 Objectives The main objective of this paper is to present a new hybrid numerical method that combines some of the most important advantages of streamline methods and MC-SPH. Streamlines are used to discretize the domain and to define the location of a set of nodes that is used to evaluate the numerical solution. Advection is solved in traditional streamline-based simulations, i.e. as a composite of one-dimensional solutions. Anisotropic dispersion is accommodated as the sum of a three-dimensional isotropic dispersion contribution handled using a meshless integral approximation, and longitudinal dispersion solved along each streamlines using a standard finite di\ufb00erence formulation. Figure 4.2 shows a schematic of the proposed hybrid method. The main advantages of the proposed method are: (i) like traditional streamlines methods, it is well suited to simulate advection-dominated transport in heterogeneous porous media because of the elimination of artificial mixing due to numerical dispersion, (ii) it provides a robust mechanism to incorporate transverse dispersion between streamlines without requiring additional interpolation steps, and (iii) the use of a flow oriented grid to approximate dispersion results in a numerical scheme that is monotone and positivity preserving even for full dispersion tensors, thereby avoiding negative concentrations and 115 \fspurious oscillations that plague many other numerical methods. 4.2 4.2.1 Mathematical Formulation Governing Equation At the local-scale reactive solute transport in porous media is modeled by a system of partial di\ufb00erential equations, which is given as follows for the case of constant porosity and an incompressible fluid (Bear, 1988): \u2202Ck = \u2207 \u00b7 (D\u2207Ck ) \u2212 v \u00b7 \u2207Ck + Rk (c) \u2202t \u2202Ck = Rk (c) \u2202t k = 1, . . . , m k = m + 1, . . . M (4.1) where Ck [M\/L3 ] is the solute concentration of species or component k, D [L2 \/T] is the hydrodynamic dispersion tensor, v [L\/T] is the pore water velocity, Rk [M\/L3 \/T] is the total reaction rate for species or component k, c = (C1 , . . . , CM ) is the concentration vector, m is the number of species or components in the aqueous (mobile) phase, and M is the total number of species or components. In what follows we will focus our attention on the numerical solution of the first group of equations that describe the migration of chemical species in the aqueous phase, which correspond to a set of advection-dispersion-reaction (ADR) equations. However, as demonstrated by others authors (Di Donato and Blunt, 2004) and in Section (4.4), the proposed streamline formulation can also handle situations that include immobile species in the solid phase. The most common expression to compute the components of the dispersion tensor D for an isotropic porous medium considering a Cartesian coordinate system is (Bear, 1988; Lichtner et al., 2002) Dij = (\u03b1T q + Dm ) \u03b4ij + (\u03b1L \u2212 \u03b1T ) 116 vi vj q (4.2) \fwhere Dm [L2 \/T] is the molecular di\ufb00usivity, \u03b4ij is Kronecker\u2019s delta, q = |v| [L\/T] is the magnitude of the pore water velocity, and \u03b1L and \u03b1T [L] are the longitudinal and transverse dispersivity of the medium, respectively. 4.2.2 Streamline Formulation Traditional streamline models neglect dispersion and rewrite the multidimensional transport equation (4.1) as a one-dimensional transport equation along streamlines using the following identity (Thiele et al., 1997; Crane and Blunt, 1999) v \u00b7 \u2207 \u2261 |v| \u2202 \u2202 = \u2202s \u2202\u03c4 (4.3) where s is the arc length coordinate and \u03c4 is the time of flight (TOF), defined as the time required to reach a point located at a distance s along a streamline (Thiele et al., 1996; Crane and Blunt, 1999). Mathematically, \u03c4= \u02c6s 0 1 d\u03be |v| (4.4) If we consider a local coordinate system with components x\u02c6i that are parallel and perpendicular to the flow direction as shown in Figure 4.3, then the o\ufb00-diagonal terms in (4.2) \ufffd = \u03b1 |v| and D \ufffd =D \ufffd = \u03b1 |v|. are equal to zero and the diagonal terms simplify to D 11 L 22 33 T Therefore, the multidimensional ADR equations can be written using a flow-oriented coordinate system and the TOF to get \u2202Ck \u2202Ck \ufffd = \u2207 \u00b7 D\u2207C + Rk (c) k \u2212 \u2202t \u2202\u03c4 k = 1, . . . m (4.5) or in terms of the arc length coordinate, s, to get \u2202Ck \u2202Ck \ufffd = \u2207 \u00b7 D\u2207C + Rk (c) k \u2212 |v| \u2202t \u2202s k = 1, . . . m (4.6) The formulations given by (4.5) and (4.6) are equivalent, but they each present distinct challenges for numerical methods. 117 \fx\u02c62 x\u02c61 s0 , ! 0 s0 + !s, \" 0 + !\" Figure 4.3: Flow oriented coordinate system. The transport equation can be written considering using a coordinate system with coordinates x \u02c6i that are parallel and perpendicular to the direction of the flow. Streamline simulations also define other two coordinates along individual streamlines, the time of flight \u03c4 and the arc length s. 4.2.3 Numerical Approximation The numerical solution of equations (4.5) or (4.6) requires numerical approximations for the advection, dispersion and reactions terms. The advection term can be approximated within a traditional streamline framework whereas the dispersion term can be evaluated using a combination of a one-dimensional finite di\ufb00erence approximation along streamlines for the longitudinal component and a kernel-based interpolation for the other components. Finally, the reaction component can be approximated using di\ufb00erent solvers designed to integrate initial value problems (e.g. see Oran and Boris, 2000). In the following description of the proposed streamline-based formulation we assume that: (i) the flow velocity field is externally computed, thus it is an input parameter; and (ii) the flow field is steady-state. The second assumption allows us to simplify the discussion about the implementation of the method but it does not represent a real limitation, because transient flow fields can be easily handled by tracing new streamlines when flow conditions change and, then, interpolating concentrations from the old to the new streamline locations(Thiele et al., 1996; Thiele, 2005). In the discussion that follows we drop the sub-index k and assume a single species or component to simplify notation. 118 \f4.2.3.1 Advection along streamlines For simple problems that involve only advection and longitudinal dispersion, concentration values along individual streamlines can be exactly computed using one-dimensional analytical solutions (Thiele et al., 1996). However, more general scenarios require the use of numerical approximation schemes. Standard streamline simulations generate a numerical grid in TOF space by tracking particles and recording the TOF when particles enter and exit from individual cells (e.g. Crane and Blunt, 1999; Obi and Blunt, 2004). Because of the heterogeneity of the porous medium and, hence, the flow velocity, the time required to cross individual cells may be very di\ufb00erent and node separation in TOF space is very irregular. In general, the integration of the advective term in (4.5) over the irregularly spaced nodes in TOF space requires some regularization of the one-dimensional grid to avoid excessive numerical dispersion, to relax the stability restrictions of explicit solvers, and to simplify its numerical solution by keeping a uniform grid spacing (Crane and Blunt, 1999; Thiele, 2003). For example, Crane and Blunt (1999) refined the original TOF grid to get uniformly spaced nodes and used a regularization algorithm to conserve mass balance in the interpolated concentration values. Another approach is to only remove cells that are considered too small to significantly improve the spatial resolution of the method and may introduce unnecessary numerical constraints (Thiele, 2003). Thiele et al. (1997) used a second-order in space and an explicit first-order in time total variation diminishing (TVD) solver to compute the solution, while Crane and Blunt (1999) used a first-order finite di\ufb00erence method with upstream di\ufb00erences for space and an implicit (backward Euler) di\ufb00erence for time. A second option, which is the one we have implemented in our code, is to formulate the one-dimensional advection-dispersion equation along a streamline in terms of the arc length coordinate using (4.6). In that case the numerical solution can be computed using a grid defined by equispaced nodes along individual streamlines. The generation of such a grid involves several steps. First, one must numerically integrate the fluid particle trajectories recording particle positions instead of TOF. Next, one can approximate the total length of a streamline as the sum of the distances of the arcs that connect adjacent nodes. The approximation of the arc length segments by the arc connecting adjacent nodes is second-order accurate for nodes that are relatively close (Aris, 1989). Then, the total arc length is divided into a number of segments such that the length of each segment is close to a given target spacing \u2206s, while the sum of the individual segments 119 \fis equal to the original streamline length and the starting and end points are the same as in the original streamline. The solution of the advective term in (4.6) is equivalent to solving the following PDE \u2202C \u2202C + q(s) =0 \u2202t \u2202s (4.7) which corresponds to an advection equation with variable coe\ufb03cients also known as the color equation (LeVeque, 2002). The last equation can be recast as a conservation law with flux F = qC plus a source term due to the change in velocity, to obtain \u2202C \u2202 \u2202q (qC) = C + \u2202t \u2202s \u2202s (4.8) The last solution can be solved with any one-dimensional solver for hyperbolic equations, e.g. low- or high-resolution schemes and explicit or implicit time discretizations. The use of a uniformly spaced grid in s instead of one spaced in \u03c4 allows more control of the physical distribution of nodes and the possibility of refining the streamline grid by decreasing the node spacing independently of the resolution of the grid used to compute the flow velocity. 4.2.3.2 Dispersion The ratio between longitudinal and transverse dispersivities in porous media is equal to \ufffd L with or greater than one. Then, one can make the change of variable \u03b1L = \u03b1T + \u03b1 \u03b1 \u02dc L \u2265 0. Therefore, the dispersion tensor with principal directions that are parallel and \ufffd can be rewritten as perpendicular to the flow velocity, D, \uf8ee \uf8ef \uf8ef \uf8f0 \ufffd=\uf8ef D \ufffd +D \ufffd D L 0 0 0 \ufffd D 0 0 0 \ufffd D \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fb (4.9) \ufffd = q\u03b1 \ufffd = q\u03b1 + D m . Then, the dispersion term in (4.6) can be rewritten \ufffd L and D where D L T as, 120 \f\u2207\u00b7 \ufffd \ufffd D\u2207C \ufffd =\u2207\u00b7 \ufffd \ufffd D\u2207C \ufffd \ufffd \u2202 \ufffd \u2202C D + L \u2202 x\u02c61 \u2202 x\u02c61 \ufffd (4.10) where x\u02c61 is the coordinate aligned with the flow direction (see Figure 4.3). Using a streamline discretization the derivative along x\u02c61 can be easily evaluated using a second-order finite di\ufb00erence approximation to obtain, \uf8ee \uf8f9 \ufffdi+1\/2 \ufffdi\u22121\/2 \u2202 \ufffd \u2202C 1 D D L L \uf8f0 (Ci+1 \u2212 Ci ) \u2212 (Ci \u2212 Ci\u22121 )\uf8fb DL = \u2202 x\u02c61 \u2202 x\u02c61 si+1\/2 \u2212 si\u22121\/2 si+1 \u2212 si si \u2212 si\u22121 (4.11) To derive this expression we have assumed that the di\ufb00erence between the indices of consecutive nodes along a streamline is equal to one. Thus, (4.11) may be written as \u2202 \ufffd \u2202C DL = \u03b3i+1 Ci+1 + \u03b3i\u22121 Ci\u22121 \u2212 \u03b3i Ci \u2202 x\u02c61 \u2202 x\u02c61 (4.12) with \u03b3i \u2265 0. The first term on the right-hand-side of (4.10), which is equivalent to isotropic dispersion or a di\ufb00usion process, can be evaluated using a MC-SPH approximation to obtain (Cleary and Monaghan, 1999; Jubelgas et al., 2004; Herrera et al., 2009b), \ufffd r \ufffd 1 \ufffd dCi ij \ufffd +D \ufffd =\u2212 D \u2207W (rij ) (Cj \u2212 Ci ) i j dt p \u02c6 |rij |2 ij j (4.13) \ufffd is the modified where rij = ri \u2212 rj is the separation vector between nodes i and j, D i dispersion coe\ufb03cient at node i, W is a kernel function that satisfies some normalization conditions and that, in general, has compact support, and p\u02c6ij is a symmetric approximation of the node density at nodes i and j (for details see Cleary and Monaghan, 1999; Monaghan, 2005; Herrera et al., 2009b, and references therein). The node density at node i is evaluated as, pi = \ufffd W (rij ) j 121 (4.14) \fThen, we can rewrite (4.13) as dCi \ufffd = \u03b2ij (Cj \u2212 Ci ) dt j (4.15) with \u03b2ij \u2265 0 because for typical kernels \u2207W \u2264 0. Therefore, the numerical approximation of (4.10) can be written \ufffd dCi = \u03b3i+1 Ci+1 + \u03b3i\u22121 Ci\u22121 \u2212 \u03b3i Ci + \u03b2ij (Cj \u2212 Ci ) dt j (4.16) To study the monotonicity properties of this approximation (4.16), we notice that it has the form \ufffd dCi \ufffd \u02c6 = \u03b2ij (Cj \u2212 Ci ) = \u03b2\u02c6ij Cj dt j j\ufffd=i (4.17) \ufffd with j \u03b2\u02c6ij = 0. The local extremum diminishing (LED) criteria (Jameson, 1995; Kuzmin and Turek, 2002) establishes that numerical approximations such as (4.17) that satisfy \u03b2\u02c6ij \u2265 0, \u2200i \ufffd= j preserves the monotonicity of the solution, because the temporal derivative of the concentration at a maximum can only be negative and similarly, the concentration at a minimum can only increase(Kuzmin and Turek, 2002). Therefore, the discretization (4.16) preserves the positivity of the concentration distribution and provides solutions that are free of spurious oscillations and negative concentrations. 4.3 4.3.1 Implementation Details Streamline Tracing An important part of streamline-based simulations consists in tracing streamlines given a velocity field. Given the location of an initial seed, the geometry of the streamline that passes through that point is generated using a particle tracking method to integrate the fluid trajectory (in the forward or backward directions) until reaching an inlet or outlet 122 \fface or a sink or source cell. The arc length and TOF are recorded at discrete intervals along the fluid particle trajectory. Pollock\u2019s semi-analytical method Pollock (1988) is a popular choice to track streamlines when the flow velocity is known in a Cartesian staggered grid, because of its high performance and accuracy due to its semi-analytical character. The method has also been extended to handle situations when the flow velocity is computed in an unstructured grid (Prevost et al., 2002). It is also possible to use explicit schemes to integrate streamline trajectories, e.g. Runge-Kutta schemes (Zheng and Wang, 1999) or adaptive algorithms e.g. (Bensabat et al., 2000). In our experience it is possible to obtain a similar accuracy with Pollock\u2019s method or with an adaptive explicit scheme. Although, Pollock\u2019s method is generally faster than explicit schemes, the performance di\ufb00erences are negligible when compared to the total time required for a simulation. On the contrary, explicit schemes are simpler to program and more numerically robust because they avoid floating point errors that can be problematic for semi-analytical methods. In our streamline solver we have implemented both Pollock\u2019s algorithm and an explicit adaptive scheme, however we use the second one as our default particle tracking method. The spatial distribution of streamlines is another key issue in streamline-based simulations. Without an adequate choice of the initial seed particle locations and in the presence of heterogeneous flow fields or sources or sinks, the spatial streamline distribution can be very irregular with large areas of the domain that do not contain any streamlines. This can be particularly problematic in situations that require mapping concentrations onto a background grid (Obi and Blunt, 2004). It can also be problematic for the implementation of our hybrid scheme, because the MC-SPH approximation for dispersion assumes that the area of influence of nodes in neighboring streamlines always overlap. Thus, it is important to assure a minimum density of streamlines in every region of the domain. A common solution of this problem is to use a background grid. After a set of initial streamlines has been traced, new streamlines are traced starting at each grid cell that does not contain one (Batycky et al., 1997; Crane and Blunt, 1999). This is the approach we have implemented in our streamline simulator. 123 \f4.3.2 Time Integration In principle, it is possible to use an explicit, implicit or a hybrid scheme to integrate (4.16). Moreover, depending on the numerical scheme used to approximate advection, the solution of the advection-dispersion-reaction equation can be solved fully-implicitly. A fully-implicit solution would result in more relaxed stability restrictions for the time step size. On the other hand, as discussed below, a fully-implicit implementation also has disadvantages such as larger memory requirements that make it less attractive. As a consequence, in our streamline simulator we use an operator-splitting (OS) approach to solve the advection and dispersion terms. The OS approach is also used in current streamline simulators to incorporate dispersion (Obi and Blunt, 2004), to decouple the saturation and pressure equations in streamline simulations of oil migration (Thiele et al., 1997), and in numerical packages to solve solute transport in porous media (e.g. Zheng and Wang, 1999). The OS approach provides ample flexibility in the selection of numerical algorithms to obtain high accuracy and reasonable performance. An OS approach also allows use of di\ufb00erent time steps to solve the advective and dispersive terms. This can be an advantage to overcome some of the limitations of explicit solvers. Given a global time step \u2206t, one can integrate the dispersion term using \u2206tD \u2264 \u2206t such that many sub-steps may be necessary to complete a global step. A similar idea can be applied to integrate the advection term. This is the approach we apply in our streamline simulator: a single global step can involve many sub-steps to integrate the dispersive and advective terms. 4.3.3 Advection Solution We use a first-order explicit TVD finite di\ufb00erence approximation to solve (4.8) (LeVeque, 2002). Although formally first-order accurate, the high-resolution approximation performs better than low-order approximations such as upstream finite di\ufb00erence (LeVeque, 2002). The implementation of the one-dimensional TVD solver can be done assuming that the flow velocity is evaluated at the node positions or at the midpoint between them. In our implementation we evaluate the flow velocity at the node positions using a linear interpolation scheme for the velocity components (Pollock, 1988), however any velocity reconstruction scheme that provides a continuous velocity field that satisfies the original mass balance equation may be used. 124 \fWe use di\ufb00erent time steps along each streamline to satisfy the stability constraints of the explicit solver while minimizing numerical dispersion and computational requirements. We use ni time steps of size \u2206ti to integrate (4.8) along streamline i during a global time step \u2206t such that \u2206t = ni \u2206ti , and the internal time step \u2206ti is such that the maximum CFL number along streamline i is less than or equal to one, i.e. max(q\u2206ti \/\u2206si ) \u2264 1. Therefore, small time steps are necessary only along streamlines that cross fast flow regions, while large time steps can be applied to integrate along slow streamlines. This constitutes an important performance advantage of streamline simulations versus multidimensional mesh-based solvers. 4.3.4 MC-SPH Solution 4.3.4.1 SPH kernel In our streamline simulator we use a cubic-spline kernel (Monaghan, 1992), \uf8f1 \ufffd \ufffd2 3 r \uf8f4 \uf8f4 1 \u2212 \uf8f4 \uf8f4 \uf8f2 \ufffd 2 h \ufffd3 \u03c3 W (r, h) = nd 14 2 \u2212 \uf8f4 h \uf8f4 \uf8f4 \uf8f4 \uf8f30 r h + 3 4 \ufffd \ufffd3 r h 0\u2264 1\u2264 r h r h <1 r h <2 (4.18) \u22652 where r is the magnitude of the separation vector, h is the so called smoothing length, \u03c3 is a normalization constant, and nd is the number of dimensions. Hence, the size of the kernel support volume is given by the selection of h. In our implementation we use a constant smoothing length for all the nodes. We select h based on the spatial distribution of streamlines and nodes such that the number of nodes per kernel support volume stays within a range that guarantees reasonable accuracy (Herrera et al., 2009b,a). 4.3.4.2 Neighbor search The number of nodes that e\ufb00ectively contribute to the summation in (4.13) depends upon the support volume of the kernel function. Thus, evaluation of the temporal derivative in (4.13) can be accelerated by discarding the nodes that are beyond the kernel support volume. In that case the evaluation of the dispersion term for all the nodes becomes a 125 \fproblem of order O(Nk N ), where Nk is the average number of nodes per kernel volume and N is the total number of nodes (Herrera et al., 2009b). There are di\ufb00erent methods to identify near neighbor nodes that use data structures to classify nodes according to their spatial location (Waltz et al., 2002; Viccione et al., 2008), e.g. linked lists (Welton, 1998) or hierarchical trees (Hernquist and Katz, 1989). In our streamline simulator we use a background grid together with linked lists to store a list of the nodes located at each cell. Then, the evaluation of (4.13) for a specific node only requires looping over nodes that are within adjacent cells (Welton, 1998). While in SPH particle simulations the node lists must be updated at each time step, in our hybrid methods the lists must be only updated each time that the streamlines are traced which happens much less often. 4.3.4.3 Time integration Numerical experiments show implicit schemes to solve (4.16) are unconditionally stable independent of the time step utilized. Although attractive because of its stability properties, the implicit solution of (4.16) can become impractical when some nodes have a large number of neighbor nodes, e.g. three-dimensional problems or highly heterogeneous system. In those cases, the number of nodes that contribute to the summation in (4.17) and, hence, the number of non-zero coe\ufb03cients \u03b2\u02c6ij can be quite large. As consequence, the memory required to store the matrix of the implicit solution can become prohibitive even for a moderate number of nodes. A possible solution to this problem would be to use a variable smoothing length such that the number of neighbor nodes stays relatively constant (Monaghan, 2005). Based on the above considerations, we use a first-order explicit formulation to integrate the dispersion term. The stability restriction of the explicit solver requires a time step such that (Cleary and Monaghan, 1999; Herrera et al., 2009b) \u2206t \u2264 \ufffd h2 \ufffd \ufffd \ufffd max D (4.19) where \ufffd is constant factor. In the simulations presented in the next section we find that \ufffd = 0.1 provides stable solutions. It is important to notice that the maximum time step given by (4.19) is inversely pro\ufffd which, for typical porous media applications is small portional to the magnitude of D, 126 \fcompared to the scale of the numerical discretization given by h. Thus, in general, the condition imposed by (4.19) on the time step is less restrictive that the stability requirements of explicit solvers for advection. 4.3.5 Longitudinal Dispersion 4.3.5.1 Interface coe\ufb03cients The numerical approximation of the longitudinal dispersion terms requires the evaluation \ufffdi\u00b11\/2 in (4.11). Those coe\ufb03cients can be directly evaluated if the flow of the coe\ufb03cients D L \ufffdi\u00b11\/2 can be evaluated velocity is known at the interface position i \u00b1 1\/2. Alternatively, D L as the harmonic average of the coe\ufb03cients at the nodes i and i \u00b1 1 as in a standard cellcentered finite di\ufb00erence approximation (Zheng and Bennet, 1995). Both approximations result in symmetric expressions to compute dispersive numerical fluxes and guarantee flux continuity across the interface. Because we evaluate the flow velocity at node positions, we have implemented the second alternative in our streamline simulator. 4.3.5.2 Time integration The use of an OS strategy allows decoupling of the temporal integration of the longitudinal and transverse dispersion components that appear in (4.16). If each component is integrated separately then the longitudinal term can be approximated using an explicit or implicit approximations. An explicit approximation for the one-dimensional dispersion equation is conditionally stable and must satisfy the following stability restriction \u2206t \u2264 0.5 (\u2206si )2 \ufffd \ufffd max D L \ufffd (4.20) On the other hand, an implicit approximation has the advantage of being unconditionally stable. The resulting linear system is tri-diagonal and can be e\ufb03ciently solved using a direct solver, e.g. one based on the Thomas algorithm (Wang and Anderson, 1982). However, such a splitting strategy would introduce an additional operator-splitting error. Alternatively, one can apply a single step to integrate (4.17), which combines the longitudinal and transverse dispersion terms. This is the approach implemented in our streamline simulator which uses an explicit time marching scheme. 127 \fFigure 4.4 shows a diagram of the overall solution strategy implemented in our streamlinebased simulator. 4.4 Numerical Examples In this section, we present four examples that we use to compare our implementation of the proposed streamline-based method and a finite di\ufb00erence package, MT3DMS (Zheng and Wang, 1999), which is a well-established solute transport simulator. The examples correspond to di\ufb00erent hydraulic conditions and solute release mechanisms. We consider di\ufb00erent dispersivity values to test the quality of our new streamline-based approximation for dispersion. In all the examples, the velocity field was computed with an external finite volume package, MODFLOW (Harbaugh and McDonald, 1996). MT3DMS is a well-tested and robust numerical package that provides several solvers to simulate solute advection (Zheng and Wang, 1999). We use the multidimensional TVD and method of characteristics (MOC) solvers to simulate the examples presented below. The multidimensional TVD solver is a natural candidate for a comparison with our onedimensional TVD solver used to advect solute along streamlines. On the other hand, the MOC solver minimizes numerical dispersion when transport is advection-dominated at the cost of introducing additional mass balance errors and numerical oscillations (Zheng and Wang, 1999). Thus, the two solvers provide a range of solutions that are a good representation of the performance of the state of the art numerical solvers used to simulate solute transport in porous media. In the rest of this section, we focus our analysis on the ability of our streamline simulator to incorporate dispersion more than on the relative advantages of the MT3DMS or streamline solvers to simulate advection, since our principal objective is to introduce and validate our new formulation to incorporate dispersion in streamline-based simulations. The comparison of the performance of the solvers available in MT3DMS and our streamlinebased simulator is di\ufb03cult because of di\ufb00erences in their implementations and capabilities. For example, the solvers included in MT3DMS are implemented in the FORTRAN programming language using single precision, while our streamline simulator is implemented in Java using double precision. There are other implementation details that can also result in additional performance di\ufb00erences. Furthermore, the simulations presented in this section are for relatively small spatial domains and we expect that the observed di\ufb00erences in performance would be di\ufb00erent and, probably, more important for larger 128 \fInitialize Simulation New Time Step For each species k in aqueous phase, solve \u2202Ck \u2202Ck + q(s) = 0 k = 1, . . . , m \u2202t \u2202s Solve Advection along each streamline i using \u2206ti \u2264 min(\u2206si \/q) and an explicit one-dimensional TVD solver. Advance solution along each streamline until completing a global time step. Time Step, \u2206t For each species k in aqueous phase, solve \ufffd Solve Dispersion \u2202Ck \u2202 \ufffd \ufffd L \u2202Ck \u2212 \u2207 \u00b7 D\u2207C D k\u2212 \u2202t \u2202x \u02c61 \u2202x \u02c61 \ufffd = 0 k = 1, . . . , m at each node using a hybrid MC-SPH finite di\ufb00erence scheme with an explicit in time approximation. Compute maximum time step, \u2206tD , to satisfy stability requirements. If \u2206tD < \u2206t, loop over until completing a global time step. For each species k, solve \u2202Ck = Rk (c) k = 1, . . . , M \u2202t Solve Reactions at each node. yes More time steps? no End of Simulation Figure 4.4: Overall solution approach implemented in streamline-based simulator. An operator splitting approach is used to decouple the solution of the advective, dispersive and reactive terms. 129 \fdomains or finer grids. Finally, our streamline simulator and the solvers implemented in MT3DMS are for serial computer platforms, thus we do not take into account the obvious advantages of the streamline formulation to transform the solution of advection into multiple independent one-dimensional problems that are amenable to parallelization. Therefore, one should keep in mind that the performance comparisons reported below are limited to specific implementations of the methods and only a few problem sizes. 4.4.1 Example 1: Continuous Solute Release in Uniform Flow The first example corresponds to the continuous release of a contaminant in a uniform two-dimensional flow. The domain is square with each side equal to 1000 m. The finite di\ufb00erence grid has 100 x 100 cells, thus the cell spacing \u2206 is equal to 10 m. The streamline grid consists of 100 streamlines with nodes spaced every 10 m. Thus, the number of nodes in the streamline grid is equal to the number of cells in the finite di\ufb00erence grid. The flow velocity is constant and equal to 1 m\/d and parallel to the x axis. The solute is continuously released with constant concentration equal to 1 mg\/L from a small region in the center of the inlet boundary of the domain. We use a time step equal to 3.65 d and we simulate the solute migration for a total of 150 time steps. In the streamline simulations, we use a smoothing length equal to 12 m. For this simple quasi one-dimensional problem we use the MT3DMS multidimensional TVD solver; which, for this flow configuration, is equivalent to the one-dimensional TVD solver implemented in our the streamline simulator. Then, di\ufb00erences between both numerical solutions are only due to the approximation for dispersion. We define four di\ufb00erent scenarios depending upon the longitudinal and transverse dispersivity values as summarized in Table 4.1. The dispersivity values considered correspond to longitudinal (P eL = \u2206\/\u03b1L ) and transverse (P eT = \u2206\/\u03b1T ) grid P\u00e9clet numbers between 1 to 10 and 2 to 100, respectively. Figure 4.5 shows contours of concentration values equal to 0.2 and 0.8 mg\/L. The TVD and streamline solutions are identical independently of the longitudinal and transverse dispersivity values used in each scenario. This example demonstrates that the new streamline-based approximation for anisotropic dispersion performs well independently of the dispersivity values or anisotropy ratio. 130 \fScenario \u03b1L \u03b1T P eL P eT 1A 10 1 1 10 1B 10 5 1 2 1C 1 0.1 10 100 1D 1 0.5 10 20 Table 4.1: Dispersivity and equivalent longitudinal (P eL ) and transverse (P eT ) grid P\u00e9clet values used in Example 1. Figure 4.5: Comparison of simulated concentrations for Example 1. Contours for concentration values equal to 0.2 and 0.8 mg\/L at the end of runs 1A (a), 1B (b), 1C (c) and 1D (d). Solid lines correspond to finite di\ufb00erence and squares to streamline solutions, respectively. 131 \f4.4.2 Example 2: Quarter Five-Spot in Heterogeneous Medium 4.4.2.1 Setup The second example corresponds to the well-known quarter five-spot well configuration. We consider a square domain with an injection well located on the lower left corner and an extraction well on the upper right corner. The four faces of the domain have no flow boundary conditions. The domain is a square of 64 x 64 m and is discretized using a uniform grid with 64 cells in each direction. We compute the flow velocity field assuming steady-state conditions and a heterogeneous hydraulic conductivity field. The spatial distribution of the natural logarithm of the hydraulic conductivity, Y = ln(K) with K in units of m\/d, is generated assuming an exponential covariance model with mean value Y\u00af = 1.0, variance \u03c3Y = 1.0 and correlation length in both directions equal to five times the grid spacing. The injection and extraction rates at the wells is set equal to 10 m3 \/d. Streamlines are first generated from 100 equispaced points located over the diagonal line that connects the upper left and lower right corners. Additional streamlines are traced such that each cell of the grid used to compute the velocity field is crossed by at least one streamline resulting in a total of 146 streamlines. The generated hydraulic conductivity and streamlines are shown in Figure 4.6. Figure 4.6: Spatial distribution of the natural logarithm of the hydraulic conductivity and streamlines in Example 2. 132 \fTo test the sensitivity of the TVD and MOC solutions with respect to the grid size, we refine the original grid to obtain a fine grid with 128 cells in each direction. We assign the hydraulic conductivity values computed in the coarse grid to the corresponding cells in the the fine grid, i.e. one value computed in the coarse grid is assigned to four cells in the fine grid. We then solve the flow and transport problems in the new grid. There are di\ufb00erences between the flow solutions computed in the coarse and fine grid as result of the di\ufb00erent spatial discretizations, but they are rather small. For example, the mean velocity computed in the fine grid is less than 1% higher than the one computed in the coarse grid. However, the simulation results presented below demonstrate that such di\ufb00erences have a negligible impact on the solute transport solution. In the streamline simulations nodes are uniformly distributed along streamlines with an average spacing of 1 m. Additional parameters required to set up the MOC solver are listed in Table 4.2. Those parameters were chosen to minimize numerical oscillations observed in some preliminary simulations. Parameter Value Max. # of cells a particle can move in one time step Relative cell concentration gradient (DCCELL) 1 0.00001 Number of particles in cells with relative gradient > DCCELL 32 Number of particles in cells with relative gradient < DCCELL 2 Number of particles in sources or sink cells 64 Tracking algorithm 4th-order Runge-Kutta Table 4.2: Parameters used in MOC simulations. For a detailed explanation see (Zheng and Wang, 1999). We assume that the contaminant is injected through the lower left well with concentration equal to 1 mg\/L and that the initial concentration is zero. The period simulated corresponds to 300 days and it is discretized using di\ufb00erent time steps according to the stability restrictions of the explicit multidimensional TVD, MOC and streamline solvers as summarized in Table 4.3. The time step used in the streamline simulations was chosen such that the product of the mean flow velocity times the time step is equal to the average arc length spacing. 133 \fMethod # Nodes or Cells Time Step # Time steps Streamlines 15,106 0.500 600 TVD Coarse 4,096 0.109 2820 TVD Fine 16,384 0.034 8520 MOC Coarse 49,116 0.193 1560 MOC Fine 203,439 0.054 5520 Table 4.3: Number of nodes or cells, time step size and number of time steps used in simulations of Example 2. Number of nodes reported for MOC corresponds to the maximum number of particles used during the simulation since this is the factor that controls the computational requirements, i.e. CPU time and memory. We use the three solvers to simulate four scenarios that represent di\ufb00erent dispersivity values as summarized in Table 4.4. For the streamline simulations that include dispersion we use a smoothing length equal to 1.2 m. Scenario \u03b1L (m) \u03b1T (m) P eL P eT 2A 0.1 0 10 2B 0.1 0.01 10 \u221e 100 2C 0.1 0.1 10 10 2D 0 0 \u221e \u221e Table 4.4: Dispersivity and equivalent longitudinal (P eL ) and transverse (P eT ) grid P\u00e9clet values used in Example 2. 4.4.2.2 Simulated concentrations Figure 4.7 shows simulated concentrations for scenarios 2A and 2C after the injection of 0.4 pore volumes of solute. MOC and TVD solutions were computed using the fine grid. Simulated concentration values using the streamline simulator were interpolated from nodes along streamlines to the cell centers of the fine grid for comparison purposes. In general, the numerical solutions computed with all three methods are similar. For scenario 2A the simulated concentrations indicate the presence of a slow flow region along the diagonal line that connects the two wells, which creates a sharp interface 134 \fbetween two fast moving fingers with concentration equal to the source concentration and a central region with concentration equal to zero. When transverse dispersion is included (run 2C) the slow central flow region is filled with concentrations that are about 50% of the source value. Transverse dispersion also produces a wider mixing zone at the edges of the advancing contaminant front where concentration values lie between the source and the background values. Figure 4.7: Simulated concentration values after injection of 0.4 pore volume of contaminated fluid for Example 2. Interpolated streamline (first row), MOC (second row) and TVD (third row) solutions for scenarios 2A (left column) and 2C (right column). The solutions computed with the three methods are similar for both scenarios. 135 \fWe also recorded the simulated concentration versus time at two observation points. To avoid introducing additional numerical dispersion in the streamline results, we chose the locations of the observation points such that they coincide with two nodes in the streamline grid. The first observation point, P1, is located in the region of rapid flow changes near the plume center-line (see Figure 4.7) and the second one, P2, in a region where the advance of the plume is relatively homogeneous. Figures 4.8 and 4.9 show simulated breakthrough curves for the four scenarios considered at P1 and P2, respectively. While all three numerical methods simulate concentration values that are similar for point P2, there are important di\ufb00erences in the simulated curves for P1. At P1, the solution is very sensitive to numerical dispersion because of the presence of a slow flow region between two fast advancing plume fingers, which creates high concentration gradients. Simulated concentrations with the MOC and streamline-based solvers at point P1 for the purely-advective case (2D) agree well, with the exception of numerical oscillation in the MOC solution. On the other hand, numerical dispersion is clearly observable in both, coarse and fine, TVD curves. In general, both mesh-based solvers predict earlier breakthrough for all the simulated scenarios because of additional transverse dispersion due to computing cell average concentrations. For example, in absence of transverse dispersion (2A) both mesh based solvers predict that the arrival of solute to the observation point P1 would occur around 80 days earlier than predicted by the streamline simulator. However, the di\ufb00erence between the streamline and mesh-based solvers becomes smaller as transverse dispersion increases and concentration values are smooth out at the grid scale, e.g. scenarios 2B and 2C. The solutions computed with the MOC and TVD solvers also become more similar as transverse dispersion increases and the advantages of the MOC solver to minimize numerical dispersion become less important. 136 \f1 A 1 0.6 0.6 C\/C0 0.8 C\/C0 0.8 B 0.4 0.4 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.2 0.3 0.4 0.5 0.6 0.7 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.8 0.2 0.3 0.4 Pore Volume 1 0.5 0.6 0.7 0.8 Pore Volume C 1 0.6 0.6 C\/C C\/C0 0.8 0 0.8 D 0.4 0.4 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.2 0.3 0.4 0.5 0.6 0.7 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.8 0.2 Pore Volume 0.3 0.4 0.5 0.6 0.7 0.8 Pore Volume Figure 4.8: Breakthrough curves at observation point P1 in Example 2. Point P1 is located in a region of rapid flow changes near the plume center-line. Each figure corresponds to one of the four scenarios simulated in Example 2: 2A, 2B, 2C and 2D. At P1 simulated concentrations are very sensitive to transverse dispersion. The numerical solutions computed with the streamline solver in absence of transverse dispersion (A and D) di\ufb00er significantly from the ones computed with the two mesh-based solvers. Those di\ufb00erences become smaller as transverse dispersion increases (B and C). Figure 4.10 shows a comparison of the simulated breakthrough curves at P1 using the streamline and MOC (fine grid) solvers. The streamline solver predicts a breakthrough curve for run 2A, which considers only longitudinal dispersion, that is similar to the curve for the purely-advective case (2D), but has earlier breakthrough and reaches the peak concentration at later time. This is the expected behavior for that situation, which corresponds to a quasi one-dimensional transport problem. When transverse dispersion is included (run 2B), the streamline simulator predicts a change in the first part of the curve as consequence of the transfer of solute mass from fast streamlines to slower ones, 137 \f1 A 1 0.6 0.6 C\/C0 0.8 C\/C0 0.8 B 0.4 0.4 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.2 0.3 0.4 0.5 0.6 0.7 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.8 0.2 0.3 0.4 Pore Volume 1 0.5 0.6 0.7 0.8 Pore Volume C 1 0.6 0.6 C\/C C\/C0 0.8 0 0.8 D 0.4 0.4 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.2 0.3 0.4 0.5 0.6 0.7 MOC Coarse MOC Fine TVD Coarse TVD Fine Streamlines 0.2 0 0.8 0.2 Pore Volume 0.3 0.4 0.5 0.6 0.7 0.8 Pore Volume Figure 4.9: Breakthrough curves at observation point P2 in Example 2. Point P2 is located in a relatively homogeneous flow region where the advance of the solute front is relatively uniform. Each figure corresponds to one of the four scenarios simulated in Example 2: 2A, 2B, 2C and 2D. Simulated concentrations with the streamline simulator and the two mesh-based solvers are similar independent of the longitudinal and transverse dispersivity values. 138 \fwhich results in an earlier breakthrough and change in slope with respect to the curves for runs 2A and 2D. In contrast, the breakthrough curves computed with the MOC solver, which performs well for the purely-advective case, do not show a clear distinction between the addition of longitudinal or transverse dispersion. When longitudinal dispersion is included the breakthrough curve shifts to the left of the curve for the purely-advective case, which is not consistent with the situation analyzed. Adding transverse dispersion results in an additional shift of the curve to the left, but there are no clearly distinguishable changes in slope as observed in the curve obtained with the streamline-based solver. This example demonstrates some of the advantages of the streamline simulator to study situations of theoretical interest such as the e\ufb00ect of transverse dispersion in the transport of solutes in heterogeneous porous media. 1 a 1 0.6 0.6 C\/C0 0.8 C\/C0 0.8 b 0.4 0.4 0.2 0 0.2 0.2 Run A Run B Run C Run D 0.3 0.4 0.5 0.6 0.7 Run A Run B Run C Run D 0 0.8 0.2 Pore Volume 0.3 0.4 0.5 0.6 0.7 0.8 Pore Volume Figure 4.10: Comparison of simulated breakthrough curves at observation point P1 for Example 2, (a) streamline simulator and (b) MOC solver using fine grid. Figure 4.11 shows a comparison of the simulated breakthrough curves at P2 using the streamline and MOC (fine grid) solvers for the four transport scenarios analyzed. With the exception of the purely-advective case simulated with the MOC solver, the simulated breakthrough curves are similar independently of the solver and dispersivity values considered. 139 \f1 a 1 0.6 0.6 C\/C C\/C0 0.8 0 0.8 b 0.4 0.4 0.2 0 0.2 0.2 Run A Run B Run C Run D 0.3 0.4 0.5 0.6 0.7 Run A Run B Run C Run D 0 0.8 0.2 Pore Volume 0.3 0.4 0.5 0.6 0.7 0.8 Pore Volume Figure 4.11: Comparison of simulated breakthrough curves at observation point P2 for Example 2, (a) streamline simulator and (b) MOC solver using fine grid. 4.4.2.3 Numerical oscillations Figure 4.12 shows simulated concentrations after injection of 0.4 pore volumes of solute for runs 2A and 2B. Negative and greater than source concentration values are colored black, thus dark areas within the domain boundaries indicate zones where numerical oscillations occur. Numerical oscillations present in the solutions computed with the MOC and TVD solvers cover most of the simulation domain including areas that have not been reached by the solute front. Table 4.5 and 4.6 lists the normalized maximum and minimum simulated concentrations, respectively. Minimum concentration values simulated with both mesh-based solvers, TVD and MOC, are negative for scenarios that include anisotropic dispersion (A, B) due to the presence of the o\ufb00-diagonal terms of the dispersion tensor. The TVD solver also produces small negative values for the advection-only case (D), but their magnitude is much smaller than for the runs that included anisotropic dispersion. In contrast, solutions computed with the streamline solver are always positive. Moreover, maximum concentration values computed with the TVD and MOC solvers are greater than the source concentration for some of the scenarios simulated because of spurious numerical oscillations. The magnitude of the oscillations is greater for scenarios that consider anisotropic dispersion (A and B), probably because of the presence of negative concentrations values that arise due to the presence of the cross-dispersion terms. The magnitude of the oscillations decreases when only advection (D) or isotropic dispersion are simulated (C). Solutions computed with the streamline solver are free of spurious oscillations in all cases. 140 \fFigure 4.12: Numerical oscillations in simulated concentrations for Example 2. Concentration values after injection of 0.4 pore volume of contaminated fluid. Interpolated streamline (first row), MOC (second row) and TVD solutions (third row) for scenarios 2A (left column) and 2B (right column). Negative and greater than source concentration values are shown as dark areas within the domain boundaries. Solutions computed with the MOC and TVD solver exhibit numerical oscillations that cover most of the domain. 141 \fMethod\\Run 2A 2B 2C 2D Streamlines 0 0 0 0 TVD Coarse -0.0285 -0.0171 0 <-0.0001 TVD Fine -0.0236 -0.0111 0 <-0.0001 MOC Coarse -0.0042 -0.0011 0 0 MOC Fine -0.0043 -0.0010 0 0 Table 4.5: Normalized minimum simulated concentration values for Example 2. Method\\Run 2A 2B 2C 2D Streamlines 1.0000 1.0000 1.0000 1.0000 TVD Coarse 1.0272 1.0147 1.0037 1.0063 TVD Fine 1.0588 1.0276 1.0000 1.0034 MOC Coarse 1.0435 1.0112 1.0000 1.0000 MOC Fine 1.0561 1.0076 1.0000 1.0000 Table 4.6: Normalized maximum simulated concentration values for Example 2. 4.4.2.4 Performance comparison Table 4.7 summarizes the normalized CPU time required to simulate the four di\ufb00erent scenarios analyzed in Example 2. The streamline solver is faster to solve advection. It is up three times faster than the TVD or MOC solvers for the coarse grid (64x64 cells) and more than thirty times faster for the fine grid (128x128 cells). However, the mesh-based solvers are faster if dispersion is included and the solution is computed using the coarse grid. Yet, the streamline solver is faster by a factor of about two, if the fine grid is used. This demonstrates that the streamline solver performs much better than mesh-based solvers to simulate two-dimensional problems. The di\ufb00erence in performance is more important when advection and longitudinal dispersion are simulated, which can be very valuable in many situations of practical interest. For example, simulating scenarios that consider only advection and longitudinal dispersion can be useful in the first stages of a model calibration, sensitivity analysis, evaluation of parameters uncertainty (Hill and Tiedeman, 2007) or in any situation where a large number of solute transport simulations is required. 142 \fMethod\\Run 2A 2B 2C 2D Streamlines 1.1 28.6 28.6 1.0 TVD Coarse 4.4 4.4 4.4 2.5 TVD Fine 55.1 55.1 48.1 29.0 MOC Coarse 5.5 5.5 5.5 3.4 MOC Fine 81.0 81.0 81.0 50.2 Table 4.7: Normalized CPU time required to simulate Example 2 for di\ufb00erent scenarios. Streamline solver is faster than mesh-based solvers to solve advection independently of the grid size. It is also faster to solve advection-dispersion than mesh-based solvers using a fine grid. 4.4.3 Example 3: Quarter Five-Spot in Heterogeneous Medium with Rate-Limited Sorption As a third example we consider the transport of a dissolved solute in groundwater that reacts with the porous medium and sorbs onto the solid grains. This example demonstrates the capacity of streamline-based simulations to easily incorporate heterogeneous chemical reactions that involve the aqueous and solid phases. Di Donato and Blunt (2004) studied a similar problem in the context of the migration of a reactive solute through fractured rocks. Sorption is usually modeled assuming local equilibrium, i.e. that solute sorption occurs almost instantaneously relative to the solute transport time scale. However, the local equilibrium assumption is not always valid (Valocchi, 1985) and it is necessary to modify the equilibrium model to incorporate rate-limited mass transfer e\ufb00ects. In those cases, sorption can be modeled as a first-order reversible kinetic reaction of the form (Haggerty and Gorelick, 1995) \ufffd \u2202S \u03b2 S = C\u2212 \u2202t \u03c1b Kd \ufffd (4.21) and \ufffd \u2202C \u03b2 S =\u2212 C\u2212 \u2202t \u03b7 Kd 143 \ufffd (4.22) \fwhere \u03b2 is the first-order mass transfer rate between the dissolved and solid phases [1\/T], Kd is the distribution coe\ufb03cient for the solid phase [M\/L3 ], \u03c1b is the bulk density of the solid, \u03b7 is the soil porosity, and S is the amount of mass in the solid phase [M\/M]. As \u03b2 decreases, mass transfer rates become smaller and sorption becomes negligible. On the other hand, as \u03b2 increases the solution becomes similar to the one obtained assuming local equilibrium. A similar mathematical model can be used to model mass transfer between mobile and immobile flow regions (Haggerty and Gorelick, 1995). In our streamline-based simulator, we compute the solution of the system of di\ufb00erential equations given by (4.21) and (4.22) at each node of the streamline grid using a firstorder implicit (backward Euler) discretization in time. To verify our implementation, we simulate the advective transport of a solute that undergoes rate limited sorption under four di\ufb00erent scenarios summarized in Table 4.8. We set the soil density value equal to 1,500 kg\/m3 and select Kd values such that the equivalent retardation factors, R = 1 + (\u03c1b \/\u03b7)Kd , are equal to 1.15 and 1.30. Run Kd (L\/mg) \u03b2 (1\/d) 3A 1 \u00b7 10\u22127 1 \u00b7 10\u22121 2 \u00b7 10\u22127 1 \u00b7 10\u22121 3B 3C 3D 1 \u00b7 10\u22127 2 \u00b7 10\u22127 1 \u00b7 10\u22124 1 \u00b7 10\u22124 Table 4.8: Parameters of the rate-limited sorption model used in Example 3. We compare concentrations simulated with the our streamline simulator and MOC and TVD solvers using the coarse grid. Figure 4.13 shows the simulated breakthrough curves at point P2. Solutions computed with the streamline solver and the MOC solver behave similarly. While the curves for scenarios 3A and 3C are retarded, the curves for scenarios 3B and 3D do not show retardation because in those cases sorption is limited by the small \u03b2 values used. As in the previous example simulations performed with the streamline solver were almost three times faster than the ones computed with the MOC solver. 144 \f1 a 0.8 Kd=1x10\u22127 \u03b2=10\u22121 0.6 C\/C0 K =1x10\u22127 \u03b2=10\u22124 d Kd=2x10\u22127 \u03b2=10\u22121 K =2x10\u22127 \u03b2=10\u22124 0.4 d 0.2 0 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.6 0.7 0.8 Pore Volume 1 b 0.8 0.6 Kd=1x10\u22127 \u03b2=10\u22121 C\/C0 Kd=1x10\u22127 \u03b2=10\u22124 Kd=2x10\u22127 \u03b2=10\u22121 0.4 Kd=2x10\u22127 \u03b2=10\u22124 0.2 0 0.2 0.3 0.4 0.5 Pore Volume Figure 4.13: Breakthrough at observation point P2 for di\ufb00erent mass transfer (\u03b2) and partition (Kd ) coe\ufb03cients considered in Example 3. Concentrations simulated with (a) streamline-based and (b) MOC solvers. 145 \f4.4.4 Example 4: Natural Biodegradation in Three-dimensional Heterogeneous Porous Media In this example, we simulate the natural biodegradation of a mixture of volatile organic compounds such as benzene, toluene, ethylbenzene, and xylenes (BTEX) in an heterogeneous aquifer with oxygen as electron acceptor. We simulate the aerobic reaction using an instantaneous explicit reaction model (Borden and Bedient, 1986; Rifai et al., 1987; Rifai and Bedient, 1990). The concentrations of oxygen ([O]) and hydrocarbon ([H]) at time t+1 given their values at time t are computed using (Clement et al., 1998) [H](t + 1) = \uf8f1 \uf8f4 \uf8f2[H](t) \u2212 [O](t)\/F [O](t + 1) = \uf8f1 \uf8f4 \uf8f20 and if [H](t) > [O](t)\/F if [H](t) \u2264 [O](t)\/F if [H](t) > [O](t)\/F \u00b7 [H](t) if [H](t) \u2264 [O](t)\/F \uf8f4 \uf8f30 \uf8f4 \uf8f3[O](t) \u2212 F (4.23) (4.24) where F is the stoichiometric reaction ratio between oxygen and the hydrocarbon, in this case BTEX, and it is assumed equal to 3.0 (Rifai et al., 1987; Clement et al., 1998). 4.4.4.1 Setup The domain is three-dimensional and rectangular with dimensions of 50 m in the x direction, 21 m in the y direction and 5 m in the vertical direction (z) and it is discretized using a regular Cartesian grid such that the cell spacing in the three directions is equal to 1 m. The hydrocarbon source is a well located at coordinates x=8.5 m, y=10.5 m and z=2.5 m that releases 0.2 m3 \/d of water with a BTEX concentration equal to 2 mg\/L. Oxygen is initially present in the natural groundwater and enters the domain with concentration equal to 5 mg\/L. 146 \fThe spatial distribution of the natural logarithm of the hydraulic conductivity, Y = ln(K), was generated assuming an exponential covariance model with mean value Y\u00af = 1.0 with K in units of meter per day (m\/d), variance \u03c3Y = 1.5 and correlation length equal to four times the grid spacing in the x and y directions and two times in the vertical direction. We solve the flow equation assuming steady-state conditions and a constant head di\ufb00erence of 0.4 m between the planes define by x = 0 and x = 50 and no flow conditions on the other faces. The spatial distributions of the generated hydraulic conductivity and computed flow velocity are shown in Figure 4.14. To evaluate the sensitivity of the solutions computed with the mesh-based solvers to the grid size, we refined the original coarse grid by a factor of two in each direction to obtain a fine grid with 100 cells in the longitudinal, 42 cells in the transverse and 10 cells in the vertical directions, respectively. We applied the same procedure as in the Example 2 to compute a flow solution that is similar to the one computed in the coarse grid. We consider three transport scenarios summarized in Table 4.9: one that includes only advection, a second one that considers advection and biodegradation, and a third one that also includes dispersion. Run \u03b1L \u03b1T Reaction 4A 0 0 Yes 4B 0.1 0.01 Yes 4C 0 0 No Table 4.9: Definition of three scenarios simulated in Example 4: advective transport with biodegradation (4A), advective-dispersive transport with biodegradation (4B) and conservative advective transport (4C). The streamline grid includes 281 streamlines with average node spacing along streamlines equal to 1 m. We use a constant smoothing length equal to 1 m to ensure that every node in the domain has at least a minimum of 10 neighboring nodes. To compute the MOC solution we use the same parameters listed in Table 4.2. We simulate this problem using our streamline simulator and the RT3D numerical model Clement (1997), which is a modified version of MT3DMS that adds the capability to 147 \fFigure 4.14: Spatial distribution of natural logarithm of hydraulic conductivity and flow velocity magnitude used in Example 4. Magnitude of hydraulic conductivity and flow velocity vary more than six and two orders of magnitude, respectively. 148 \fsimulate chemical reactions. RT3D and our streamline solver utilize the same operatorsplitting approach to incorporate chemical reactions. We simulate a total of 10,000 days which is longer than the time required for the plumes simulated with the two mesh-based solvers to reach steady-state conditions. We chose time step values to satisfy the stability or accuracy criteria required by each method. Table 4.10 summarizes the numerical discretizations and their associated time steps. Method # Nodes or Cells Time Step (d) # Time Steps Streamlines 13,539 2.0 5,000 TVD Coarse 5,250 3.2 3,300 TVD Fine 42,000 0.4 27,816 MOC Coarse 75,562 5.0 2,000 MOC Fine 565,464 0.6 16,000 Table 4.10: Spatial and temporal discretizations used to simulate Example 4. Because of the flow configuration there are two di\ufb00erent regions separated by a surface that divides the flow between flow that enters the domain through the well and natural groundwater (Cirpka et al., 1999b). In absence of longitudinal and transverse mixing, the substrate (BTEX) and oxygen are physically segregated and occupy two di\ufb00erent regions and biodegradation cannot take place. If longitudinal dispersion is included, biodegradation only occurs until all the oxygen initially present in the area located downgradient from the source is depleted or the plume exits the domain. Thus, in the long term biodegradation is only possible if transverse dispersion mixes the natural groundwater and the contaminated water (Cirpka et al., 1999b; Ham et al., 2004). It is expected that a steady-state plume will be established when the mass of substrate entering the domain is equal to the amount that is consumed through biodegradation. Since the reaction rate is controlled by transverse mixing between the two flow regions, the length of steady-state plumes depends only on the transverse dispersivity value (Ham et al., 2004). 4.4.4.2 Simulated concentrations Figure 4.15 shows simulated BTEX and oxygen concentrations at the nodes that define the streamline grid after 10,000 days since the initial release of BTEX for the scenario 149 \fthat includes advection and biodegradation (4A). As expected, oxygen is depleted in the region located downgradient of the BTEX spill. Because of the absence of transverse dispersion there is a sharp transition in BTEX and oxygen concentrations between two flow regions that correspond to BTEX-contaminated water flowing from the well and natural groundwater. BTEX concentration values along most of the streamlines are equal to the source concentration, which indicates that flow coming from the spill has completely replaced the original groundwater. Yet, few slower streamlines present concentrations that are lower than the source concentration as a result of biodegradation due to numerical dispersion along streamlines. The presence of those lower concentration values indicates that flow originating at the contaminant source and moving along slow streamlines has not reached the outlet face before the end of the simulation. Figure 4.16 shows simulated concentration for the scenario that includes advection, dispersion and biodegradation (4B). Oxygen is depleted in the region located downgradient of the BTEX spill. However, in contrast to the situation without dispersion shown in Figure 4.15, BTEX and oxygen concentrations change gradually between the two flow regions because of mixing due to transverse dispersion. In this case, natural degradation takes place in most of the plume volume and BTEX concentration values gradually decrease along streamlines. At the outlet face they are between 25 to 50% lower than the source concentration. Figure 4.17 shows simulated concentrations in the vertical plane defined by the coordinate y=11.5 at the end of the simulation using the streamline-based solver and the MOC and TVD solvers using the fine grid. For comparison purposes the streamline solution was interpolated onto a grid that is similar to the one used in the MOC and TVD simulations. For the conservative advective case the streamline and MOC solutions are similar, however, the TVD solver produces lower concentrations after some distance from the source as result of numerical dispersion. When aerobic degradation is included, hydrocarbon concentrations simulated with the TVD and MOC solvers are much lower than for the conservative case after some distance from the source. The di\ufb00erence between the conservative and reactive case is due to numerical dispersion that mixes BTEX and oxygen even in absence of physical dispersion and results in the degradation of most of the released BTEX before it exits the domain. The streamline solution for the case that includes biodegradation is similar to the one for the conservative scenario, with the exception of minor di\ufb00erences near the top center of the domain. Those di\ufb00erences are due to slow streamlines that cross that region. The leading BTEX concentration along those streamlines is lower than in the conservative 150 \fFigure 4.15: Simulated concentrations at nodes along streamlines after 10,000 days since the initial release of BTEX for the scenario that includes advective transport with biodegradation in Example 4. Only 10,000 nodes are shown. Oxygen is depleted in the region located downgradient of the BTEX spill. Because of the absence of transverse dispersion there is a sharp transition in BTEX and oxygen concentrations between two flow regions that correspond to flow originating at the well and natural groundwater. 151 \fFigure 4.16: Simulated concentrations at nodes along streamlines after 10,000 days since the initial release for the scenario that includes advection, dispersion and biodegradation in Example 4. Only 10,000 nodes are shown. Oxygen is depleted in the region located downgradient of the BTEX spill. However, in this case BTEX and oxygen concentrations change gradually between the two flow regions because of mixing due to transverse dispersion. 152 \fcase because of longitudinal numerical dispersion that mixes oxygen and BTEX (see Figure 4.15). However, the artificial longitudinal mixing results in small errors when compared with the large errors observed in the simulated concentrations obtained with the two mesh-based solvers. When transverse dispersion is included, the streamline solver, as expected, predicts lower concentrations after some distance from the source as consequence of transverse mixing that provides oxygen to degrade BTEX that flows through the center of the plume. The TVD and MOC solvers also predict lower concentrations than for the advective case with biodegradation, but the e\ufb00ect on the plume shape is relatively minor. Figure 4.17: Simulated concentration values for Example 4 at vertical plane defined by y=11.5 m. Streamlines (top), MOC (middle), and TVD (bottom) for advective transport (left column), advective transport with biodegradation (middle column) and advective-dispersive transport with biodegradation (right column). Streamline solution shows concentration values interpolated onto a grid of 100x42x10 cells. TVD and MOC solutions computed using the fine grid. Vertical scale is exaggerated by a factor of two. Figure 4.18 shows simulated concentrations after 10,000 days of BTEX injection in the horizontal plane that crosses the domain center defined by coordinate z=2.5 m. This figure confirms the results observed in Figure 4.17. The simulated plume with the MOC and TVD solvers for the case that included advection and biodegradation are shorter and thinner than for the conservative case. Including transverse dispersion has only an small e\ufb00ect in the overall shape and extension of the simulated plume. In contrast the streamline solver predicts similar plumes for the purely advective and the advectivereactive cases and a smaller plume when transverse dispersion is included. 153 \fFigure 4.18: Simulated concentration values for Example 4 at horizontal plane defined by z=2.5 m. Streamlines (top), MOC (middle), and TVD (bottom) for advective transport (left column), advective transport with biodegradation (middle column) and advective-dispersive transport with biodegradation (right column). The streamline solution shows concentration values interpolated onto a grid of 100x42x10 cells. TVD and MOC solutions were computed using fine grid. Figure 4.19 shows contours of concentration values equal to 1 mg\/L equivalent to 50 % of the source concentration for the horizontal plane shown in Figure 4.18. For the conservative case the simulated concentrations with the streamline solver and the TVD and MOC solvers using the coarse and fine grids are similar. However, the simulated plumes with the mesh-based solvers using the coarse and fine grids are di\ufb00erent when biodegradation is included. The coarse solution predicts a shorter plume, while the fine grid solutions predict a longer plume that looks more similar to the one simulated with the streamline-based solver. The observed convergence of the mesh-based solutions towards the streamline-based solution as the grid spacing decreases demonstrates that, for this problem, a streamline-based formulation may provide a high level of accuracy at a fraction of the memory requirements and, as discussed below, computational cost that would be required by a mesh-based solver. 154 \fFigure 4.19: Comparison of simulated concentration values for Example 4 at horizontal plane defined by z=2.5 m. Contours of BTEX concentration equal to 50% of the source concentration for advective transport (first row), advective transport with biodegradation (second row), and advectivedispersive transport with biodegradation (third row). Streamline solution (black), TVD solution (red) and MOC solution (blue) computed in coarse (left column) and fine (right column) grids. Mesh-based solutions overestimate biodegradation as consequence of numerical transverse dispersion. The error is larger if the solution is computed in the coarse grid. In absence of physical transverse dispersion, the mesh-based solvers predict plumes that are similar to the ones computed including transverse dispersion. The e\ufb00ects of numerical dispersion on the simulated concentration values using the meshbased solvers can be more easily understood by analyzing a transverse profile as shown in Figure 4.20. That figure shows normalized BTEX and oxygen concentration values along the profile parallel to the y direction at coordinates x=35 m and z=2.5 m simulated using the MOC and TVD solvers using the fine grid. The figure shows that in absence of transverse dispersion and reaction, there is an artificial mixing region where BTEX and oxygen are present. That mixing region is due to two factors. First, mesh-based solvers compute average concentration values over a volume (cell or element) that is not necessarily aligned with the direction of the flow, thus it is impossible to capture the flow divide that separates the two flow regions Cirpka et al. (1999b). Second, because of the 155 \fheterogeneity of the medium the flow velocity is non-uniform and solvers based on finite volume formulations, such as the multidimensional TVD solver included in MT3DMS, su\ufb00er grid orientation e\ufb00ects that introduce additional numerical dispersion. Both causes are related but are independent as demonstrated by a comparison of the profiles simulated with the MOC and TVD solvers. Because of its hybrid Eulerian-Lagrangian nature, the MOC solver is able to control the numerical dispersion due to variations in the flow velocity, however it cannot remove the e\ufb00ect of the concentration averaging over a cell volume. Therefore, the width of the simulated mixing region is equal to two or three times the dimension of a grid cell. On the other hand, the solution computed with the TVD solver is greatly a\ufb00ected by numerical dispersion caused by the non-uniform flow velocity, which results in a much larger area (approximately ten cells) where BTEX and oxygen overlap. If biodegradation is included, degradation of BTEX takes place within the artificial mixing region. Thus, the simulated plume is thinner than in the conservative case. Although, the profiles shown in Figure 4.20 are illustrative of the e\ufb00ect of numerical dispersion at a given control plane, the overall shape of the plume is the result of the cumulative e\ufb00ect of numerical dispersion and biodegradation that occur between the source and the control plane. For example, the MOC solution for the conservative case shows much less overlap of BTEX and oxygen than the TVD solution. However, the widths of the simulated plumes for the reactive scenarios are similar. This confirms that in presence of chemical reactions even small numerical errors observed in conservative transport simulations can be amplified to produce an overall solution that is very similar to the one computed with less accurate methods, e.g. TVD. Finally, we must mention that simulated concentrations with the MOC and TVD solvers include negative values and values greater than the source or natural groundwater concentrations. The magnitude of those numerical oscillations is larger for the scenario that includes dispersion because of the presence of the cross-terms in the dispersion approximation. 4.4.4.3 Breakthrough curves As an additional comparison between the streamline, TVD and MOC solvers, we also recorded the simulated concentrations versus time at two observation locations P1 and P2. We chose the location of those observations points such that they coincide with the position of nodes along streamlines and that are located close to the flow divide that 156 \f1 a 0.8 BTEX\u2212A Oxygen\u2212A BTEX\u2212B Oxygen\u2212B BTEX\u2212C Oxygen\u2212C C\/C0 0.6 0.4 0.2 0 0 5 10 15 20 15 20 y(m) 1 b 0.8 C\/C0 0.6 0.4 BTEX\u2212A Oxygen\u2212A BTEX\u2212B Oxygen\u2212B BTEX\u2212C Oxygen\u2212C 0.2 0 0 5 10 y(m) Figure 4.20: Simulated concentration values for Example 4 along the profile parallel to y direction at coordinates x=35 m and z=2.5 m. Normalized BTEX and oxygen concentration values computed using (a) MOC and (b) TVD solvers in fine grid for advective transport with biodegradation (A), advective-dispersive transport with biodegradation (B), and advective transport (C). In absence of transverse mixing and reaction, there is an overlap (mixing region) of BTEX and oxygen (black lines) because of numerical dispersion. If biodegradation is included, BTEX and oxygen react within that numerical mixing region. 157 \fseparates the flow originating at the spill and the natural groundwater flow. Figure 4.21 shows the location of the two observation points with respect to the contaminant source and simulated plume defined by the 1 mg\/L BTEX contour. Point P1 is located at approximately 7 m downgradient of the BTEX source along the main direction of the flow while point P2 is located 10 m farther downgradient from P1. Figure 4.21: Location of contaminant source (red dot) and the two observation wells (black dots) in Example 4. Solid line corresponds to simulated 1 mg\/L BTEX concentration in plane defined by coordinate z=2.5 m. Figure 4.22 shows simulated BTEX breakthrough curves at the two observation points for the scenario that includes only advection. Concentrations simulated with the streamline, MOC and TVD solvers in the coarse and fine grids are similar close to the location of the source, i.e. at P1. However, simulated concentrations farther from the source, at point P2, are di\ufb00erent. Curves that correspond to the TVD and MOC solvers show earlier breakthrough. Furthermore, solutions computed with the TVD solver in the coarse and fine grid do not reach the source concentration at point P2, which indicates artificial dilution due to numerical mixing that is more important for the solutions computed using the coarse grid. Both solutions computed with the MOC solver show large numerical oscillations. On the other hand, the breakthrough curve corresponding to the streamline-based solver also shows some longitudinal numerical dispersion. To demonstrate that that error can be easily avoided, we also simulated this scenario using a streamline grid that has the same number of streamlines but has a smaller average node spacing equal to one fifth of the original one, i.e. 0.2 m. The breakthrough curve simulated using the refined streamline grid is very sharp and concentration values go from zero to the source concentration in a very short time, which is the expected behavior for this scenario that does not include 158 \ftransverse or longitudinal dispersion. Nevertheless, as discussed above, errors due to longitudinal dispersion along streamlines are minor in comparison to the errors caused by the variable flow velocity orientation with respect to the main axes of the numerical grid associated to the MOC and TVD solvers. Figure 4.23 shows simulated BTEX breakthrough curves at the two observation points for the scenario that includes advection and biodegradation. As in the conservative case, simulated concentrations with the streamline, MOC and TVD solvers in the fine grid are similar close to the location of the BTEX release at P1. However, simulated concentrations with the TVD and MOC solvers at point P2 are much lower than the source concentration because of the combined action of numerical transverse mixing and biodegradation. Simulated concentrations are even smaller when computed in the coarse grid because of larger numerical errors. A comparison with Figure 4.22 shows that in this case di\ufb00erences between the simulated concentrations using the MOC and TVD solvers and the streamline-based solver are much more important that for the conservative case. This demonstrates how the addition of chemical reactions can amplify errors observed in conservative solute transport simulations. 4.4.4.4 Performance Table 4.11 summarizes the normalized CPU time required to simulate the two scenarios than include biodegradation. The streamline solver is faster than the mesh-based solvers to simulate advection and biodegradation independent of the grid size and number of time steps. However, it is much slower than the mesh-based solvers using the coarse grid and it is slightly slower than the TVD solver using the fine grid when dispersion is included. 159 \f1 P1 0.8 C\/C 0 0.6 0.4 Coarse TVD Fine TVD Coarse MOC Fine MOC Streamlines \u2206 s = 1.0 Streamlines \u2206 s = 0.2 0.2 0 0 0.1 0.2 0.3 0.4 Pore Volume 1 P2 0.8 C\/C 0 0.6 0.4 Coarse TVD Fine TVD Coarse MOC Fine MOC Streamlines \u2206 s = 1.0 Streamlines \u2206 s = 0.2 0.2 0 0 0.1 0.2 0.3 0.4 Pore Volume Figure 4.22: Simulated BTEX concentration versus time for Example 4 assuming advective transport only. Concentrations simulated with the streamline, MOC and TVD solvers in the coarse and fine grids are similar close to the location of the BTEX release (P1). However, simulated concentrations farther from the source at point P2 are di\ufb00erent because of the numerical dispersion that a\ufb00ects the solution computed with the TVD and MOC solvers. 160 \f1 P1 0.8 C\/C 0 0.6 0.4 Coarse TVD Fine TVD Coarse MOC Fine MOC Streamlines 0.2 0 0 0.1 0.2 0.3 0.4 0.3 0.4 Pore Volume 1 P2 0.8 C\/C 0 0.6 0.4 Coarse TVD Fine TVD Coarse MOC Fine MOC Streamlines 0.2 0 0 0.1 0.2 Pore Volume Figure 4.23: Simulated BTEX concentration versus time for Example 4 assuming advective transport and biodegradation. Concentrations simulated with the streamline, MOC and TVD solvers in the fine grid are similar close to the location of the BTEX release (P1). However, simulated concentrations with the TVD and MOC solvers farther from the source, at point P2, are much lower than the source concentration because of the combined action of numerical transverse mixing and biodegradation. Simulated concentrations are smaller when computed in the coarse grid because of the larger numerical errors. 161 \fMethod\\Run 4A 4B Streamlines 1.0 132.7 TVD Coarse 1.4 1.7 TVD Fine 90.4 117.1 MOC Coarse 5.0 5.7 MOC Fine 341.5 385.8 Table 4.11: Normalized CPU time required to simulate Example 4 for the two scenarios than include biodegradation. The streamline solver is faster than the mesh-based solvers to solve advection and biodegradation independent of the grid size. However, it is much slower than the mesh-based solvers using the coarse grid and it is slightly slower than the TVD solver using the fine grid when dispersion is included. It is somehow surprising that the streamline solver using more than 13,000 nodes and 5,000 time steps is faster than the TVD solver using a grid that has only 5,250 cells and 3,300 time steps (see Table 4.10) to simulate scenario 4A. This di\ufb00erence is due to the streamline-formulation to solve advection that allows the utilization of more e\ufb03cient and simple data structures to solve multiple one-dimensional problems versus more complex and costly ones required by multidimensional solvers. That advantage of the streamlinebased formulation makes it even more attractive for parallel implementations. The advantages of the streamline-based solver are even more important when compared to mesh-based solutions of similar level of accuracy, which require using a grid with fine discretization. At the same time that the computational cost and memory requirements increase because of the larger number of cells due to the finer discretization, the stability restrictions of the explicit mesh-based solvers require using smaller time steps. The net e\ufb00ect is a rapid increase in the simulation time with each level of grid refinement. For example, the explicit multidimensional TVD solver in MT3DMS requires that (Zheng and Wang, 1999), \u2206t \u2264 1 |vx | \u2206x + |vy | \u2206y + |vz | \u2206z (4.25) The restriction on the time step is global and it is computed using the maximum velocity in the grid. The flow velocity distribution in heterogeneous porous media is skewed and most cells have velocities that are much lower than the maximum value as shown in Figure 162 \f4.24. Thus, the use of a single time step imposes an unnecessarily restrictive condition in most of the domain. However, because of the global coupling of the concentration values introduced by use of a multidimensional solver, it is impossible to use di\ufb00erent time steps according to the local flow velocities. The distribution of flow velocities is even more asymmetric for more heterogeneous porous media, thus the global stability restriction is even costlier in those cases. 900 12000 a b 800 10000 Number of Cells Number of Cells 700 600 500 400 300 8000 6000 4000 200 2000 100 0 0 0.01 0.02 0.03 0.04 0.05 0.06 0 0 0.07 Velocity Magnitude 0.01 0.02 0.03 0.04 0.05 0.06 0.07 Velocity Magnitude Figure 4.24: Distribution of cells according to the flow velocity magnitude for the (a) coarse grid and (b) fine grid. Explicit mesh-based solvers such as the multidimensional TVD solver in MT3DMS must satisfy a global stability restriction, thus concentration values must be updated using a single time step for all the cells in the grid. The global time step is computed based on the maximum velocity at any of the cells in the grid. However, the flow velocity distribution in heterogeneous porous media is skewed and most cells have velocities that are much lower than the maximum value. The distribution of the flow velocity at the streamline nodes follows a distribution that is similar to the one of the magnitude of the flow velocity at the grid cells as shown in Figure 4.25. Yet, the explicit solution of advection must satisfy a local stability restriction that is given by the maximum velocity along individual streamlines, which has a much more uniform distribution. While short time steps must be used to advect concentration values along few fast streamlines, larger time steps can be used along many other slower streamlines. The possibility of using variable time steps according to the flow regions sampled by individual streamlines can result in important performance advantages and constitutes one of the main advantages of streamline-based simulations. 163 \f2000 40 a 1800 Number of Streamlines 1600 Number of Nodes b 35 1400 1200 1000 800 600 30 25 20 15 10 400 5 200 0 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0 0 0.08 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 Max. Velocity Magnitude Velocity Magnitude Figure 4.25: Distribution of (a) nodes along streamlines according to the flow velocity magnitude and (b) number of streamlines based on the maximum velocity magnitude along individual streamlines. The distribution of the flow velocity at the streamline nodes follows a distribution that is similar to the one of the magnitude of the flow velocity at the grid cells shown in Figure 4.24. However, the explicit solution of advection along individual streamlines must satisfy a local stability restriction that is given by the maximum velocity along individual streamlines. While short time steps must be used to advect concentration values along few fast streamlines, larger time steps can be used along many other slower streamlines. The increase in the time required to complete the streamline-based simulations for scenario 4A and 4B is due to the approximation for the dispersion terms. Because of the irregularity of the flow, streamlines and nodes along them are irregularly distributed in space. Thus, the number of neighbor nodes that contribute to the SPH approximation for dispersion, if a constant smoothing length is used, varies in di\ufb00erent regions of the domain and ranges from 10 in divergent flow regions or close to the boundaries to 138 in convergent flow regions or near the contaminant source as shown in Figure 4.26. While few nodes have less than 20 neighbors which is considered a reasonable number (Cleary and Monaghan, 1999), most nodes have many more neighbors resulting in a large computational overhead. That computational disadvantage can be overcome by using a variable smoothing length that is automatically adjusted to get a relatively constant number of neighboring nodes (Monaghan, 2005). However, the use of an adaptive smoothing length would result in a more complicated implementation. 164 \f1200 Min. 10 Max. 138 Number of Nodes 1000 800 600 400 200 0 0 20 40 60 80 100 120 140 Number of Neighbors Figure 4.26: Spatial distribution of nodes and number of nodes according to the number of neighboring nodes that contribute to the SPH summation to approximate dispersion. The selection of a constant smoothing length to guarantee a reasonable number of neighboring nodes for any node in the domain results in an irregular distribution of the number of nodes that contribute to the summation in (4.17). While few nodes have less than 20 neighbors which is considered a reasonable number Cleary and Monaghan (1999), most nodes have many more neighbors resulting in a large computational overhead. 165 \fAlthough, the SPH-based approximation for dispersion introduces a large computational overhead, the time required by the streamline-base solver to compute the solution of the overall transport equation that includes advection and dispersion is comparable to the one required by the fastest of the two mesh-based solvers (TVD) using a fine grid and it is much lower than the one required by the slowest one (MOC) . 4.5 Conclusions We derived and implemented a numerical scheme to incorporate dispersion, including transverse dispersion, in multidimensional streamline simulations. Because the new scheme does not require the mapping of concentration values onto a grid it does not introduce additional numerical dispersion. Because the new scheme is able to simulate transverse dispersion and completely avoid numerical dispersion, it is an attractive alternative to obtain accurate simulations of problems that involve chemical reactions that are controlled by transverse mixing such as bio-remediation or natural attenuation of contaminant plumes. Furthermore, we demonstrated theoretically and by numerical simulations that the proposed scheme guarantees solutions that are free of numerical oscillations even when the dispersion tensor is anisotropic. This is an important advantage of the new method over traditional numerical approximations that su\ufb00er numerical artifacts that lead to negative concentration values if the cross-terms of the dispersion tensor are included. Although, such numerical oscillations can be tolerated in conservative solute transport simulations, they may compromise the stability of the solution if non-linear reactions are included. For a set of two- and three-dimensional benchmark problems, the new streamline method was competitive in terms of performance with state of the art finite volume and a EulerianLagrangian solvers, while avoiding the numerical artifacts that plague the solutions computed with those solvers. 166 \f4.6 References Aris, R., Vectors, Tensors and the Basic Equations of Fluid Mechanics, Dover Publications, 1989. Barnes, J., and P. Hut, A hierarchical O (N log N) force-calculation algorithm, Nature, 324 , 446\u2013449, 1986. Batycky, R., M. Blunt, and M. Thiele, A 3D field-scale streamline-based reservoir simulator, SPE Reservoir Engineering, 12 , 246\u2013254, 1997. Bear, J., Dynamics of fluids in porous media, Dover, 1988. Bensabat, J., Q. Zhou, and J. Bear, An adaptive pathline-based particle tracking algorithm for the Eulerian\u2013Lagrangian method, Adv. Water Res., 23 , 383\u2013397, 2000. Borden, R., and P. Bedient, Transport of dissolved hydrocarbons influenced by oxygenlimited biodegradation 1. Theoretical development, Water Resour. Res., 22 , 1986. Cirpka, O., E. Frind, and R. Helmig, Numerical methods for reactive transport on rectangular and streamline-oriented grids., Adv. Water Res., 22 , 711\u2013728, 1999a. Cirpka, O., E. Frind, and R. Helmig, Numerical simulation of biodegradation controlled by transverse mixing, J. Contam. Hydrol., 40 , 159\u2013182, 1999b. Cleary, P. W., and J. J. Monaghan, Conduction modelling using smoothed particle hydrodynamics, J. Comput. Phys., 148 , 227\u2013264, 1999. Clement, T., RT3D-A modular computer code for simulating reactive multi-species transport in 3-Dimensional groundwater aquifers, Battelle Pacific Northwest National Laboratory Research Report, Tech. rep., PNNL-SA-28967, 1997. Clement, T., Y. Sun, B. Hooker, and J. Petersen, Modeling multispecies reactive transport in ground water, Name: Ground Water Monitoring and Remediation, 18 , 1998. Cordes, C., and W. Kinzelbach, Continuous groundwater velocity fields and path lines in linear, bilinear, and trilinear finite elements., Water Resour. Res., 28 , 2903\u20132911, 1992. Crane, M., and M. Blunt, Streamline-based simulation of solute transport, Water Resour. Res., 35 , 3061\u20133078, 1999. 167 \fDi Donato, G., and M. Blunt, Streamline-based dual-porosity simulation of reactive transport and flow in fractured reservoirs, Water Resour. Res., 40 , 2004. Di Donato, G., E. Obi, and M. Blunt, Anomalous transport in heterogeneous media demonstrated by streamline-based simulation, Geophys. Res. Lett., 30 , 1608, 2003. Gingold, R. A., and J. J. Monaghan, Smoothed particle hydrodynamics: Theory and application to non-spherical stars, Mon. Not. R. Astron. Soc., 181 , 375\u2013389, 1977. Haggerty, R., and S. Gorelick, Multiple-rate mass transfer for modeling di\ufb00usion and surface reactions in media with pore-scale heterogeneity, Water Resour. Res., 31 , 1995. Ham, P., R. Schottinga, H. Prommerb, and G. Davisc, E\ufb00ects of hydrodynamic dispersion on plume lengths for instantaneous bimolecular reactions, Adv. Water Resour., 27 , 803\u2013813, 2004. Harbaugh, A., and M. McDonald, User\u2019s documentation for MODFLOW-96, an update to the US Geological Survey modular finite-di\ufb00erence ground-water flow model, Tech. rep., US Geological Survey, 1996. Hernquist, L., and N. Katz, TREESPH - A unification of SPH with the hierarchical tree method, Astrophys. J. Suppl. S., 70 , 419\u2013446, 1989. Herrera, P., and A. Valocchi, Positive solution of two-dimensional solute transport in heterogeneous aquifers, Ground Water, 44 , 803\u2013813, 2006. Herrera, P., M. Massabo, and R. Beckie, Evaluation of particle approximations to simulate anisotropic dispersion, in preparation, 2009a. Herrera, P., M. Massabo, and R. Beckie, A meshless method to simulate solute transport in heterogeneous porous media, Adv. Water Resour., 32 , 413\u2013429, 2009b. Hill, M., and C. Tiedeman, E\ufb00ective groundwater model calibration: With analysis of data, sensitivities, predictions, and uncertainty, Wiley-Interscience, 2007. Jameson, A., Positive schemes and shock modelling for compressible flows, Int. J. Numer. Methods Fluids, 20 , 1995. Jubelgas, M., V. Springel, and K. Dolag, Thermal conduction in cosmological SPH simulations, Mon. Not. R. Astron. Soc., 351 , 423\u2013435, 2004. Kuzmin, D., and S. Turek, Flux correction tools for Finite Elements, J. Comput. Phys., 175 , 525\u2013558, 2002. 168 \fLeVeque, R., Finite Volume Methods for Conservation Laws, Cambridge University Press, Cambridge, UK, 2002. Lichtner, P., S. Kelkar, and B. Robinson, New form of dispersion tensor for axisymmetric porous media with implementation in particle tracking., Water Resour. Res., 38 , 1146, 2002. Lipnikov, K., M. Shashkov, D. Svyatskiy, and Y. Vassilevski, Monotone finite volume schemes for di\ufb00usion equations on unstructured triangular and shape-regular polygonal meshes, J. Comput. Phys., 227 , 492\u2013512, 2007. Lucy, L., A numerical approach to the testing of the fission hypothesis, Astron. J., 82 , 1013\u20131024, 1977. Matringe, S., Accurate streamline tracing and coverage, Master\u2019s thesis, Stanford University, 2004. Monaghan, J., Smoothed particle hydrodynamics, Rep. Prog. Phys., 68 , 1703\u20131759, 2005. Monaghan, J. J., Smoothed particle hydrodynamics, Annu. Rev. Astron. Astrophys., 30 , 543\u2013574, 1992. Obi, E., and M. Blunt, Streamline-based simulation of advective-dispersive solute transport, Adv. Water Resour., 27 , 913\u2013924, 2004. Obi, E. I., and M. J. Blunt, Streamline-based simulation of carbon dioxide storage in a North Sea aquifer, Water Resour. Res., 42 , W03,414, 2006. Oran, E., and J. Boris, Numerical simulation of reactive flow, Cambridge University Press, 2000. Pollock, D., Semianalytical computation of path lines for Finite-Di\ufb00erence models, Ground Water, 26 , 743\u2013750, 1988. Prevost, M., M. Edwards, and M. Blunt, Streamline tracing on curvilinear structured and unstructured grids, Soc. Petrol. Eng. J., 7 , 139\u2013148, 2002. Rifai, H., and P. Bedient, Comparison of biodegradation kinetics with an instantaneous reaction model for groundwater, Water Resour. Res., 26 , 637\u2013645, 1990. 169 \fRifai, H., P. Bedient, R. Borden, and J. Haasbeek, BIOPLUME II: Computer model of two-dimensional contaminant transport under the influence of oxygen limited biodegradation in ground water, Tech. rep., National Center for Ground Water Research, Rice University, 1987. Steefel, C., and K. MacQuarrie, Approaches to modeling of reactive transport in porous media, Reviews in Mineralogy and Geochemistry, 34 , 85\u2013129, 1996. Thiele, M., Streamline simulation, in 7th International Forum on Reservoir Simulation, Forum on Reservoir Simulation, 2003. Thiele, M., Streamline simulation, in 8th International Forum on Reservoir Simulation, Forum on Reservoir Simulation, 2005. Thiele, M., R. Batycky, and M. Blunt, Simulating flow in heteroneous systems using streamtube and streamlines, SPE Reservoir Engineering, pp. 5\u201312, 1996. Thiele, M., R. Batycky, and M. Blunt, A streamline-based 3D field-scale compositional reservoir simulator, Soc. Petrol. Eng. J., 1997. Tompson, A., Numerical simulation of chemical migration in physically and chemically heterogeneous porous media, Water Resour. Res., 29 , 3709\u20133726, 1993. Valocchi, A., Validity of the local equilibrium assumption for modeling sorbing solute transport through homogeneous soils, Water Resour. Res., 21 , 1985. Viccione, G., V. Bovolin, and E. Pugliese, Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations, Int. J. Numer. Meth. Fl., 58 , 625\u2013638, 2008. Waltz, J., G. L. Page, S. D. Milder, J. Wallin, and A. Antunes, A performance comparison of tree data structures for N-Body simulation, J. Comput. Phys., 178 , 1\u201314, 2002. Wang, H., and M. Anderson, Introduction to groundwater modelling, Academic Press, 1982. Welton, W., Two-dimensional PDF\/SPH simulations of compressible turbulent flows, J. Comput. Phys., 139 , 410\u2013443, 1998. Zheng, C., and G. Bennet, Applied Contaminant Transport Modelling: Theory and Practice, Van Nostrand Reinhold, New York, 1995. 170 \fZheng, C., and P. Wang, MT3DMS: A Modular Three-Dimensional Multispecies Transport Model for Simulation of Advection, Dispersion, and Chemical Reactions of Contaminants in Groundwater Systems; Documentation and User\u2019s Guide, Contract Report SERDP-99-1, US Army Engineer Research and Development Center, Vicksburg, MS , 1999. 171 \fChapter 5 Conclusions Previous chapters presented the derivations, implementation and evaluation of two new numerical methods for the simulation of conservative and reactive solute transport in natural porous media. Both approximations are based on a continuum description of reactive transport, thus parameters and variables are defined at the REV or local-scale. Chapter 2 presents the derivation and implementation of a meshless approximation for the advection-dispersion equation derived from smoothed particle hydrodynamics (SPH). Although, SPH formulations had been previously used to simulate solute transport at the pore (Zhu et al., 1999; Zhu and Fox, 2001, 2002; Tartakovsky et al., 2007) and laboratory (Tartakovsky et al., 2008) scales, Chapter 2 presents one of the first attempts reported in the literature to use meshless methods to simulate solute transport in porous media at the field-scale together with the work of Zimmermann et al. (2001), Li et al. (2003) and Praveen Kumar and Dodagoudar (2008). Chapter 3 presents the derivation of a new SPH approximation to simulate anisotropic dispersion, which extends the traditional SPH scheme for di\ufb00usion and thermal conduction (Cleary and Monaghan, 1999; Zhu and Fox, 2001; Jubelgas et al., 2004) used in Chapter 2. Results of numerical simulations demonstrated that the accuracy of the new approximation depends upon multiple parameters such as: average particle spacing, kernel function, smoothing length, and, most importantly, degree of particle disorder. This feature is common to other kernel interpolation methods such as the particle strength exchange (PSE) method (Degond and Mas-Gallic, 1989; Zimmermann et al., 2001). Another important conclusion of this chapter is that SPH and PSE methods provide more accurate approximations for isotropic dispersion than for anisotropic dispersion, which is also similar to the behavior of other standard numerical schemes. 172 \fChapter 4 presents a hybrid scheme to simulate solute transport in a flow oriented grid: advection and longitudinal dispersion are solved along streamlines, while transverse dispersion is handled using the meshless approximation presented in Chapters 2 and 3. The hybrid scheme overcomes two main limitations of previous streamline-based simulations. First, it allows simulating transverse dispersion without using a background grid and introducing numerical dispersion. Second, it can be used to simulate three-dimensional problems, which was not possible with previous methods that used orthogonal floworiented grids and were restricted to two-dimensional problems (e.g. Frind, 1982; Cirpka et al., 1999). Furthermore, the hybrid approach also represents one of the few and, in our opinion the simplest, monotonic approximation for anisotropic dispersion (see Mlacnik and Durlofsky, 2006; Lipnikov et al., 2009, for examples of alternative monotonic schemes). Moreover, benchmarking results demonstrated that the streamline-based formulation minimizes numerical dispersion in the longitudinal direction and it completely avoids it in the transverse direction. Because of these features, the new hybrid scheme is suitable to accurately simulate conservative and reactive solute transport including reactions controlled by transverse mixing. Furthermore, the new hybrid formulation, as others streamline-based schemes (Di Donato and Blunt, 2004), also allows the simulation of general heterogeneous chemical reactions that involve species or components in the solid phase, which constitutes one of the main advantages of this type of method over particle based methods. 5.1 Limitations of Proposed Numerical Schemes Although, the two proposed numerical schemes represent attractive alternatives versus most traditional numerical methods, they also have their own limitations. First, as demonstrated in Chapter 3, the accuracy of meshless approximations for dispersion, including SPH and PSE, depends upon the spatial distribution of particles or numerical nodes. Although, the distribution of particles can become very irregular in presence of non-uniform velocity fields, the numerical simulations presented in Chapter 2 demonstrated that it is still possible to obtain reasonable accurate results in simulations that consider large P\u00e9clet numbers. Under those conditions, even large errors in the approximation of dispersion are relatively minor in comparison to other numerical errors, e.g. due to solution of advection. Nevertheless, we believe that the e\ufb00ect of particle disorder should always be considered and, if possible, estimated whenever meshless methods like the ones presented in Chapters 2 and 3 are used. 173 \fSecond, meshless methods require searching for nearby nodes and evaluating pair interactions between neighboring nodes, which can result in computational overhead. This problem can be controlled by an adequate choice of the radius of interaction of the numerical nodes (e.g. smoothing length in SPH simulations). As demonstrated by the numerical simulations presented in Chapter 2, which include hundreds of thousands of nodes, this is an e\ufb00ective alternative for two-dimensional simulations. However, this can be a much more serious limitation in three-dimensional scenarios as demonstrated by the simulation of aerobic biodegradation presented in Chapter 4, because the number of neighboring nodes can increase dramatically going from two- to three-dimensional scenarios. Moreover, this issue becomes more important when simulations consider very heterogeneous velocity fields and\/or sources and sinks. In those cases, particles concentrate in slow flow regions, while streamlines converge towards high flow velocity zones and sources or sinks. An obvious solution to this problem is to adapt the radius of influence according to the local node density such that the number of neighboring nodes stays relatively constant, which is the standard approach in SPH simulations of fluids with large density variations (Monaghan, 2005). That modification would introduce additional complexity to the overall algorithm, but we believe that the performance gains would be enough to justify that cost. Moreover, an implementation of such algorithm would provide a method with a grid that automatically adapt to the flow field and that provides spatially varying resolution according to the flow characteristics. Last, all the simulations presented in the previous chapters considered steady-state flow conditions, however, many real problems involve transient flows. While, the extension of the SPH-based method to transient flows is direct and it does not require additional modifications, the streamline-based approach would require additional changes. Streamlinebased simulations of transient flows are standard in reservoir simulations (Thiele, 2005). Streamlines are updated each time than the flow field changes and concentrations are mapped from the old to the new streamlines. As other schemes that require interpolations, the mapping concentrations from the old to the new streamline locations introduces numerical dispersion. However, changes of the flow field occur over time periods that are relatively long in comparison to typical transport time steps, thus the mapping of concentrations is only necessary few times during a simulation and the cumulative e\ufb00ect is relatively minor. 174 \f5.2 General Conclusions In addition to the specific conclusions discussed above, the results discussed in the previous chapters also confirmed the following general results that are relevant for reactive transport modeling: 1. The simulation of aerobic biodegradation presented in Chapter 4 is a good example of situations were relatively small errors that can be tolerated in conservative solute transport simulations, can result in much larger errors if chemical reactions are included. Thus, as pointed out by Steefel and MacQuarrie (1996), traditional methods that seem to work well for simulations of conservative transport are unsuitable for simulating reactive transport. 2. The di\ufb00erence between numerical solutions computed with di\ufb00erent numerical methods can be very large. This is particularly true for realistic problems that involve heterogeneous media and chemical reactions. Since, in general, it is not possible to derive analytical solutions for such problems it is di\ufb03cult to decide a priori which numerical algorithm provides the best solution. This indicates the need for defining a set of benchmark problems that can be used to verify the performance of numerical methods and their implementations. 3. Current numerical methods are inadequate to simulate reactive transport in highly heterogeneous porous media under common field conditions. Mesh-based methods su\ufb00er excessive numerical dispersion and spurious oscillations. Similarly, hybrids schemes like the method of characteristics (MOC) that use a background grid to compute concentrations also su\ufb00er numerical mixing and require using a very large number of particles to obtain smooth solutions. Finally, random walk particle tracking methods have problems to simulate low concentrations and also su\ufb00er numerical oscillations (overshooting). 4. The main advantages of the proposed Lagrangian schemes are due to the fact that they track concentrations defined at the REV or local-scale in contrast to traditional Eulerian or Eulerian-Lagrangian formulations that compute grid-scale concentrations. Although, usually overlooked, the equations that describe the evolution of concentrations at the grid and local-scale are di\ufb00erent (Beckie, 1998). Most of the numerical errors that plague traditional numerical approximations are a manifestation of those di\ufb00erences. 175 \f5.3 Perspectives Although, the implementations of both new numerical schemes use an SPH-based approximation for isotropic dispersion, any other meshless approximation for di\ufb00usion may also be used. SPH and PSE methods are only two of multiple meshless methods developed during recent years. For example, Fries and Matthies (2004) and Schaback and Wendland (2006) present exhaustive reviews of many others meshless numerical methods. We believe that others meshless methods may have advantages over SPH, e.g. higher convergence, which could make them better alternatives for new implementations of the proposed Lagrangian numerical schemes. The two proposed numerical methods are also attractive alternatives to study fundamental issues related to mixing and reactions in heterogeneous porous media. For example, Tartakovsky et al. (2008) present a novel multiscale approach to model mixing in heterogeneous porous media. They use a SPH scheme similar to the one presented in Chapter 2, to simulate solute transport. The novel characteristics of their approach is that the evolution of particle positions is given by an stochastic Langevin equation that model velocity fluctuations at the local-scale. The resulting model is simple and theoretically appealing because it provides a clear separation between the two main components of mixing in porous media: local-dispersion and spreading due to local-scale velocity variations. On the other hand, the streamline-based method represents a unique tool to evaluate the potential e\ufb00ect of transverse dispersion and flow heterogeneity, e.g. convergent flow regions, on the enhancement of mixing and dilution rates in natural aquifers as hypothesized by Werth et al. (2006). The two numerical methods derived in this research allow using di\ufb00erent spatial resolutions to simulate flow and reactive transport. This flexibility can be an important advantage in the implementation of multiscale or upscaling methods that require solving transport and flow with di\ufb00erent levels of spatial resolution as demonstrated by the nested gridding approach of Gautier et al. (1999) or the multiscale method of Tartakovsky et al. (2008). This constitutes a significant advantage over mesh-based methods that, in general, solve flow and transport using the same spatial discretization. 176 \f5.4 Final Remarks Although, a large portion of this thesis has been focused on discussing specific methods and implementation details, we think that its most important contribution would be to promote and demonstrate the advantages of Lagrangian approaches \u2013 be they SPH, streamline-based simulations or other \u2013 to simulate reactive transport in natural porous media. We hope that the results of this research would help to highlight those advantages and contribute to the adoption of Lagrangian schemes in current and future reactive transport codes. 177 \f5.5 References Beckie, R., Scale dependence and scale invariance in hydrology, chap. Analysis of scale e\ufb00ects in large-scale solute-transport models, pp. 314\u2013334, Cambridge University Press, 1998. Benson, D., and M. Meerschaert, Simulation of chemical reaction via particle tracking: Di\ufb00usion-limited versus thermodynamic rate-limited regimes, Water Resour. Res., 44 , 12, 2008. Cirpka, O., E. Frind, and R. Helmig, Numerical methods for reactive transport on rectangular and streamline-oriented grids., Adv. Water Res., 22 , 711\u2013728, 1999. Cleary, P. W., and J. J. Monaghan, Conduction modelling using smoothed particle hydrodynamics, J. Comput. Phys., 148 , 227\u2013264, 1999. Cottet, G., and P. Koumoutsakos, Vortex methods: Theory and practice., Cambridge University Press, 2000. Degond, P., and S. Mas-Gallic, The weighted particle method for convection-di\ufb00usion equations. II: The anisotropic case, Math. Comp, 53 , 485,508, 1989. Di Donato, G., and M. Blunt, Streamline-based dual-porosity simulation of reactive transport and flow in fractured reservoirs, Water Resour. Res., 40 , 2004. Fries, T., and H. Matthies, Classification and overview of meshfree methods, Tech. rep., Institute of Scientific Computing, Technical University Braunschweig, 2004. Frind, E., The principal direction technique: a new approach to groundwater contaminant transport modeling, in Proceedings, Fourth International Conference on Finite Elements in Water Resources, Tech. Univ. Hannover, Germany. Springer Verlag, New York, vol. 13, pp. 25\u201342, 1982. Frind, E., E. Sudicky, and S. Schellenberg, Micro-scale modelling in the study of plume evolution in heterogeneous media, Stoch. Hydrol. Hydraul., 1 , 263\u2013279, 1987. Gautier, Y., M. Blunt, and M. Christie, Nested gridding and streamline-based simulation fast reservoir performance predicition, Computat. Geosci., pp. 295\u2013320, 1999. Jubelgas, M., V. Springel, and K. Dolag, Thermal conduction in cosmological SPH simulations, Mon. Not. R. Astron. Soc., 351 , 423\u2013435, 2004. 178 \fLi, J., Y. Chen, and D. Pepper, Radial basis function method for 1-d and 2-d groundwater contaminant transport modeling, Comput. Mech., 32 , 10\u201315, 2003. Lipnikov, K., D. Svyatskiy, and Y. Vassilevski, Interpolation-free monotone finite volume method for di\ufb00usion equations on polygonal meshes, J. Comput. Phys., 228 , 703\u2013716, 2009. Mlacnik, M., and L. Durlofsky, Unstructured grid optimization for improved monotonicity of discrete solutions of elliptic equations with highly anisotropic coe\ufb03cients, J. Comput. Phys., 216 , 337\u2013361, 2006. Monaghan, J., Smoothed particle hydrodynamics, Rep. Prog. Phys., 68 , 1703\u20131759, 2005. Praveen Kumar, R., and G. Dodagoudar, Two-dimensional modelling of contaminant transport through saturated porous media using the radial point interpolation method (RPIM), Hydrogeol. J., 16 , 1497\u20131505, 2008. Schaback, R., and H. Wendland, Kernel techniques: From machine learning to meshless methods, Acta Numerica, pp. 1\u201397, 2006. Steefel, C., and K. MacQuarrie, Approaches to modeling of reactive transport in porous media, Reviews in Mineralogy and Geochemistry, 34 , 85\u2013129, 1996. Suciu, N., C. Vamos, J. Vanderborght, H. Hardelauf, and H. Vereecken, Numerical investigations on ergodicity of solute transport in heterogeneous aquifers, Water Resour. Res, 42 , 1\u201317, 2006. Tartakovsky, A., P. Meakin, T. Scheibe, and B. Wood, A smoothed particle hydrodynamics model for reactive transport and mineral precipitation in porous and fractured porous media, Water Resour. Res., 43 , W05,437, 2007. Tartakovsky, A., D. Tartakovsky, and P. Meakin, Stochastic Langevin model for flow and transport in porous media, Phys. Rev. Lett., 101 , 44,502, 2008. Thiele, M., Streamline simulation, in 8th International Forum on Reservoir Simulation, 2005. Tompson, A., and D. Dougherty, Particle-grid methods for reacting flows in porous media with applications to Fisher\u2019s equation, Appl. Math. Modelling, 16 , 374\u2013383, 1992. Werth, C. J., O. A. Cirpka, and P. Grathwohl, Enhanced mixing and reaction through flow focusing in heterogeneous porous media, Water Resour. Res., 42 , W12,414, 2006. 179 \fZhu, Y., and P. Fox, Smoothed Particle Hydrodynamics Model for Di\ufb00usion through Porous Media, Transport Porous Med., 43 , 441\u2013471, 2001. Zhu, Y., and P. Fox, Simulation of pore-scale dispersion in periodic porous media using smoothed particle hydrodynamics, J. Comput. Phys., 182 , 622\u2013645, 2002. Zhu, Y., P. Fox, and J. Morris, A pore-scale numerical model for flow through porous media, Int. J. Numer. Anal. Meth. Geomech., 23 , 881\u2013904, 1999. Zimmermann, S., P. Koumoutsakos, and W. Kinzelbach, Simulation of pollutant transport using a particle method, J. Comput. Phys., 173 , 322\u2013347, 2001. 180 \fAppendix A Derivation of SPH Approximation for Isotropic Dispersion To solve the PDE equation given by dA 1 = \u2207 \u00b7 (\u03b2\u03a6\u2207A) dt \u03b1 (A.1) where A is an scalar variable, and \u03b1, \u03b2 and \u03a6 are scalar parameters; we can use the identity \ufffd 1 1 \ufffd 2 \u2207 \u00b7 (\u03b2\u03a6\u2207A) = \u2207 (\u03b2\u03a6A) \u2212 A\u22072 (\u03b2\u03a6) + \u03b2\u03a6\u22072 A \u03b1 2\u03b1 (A.2) Thus, the solution of (A.1) requires only an expression to evaluate the Laplacian. Applying a Taylor series expansion and some algebraic manipulation it is possible to show that the Laplacian of a scalar field S can be approximated by (Jubelgas et al., 2004) \u2207 2 \ufffd S \ufffd\ufffd r \u2248 \u22122 \u02c6 [S(r\ufffd ) \u2212 S(r)] (r\ufffd \u2212 r) \u00b7 \u2207W (r\ufffd \u2212 r) dr\ufffd + O(h2 ) |r\ufffd \u2212 r|2 (A.3) If this last expression is integrated using a traditional SPH approach, then \u2207 2 \ufffd \ufffd S\ufffd ri Np 2 \ufffd 1 =\u2212 [S(rj ) \u2212 S(ri )]F (rj \u2212 ri ) Np j=1 pj 181 (A.4) \fwhere F (rj \u2212 ri ) = (rj \u2212 ri ) \u00b7 \u2207W (rj \u2212 ri ) |rj \u2212 ri |2 (A.5) Finally, substituting (A.4) into (A.2), we get \ufffd Np dA \ufffd\ufffd 1 \ufffd 1 (\u03b2i \u03c6i + \u03b2j \u03c6j ) (Aj \u2212 Ai ) F (rj \u2212 ri ) \ufffd = \ufffd dt ri Np j=1 \u03b1i pj (A.6) References Jubelgas, M., V. Springel, and K. Dolag, Thermal conduction in cosmological SPH simulations, Mon. Not. R. Astron. Soc., 351 , 423\u2013435, 2004. 182 \fAppendix B Derivation of SPH Approximation for Second Order Derivatives Espa\u00f1ol and Revenga (2003) and Monaghan (2005) provide expressions to compute second derivatives using a smoothed particle hydrodynamics (SPH) formulation. Here, we give a detailed derivation of those expressions. We start by recalling some of the properties of SPH kernels. The gradient of a spherically symmetric SPH kernel, W (r), can be expressed as \u2207W (r) = \u2212rF (r), where F (r) is a spherically symmetric scalar function and r and r are the separation vector and its magnitude, respectively. Additionally, the kernel satisfies the normalization condition \u00b4 W (r) dr = 1 and has compact support, i.e. W (r) = 0 \u2200r > he , where he is a finite constant. The Taylor series approximation of a function A around x is, 1 A(x\ufffd ) = A(x) + (x\ufffd \u2212 x)T \u00b7 \u2207A|x + (x\ufffd \u2212 x)T \u00b7 \u2207\u2207A|x \u00b7 (x\ufffd \u2212 x) + O(|x\ufffd \u2212 x|3 ) (B.1) 2 To simplify notation, we use r = x\ufffd \u2212 x = (r1 , r2 , r3 ), such that A(x ) \u2212 A(x) \u2248 \ufffd \ufffd i \ufffd \ufffd \u2202A \ufffd\ufffd 1 \ufffd\ufffd \u2202 2 A \ufffd\ufffd ri \ufffd + ri rj \ufffd \u2202xi \ufffdx 2 i j \u2202xi \u2202xj \ufffdx 183 (B.2) \fNow, we multiply by \u0393\u03b1\u03b2 (r) = F (r)r\u03b1 r\u03b2 \/r2 and integrate to obtain, \u02c6 \ufffd \ufffd ri r \u03b1 r\u03b2 \ufffd dx r2 i \u02c6 1 \ufffd \ufffd \u22022A ri rj r\u03b1 r \u03b2 \ufffd + F (r) dx 2 i j \u2202xi \u2202xj r2 (A(x ) \u2212 A(x)) \u0393\u03b1\u03b2 (r) dx = \ufffd \u2202A \u2202xi \u02c6 F (r) (B.3) We note that dr = dx\ufffd and use spherical coordinates to evaluate the integrals, to obtain, \u02c6 r 1 r1 r 2 F (r) 2 dr = r \u02c6\u221e \u02c62\u03c0 \u02c6\u03c0 0 0 F (r)r3 cos2 (\u03b8)sin(\u03b8) sin3 (\u03c6) d\u03c6 d\u03b8 dr = 0 (B.4) 0 \u00b4 2\u03c0 because 0 cos2 (\u03b8)sin(\u03b8) d\u03b8 = 0. Similarly, the other terms multiplying first derivatives vanish. Thus, \u02c6 (A(x\ufffd ) \u2212 A(x)) \u0393\u03b1\u03b2 (r) dx\ufffd = where only coe\ufb03cients of the form \u039b\u03b1\u03b2 = 2 \u02c6 \u00b4 1 \ufffd \ufffd \u22022A \u039b\u03b1\u03b2 2 \u03b1 \u03b2 \u2202x\u03b1 \u2202x\u03b2 (B.5) F (r)r\u03b1 r\u03b1 r\u03b2 r\u03b2 \/r2 dr are not zero. Therefore, (A(x\ufffd ) \u2212 A(x)) \u0393\u03b1\u03b1 (r) dr = \u039b\u03b1\u03b1 \u22022A \ufffd \u22022A + \u039b \u03b1\u03b2 \u2202x2\u03b1 \u03b2\ufffd=\u03b1 \u2202x2\u03b2 \u22022A = (\u039b\u03b1\u03b1 \u2212 \u039b\u03b1\u03b2 ) 2 + \u039b\u03b1\u03b2 \u22072 A \u2202x\u03b1 (B.6) and 2 \u02c6 \u22022A \u22022A + \u039b\u03b2\u03b1 \u2202x\u03b1 \u2202x\u03b2 \u2202x\u03b2 \u2202x\u03b1 \u22022A = 2\u039b\u03b1\u03b2 \u2202x\u03b1 \u2202x\u03b2 (A(x\ufffd ) \u2212 A(x)) \u0393\u03b1\u03b2 (r) dr = \u039b\u03b1\u03b2 The coe\ufb03cients \u039b\u03b1\u03b2 can be easily evaluated, for example, 184 (B.7) \f\u039bxx = \u02c6\u221e \u02c62\u03c0 \u02c6\u03c0 0 0 4 = \u03c0 5 F (r)r4 cos4 (\u03b8) sin5 (\u03c6) d\u03c6 d\u03b8 dr 0 \u02c6\u221e (B.8) F (r)r4 dr 0 and \u039bxy = \u02c6\u221e \u02c62\u03c0 \u02c6\u03c0 0 = 0 4 \u03c0 15 F (r)r4 cos2 (\u03b8) sin2 (\u03b8) sin5 (\u03c6) d\u03c6 d\u03b8 dr 0 \u02c6\u221e (B.9) F (r)r4 dr 0 The coe\ufb03cients related to the other directions have one of these two forms. To compute the integral in r, we recall that rF (r) = \u2212\u2202W (r)\/\u2202r, thus \u02c6\u221e 0 4 F (r)r dr = \u2212 \u02c6\u221e r 3 \u2202W (r) 0 \u2202r dr = 3 \u02c6\u221e r2 W (r) dr (B.10) 0 after integration by parts. Finally, we use the normalization condition of the kernel \u02c6 W (r) dr = \u02c6\u03c0 \u02c62\u03c0 \u02c6\u221e 0 0 r2 W (r) dr d\u03b8 d\u03c6 = 4\u03c0 0 \u02c6\u221e r2 W (r) dr = 1 (B.11) 0 to obtain \u02c6\u221e 0 3 F (r)r4 dr = \u03c0 4 (B.12) Then, \u039b\u03b1\u03b1 = 3 5 \u039b\u03b1\u03b2 = 185 1 5 (B.13) \fWe observe that \u039b\u03b1\u03b1 \u2212 \u039b\u03b1\u03b2 = 2\u039b\u03b1\u03b2 , thus equations B.6 and B.7 can be combined to obtain, 2 \u02c6 (A(x\ufffd ) \u2212 A(x)) \u0393\u03b1\u03b2 (x\ufffd \u2212 x) dx\ufffd = \u039b\u03b1\u03b2 \u22072 A\u03b4\u03b1\u03b2 + 2\u039b\u03b1\u03b2 \u22022A \u2202x\u03b1 \u2202x\u03b2 (B.14) where \u03b4\u03b1\u03b2 is Kronecker delta. This last expression gives the following approximation for the Laplacian, 2 \u2207 A=2 \u02c6 (A(x\ufffd ) \u2212 A(x)) F (x\ufffd \u2212 x) dx\ufffd (B.15) which is identical to an expression previously derived to simulate thermal conduction (Cleary and Monaghan, 1999; Jubelgas et al., 2004). Finally, substituting B.15 into B.14 and rearranging terms, we obtain \ufffd \u2202 2 A \ufffd\ufffd \ufffd = \u2202x\u03b1 \u2202x\u03b2 \ufffdx \u02c6 \ufffd \ufffd 1 r\u03b1 r\u03b2 (A(x ) \u2212 A(x)) F (x \u2212 x) \u2212 \u03b4\u03b1\u03b2 dx\ufffd \u039b\u03b1\u03b2 r2 \ufffd \ufffd (B.16) Using an SPH approximation to evaluate the integral, \ufffd \ufffd 1 \u2202 2 A \ufffd\ufffd (A(xb ) \u2212 A(xa )) F (|xb \u2212 xa |)\u0398\u03b1\u03b2 (xb \u2212 xa ) \ufffd = \u2202x\u03b1 \u2202x\u03b2 \ufffdxa b pb \ufffd \ufffd (x\ufffd \u2212x) (x\ufffd \u2212x) (B.17) \ufffd \u03b1 \u03b2 where \u0398\u03b1\u03b2 (x\ufffd \u2212 x) = \u039b1\u03b1\u03b2 \u2212 \u03b4\u03b1\u03b2 and pa = b W (xb \u2212 xa ). Substituting |x\ufffd \u2212x|2 1\/\u039b\u03b1\u03b2 = 5 in three dimensions and 1\/\u039b\u03b1\u03b2 = 4 in two dimensions, we obtain the expressions given by Espa\u00f1ol and Revenga (2003) and Monaghan (2005), respectively. References Cleary, P. W., and J. J. Monaghan, Conduction modelling using smoothed particle hydrodynamics, J. Comput. Phys., 148 , 227\u2013264, 1999. Espa\u00f1ol, P., and M. Revenga, Smoothed dissipative particle dynamics, Phys. Rev. E, 67 , 026,705\u201312, 2003. 186 \fJubelgas, M., V. Springel, and K. Dolag, Thermal conduction in cosmological SPH simulations, Mon. Not. R. Astron. Soc., 351 , 423\u2013435, 2004. Monaghan, J., Smoothed particle hydrodynamics, Rep. Prog. Phys., 68 , 1703\u20131759, 2005. 187 \fAppendix C Random Walk Particle Method Random-walk particle-tracking (RWPT) methods are based on the equivalence in the limit of a large number of particles between the ADE which describes continuum-scale mass conservation and the Fokker\u2013Planck equation which describes the time evolution of the probability density function of the position of a solute particle. Most numerical implementations of the RWPT are based on the \u00ceto integration of the equivalent Langevin equation (Gardiner, 1990) that written in matrix form corresponds to \u221a X(t + \u2206t) = X(t) + \u2206tA(t) + B(t)Z \u2206t (C.1) where X(t) corresponds to the vector of particle position at time t and Z is a normally distributed random vector with zero mean and unit variance that represents the Brownian motion of the particles due to dispersion. The other two terms in (C.1) corresponds to a drift term given by A =v + \u2207 \u00b7 D (C.2) assuming constant porosity; and a displacement matrix, B, that depends on the dispersion tensor. The relation of these terms with the ADE are discussed in detail in several references (e.g. Lichtner et al., 2002; Delay et al., 2005; Salamon et al., 2006). Several approaches have been proposed to interpolate the flow velocity required to evaluate the coe\ufb03cients appearing in (C.1) and (C.2). Particular attention has been paid to 188 \fmethods that avoid local mass conservation problems due to discontinuities of the dispersion tensor across sharp interfaces (LaBolle et al., 1996; Labolle et al., 2000; Salamon et al., 2006). In our implementation of the RWPT we use a hybrid approach to interpolate velocity: a linear interpolation is used to evaluate the velocity vector that appears in the drift term, and a trilinear interpolation is used to interpolate the velocity vector used to evaluate the dispersion tensor. This interpolation scheme guarantees the spatial continuity of the advective velocity and the dispersion tensor (Salamon et al., 2006). To apply the RWPT method to practical situations it is necessary to map solute mass from and to concentration values because initial and boundary conditions and geochemical computations are usually expressed in concentration units. Given the total solute mass in the system M , the mass of each particle is computed as mp = M\/Np . In general, the total number of particles is chosen to satisfy some numerical resolution, for example such that the mass of a given number of particles Nr is equal to some unit mass value M0 , i.e. mp Nr = M0 . Given a set of particles, a continuum spatial concentration distribution can be approximated as (Bagtzoglou et al., 1992; Tompson, 1993) C(x) = \u02c6 \u2126 mp \u03be(x \u2212 x )dx \u2248 \ufffd \ufffd Np \ufffd j=1 mp \u03be(x \u2212 xj ) (C.3) where \u03be(x) is a projection function. In theory, this expression allows the computation of the concentration values at any location. In practice, most implementations use a box function with value 1\/Vc for points within a cube of volume Vc around x and 0 otherwise(Tompson, 1993). In simple terms, the domain \u2126 is divided in a set of cubic cells with volume Vc , then concentration values are assigned to cell j by counting the number of particles within it, nj , so that the concentration value of the cell is computed as Cj = nj mp \/Vc . The value of Np a\ufb00ects the accuracy of the method in two ways. First, the equivalence between the Langevin equation and the continuum ADE is valid for Np \u2192 \u221e. Second, concentration values can only be represented as an integer multiple of mp \/Vc . Errors can be particularly important near the plume edges where the drop in the number of particles produces unphysical numerical oscillations in the computed concentrations that can be amplified in presence of non-linear chemical reactions if a splitting approach is used to solve reactive transport (Tompson and Dougherty, 1992; Tompson, 1993). 189 \fReferences Bagtzoglou, A., A. Tompson, and D. Dougherty, Projection functions for particle-grid methods, Num. Meth. Part. Di\ufb00. Eq., 8 , 325\u2013340, 1992. Delay, F., P. Ackerer, and C. Danquigny, Simulating Solute Transport in Porous or Fractured Formations Using Random Walk Particle Tracking: A Review, Vadose Zone J., 4 , 360\u2013379, 2005. Gardiner, C., Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences, 1990. LaBolle, E. M., G. E. Fogg, and A. F. B. Tompson, Random-walk simulation of transport in heterogeneous porous media: Local mass-conservation problem and implementation methods, Water Resour. Res., 32 , 583\u2013594, 1996. Labolle, E. M., J. Quastel, G. E. Fogg, and J. Gravner, Di\ufb00usion processes in composite porous media and their numerical integration by random walks: Generalized stochastic di\ufb00erential equations with discontinuous coe\ufb03cients, Water Resour. Res., 36 , 651, 2000. Lichtner, P., S. Kelkar, and B. Robinson, New form of dispersion tensor for axisymmetric porous media with implementation in particle tracking., Water Resour. Res., 38 , 1146, 2002. Salamon, P., D. Fern\u00e0ndez-Garcia, and J. G\u00f3mez-Hern\u00e1ndez, A review and numerical assessment of the random walk particle tracking method., J. Contam. Hydrol., 87 , 277\u2013305, 2006. Tompson, A., Numerical simulation of chemical migration in physically and chemically heterogeneous porous media, Water Resour. Res., 29 , 3709\u20133726, 1993. Tompson, A., and D. Dougherty, Particle-grid methods for reacting flows in porous media with applications to Fisher\u2019s equation, Appl. Math. Modelling, 16 , 374\u2013383, 1992. 190 \fAppendix D Streamline Tracing In streamline simulations the value of variables such as time of flight and arc length together with the node positions along streamlines define the computational grid. Therefore, the accuracy of the results depends upon the accuracy of the computed streamlines trajectory, arc length and time of flight. On the other hand, it may be necessary to trace a large number of streamlines to provide an adequate coverage of the domain in complex three-dimensional problems. Additionally, streamlines must be periodically updated whenever temporal changes of the flow field occur. Therefore, it is important to select tracing algorithms that allow an accurate and e\ufb03cient computation of the streamlines. When tracing the streamlines used in a simulation it is sometimes useful to consider some of the characteristics of the flow field in order to optimize the location and minimize the number of streamlines necessary to obtain a given spatial resolution and accuracy. We discuss some of the issues associated with tracing and spatial distribution of streamlines in the next sections. Streamline Tracing Algorithms Most current streamline simulators use a semi-analytical method to trace streamlines that was first introduced by Pollock (1988) to track fluid particles in groundwater simulations. This method is attractive because given a velocity field in a staggered Cartesian grid, it provides analytical expressions to compute particle trajectories without introducing additional numerical errors. Moreover, the method is simple to understand and, in 191 \ftheory, easy to implement. In practice, implementations of the algorithm are complex and sensitive to errors due to floating point arithmetic. Additionally, the extension of the method to unstructured grids, although possible using isoparametric coordinate transformations (Cordes and Kinzelbach, 1992; Prevost et al., 2002), is much more involved and di\ufb03cult to implement than the original method. Fluid particle trajectories that define streamlines can also be integrated using explicit time integration schemes, e.g. Runge-Kutta. This type of algorithm is straightforward, very easy to implement, numerically robust, and can be used with velocity fields given in structured or unstructured grids without modifications. However, explicit integration schemes introduce additional numerical errors that can be di\ufb03cult to quantify and control. In this section, we compare Pollock\u2019s method with an explicit adaptive first-order time integration scheme. We give a brief description of both methods and compare them in a set of benchmark problems. Finally, we comment on their relative advantages and disadvantages. Pollock\u2019s Method Given the components of the flow velocity in a three-dimensional staggered Cartesian grid, Pollock\u2019s algorithm assumes that the components of the velocity vector v = (u, v, w), can be approximated as a linear function of the velocity components at the cell faces, i.e. u(x, y, z) = Ax (x \u2212 x1 ) + u1 v(x, y, z) = Ay (y \u2212 y1 ) + v1 (D.1) w(x, y, z) = Az (z \u2212 z1 ) + w1 where u1 is the velocity component in the x direction at face 1 located at x1 as shown in Figure D.1, and the slope Ai is computed as ratio of the di\ufb00erence of the cell face velocities over the grid spacing, e.g. Ax = (u2 \u2212 u1 ) \/\u2206x. Similar definitions apply for the other two directions. 192 \fv2 B y2 D (x1 , y1 ,t1 ) u1 u2 (x0 , y0 ,t 0 ) A C #\" !\" x1 v1 y1 x2 Figure D.1: Pollock\u2019s method assumes that the components of the velocity within a cell can be approximated as a linear function of the velocity components at the cell faces. The method provides analytical expressions to compute the new position D after an interval of time \u2206t = t1 \u2212 t0 of a particle initially at point C. However, the method is usually used to compute the exit point B from a cell given an entry point A. The fluid velocity and particle position in each direction are related by, du du dx = = Ax u dt dx dt (D.2) Integrating this last expression one obtains, \ufffd 1 u(x0 + \u2206x, t0 + \u2206t) \u2206t = ln Ax u(x0 , t0 ) \ufffd (D.3) Taking the exponential of each side and substituting u(x0 + \u2206x, t0 + \u2206t) from (D.1), \u2206x = \ufffd 1 \ufffd u(x0 )eAx \u2206t \u2212 u1 Ax 193 (D.4) \fSimilar expressions are valid in the y and z directions. While equation (D.3) provides an expression to compute the travel time required by a fluid particle at position x0 to move a distance \u2206x, (D.4) can be used to compute the new position after an interval of time \u2206t. A common application of Pollock\u2019s method is to compute the time a fluid particle at position xp will need to exit from the current cell. Assuming all velocities are positive, \ufffd \ufffd 1 u2 \u2206tx = ln Ax u(xp ) \ufffd \ufffd 1 v2 \u2206ty = ln Ay v(yp ) \ufffd \ufffd 1 w2 \u2206tz = ln Az w(zp ) (D.5) \u2206texit = min(\u2206tx , \u2206ty , \u2206tz ) (D.6) Then, the particle will exit after Thus, given an entry point to a cell it is possible to calculate the exact exit position in single step and without introducing additional numerical errors. A simple inspection of (D.4) and (D.3) reveals that implementations of the algorithm must take into account several possible issues: 1. If the flow velocity is constant within a cell, then A = 0, and expressions (D.3) and (D.4) become undefined. The situation is more complicated if floating point arithmetic is used because the ratio 1\/A can also overflow for small di\ufb00erences of velocity. 2. The analytical expressions are not valid in cells with sources or sinks where the slope of the velocity changes sign within a single cell. 3. Equations (D.3) and (D.4) are valid within a single cell. Thus, to compute the new position of a particle after a time step \u2206t, one must first check if the particle would exit the current cell before that time. If it exits, then the time step must be divided in smaller sub steps. 194 \f4. Additionally, the algorithm assumes that it is always possible to exactly determine the cell where an individual particle is located. Thus, particles located over or close to one of the cell edges or corners can be problematic. Algorithm D.1 summarizes the steps necessary to find the position of a fluid particle initially at position xp after an interval of time \u2206t. Algorithm D.2 presents the steps used to obtain the remaining time to exit from the current cell. Finally, Algorithm D.3 presents the steps to update the position of a fluid particle. Algorithm D.1 Pollock\u2019s particle tracking algorithm. 1: xp \u2190 initial position 2: time \u2190 0 3: while time < \u2206t and xp inside domain do 4: cell \u2190 get cell that contains xp 5: if cell = sink or cell = source then 6: break 7: else 8: vp \u2190 get velocity at xp 9: \/\/ for each direction 10: fi \u2190 get exit face in direction i 11: \u2206ti \u2190 get time to exit through face fi 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: \u2206texit \u2190 min(\u2206ti ) if \u2206texit > \u2206t then xp \u2190 update position using \u2206t break else xp \u2190 update position using texit \/\/ now xp is over one of the cell edges move xp to next cell time \u2190 time + texit end if end if end while return xp Explicit Time Integration The temporal evolution of the trajectory of a fluid particle initially at x0 at time t0 is given by the solution of the following di\ufb00erential equation, 195 \fAlgorithm D.2 Function to compute exit time from current cell in Pollock\u2019s method. 1: x1 , x2 , xp \u2190 coordinates of face 1, 2 and fluid particle 2: u1 , u2 , up \u2190 velocities at face 1, 2 and fluid particle position 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: A \u2190 (x2 \u2212 x1 )\/(u2 \u2212 u1 ) if exit through face 1 then if constant velocity then time \u2190 (x1 \u2212 xp )\/up else time \u2190 A \u00b7 ln(u1 \/up ) end if else if exit through face 2 then if constant velocity then time \u2190 (x2 \u2212 xp )\/up else time \u2190 A \u00b7 ln(u2 \/up ) end if end if return time Algorithm D.3 Function to update position in Pollock\u2019s method. 1: x1 , x2 , xp \u2190 coordinates of face 1, 2 and fluid particle 2: u1 , u2 , up \u2190 velocities at face 1, 2 and fluid particle position 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: if exit throug face 1 or 2 then \/\/ we have to move xp to new cell \/\/ thus we add to or substract from x1 or x2 a small number if exit through face 1 then xp \u2190 x1 \u2212 \ufffd else if exit through face 2 then xp \u2190 x2 + \ufffd end if else if constant velocity then xp \u2190 xp + up \u2206t; else A = (x2 \u2212 x1 )\/(u2 \u2212 u1 ) xp \u2190 x1 + A [up \u00b7 exp (\u2206t\/A) \u2212 u1 ] end if end if return xp 196 \fdx = v(x, t) dt (D.7) x(t0 ) = x0 (D.8) with, The numerical solution of (D.7) can be easily computed using an explicit time integration scheme. For example, a first-order explicit approximation reads, x(t + \u2206t) = x0 + v(x0 , t0 )\u2206t (D.9) Although simple to implement, (D.9) is seldom used in practice because of its relatively large error, which is proportional to the time step. In practice, (D.7) is solved using a higher-order integration scheme, e.g. explicit second- and fourth-order Runge-Kutta, that have smaller errors for a given \u2206t. Such schemes apply expressions similar to (D.9) to compute the particle position at intermediate steps. Then, the final position after \u2206t is computed as a weighted combination of the the intermediate locations. The main drawback of explicit integrators is that it is di\ufb03cult to determine a priori a value \u2206t such that the error remains below a given threshold. This problem is particularly important in velocity fields that exhibit large di\ufb00erences in velocity magnitude and\/or direction within short distances as shown in Figure (D.2). 197 \f%\" $\" &\" #\" !\" Figure D.2: Example of explicit time integration. A fluid particle starting at point A travels along the instantaneous streamline (solid line). After a time step \u2206t, it is located at point B. If an explicit integration scheme is used to integrate the particle trajectory numerical errors can become important. For example, if a large time step \u2206t is used, the particle moves in the direction of the instantaneous velocity at position A ending at point D. However, the error can be made smaller if two steps are used for the integration. First, the particle moves with the initial velocity to E, and then it moves to C along the direction of the velocity at point E. There are multiple possible solutions to control the error of explicit integration schemes. The first one is to use a very small constant time step such that the error in the worst case stays below a specific threshold. In general, this solution is not acceptable because it introduces unnecessary computational overhead in slow regions. A second alternative consists in using an adaptive step size integration algorithm, e.g. Dormand-Prince (Dormand and Prince, 1980); which uses two methods with di\ufb00erent order at each time step. The di\ufb00erence between both solutions is used to estimate the numerical error and, if necessary, to adapt the size of the time step. A third alternative consists in recognizing that the accuracy of the explicit integration also depends on the spatial resolution of the reconstruction of the velocity field. The error of the velocity field reconstruction is related to the size of the numerical grid used to compute the velocity components. Thus, an e\ufb03cient algorithm can limit the error of the integration by controlling how far a fluid particle can move in one time step relative to the grid size. Therefore, many sub-steps may be necessary in areas of high velocity, 198 \fwhile one or few sub-steps may be enough in slow zones. Therefore, it is possible to satisfy restrictions on accuracy and performance. We refer to this scheme as the firstorder explicit adaptive particle tracking (FEAPT) method. Algorithm D.4 summarizes the steps of the explicit method. Algorithm D.4 First-order explicit adaptive particle tracking. 1: xp \u2190 initial position 2: \u2206 \u2190 maximum distance a particle is allowed to move during one time step 3: time \u2190 0 4: while time < \u2206t and xp inside domain do 5: cell \u2190 get cell that contains xp 6: if cell = sink or cell = source then 7: break 8: else 9: vp \u2190 get velocity at xp 10: t \u2190 \u2206\/|vp | 11: xp \u2190 xp + vp \u00b7 t 12: time \u2190 time + t 13: end if 14: end while 15: return xp Numerical Examples In this section, we compare Pollock\u2019s and the FEAPT methods in a set of benchmark problems. Homogeneous quarter five-spot The first test problem corresponds to the well known quarter five-spot configuration in a homogeneous medium. An injection and extraction well are located in the lower left corner and upper right corner, respectively. The resulting streamline pattern is well known and it has become a common test problem for streamline simulations (e.g. Matringe, 2004). We consider a square domain of 25 m side and we use a 100 x 100 regular Cartesian grid to solve the flow problem. We trace streamlines from ten seeds placed along a diagonal straight line that passes through the center of the domain and that connects the upper left and lower right corners. 199 \fFigure D.3 shows streamlines traced with Pollock\u2019s and the explicit adaptive scheme with tolerance equal to 5% and 50% of the cell size of the velocity field. The explicit scheme performs similarly that Pollock\u2019s method to trace the interior streamlines. However, the FEAPT solution with larger tolerance has problems tracing the exterior streamlines at the lower right and upper left corners where the curvature of the trajectory is maximum. When using the larger tolerance particles travel too far and exit the domain. While the explicit solution with 50% tolerance required the same time that Pollock\u2019s method, the FEAPT solution with 5% tolerance needed three times longer. Figure D.3: Streamlines traced with Pollock\u2019s method (solid lines) and with explicit adaptive scheme (crosses). Spacing between crosses is equal to four times the cell size of velocity field. Numbers indicate streamline labels used in the text. Solutions for explicit time integration correspond to 5% (left) and 50% (right) tolerance. In both cases the position of the interior streamlines is almost identical. However, the FEAPT solution with larger tolerance has problems tracing the exterior streamlines at corners where the streamline curvature is maximum. Heterogeneous quarter five-spot As a second test problem, we consider the same well configuration but a heterogeneous hydraulic conductivity field. We generate two hydraulic conductivity fields assuming a spatial distribution of Y = ln(K) given by an exponential covariance with variance \u03c3Y = 5 and correlation length equal to four times the grid spacing (Figure D.5). 200 \f1 streamline #2 Normalized Time of Flight Normalized Time of Flight 1 0.8 0.6 0.4 0.2 0 0 Pollock Explicit 5% Explicit 50% 0.2 0.4 0.6 0.8 0.8 0.6 0.4 0.2 0 0 1 Normalized Arc Length streamline #5 Pollock Explicit 5% Explicit 50% 0.2 0.4 0.6 0.8 1 Normalized Arc Length Figure D.4: Normalized time of flight versus normalized arc length computed with Pollock\u2019s and adaptive explicit time integration with tolerances equal to 5% and 50% of grid spacing. Streamlines traced with any of the three methods are similar. Figure D.5: Spatial distribution of hydraulic conductivity in fields K1 (left) and K2 (right). Note that hydraulic conductivity values vary by more than 14 and 18 orders of magnitude in field K1 and K2, respectively. In both cases, the magnitude of the resulting flow velocity varies up to five orders of magnitude. 201 \fFigure D.6: Streamlines traced with Pollock\u2019s method (solid lines) and with explicit adaptive scheme (crosses) for fields K1 (left) and K2 (right). Spacing between crosses is equal to four times the cell size of the grid used to compute the velocity field. Streamlines were traced with explicit time integration scheme using a tolerance equal to 5% of the grid spacing. As in the homogeneous case, we trace streamlines from ten seeds placed along a diagonal straight line that passes through the center of the domain and that connects the upper left and lower right corners. The resulting streamlines are shown in Figure D.6. With the exception of few location along streamline 8 in field K1, streamlines traced with Pollock\u2019s and FEAPT method are very similar. As shown in Figure D.7, the small di\ufb00erences in the streamline locations are also observed in curves that relate the time of flight and arc length along individual streamlines. For the strongly heterogeneous fields used in this example, it is necessary to use a very small tolerance (< 1% of grid spacing) in the explicit integration scheme to obtain a perfect match between the FEAPT and Pollock\u2019s methods. However, the FEAPT solution with tolerance equal to 1% of the grid produces results that are also very close to the curves generated with Pollock\u2019s method. Moreover, it is is clear that the FEAPT and Pollock\u2019s solutions converge to the same curve as we decrease the maximum distance than a fluid particle is allowed to advance in an individual time step. 202 \f1 streamline #6 0.8 0.6 0.4 Pollock Explicit 0.1% Explicit 1% Explicit 5% 0.2 0 0 0.2 0.4 0.6 0.8 Normalized Time of Flight Normalized Time of Flight 1 0.8 0.6 0.4 Pollock Explicit 0.1% Explicit 1% Explicit 5% 0.2 0 0 1 streamline #8 0.2 Normalized Arc Length 1 streamline #4 0.8 0.6 0.4 Pollock Explicit 0.1% Explicit 1% Explicit 5% 0.2 0 0 0.2 0.4 0.6 0.8 Normalized Time of Flight Normalized Time of Flight 1 0.4 0.6 0.8 1 Normalized Arc Length 0.8 0.6 0.4 Pollock Explicit 0.1% Explicit 1% Explicit 5% 0.2 0 0 1 Normalized Arc Length streamline #7 0.2 0.4 0.6 0.8 1 Normalized Arc Length Figure D.7: Normalized time of flight versus normalized arc length for streamlines in heterogeneous K1 (top) and K2 (down) hydraulic conductivity fields. The di\ufb00erence between the results of the adaptive explicit integration scheme and Pollock\u2019s method become negligible as the tolerance for the explicit integration decreases to around 1% of the grid spacing. 203 \fPerformance The main advantage of Pollock\u2019s method consists in its ability to provide accurate results with minimum computational overhead. To assess the di\ufb00erence between the performance of the explicit integration scheme versus Pollock\u2019s algorithm, we traced 600 streamlines in the heterogeneous quarter five-spot configuration discussed in the previous section. The resulting streamlines are shown in Figure D.8. When using the explicit integration algorithm, nodes are recorded only if the separation distance between the new and the previously recorded node is equal to or larger than an specified arc length spacing \u2206s. In Pollock\u2019s method only entry and exit points to\/from cells are recorded. All the tests were run in laptop computer with an Intel Core 2 Duo 2GHz processor with 3MB of L2 cache and 2GB of RAM memory. The results of the comparison are summarized in Table D.1. The explicit streamline integration with tolerance equal to 1% of the grid spacing takes one order of magnitude longer than Pollock\u2019s method, while reducing the tolerance to 0.1% resulted in an extra order of magnitude increase in the computational time. Although the performance di\ufb00erence between both methods is important, it is very likely that it would not be relevant in practical streamline simulations. In real simulations, the time required to trace streamlines would be much smaller than the time required to solve the flow and transport problems. In that case, even the slowest of the three methods, explicit integration with 0.1% tolerance, would require only a small fraction of the total simulation time. Method Time (sec) # Nodes \u2206s Pollock 0.3 99,361 Explicit 1% 5.9 221,437 \u2206x\/2 Explicit 1% 5.8 111,739 \u2206x Explicit 0.1% 56.6 223,140 \u2206x\/2 Explicit 0.1% 57.9 112,206 \u2206x \u2212 Table D.1: Comparison of the performance of Pollock\u2019s and explicit adaptive algorithm to trace streamlines shown in Figure D.8. When using the explicit integration algorithm, nodes are recorded only if the separation distance between the new and the previously recorded node is equal to or larger than the arc length spacing \u2206s. In Pollock\u2019s method only entry to and exit points from cells are recorded. 204 \fComments on the Selection of a Streamline Tracing Algorithm Based on the examples presented above and our accumulated experience using Pollock\u2019s and the explicit adaptive integration schemes, we have the following comments: 1. Both methods are able to provide the same level of accuracy if a small tolerance is used for FEAPT method. 2. However, as demonstrated with the heterogeneous quarter five-spot problem, Pollock\u2019s method can be orders of magnitude faster than the explicit integration algorithm for the same level of accuracy. 3. On the other hand, tracing streamlines is a relatively inexpensive part of a simulation when compared to the solution of the flow and transport problems. Moreover, the cost of the tracing step can be easily reduced by parallelizing both algorithms, making the relative cost even smaller. Therefore, performance should not be considered as the sole factor in choosing a streamline tracing algorithm. 4. Because of its semi-analytical formulation, the original Pollock\u2019s method is restricted to flow fields computed in regular cell-centered Cartesian grids. Its extension to unstructured grids, although possible, it involves much more complex expressions and additional steps. Additionally, the method assumes a linear reconstruction of the velocity components, which is a low order approximation. On the other hand, the FEAPT method only requires a routine to evaluate the flow velocity at each location, thus it can be applied to any type of grid (structured or unstructured) and to any velocity approximation without modifications. In summary, Pollock\u2019s method continue to be an attractive option because of its inherent accuracy and relative low computational overhead. However, the explicit integration schemes should be considered as a serious alternative to replace it in new streamline simulation packages because of its simplicity, flexibility, and numerical robustness. Streamline Distribution In streamline simulations the resolution of the numerical grid is given by the distribution and number of streamlines. Good spatial resolution requires that streamlines cover all 205 \fthe domain with some minimum density of lines crossing every region of the domain. In general, streamlines are traced starting from an initial location (seed) and then tracking backward and forward until exiting the domain or hitting a sink or source cell. Therefore, it is possible, for simple flow fields, to optimize the streamline distribution with an adequate choice of the initial seeds. For example, Figure D.9 shows two possible distributions of ten streamlines in the homogeneous quarter five-spot problem. It is clear that the streamlines traced from equispaced seeds over the diagonal line provide a more regular coverage of the domain than the ones traced from points located over a vertical line. The optimal selection of initial seeds becomes much more complicated in the case of heterogeneous velocity fields as shown in Figure D.10. The figure shows four possible distributions for hundred streamlines in the heterogeneous quarter five-spot problem considering field K1. We observe that independently of the distribution of the initial seeds, the distribution of streamlines is very irregular. Large areas of the domain contain few streamlines, while few small regions concentrate many of them. Streamlines occur less often in slow flow areas, while they concentrate in fast regions. Therefore, an attractive alternative to obtain a more uniform coverage is to launch some streamlines from the slowest cells in the domain. However, many of the slowest cells are located nearby, and seeding streamlines using such strategy produces a more irregular streamline distribution than the one obtained using randomly distributed seeds. In many streamline simulations, it is impossible to tolerate regions of the domain without a crossing streamline. For example, in solute transport simulations that use an operator-splitting approach and solve advection along streamlines and dispersion using a background grid (Crane and Blunt, 1999; Obi and Blunt, 2004), at least one streamline must cross each cell of the background grid in order to minimize interpolation errors. A common approach in those cases consists in using a background grid to control the streamline distribution. First, streamlines are traced from specified seeds marking cells of the grid that are crossed by at least one streamline. Second, new streamlines are traced from the rest of cells. In general, the number of streamlines is dependant on the initial seeds configuration and the order used to identify empty cells in the grid. As illustration, we use the quarter five-spot problem considering the field K1 and trace enough streamlines such as at least one streamline crosses every cell a 100 x 100 square grid. We use Pollock\u2019s method and only record the entry and exit points in each cell. Table D.2 summarizes the total number of streamlines and nodes required to cover the grid using five di\ufb00erent strategies for the distribution of initial seeds. We observe that independent 206 \fFigure D.8: Distribution of 600 streamlines traced to compare the performance of Pollock\u2019s and the explicit adaptive integration scheme. Streamlines for fields K1 (left) and K2 (right). Figure D.9: Two possible distributions of ten streamlines in the homogeneous quarter five-spot problem. Red squares indicate the position of initial seeds. Using a sensible choice of the initial seeds, it is possible to obtain a more uniform coverage of the domain with the same number of streamlines. 207 \fFigure D.10: Four possible distributions for hundred streamlines in the heterogeneous quarter five-spot problem considering field K1. Red squares indicate the position of initial seeds. Seed distributions correspond to: (i) equispaced points along diagonal line (top left), (ii) quasi-randomly distributed points (top right), (iii) fifty equispaced points along diagonal and fifty quasi-randomly distributed points (down left), and (iv) fifty equispaced points along diagonal and the location of the fifty (0.5%) of the slowest cells. Independent of the distribution of the initial seeds, the distribution of streamlines is very irregular in highly heterogeneous velocity fields. 208 \fInitial seeds # Streamlines # Nodes 100 points over diagonal line 1036 169,831 100 quasi-random points 1034 169,253 50 points over diagonal and 50 quasi-random points 1016 166,274 400 quasi-random points 1064 174,313 without initial seeds (trace streamlines from each empty cell) 1035 169,128 Table D.2: Comparison of di\ufb00erent strategies to trace streamlines such that at least one streamline crosses each cell of a 100 x 100 Cartesian grid. The total number of streamlines and nodes are very similar independently of the di\ufb00erent seed locations. of the seed distribution the required number of streamlines and nodes are similar with small variations around average values of 1035 streamlines and 169,000 nodes. It is important to highlight that the average number of nodes is much larger than the number of cells in the background grid (10,000), which is, in our experience, a common situation in streamline simulations. The large number of nodes required to provide an adequate coverage of the domain is the price one must pay to obtain good spatial resolution and better accuracy. On the other hand, that cost is smaller in simulations that consider less heterogeneous media. Streamline Discretization There are three possible choices to distribute nodes along streamlines: (i) uniform spacing in the time of flight coordinate, (ii) uniform spacing in the arc length coordinate, and (iii) only record positions of entry and exit points in each cell. The selection of the streamline discretization has important practical implications for the performance of the simulation, selection of numerical solvers for the transport step, and stability restrictions of the overall numerical method. For example, it is much easier to solve the advection step formulated in terms of the time of flight coordinate \u03c4 , if nodes along streamlines are separated by a uniform step \u2206\u03c4 (Crane and Blunt, 1999). However, there are also other trade-o\ufb00s that must be considered such as limitations in the total number of nodes and spatial node distribution. 209 \fWe use a simple flow scenario to motivate our discussion about the merits of the di\ufb00erent streamline discretization schemes. We consider flow in a homogeneous medium with hydraulic conductivity K0 that contains a high permeability inclusion with K1 = 10K0 . We set boundary conditions such that the mean flow goes from left to right. We solve the flow problem using a regular Cartesian grid with 10 x 10 cells. Figure D.11 shows an schematic of the flow problem. We use the resulting velocity field to trace ten streamlines using the three di\ufb00erent discretization approaches. First, we trace streamlines recording only the entry and exit points to\/from individual cells. This is the most common discretization used in streamlines simulation because, as explained above, it arises naturally from the use of Pollock\u2019s method as the tracing algorithm. Second, we trace streamlines recording node positions that are equispaced in the time of flight coordinate with step \u2206\u03c4 , i.e. a fluid particle at node i needs \u2206\u03c4 time to move to the next node i + 1. Third, we trace streamlines recording only the entry and exit points to\/from individual cells as in the first discretization method, but we additionally apply a post-processing step to uniformly distribute nodes in the arc length coordinate such as neighbor nodes are separated by an arc length spacing \u2206s. FLOW! H0 10K 0 H1 K0 Figure D.11: Schematic of flow problem used to discuss alternatives streamline discretization. We consider a homogeneous medium with hydraulic conductivity K0 that contains a high permeability inclusion with K1 = 10K0 . Boundary conditions are set such that the mean flow goes from left to right. Figure D.12 shows the locations of nodes along streamlines traced using the first two discretization approaches. If only entry and exit points are recorded, then some of the 210 \fnodes located near the high permeability inclusion are separated by a very short distance because they enter and exit near one of the cell corners. Those small separations can introduce unacceptable stability constrains for explicit solvers used to simulate advection (Thiele, 2003). Therefore, some post-processing step must be applied to remove nodes with short separation (Crane and Blunt, 1999; Thiele, 2003). On the other hand, a discretization based on the time of flight with spacing \u2206\u03c4 = \u2206x\/U , where \u2206x is the grid spacing and U is the mean velocity; can result in a very irregular spatial node distribution. Nodes along streamlines cluster in slow flow zones, while they are separated by long distances in regions with fast flow velocity. Therefore, a prohibitively large number of nodes may be required in order to keep a minimum spatial node density in all the domain. Figure D.12: Comparison of streamline discretization approaches. Red dots indicate the position of nodes along streamlines. In traditional streamline methods, Pollock\u2019s semi-analytical method is used to find nodes where streamlines enter or exit to\/from individual cells (left). Alternatively, nodes can be distributed using a constant time of flight spacing (right). Figure D.13 presents a comparison of node locations if only entry and exit points are recorded and for a uniform arc length discretization with spacing \u2206s = \u2206x\/2. The arc length based discretization provides a uniform coverage of the domain with a relatively small number of nodes in comparison with the time of flight based discretization. Additionally, the constant node spacing along individual streamlines relaxes the stability restrictions of explicit solvers in comparison to the situation where entry and exit points are recorded. Because of its advantages, we selected the arc length based discretization 211 \fas the default option in our streamline simulator. Figure D.13: In traditional streamline methods, Pollock\u2019s semi-analytical method is used to find nodes where streamlines enter or exit to\/from individual cells (left). That information can be used to distribute nodes using a constant arc length spacing along streamlines (right). Red dots indicate the position of nodes along streamlines. Note the short separation between some nodes in the left figure and the regular spatial node distribution in the right one. References Aris, R., Vectors, Tensors and the Basic Equations of Fluid Mechanics, Dover Publications, 1989. Cordes, C., and W. Kinzelbach, Continuous groundwater velocity fields and path lines in linear, bilinear, and trilinear finite elements., Water Resour. Res., 28 , 2903\u20132911, 1992. Crane, M., and M. Blunt, Streamline-based simulation of solute transport, Water Resour. Res., 35 , 3061\u20133078, 1999. Dormand, J., and P. Prince, A family of embedded Runge-Kutta formulae, J. Comput. Appl. Math., 6 , 19\u201326, 1980. Matringe, S., Accurate streamline tracing and coverage, Master\u2019s thesis, Stanford University, 2004. 212 \fObi, E., and M. Blunt, Streamline-based simulation of advective-dispersive solute transport, Adv. Water Resour., 27 , 913\u2013924, 2004. Pollock, D., Semianalytical computation of path lines for Finite-Di\ufb00erence models, Ground Water, 26 , 743\u2013750, 1988. Prevost, M., M. Edwards, and M. Blunt, Streamline tracing on curvilinear structured and unstructured grids, Soc. Petrol. Eng. J., 7 , 139\u2013148, 2002. Thiele, M., Streamline simulation, in 7th International Forum on Reservoir Simulation, 2003. Thiele, M., R. Batycky, and M. Blunt, Simulating flow in heteroneous systems using streamtube and streamlines, SPE Reservoir Engineering, pp. 5\u201312, 1996. 213 ","@language":"en"}],"Genre":[{"@value":"Thesis\/Dissertation","@language":"en"}],"GraduationDate":[{"@value":"2010-05","@language":"en"}],"IsShownAt":[{"@value":"10.14288\/1.0053008","@language":"en"}],"Language":[{"@value":"eng","@language":"en"}],"Program":[{"@value":"Geological Engineering","@language":"en"}],"Provider":[{"@value":"Vancouver : University of British Columbia Library","@language":"en"}],"Publisher":[{"@value":"University of British Columbia","@language":"en"}],"Rights":[{"@value":"Attribution-NonCommercial-NoDerivatives 4.0 International","@language":"en"}],"RightsURI":[{"@value":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/","@language":"en"}],"ScholarlyLevel":[{"@value":"Graduate","@language":"en"}],"Title":[{"@value":"Particle and streamline numerical methods for conservative and reactive transport simulations in porous media","@language":"en"}],"Type":[{"@value":"Text","@language":"en"}],"URI":[{"@value":"http:\/\/hdl.handle.net\/2429\/15967","@language":"en"}],"SortDate":[{"@value":"2009-12-31 AD","@language":"en"}],"@id":"doi:10.14288\/1.0053008"}