This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Numerical approximation of the insitu combustion model using the nonlinear mixed complementarity method

Julio César Agustín Sangay J. Sangay. Universidad Privada del Norte, Trujillo-Perú [email protected] Alexis Rodriguez Carranza A. Rodriguez. Universidad Privada del Norte, Trujillo-Perú [email protected] George J. Bautista Faculty of Engineering, Civil Engineering Professional School, Technological University of the Andes(UTEA), Sede Abancay, Av. Perú 700, Apurímac, Peru. [email protected] Juan Carlos Ponte Bejarano Universidad Tecnológica del Peru, Trujillo-Perú [email protected] José Luis Ponte Bejarano J. Ponte Universidad Tecnológica del Peru, Trujillo-Perú [email protected]  and  Eddy Cristiam Miranda Ramos E. Cristiam Universidad Nacional de Trujillo [email protected]
Abstract.

In this work, we will study a numerical method that allows finding an approximation of the exact solution for a in-situ combustion model using the nonlinear mixed complementary method, which is a variation of the Newton’s method for solving nonlinear systems based on an implicit finite difference scheme and a nonlinear algorithm mixed complementarity, FDA-MNCP. The method has the advantage of provide a global convergence in relation to the finite difference method and method of Newton that only has local convergence. The theory is applied to model in-situ combustion, which can be rewritten in the form of mixed complementarity also we do a comparison with the FDA-NCP method.

Key words and phrases:
insitu combustion model, nonlinear mixed complementarity method

1. Introduction

several mathematical models in different disciplines such as engineering, physics, economics and other sciences study partial differential equations of the parabolic type. These models can lead to the problem of mixed complementarity, that is, the case several mathematical models in different disciplines, such as engineering, physics, economics and other sciences study partial differential equations of the parabolic type. These models can lead to the problem of mixed complementarity, that is, the case of the in-situ combustion model, which will be our model in this work. Other applications of complementarity problems are described in [9].

Since the goal is to find an approximation of the analytical solution, we will develop a numerical method that will allow us to achieve our goal. This technique will be applied to the simple in-situ combustion model which will be written as a mixed complementarity problem.

The in-situ combustion model is a particular case of the model treated in [4]. In this case, the model considers the injection of air into a porous medium containing solid fuel and consists of a system of two nonlinear parabolic differential equations.

The contribution of the work is the study of the simple in-situ combustion model and simulations for the proposed model applying the Crank-Nicolson method and the FDA-MNCP algorithm [6].

We will present the results that indicate that the sequence of feasible points generated is contained in a feasible region and we will verify that the directions obtained are feasible and descending for a function associated with the complementarity problem and we will also see the proof of global convergence for the FDA-MNCP following the feat for FDA-NCP[11]. We apply the FDA-MNCP method to the in-situ combustion problem, describe the discretization procedure using the finite difference technique for the mixed complementarity problem associated with the problem, and also present the numerical results and the corresponding error analysis with the comparison with the FDA-NCP method. Finally, we will present some conclusions.

2. Physical problem modeling

The model studies one-dimensional flows, with a combustion wave in the case when the oxidant (air with oxygen) is injected into a porous medium. Initially the medium contains a fuel that is essentially immobile, does not vaporize and the amount of oxygen is unlimited. This is the case for solid or liquid fuels with low saturations. As in [1], we study the simplified model where:

  • \bullet

    A small part of the available space is occupied by fuel.

  • \bullet

    Porosity changes in the reaction are negligible.

  • \bullet

    Temperature of solid and gas are the same (local thermal equilibrium).

  • \bullet

    Gas velocity is constant.

  • \bullet

    Heat loss is negligible.

  • \bullet

    Pressure variations are small compared to the prevailing pressure.

The model has temporal tt and spatial xx coordinates that include the heat balance equation, the molar balance equation for immobile fuels, and the ideal gas law.

CmTt+x(Cgρu(TTres))\displaystyle{}C_{m}\frac{\partial T}{\partial t}+\frac{\partial}{\partial x}(C_{g}\rho u(T-T_{res})) =\displaystyle= λ2Tx2+QrWr,\displaystyle\lambda\frac{\partial^{2}T}{\partial x^{2}}+Q_{r}W_{r}, (1)
ρft\displaystyle\frac{\partial\rho_{f}}{\partial t} =\displaystyle= μfWr,\displaystyle-\mu_{f}W_{r}, (2)
ρ\displaystyle\rho =\displaystyle= PTR,\displaystyle\frac{P}{TR}, (3)

where T[K]T[K] is the temperature, ρ[molm3]\rho[\frac{mol}{m^{3}}] is the molar density of the gas, and ρf[molm3]\rho_{f}[\frac{mol}{m^{3}}] is the molar concentration of the immobile fuel. The set of parameters along with their typical values are given in the Table1.

Symbol Physical Quantity Value Unit
TresT_{res} Initial reservoir temperature 273 [K][K]
CmC_{m} Heat capacity of porous medium 21062\cdot 10^{6} [J/m3K][J/m^{3}K]
cgc_{g} Heat capacity of gas 27.42 [J/molK][J/molK]
λ\lambda Thermal conductivity of porous medium 0.87 [J/(msK)][J/(msK)]
QrQ_{r} Enthalpy of the still fuel in TresT_{res} 41054\cdot 10^{5} [J/mol][J/mol]
uinju_{inj} Darcy speed for gas injection (200m/dia)(200m/dia) 0.00230.0023 [m/s][m/s]
ErE_{r} Activation energy 5800058000 [J/mol][J/mol]
KpK_{p} Pre-exponential parameter 500 1/s1/s
RR Ideal gas constant 8.314 [J/molK][J/molK]
PP Prevailing pressure (1atm)(1atm) 101325 [Pa][Pa]
ρfres\rho^{res}_{f} Initial molar density of fuel 372 [mol/m3][mol/m^{3}]
Table 1. Dimensional parameters for in-situ combustion and their typical values [1].

