Skip to content

Buckley-Leverett two-phase problem

Introduction   Validation   Immiscible  

The Buckley-Leverett test problem is a classical reservoir simulation benchmark that demonstrates the nonlinear displacement process of a viscous fluid being displaced by a less viscous fluid, typically taken to be water displacing oil.

Problem definition

This is a simple model without wells, where the flow is driven by a simple source term and a simple constant pressure boundary condition at the outlet. We define a function that sets up a two-phase system, a simple 1D domain and replaces the default relative permeability functions with quadratic functions:

krα(S)=min(SSr1Sr,1)n,Sr=0.2,n=2

In addition, the phase viscosities are treated as constant parameters of 1 and 5 centipoise for the displacing and resident fluids, respectively.

The function is parametrized on the number of cells and the number of time-steps used to solve the model. This function, since it uses a relatively simple setup without wells, uses the Jutul functions directly.

julia
using JutulDarcy, Jutul
function solve_bl(;nc = 100, time = 1.0, nstep = nc)
    T = time
    tstep = repeat([T/nstep], nstep)
    domain = get_1d_reservoir(nc)
    nc = number_of_cells(domain)
    timesteps = tstep*3600*24
    bar = 1e5
    p0 = 100*bar
    sys = ImmiscibleSystem((LiquidPhase(), VaporPhase()))
    model = SimulationModel(domain, sys)
    kr = BrooksCoreyRelativePermeabilities(sys, [2.0, 2.0], [0.2, 0.2])
    replace_variables!(model, RelativePermeabilities = kr)
    tot_time = sum(timesteps)
    pv = pore_volume(domain)
    irate = 500*sum(pv)/tot_time
    src  = SourceTerm(1, irate, fractional_flow = [1.0, 0.0])
    bc = FlowBoundaryCondition(nc, p0/2)
    forces = setup_forces(model, sources = src, bc = bc)
    parameters = setup_parameters(model, PhaseViscosities = [1e-3, 5e-3]) # 1 and 5 cP
    state0 = setup_state(model, Pressure = p0, Saturations = [0.0, 1.0])
    states, report = simulate(state0, model, timesteps,
        forces = forces, parameters = parameters)
    return states, model, report
end
solve_bl (generic function with 1 method)

Run the base case

We solve a small model with 100 cells and 100 steps to serve as the baseline.

julia
n, n_f = 100, 1000
states, model, report = solve_bl(nc = n)
print_stats(report)
Jutul: Simulating 1 day as 100 report steps
╭────────────────┬───────────┬───────────────┬──────────╮
 Iteration type   Avg/step   Avg/ministep     Total 
 100 steps  100 ministeps  (wasted) 
├────────────────┼───────────┼───────────────┼──────────┤
 Newton         │      4.15 │          4.15 │  415 (0) │
 Linearization  │      5.15 │          5.15 │  515 (0) │
 Linear solver  │      4.15 │          4.15 │  415 (0) │
 Precond apply  │       0.0 │           0.0 │    0 (0) │
╰────────────────┴───────────┴───────────────┴──────────╯
╭───────────────┬────────┬────────────┬────────╮
 Timing type      Each    Relative   Total 
     ms  Percentage       s 
├───────────────┼────────┼────────────┼────────┤
 Properties    │ 0.0146 │     0.24 % │ 0.0061 │
 Equations     │ 0.4271 │     8.77 % │ 0.2200 │
 Assembly      │ 0.2071 │     4.25 % │ 0.1066 │
 Linear solve  │ 2.2200 │    36.72 % │ 0.9213 │
 Linear setup  │ 0.0000 │     0.00 % │ 0.0000 │
 Precond apply │ 0.0000 │     0.00 % │ 0.0000 │
 Update        │ 0.0133 │     0.22 % │ 0.0055 │
 Convergence   │ 0.1672 │     3.43 % │ 0.0861 │
 Input/Output  │ 0.2806 │     1.12 % │ 0.0281 │
 Other         │ 2.7356 │    45.25 % │ 1.1353 │
├───────────────┼────────┼────────────┼────────┤
 Total         │ 6.0455 │   100.00 % │ 2.5089 │
╰───────────────┴────────┴────────────┴────────╯
╭────────────────┬───────────┬───────────────┬──────────╮
 Iteration type   Avg/step   Avg/ministep     Total 
 100 steps  100 ministeps  (wasted) 
├────────────────┼───────────┼───────────────┼──────────┤
 Newton         │      4.15 │          4.15 │  415 (0) │
 Linearization  │      5.15 │          5.15 │  515 (0) │
 Linear solver  │      4.15 │          4.15 │  415 (0) │
 Precond apply  │       0.0 │           0.0 │    0 (0) │
╰────────────────┴───────────┴───────────────┴──────────╯
╭───────────────┬────────┬────────────┬────────╮
 Timing type      Each    Relative   Total 
     ms  Percentage       s 
├───────────────┼────────┼────────────┼────────┤
 Properties    │ 0.0146 │     0.24 % │ 0.0061 │
 Equations     │ 0.4271 │     8.77 % │ 0.2200 │
 Assembly      │ 0.2071 │     4.25 % │ 0.1066 │
 Linear solve  │ 2.2200 │    36.72 % │ 0.9213 │
 Linear setup  │ 0.0000 │     0.00 % │ 0.0000 │
 Precond apply │ 0.0000 │     0.00 % │ 0.0000 │
 Update        │ 0.0133 │     0.22 % │ 0.0055 │
 Convergence   │ 0.1672 │     3.43 % │ 0.0861 │
 Input/Output  │ 0.2806 │     1.12 % │ 0.0281 │
 Other         │ 2.7356 │    45.25 % │ 1.1353 │
