1997
DOI: 10.1016/s0169-7722(96)00089-7
|View full text |Cite
|
Sign up to set email alerts
|

The ‘front limitation’ algorithm A new and fast finite-difference method for groundwater pollution problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…The boundary conditions of zero ponding depth at x = 0, and the initial condition of h = 0 for x > 0 were used. The front limitation algorithm (Haefner et al , 1997) was applied to solve the bacteria transport Equations (5), (6), and (7). The Dirichlet boundary condition of zero concentration and the Neumann boundary condition of zero concentration gradient were set at the inlet and outlet boundaries, respectively, and a constant initial concentration C r = 0 at x > 0 was assumed for Equation (5) at the absence of surface water.…”
Section: Methodsmentioning
confidence: 99%
“…The boundary conditions of zero ponding depth at x = 0, and the initial condition of h = 0 for x > 0 were used. The front limitation algorithm (Haefner et al , 1997) was applied to solve the bacteria transport Equations (5), (6), and (7). The Dirichlet boundary condition of zero concentration and the Neumann boundary condition of zero concentration gradient were set at the inlet and outlet boundaries, respectively, and a constant initial concentration C r = 0 at x > 0 was assumed for Equation (5) at the absence of surface water.…”
Section: Methodsmentioning
confidence: 99%
“…The KINEROS2 numerical code (Woolhiser et al, 1990) was used to solve the flow equation. The front limitation algorithm (Haefner et al, 1997) was applied for solving the solute transport equations.…”
Section: Methodsmentioning
confidence: 99%
“…The transport equations were solved by using an implicit finite differences method and applying the front limitation algorithm [28]. The space step was 10 m, while the time step varied to fit both stability criteria to solve the Saint-Venant equation and to keep the Courant number to be less than 0.5 for the transport equation solution.…”
Section: Initial and Boundary Conditions Numerical Solutionmentioning
confidence: 99%