As in [1], if we consider for simplicity μf=μg=μ0=1\mu_{f}=\mu_{g}=\mu_{0}=1 and the amount of oxygen is unlimited, the reaction ratio WrW_{r} is taken as:

Wr=kpρfexp(ErRT).W_{r}=k_{p}\rho_{f}\exp\left(\frac{-E_{r}}{RT}\right). (4)

The variables to be found are the temperature (T)(T) and the molar concentration of the immobile fuel (ρf)(\rho_{f}). Since the equations are not dimensioned, we do as [1], to obtain the dimensionless form:

θt+u(ρθ)x\displaystyle\frac{\partial\theta}{\partial t}+u\frac{\partial(\rho\theta)}{\partial x} =\displaystyle= 1PeT2θx2+Φ(θ,η).\displaystyle\frac{1}{P_{e_{T}}}\frac{\partial^{2}\theta}{\partial x^{2}}+\Phi(\theta,\eta). (5)
ηt\displaystyle\frac{\partial\eta}{\partial t} =\displaystyle= Φ(θ,η).\displaystyle\Phi(\theta,\eta). (6)
where:ρ=θ0θ+θ0,Φ=β(1η)exp(Eθ+θ0).\mbox{where:}\ \ \ \ \rho=\frac{\theta_{0}}{\theta+\theta_{0}},\ \ \ \ \ \ \Phi=\beta(1-\eta)\exp\left(\frac{-E}{\theta+\theta_{0}}\right).

with the dimensionless constants:

PET=xλΔT,β=ρfkpQr,E=ErRΔT,θ0=TresΔT,u=uinjtx.P_{E_{T}}=\frac{x^{\star}}{\lambda\Delta T^{\star}},\ \ \beta=\rho_{f}^{\star}k_{p}Q_{r},\ \ E=\frac{E_{r}}{R\Delta T^{\star}},\ \ \theta_{0}=\frac{T_{res}}{\Delta T^{\star}},\ \ u=\frac{u_{inj}t^{\star}}{x^{\star}}. (7)

Here PeTP_{e_{T}} is the Peclet number for thermal diffusion, uu becomes the dimensionless thermal wave velocity, EE is a escalated activation energy and θ0\theta_{0} is a scaled reservoir temperature. With a reservoir initial conditions:

t=0;x0:θ=0,η=0t=0;\quad x\geq 0:\quad\theta=0,\quad\eta=0

and injections condition:

t0;x=0:θ=0,η=1.t\geq 0;\quad x=0:\quad\theta=0,\quad\eta=1.

3. Description of the FDA-MNCP method for the simple in-situ combustion model

We now describe in detail the finite difference scheme for the in-situ combustion model for the FDA-MNCP method. For this we use the mesh applying the Crank-Nicolson method to approximate the spatial derivatives in each case, i.e.:

tθ(xm,tn+12)\displaystyle\partial_{t}\theta(x_{m},t_{n+\frac{1}{2}}) =\displaystyle= θmn+1θmnk.\displaystyle\frac{\theta^{n+1}_{m}-\theta^{n}_{m}}{k}. (8)
xxθ(xm,tn+12)\displaystyle\partial_{xx}\theta(x_{m},t_{n+\frac{1}{2}}) =\displaystyle= θm+1n+12θmn+1+θm1n+12h2+θm+1n2θmn+θm1n2h2.\displaystyle\frac{\theta^{n+1}_{m+1}-2\theta^{n+1}_{m}+\theta^{n+1}_{m-1}}{2h^{2}}+\frac{\theta^{n}_{m+1}-2\theta^{n}_{m}+\theta^{n}_{m-1}}{2h^{2}}. (9)
xF(θ(xm,tn+12))\displaystyle\partial_{x}F(\theta(x_{m},t_{n+\frac{1}{2}})) =\displaystyle= Fm+1n+1Fm1n+14h+Fm+1nFm1n4h.\displaystyle\frac{F^{n+1}_{m+1}-F^{n+1}_{m-1}}{4h}+\frac{F^{n}_{m+1}-F^{n}_{m-1}}{4h}. (10)
Φ(θ(xm,tn+12))\displaystyle\Phi(\theta(x_{m},t_{n+\frac{1}{2}})) =\displaystyle= Φmn+1+Φmn2.\displaystyle\frac{\Phi^{n+1}_{m}+\Phi^{n}_{m}}{2}. (11)

Considering the Dirichlet conditions at the point x0x_{0}:

θ(x0,t)=0,η(x0,t)=1,\theta(x_{0},t)=0,\quad\quad\eta(x_{0},t)=1,

and Neumann conditions at the point xMx_{M}

θx(xM,t)=0,ηx(xM,t)=0,\frac{\partial\theta}{\partial x}(x_{M},t)=0,\quad\quad\frac{\partial\eta}{\partial x}(x_{M},t)=0,

given in[20], therefore, the value at x0x_{0} is known at all times but not at xMx_{M}, and

θ0n+1=θ0n,η0n+1=η0n,for all n{}\theta^{n+1}_{0}=\theta^{n}_{0},\quad\eta^{n+1}_{0}=\eta^{n}_{0},\quad\text{for all $n\in\mathbb{N}$} (12)

The boundary condition on xMx_{M} gives:

θx(xM,t)=0θM+1nθM1n2h=0\frac{\partial\theta}{\partial x}(x_{M},t)=0\Longrightarrow\frac{\theta^{n}_{M+1}-\theta^{n}_{M-1}}{2h}=0

therefore,