├───────────────┼────────┼────────────┼────────┤
 Total         │ 6.0455 │   100.00 % │ 2.5089 │
╰───────────────┴────────┴────────────┴────────╯

Run refined version (1000 cells, 1000 steps)

Using a grid with 100 cells will not yield a fully converged solution. We can increase the number of cells at the cost of increasing the runtime a bit. Note that most of the time is spent in the linear solver, which uses a direct sparse LU factorization by default. For larger problems it is recommended to use an iterative solver. The high-level interface used in later examples automatically sets up an iterative solver with the appropriate preconditioner.

julia
states_refined, _, report_refined = solve_bl(nc = n_f);
print_stats(report_refined)
Jutul: Simulating 23 hours, 60 minutes as 1000 report steps
╭────────────────┬────────────┬────────────────┬──────────╮
 Iteration type    Avg/step    Avg/ministep     Total 
 1000 steps  1000 ministeps  (wasted) 
├────────────────┼────────────┼────────────────┼──────────┤
 Newton         │       4.12 │           4.12 │ 4120 (0) │
 Linearization  │       5.12 │           5.12 │ 5120 (0) │
 Linear solver  │       4.12 │           4.12 │ 4120 (0) │
 Precond apply  │        0.0 │            0.0 │    0 (0) │
╰────────────────┴────────────┴────────────────┴──────────╯
╭───────────────┬────────┬────────────┬─────────╮
 Timing type      Each    Relative    Total 
     ms  Percentage        s 
├───────────────┼────────┼────────────┼─────────┤
 Properties    │ 0.0791 │     2.72 % │  0.3259 │
 Equations     │ 0.0783 │     3.35 % │  0.4011 │
 Assembly      │ 0.0340 │     1.45 % │  0.1740 │
 Linear solve  │ 2.5642 │    88.10 % │ 10.5643 │
 Linear setup  │ 0.0000 │     0.00 % │  0.0000 │
 Precond apply │ 0.0000 │     0.00 % │  0.0000 │
 Update        │ 0.0437 │     1.50 % │  0.1802 │
 Convergence   │ 0.0295 │     1.26 % │  0.1510 │
 Input/Output  │ 0.0272 │     0.23 % │  0.0272 │
 Other         │ 0.0408 │     1.40 % │  0.1679 │
├───────────────┼────────┼────────────┼─────────┤
 Total         │ 2.9106 │   100.00 % │ 11.9917 │
╰───────────────┴────────┴────────────┴─────────╯
╭────────────────┬────────────┬────────────────┬──────────╮
 Iteration type    Avg/step    Avg/ministep     Total 
 1000 steps  1000 ministeps  (wasted) 
├────────────────┼────────────┼────────────────┼──────────┤
 Newton         │       4.12 │           4.12 │ 4120 (0) │
 Linearization  │       5.12 │           5.12 │ 5120 (0) │
 Linear solver  │       4.12 │           4.12 │ 4120 (0) │
 Precond apply  │        0.0 │            0.0 │    0 (0) │
╰────────────────┴────────────┴────────────────┴──────────╯
╭───────────────┬────────┬────────────┬─────────╮
 Timing type      Each    Relative    Total 
     ms  Percentage        s 
├───────────────┼────────┼────────────┼─────────┤
 Properties    │ 0.0791 │     2.72 % │  0.3259 │
 Equations     │ 0.0783 │     3.35 % │  0.4011 │
 Assembly      │ 0.0340 │     1.45 % │  0.1740 │
 Linear solve  │ 2.5642 │    88.10 % │ 10.5643 │
 Linear setup  │ 0.0000 │     0.00 % │  0.0000 │
 Precond apply │ 0.0000 │     0.00 % │  0.0000 │
 Update        │ 0.0437 │     1.50 % │  0.1802 │
 Convergence   │ 0.0295 │     1.26 % │  0.1510 │
 Input/Output  │ 0.0272 │     0.23 % │  0.0272 │
 Other         │ 0.0408 │     1.40 % │  0.1679 │
├───────────────┼────────┼────────────┼─────────┤
 Total         │ 2.9106 │   100.00 % │ 11.9917 │
╰───────────────┴────────┴────────────┴─────────╯

Plot results

We plot the saturation front for the base case at different times together with the final solution for the refined model. In this case, refining the grid by a factor 10 gave us significantly less smearing of the trailing front.

julia
using GLMakie
x = range(0, stop = 1, length = n)
x_f = range(0, stop = 1, length = n_f)
f = Figure()
ax = Axis(f[1, 1], ylabel = "Saturation", title = "Buckley-Leverett displacement")
for i in 1:6:length(states)
    lines!(ax, x, states[i][:Saturations][1, :], color = :darkgray)
end
lines!(ax, x_f, states_refined[end][:Saturations][1, :], color = :red)
f

Example on GitHub

If you would like to run this example yourself, it can be downloaded from the JutulDarcy.jl GitHub repository as a script, or as a Jupyter Notebook

This example took 19.638930359 seconds to complete.

This page was generated using Literate.jl.