θM+1n=θM1nFM+1n=FM1n,for all n{}\theta^{n}_{M+1}=\theta^{n}_{M-1}\Longrightarrow F^{n}_{M+1}=F^{n}_{M-1},\quad\text{for all $n\in\mathbb{N}$} (13)

given shaping the FDA-MNCP method:

θ0;θt+u(ρθ)x1PeT2θx2Φ(θ,η)0.\displaystyle\theta\geq 0;\ \frac{\partial\theta}{\partial t}+u\frac{\partial(\rho\theta)}{\partial x}-\frac{1}{P_{e_{T}}}\frac{\partial^{2}\theta}{\partial x^{2}}-\Phi(\theta,\eta)\geq 0. (14)
ηtΦ(θ,η)=0.\displaystyle\frac{\partial\eta}{\partial t}-\Phi(\theta,\eta)=0. (15)

To obtain the discrete relations of(14), we replace (8-11) in(14) to obtain:

2μHθm1n+1+(4+4μH)θmn+12μHθm+1n+1+λ[Fm+1n+1Fm1n+1]2kΦmn+1\displaystyle-2\mu H\theta^{n+1}_{m-1}+(4+4\mu H)\theta^{n+1}_{m}-2\mu H\theta^{n+1}_{m+1}+\lambda[F^{n+1}_{m+1}-F^{n+1}_{m-1}]-2k\Phi^{n+1}_{m}\ \ \geq (16)
2μHθm1n+(44μH)θmn+2μHθm+1n+λ[Fm+1nFm1n]+2kΦmn,\displaystyle\ \ \ \ \ \ \ \ \ \ \ \geq\ \ 2\mu H\theta^{n}_{m-1}+(4-4\mu H)\theta^{n}_{m}+2\mu H\theta^{n}_{m+1}+\lambda[F^{n}_{m+1}-F^{n}_{m-1}]+2k\Phi^{n}_{m},

where λ=hh\lambda=\frac{h}{h} and μ=khr\mu=\frac{k}{hr}. The scheme is valid for m=1,2,,Mm=1,2,\dots,M of the points whose values are not known. At the boundary points we have that for m=1m=1, substituting (12) in (16) we obtain:

(4+4μH)θ1n+12μHθ2n+1+λ[F2n+1F0n+1]2kΦ1n+1\displaystyle(4+4\mu H)\theta^{n+1}_{1}-2\mu H\theta^{n+1}_{2}+\lambda[F^{n+1}_{2}-F^{n+1}_{0}]-2k\Phi^{n+1}_{1}\ \ \geq (17)
(44μH)θ1n+2μHθ2nλ[F2nF0n]+2kΦ1n+4μHθ0n,\displaystyle\ \ \geq\ \ (4-4\mu H)\theta^{n}_{1}+2\mu H\theta^{n}_{2}-\lambda[F^{n}_{2}-F^{n}_{0}]+2k\Phi^{n}_{1}+4\mu H\theta^{n}_{0},

for n=Mn=M, we replace (13) in (16) for obtain:

4μHθM1n+1+(4+4μH)θMn+12kΦMn+14μHθM1n+(44μH)θMn+2kΦMn.\displaystyle-4\mu H\theta^{n+1}_{M-1}+(4+4\mu H)\theta^{n+1}_{M}-2k\Phi^{n+1}_{M}\geq 4\mu H\theta^{n}_{M-1}+(4-4\mu H)\theta^{n}_{M}+2k\Phi^{n}_{M}. (18)

Then (16) is valid for all m=2,,M1m=2,\dots,M-1 and joining the expressions (17) and (18)we obtain the following inequality in the variable θn+1\theta^{n+1}

Gn(θn+1,ηn+1)=Aθn+1+λP(θn+1,ηn+1)2kΦ(θn+1,ηn+1)LD(θn,ηn)0,\displaystyle G^{n}(\theta^{n+1},\eta^{n+1})=A\theta^{n+1}+\lambda P(\theta^{n+1},\eta^{n+1})-2k\Phi(\theta^{n+1},\eta^{n+1})-LD(\theta^{n},\eta^{n})\geq 0, (19)

where LD=BθnλP(θn,ηn)+2kΦ(θn,ηn)+URLD=B\theta^{n}-\lambda P(\theta^{n},\eta^{n})+2k\Phi(\theta^{n},\eta^{n})+UR is known at every instant of time.

Furthermore:

A=[4+4μH2μH000002μH4+4μH2μH000002μH4+4μH2μH00000002μH4+4μH2μH000004μH4+4μH],A=\left[\begin{array}[]{cccccccc}\!4+4\mu H&-2\mu H&0&0&\cdots&0&0&0\\ \!-2\mu H&4+4\mu H&-2\mu H&0&\cdots&0&0&0\\ \!0&-2\mu H&4+4\mu H&-2\mu H&&0&0&0\\ \vdots&&&&\ddots&&&\vdots\\ \!0&0&0&0&&-2\mu H&4+4\mu H&-2\mu H\\ \!0&0&0&0&&0&-4\mu H&4+4\mu H\end{array}\right]\!, (20)
B=[44μH2μH000002μH44μH2μH000002μH44μH2μH00000002μH44μH2μH000004μH44μH],B=\left[\begin{array}[]{cccccccc}4-4\mu H&2\mu H&0&0&\cdots&0&0&0\\ 2\mu H&4-4\mu H&2\mu H&0&\cdots&0&0&0\\ 0&2\mu H&4-4\mu H&2\mu H&&0&0&0\\ \vdots&&&&\ddots&&&\vdots\\ 0&0&0&0&&2\mu H&4-4\mu H&2\mu H\\ 0&0&0&0&&0&4\mu H&4-4\mu H\end{array}\right], (21)
Pn=P(θn)=[F2nF0nF3nF1nF4nF2nFMnFM2n0],Φn=Φ(θn)=[Φ1nΦ2nΦ3nΦM1nΦMn],P^{n}=P(\theta^{n})=\left[\begin{array}[]{ccc}F^{n}_{2}-F^{n}_{0}\\ F^{n}_{3}-F^{n}_{1}\\ F^{n}_{4}-F^{n}_{2}\\ \vdots\\ F^{n}_{M}-F^{n}_{M-2}\\ 0\end{array}\right],\ \ \Phi^{n}=\Phi(\theta^{n})=\left[\begin{array}[]{ccc}\Phi^{n}_{1}\\ \Phi^{n}_{2}\\ \Phi^{n}_{3}\\ \vdots\\ \Phi^{n}_{M-1}\\ \Phi^{n}_{M}\\ \end{array}\right],\ \ \ (22)
θn=[θ1nθ2nθ3nθM1nθMn],UR=[4μHθ0n0000]\theta^{n}=\left[\begin{array}[]{ccc}\theta^{n}_{1}\\ \theta^{n}_{2}\\ \theta^{n}_{3}\\ \vdots\\ \theta^{n}_{M-1}\\ \theta^{n}_{M}\\ \end{array}\right],\ \ UR=\left[\begin{array}[]{ccc}4\mu H\theta^{n}_{0}\\ 0\\ 0\\ \vdots\\ 0\\ 0\\ \end{array}\right] (23)

where A,BM×M;θn,Pn,ΦnM.A,B\in\mathbb{R}^{M\times M};\ \theta^{n},P^{n},\Phi^{n}\in\mathbb{R}^{M}. Similarly, to obtain the discrete form of (15) we replaced (8-11) in (15) to obtain:

Diag(2)ηmn+1kΦmn+1=Diag(2)ηmn+kΦmn.\displaystyle Diag(2)\eta^{n+1}_{m}-k\Phi^{n+1}_{m}=Diag(2)\eta^{n}_{m}+k\Phi^{n}_{m}. (24)

The difference scheme is valid for all m=1,2,,Mm=1,2,\dots,M of the points whose values are not known.

At the boundary points we have that for m=1m=1, we replace (12) in (24) we obtain:

2η1n+1kΦ1n+1=2η1n+kΦ1n,2\eta^{n+1}_{1}-k\Phi^{n+1}_{1}=2\eta^{n}_{1}+k\Phi^{n}_{1}, (25)

for m=Mm=M, we replaced (13) in (24) to obtain:

2ηMn+1kΦMn+1=2ηMn+kΦMn.\displaystyle 2\eta^{n+1}_{M}-k\Phi^{n+1}_{M}=2\eta^{n}_{M}+k\Phi^{n}_{M}. (26)

Therefore, (24) is valid for all m=2,,M1m=2,\dots,M-1 and joining the expressions (25) and (26) we obtain the following inequality in the variable ηn+1\eta^{n+1};

Q(θn+1,ηn+1)=Diag(2)ηn+1kφ(θn+1,ηn+1)LDQ(θn,ηn),Q(\theta^{n+1},\eta^{n+1})=Diag(2)\eta^{n+1}-k\varphi(\theta^{n+1},\eta^{n+1})-LDQ(\theta^{n},\eta^{n}), (27)

where LDQ=Diag(2)ηn+kφ(θn,ηn)LDQ=Diag(2)\eta^{n}+k\varphi(\theta^{n},\eta^{n}) is known at every instant of time.

Furthermore:

Diag(2)=[20000000200000002000000000200000002],Diag(2)=\left[\begin{array}[]{cccccccc}2&0&0&0&\cdots&0&0&0\\ 0&2&0&0&\cdots&0&0&0\\ 0&0&2&0&&0&0&0\\ \vdots&&&&\ddots&&&\vdots\\ 0&0&0&0&&0&2&0\\ 0&0&0&0&&0&0&2\end{array}\right], (28)
φn=φ(θ,ηn)=[φ1nφ2nφ3nφM1nφMn],ηn=[η1nη2nη3nηM1nηMn].\varphi^{n}=\varphi(\theta,\eta^{n})=\left[\begin{array}[]{ccc}\varphi^{n}_{1}\\ \varphi^{n}_{2}\\ \varphi^{n}_{3}\\ \vdots\\ \varphi^{n}_{M-1}\\ \varphi^{n}_{M}\\ \end{array}\right],\ \ \ \eta^{n}=\left[\begin{array}[]{ccc}\eta^{n}_{1}\\ \eta^{n}_{2}\\ \eta^{n}_{3}\\ \vdots\\ \eta^{n}_{M-1}\\ \eta^{n}_{M}\\ \end{array}\right]. (29)

Therefore, the discrete form of (14) and (15) is given by (19) and (27).

Gn(θn+1,ηn+1)θn+1\displaystyle G^{n}(\theta^{n+1},\eta^{n+1})\bullet\theta^{n+1} =\displaystyle= 0,\displaystyle 0, (30)
Qn(θn+1,ηn+1)\displaystyle Q^{n}(\theta^{n+1},\eta^{n+1}) =\displaystyle= 0,\displaystyle 0, (31)

and must comply with:

θn+10.\theta^{n+1}\geq 0. (32)

Thus, joining (19), (27) (30) and (32) form a Mixed Complementarity Problem, which can be solved by the FDA-MNCP algorithm

Algoritmo 3.1 (implementation FDA-MNCP.).

Do n=0n=0 and N=1/Δt.N=1/\Delta t.

To obtain θn+1\theta^{n+1} and ηn+1\eta^{n+1} we apply the method FDAMNCPFDA-MNCP to solve the mixed complementarity problem.

Gn(θn+1,ηn+1)θn+1=0,θn+10,\displaystyle G^{n}(\theta^{n+1},\eta^{n+1})\bullet\theta^{n+1}=0,\ \ \theta^{n+1}\geq 0,
Qn(θn+1,ηn+1)=0\displaystyle Q^{n}(\theta^{n+1},\eta^{n+1})=0 (33)

with

Gn(θn+1,ηn+1)=Aθn+1+λP(θn+1,ηn+1)2kΦ(θn+1,ηn+1)LD(θn,ηn+1)0,\displaystyle G^{n}(\theta^{n+1},\eta^{n+1})=A\theta^{n+1}+\lambda P(\theta^{n+1},\eta^{n+1})-2k\Phi(\theta^{n+1},\eta^{n+1})-LD(\theta^{n},\eta^{n+1})\geq 0,
Q(θn+1,ηn+1)=Diag(2)ηn+1kφ(θn+1,ηn+1)LDQ(θn,ηn+1)=0.\displaystyle Q(\theta^{n+1},\eta^{n+1})=Diag(2)\cdot\eta^{n+1}-k\varphi(\theta^{n+1},\eta^{n+1})-LDQ(\theta^{n},\eta^{n+1})=0.

where the matrices A,BA,B and the vectors P,ΦP,\Phi and φ\varphi are given in (20), (21), (22), and (29).

If n=Nn=N then END.
           else n=n+1n=n+1 return to Step 2

The numerical results obtained from the implementation of the Algorithm in Matlab are shown in the following Section.

4. Comparison of FDA-MNCP and FDA-NCP methods

We will now present the numerical results of the simulations performed in Matlab for the FDA-MNCP method. For this simulation, we considered [x0,xM]=[0, 0.05][x_{0},x_{M}]=[0,\ 0.05] and [t0,tN]=[0,1][t_{0},t_{N}]=[0,1] as the space and time intervals respectively. We keep the numbers of subintervals in time constant and equal to: N=105N=10^{5}, that is, k=Δt=105k=\Delta t=10^{-5} while the number of subintervals in space will be equal to M=50,100,200,400M=50,100,200,400. For the FDA-MNCP method we consider an error tolerance of 10810^{-8}.

The values of the dimensionless parameters in (7) are:

x=9,1×104[m],t=1,48×108[s],ΔT=74,4[K],\displaystyle x^{\star}=9,1\times 10^{4}[m],\ \ \ \ t^{\star}=1,48\times 10^{8}[s],\ \ \ \Delta T^{\star}=74,4[K],
u=6,1×104,PeT=1406,β=7,44×1010,\displaystyle u^{\star}=6,1\times 10^{-4},\ \ \ \ \ \ \ \ P_{e_{T}}=1406,\ \ \ \ \ \ \ \ \ \beta=7,44\times 10^{10},
E=93,8θ0=3.67u=3,76.\displaystyle E=93,8\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \theta_{0}=3.67\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ u=3,76.

with the previous input data we obtain Figures (1), (2), (3), (4), which show the results obtained by algorithm 3.1 and algorithm 5 of [1] for the FDA-MNCP and FDA-NCP [11] methods, respectively.

Refer to caption
Figure 1. Comparison of the FDA-MNCP and FDA-NCP methods for M = 50 at time instants t=0.000,0.002,0.004,0.006,0.008,0.010t=0.000,0.002,0.004,0.006,0.008,0.010. The values of θ\theta are represented by green dots and a solid red line, the values of η\eta are represented by pink dots and a solid blue line.
Refer to caption
Figure 2. Comparison of the FDA-MNCP and FDA-NCP methods forM=100M=100 at times t=0.000,0.002,0.004,0.006,0.008,0.010t=0.000,0.002,0.004,0.006,0.008,0.010. The values of θ\theta are represented by green dots and a solid red line, the values of η\eta are represented by pink dots and a solid blue line.
Refer to caption
Figure 3. Comparison of the FDA-MNCP and FDA-NCP methods for M=200M=200 at times t=0.000,0.002,0.004,0.006,0.008,0.010t=0.000,0.002,0.004,0.006,0.008,0.010. The values of θ\theta are represented by green dots and a solid red line, the values of η\eta are represented by pink dots and a solid blue line.
Refer to caption
Figure 4. Comparison of the FDA-MNCP and FDA-NCP methods for M=400M=400 at times t=0.000,0.002,0.004,0.006,0.008,0.010t=0.000,0.002,0.004,0.006,0.008,0.010. The values of θ\theta are represented by green dots and a solid red line, the values of η\eta are represented by pink dots and a solid blue line.

As we can see in Figures 1, 2, 3 and 4 obtained previously, they show us that the results obtained by the FDA-MNCP methods and FDA-NCP, coincide very well, as can be seen in the times indicated in the figures presented previously. In Figure 5, the differences between the methods can be observed.

Refer to caption
Figure 5. Difference between DA-NCP and FDA-NCP methods.

we can see that the difference between the solutions of θ\theta and η\eta are very small as we increase the number of points, between the FDA-MNCP and FDA-NCP methods[11].

Below we show four tables where we compare the computational process time for M=50, 100, 20, 400M=50,\ 100,\ 20,\ 400 of the FDA-MNCP method and the FDA-NCP method studied in [1].

FDA-MNCP FDA-NCP
tt t(n)t(n) iter BL(t) [S][S] [S][\nabla S] t(n)t(n) iter BL(t) FF F\nabla F
0.001 0.401 33 1.0 43 34 0.194 20 1.0 43 40
0.002 0.411 34 0.8 44 35 0.194 20 1.0 43 40
0.003 0.406 34 1.0 43 35 0.199 20 1.0 43 40
0.004 0.386 32 0.8 41 33 0.184 20 1.0 43 40
0.005 0.385 32 0.8 41 33 0.178 21 1.0 45 42
0.006 0.406 34 0.8 43 35 0.198 21 1.0 45 42
0.007 0.395 33 0.8 42 34 0.193 21 1.0 45 42
0.008 0.403 33 0.8 43 34 0.229 21 1.0 45 42
0.009 0.390 32 0.8 42 33 0.169 21 1.0 45 42
0.010 0.405 33 0.8 44 34 0.173 21 1.0 45 42
Table 2. Comparison of the computational process time with M=50M=50 for the FDA-MNCP and FDA-NCP methods. t(n)t(n) is the time measured in seconds that the method took to find the solution at time tt.

As we can see in Table 2, the computational process time used by the FDA-MNCP method doubles the time of the FDA-NCP method for a partition of the xx-axis into fifty points; the number of iterations of the FDA-MNCP method for the indicated times is also greater than that of the FDA-NCP method. In addition, the third column of each table shows the value of tkt^{k} for each of the methods.

FDA-MNCP FDA-NCP
tt t(n)t(n) iter BL(t) [S][S] [S][\nabla S] t(n)t(n) iter BL(t) FF F\nabla F
0.001 0.912 36 0.8 47 37 0.555 21 1.0 45 42
0.002 0.885 36 0.8 46 37 0.519 21 1.0 45 42
0.003 0.870 37 0.8 47 38 0.515 21 1.0 45 42
0.004 0.892 35 0.64 46 36 0.494 21 1.0 45 42
0.005 0.831 34 0.8 44 35 0.486 21 1.0 45 42
0.006 0.793 34 0.8 43 35 0.508 21 1.0 45 42
0.007 0.790 34 0.8 43 35 0.457 21 1.0 45 42
0.008 0.894 36 0.64 49 37 0.515 21 1.0 45 42
0.009 0.869 35 0.8 46 36 0.507 21 1.0 45 42
0.010 0.839 35 0.8 46 36 0.479 21 1.0 45 42
Table 3. Comparison of the computational process time with M=100M=100 for the FDA-MNCP and FDA-NCP methods. t(n) is the time measured in seconds that the method took to find the solution at time tt.

In Table 3, we can also observe that the computational process time used by the FDA-MNCP method is slightly greater than the time of the FDA-NCP method as the number of iterations.

FDA-MNCP FDA-NCP
tt t(n)t(n) iter BL(t) [S][S] [S][\nabla S] t(n)t(n) iter BL(t) FF F\nabla F
0.001 1.771 36 0.8 47 37 3.223 21 1.0 45 42
0.002 1.852 38 0.8 48 39 3.185 21 1.0 45 42
0.003 1.969 37 0.8 46 38 3.129 21 1.0 45 42
0.004 1.995 38 0.8 47 39 3.245 21 1.0 45 42
0.005 1.771 37 0.8 46 38 3.143 21 1.0 45 42
0.006 1.785 37 1.0 45 38 3.122 21 1.0 45 42
0.007 1.787 37 0.8 47 38 3.205 21 1.0 45 42
0.008 1.778 37 0.8 47 38 3.241 21 1.0 45 42
0.009 2.001 36 0.8 46 37 3.346 22 1.0 47 44
0.010 1.685 35 0.8 45 36 3.396 22 1.0 47 44
Table 4. Comparison of the computational process time with M=200M=200 for the FDA-MNCP and FDA-NCP methods. t(n) is the time measured in seconds that the method took to find the solution at time tt.

In Table 4, we see that when we increase the number of partitions to 200200, the computational process time of the FDA-MNCP method starts to be shorter than the time of the 1FDA-NCP method, although the number of iterations is still greater.

FDA-MNCP FDA-NCP
tt t(n)t(n) iter BL(t) [S][S] [S][\nabla S] t(n)t(n) iter BL(t) FF F\nabla F
0.001 4.497 37 0.8 48 38 33.127 21 1.0 45 21
0.002 4.337 37 1.0 46 38 33.174 21 1.0 45 21
0.003 4.533 38 0.8 47 39 33.034 21 1.0 45 21
0.004 4.494 39 0.8 48 40 33.398 21 1.0 45 21
0.005 4.429 37 1.0 45 38 34.722 22 1.0 47 22
0.006 4.329 37 1.0 45 38 34.652 22 1.0 47 22
0.007 4.523 39 0.8 49 40 34.777 22 1.0 47 22
0.008 4.530 39 0.8 49 40 34.802 22 1.0 47 22
0.009 4.459 37 0.8 47 38 34.824 22 1.0 47 22
0.010 4.315 37 1.0 48 38 34.571 22 1.0 47 22
Table 5. Comparison of the computational process time with M=400M=400 for the FDA-MNCP and FDA-NCP methods. t(n)t(n) is the time measured in seconds that the method took to find the solution at time tt.

With the last Table 5, we can observe that by considerably increasing the number of partitions, the computational process time of the FDA-MNCP method is much lower than that of the FDA-NCP[11] method, because for the calculation of S\nabla S in the FDA-MNCP method, it makes half the calculations than for F\nabla F in the FDA-NCP[11] method, although the number of iterations is greater. We can also observe that the number of iterations varies little in each of the tables presented previously.

5. Error analysis

In this section we will perform a numerical study of the relative error for the FDA-MNCP method, for each instant of time and EΔxE_{\Delta x}, where Δx=h,h/2,h/4\Delta x\ =\ h,\ \ h/2,\ \ h/4. The length of the subinterval in time will be constant and equal to Δt=k= 105\Delta t\ =\ k\ =\ 10^{-5}  e  h=150h\ =\ \frac{1}{50}, and compared with the FDA-NCP method, [1]. Tables 6 and 8 show the results for the Relative Errors of the FDA-MNCP method, while Tables 7 and 9 show the Relative Error for the FDA-NCP method and are represented in Figures 6 and 7.

Refer to caption
Figure 6. Time (t)vsEΔx(t)\mbox{vs}E_{\Delta x}. Relative Method Error. Here Δx=150,1100,1200\Delta x=\frac{1}{50},\ \frac{1}{100},\ \frac{1}{200}.
Refer to caption
Figure 7. Time (t)vsEΔx(t)\mbox{vs}E_{\Delta x}. Relative Method Error FDA-NCP. Here Δx=150,1100,1200\Delta x=\frac{1}{50},\ \frac{1}{100},\ \frac{1}{200}.

As can be seen in Figures 6 and 7, the relative errors corresponding to the FDA-MNCP and FDA-NCP methods, respectively, are very similar, as can be seen in the following tables, which show the relative errors for θ\theta and η\eta usando h=1/50h=1/50.

tt EhE_{h} Eh2E_{\frac{h}{2}} Eh4E_{\frac{h}{4}} EhEh2\frac{E_{h}}{E_{\frac{h}{2}}} Eh2Eh4\frac{E_{\frac{h}{2}}}{E_{\frac{h}{4}}}
0.00100000 0.07757130 0.02809022 0.00730451 2.76 3.85
0.00200000 0.12495960 0.04805076 0.01233415 2.60 3.90
0.00300000 0.12512590 0.05824369 0.01679689 2.15 3.47
0.00400000 0.15843617 0.07200921 0.02080162 2.20 3.46
0.00500000 0.19817638 0.08645161 0.02467447 2.29 3.50
0.00600000 0.19866653 0.09841438 0.02840411 2.02 3.46
0.00700000 0.22936049 0.10892940 0.03195340 2.11 3.41
0.00800000 0.24606770 0.11916519 0.03538988 2.06 3.37
0.00900000 0.25789027 0.12872004 0.03877097 2.00 3.32
0.01000000 0.28886846 0.13735367 0.04209700 2.10 3.26
Table 6. Relative error for θ\theta com FDA-MNCP e h=150h=\frac{1}{50} for the time instants tt indicated in the first column.
tt EhE_{h} Eh2E_{\frac{h}{2}} Eh4E_{\frac{h}{4}} EhEh2\frac{E_{h}}{E_{\frac{h}{2}}} Eh2Eh4\frac{E_{\frac{h}{2}}}{E_{\frac{h}{4}}}
0.001 0.07753953 0.02808885 0.00730328 2.76 3.85
0.002 0.12490382 0.04804832 0.01233527 2.60 3.89
0.003 0.12507648 0.05824052 0.01679940 2.15 3.47
0.004 0.15841526 0.07200834 0.02080540 2.20 3.46
0.005 0.19818512 0.08645353 0.02467944 2.29 3.50
0.006 0.19869586 0.09841770 0.02841001 2.02 3.46
0.007 0.22940100 0.10893437 0.03196011 2.10 3.41
0.008 0.24613384 0.11917200 0.03539747 2.07 3.37
0.009 0.25797041 0.12872819 0.03877948 2.00 3.32
0.010 0.28897837 0.13736335 0.04210642 2.10 3.26
Table 7. Relative error for θ\theta com FDA-NCP e h=150h=\frac{1}{50} for the time instants tt indicated in the first column.

In Tables 6 and 7 we see that the relative errors Eh,Eh2,Eh4E_{h},\ E_{\frac{h}{2}},\ E_{\frac{h}{4}}\ for θ\ \theta\ of both the FDA-MNCP method and the FDA-NCP method are very similar since they are the same in the first three decimal places.

tt EhE_{h} Eh2E_{\frac{h}{2}} Eh4E_{\frac{h}{4}} EhEh2\frac{E_{h}}{E_{\frac{h}{2}}} Eh2Eh4\frac{E_{\frac{h}{2}}}{E_{\frac{h}{4}}}
0.00100000 0.03656879 0.02183277 0.00451877 1.67 4.83
0.00200000 0.08417410 0.02792488 0.00819559 3.01 3.41
0.00300000 0.06717364 0.03432880 0.01103677 1.96 3.11
0.00400000 0.05513563 0.05046208 0.01381861 1.09 3.65
0.00500000 0.10897196 0.06002542 0.01653614 1.82 3.63
0.00600000 0.09771893 0.06361601 0.01887177 1.54 3.37
0.00700000 0.09347666 0.06753455 0.02105732 1.38 3.21
0.00800000 0.11948456 0.07350345 0.02332175 1.63 3.15
0.00900000 0.10838295 0.07908666 0.02560247 1.37 3.09
0.01000000 0.12663557 0.08343716 0.02775604 1.52 3.01
Table 8. Relative error for η\eta with FDA-MNCP and h=150h=\frac{1}{50} for the instants of time tt indicated in the first column.
tt EhE_{h} Eh2E_{\frac{h}{2}} Eh4E_{\frac{h}{4}} EhEh2\frac{E_{h}}{E_{\frac{h}{2}}} Eh2Eh4\frac{E_{\frac{h}{2}}}{E_{\frac{h}{4}}}
0.001 0.03656752 0.02183277 0.00451876 1.67 4.83
0.002 0.08415103 0.02792385 0.00819578 3.01 3.41
0.003 0.06714517 0.03432836 0.01103751 1.96 3.11
0.004 0.05513010 0.05046448 0.01382034 1.09 3.65
0.005 0.10898570 0.06002658 0.01653867 1.82 3.63
0.006 0.09776211 0.06361489 0.01887480 1.54 3.37
0.007 0.09351854 0.06753575 0.02106120 1.38 3.21
0.008 0.11952653 0.07350797 0.02332674 1.63 3.15
0.009 0.10846255 0.07909222 0.02560830 1.37 3.09
0.010 0.12671978 0.08344353 0.02776237 1.52 3.01
Table 9. Relative error for η\eta with FDA-NCP and h=150h=\frac{1}{50} for the instants of time tt indicated in the first column.

Similarly, in Tables 8 and 9 we Eh,Eh2,Eh4E_{h},\ E_{\frac{h}{2}},\ E_{\frac{h}{4}}\ for η\eta of both the FDA-MNCP method and the FDA-NCP method are very similar, since the first three decimal places are the same

6. Conclusions

  • We propose the solution of the simple in-situ combustion model using a numerical method based on an implicit finite difference scheme and a nonlinear mixed complementarity algorithm, which can be applied to parabolic problems and can be rewritten in the form of a mixed complementarity problem. This method is applied to the system(1).

  • In this work, we have seen that the feasible interior point algorithm FDA-MNCP, as a good technique to numerically solve mixed complementarity problems. Theoretical results of the algorithm ensure the global convergence.

  • We solve the in-situ combustion model(1) using the nonlinear mixed complementarity algorithm and comparing it to the FDA-NCP method, with the two solutions being very close, as can be seen in Figures 1, 2, 3 and 4. This suggests that it is possible to apply this method to parabolic and hyperbolic problems, which can be written as a mixed complementarity problem. The FDA-MNCP method shows the advantage of being able to be used with more points in the discretization of the space, as can be seen in Tables 4 and 5, in addition to being faster in computational time than the FDA-NCP method when we increase the discretization in the space.

  • Regarding the relative errors, Tables 6 and 8 show good evidence of convergence of the mixed complementarity algorithm, which is observed in Figure 5, which indicates a decrease in linear growth when we refine the mesh.

References

  • [1] RAMIREZ GUTIERREZ, ANGEL Application of the nonlinear complementarity method for the study of in situ oxygen combustion (Master’s Thesis in Mathematics). Universidade Federal de Juis de Fora, Juiz de Fora, Brasil, 2013.
  • [2] BRUINING J., MARCHESIN D., and VAN DUIJN C.J. Steam injection into water-saturated porous rock. Computational e Applied Mathematics, 22(3):359-395, 2003.
  • [3] BURDEN, R. L.; FAIRES, J. D. Numerical Analysis. Ninth edition. Boston, USA: Brooks/Cole - CENGAGE Learning, 2010.
  • [4] CHAPIRO, G. ; MAZORCHE, S. R. ; HERSKOVITS, J. ; ROCHE, J. R. . Solution of the Non-linear Parabolic Problems using Nonlinear Complementarity Algorithm (FDA-NCP). Mecńica Computacional, v. XXIX, p. 2141-2153, 2010.
  • [5] DAKE L.P. Fundamentals of reservoir engineering. Elsevier, 1983.
  • [6] DENNIS JR J.E. and SCHNABEL R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, 1983.
  • [7] DUIJN, C. J. V. An Introduction to Conservation Laws: Theory and Applications to Multi-Phase Flow. Eindhoven University of Technology, The Netherlands, 2003.
  • [8] EL-BAKRY A.S. ,TAPIA R.A. , Y. ZHANG, and T. TSUCHIYA. On the formulation and theory of the newton interior-point method for nonlinear programming. Journal of Optimization Theory and Applications, 89(3):507-541, 1996.
  • [9] FERRIS, M. C.; PANG, J. S. Engineering and economic applications of complementarity problems. Society for Industrial and Applied Mathematics, SIAM, v. 39, n. 4, 1997.
  • [10] HERSKOVITS J., LEONTIEV A., DIAS G. and SANTOS G. Contact Shape Optimization: A Bilevel Programming Approach, Structural and Multidisciplinary Optimization 20, pp. 214-221.
  • [11] HERSKOVITS J., MAZORCHE S. A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, Structural and Multidisciplinary Otimization, Feb 2009, vol 37, pp. 435-446.
  • [12] LAWRENCE C. E. Partial Differential Equations. American Mathematical Society, 1997.
  • [13] LEONTIEV A., HUACASI W. and HERSKOVITS J. An Optimization Technique For The Solution Of The Signorini Problem Using The Boundary Element Method, Structural and Multidisciplinary Optimization., 24, pp. 72-77.
  • [14] LEVEQUE, R. J. Numerical methods for conservation laws. Lectures in mathematics: ETH Zurich, 1992.
  • [15] MAYERS, D.; MORTON, K. Numerical Solution of Partial Differential Equations. Cambridge, UK.: Cambridge University Press, 2005.
  • [16] OLEINIK, O. Discontinuous Solutions of Nonlinear Differential Equations. Amer. Math. Soc. Trans. Ser. 2, vol. 26, pp. 95-172, 1957.
  • [17] SERRE, D. Systems of Conservation Laws 1. Hyperbolicity, Entropies, Shock Waves. Cambridge University Press, 1999.
  • [18] SMOLLER, J. Shock Waves and Reaction-Diffusion Equations. 2da. ed. Springer Verlag, p.327, 1994.
  • [19] STRIKWERDA, J. C. Finite Difference Schemes and Partial Differential Equations. Philadelphia, EE. UU.: Society for Industrial and Applied Mathematics, SIAM., 2004.
  • [20] TANNEHILL, J. C.; ANDERSON, D. A.; PLETCHER, R. H. Computational Fluid Mechanics and Heat Transfer. W. J. Minkowycz and E. M. Sparrow, Editors, 1997.
  • [21] THOMAS, J. Numerical Partial Differencial Equations. Conservation Laws and Elliptic Equations. Springer-Verlag New York, Inc., 1999.