Skip to main content

differential equations - How to solve a certain coupled first order PDE system


I would like to find the solution $(U,V)\equiv (U(x,t),V(x,t))$ of the following system.


\begin{equation} \displaystyle\left\{\begin{array}{l} \frac{\partial U}{\partial t}+(a+b x)\frac{\partial U}{\partial x}-(c+k_1)U+k_1V=0, \\ \frac{\partial V}{\partial t}+(a+b x)\frac{\partial V}{\partial x}-(c+k_2)V+k_2 U=0, \\ \end{array}\right. t\in [s,T] \end{equation}


with the boundary conditions (where $W$ could be $U$ and $V$)


\begin{equation} \left\{\begin{array}{l} W(x,t)=0 \ \ \text{as} \ \ x\to-\infty,\\ W(x,t)\to e^x \ \ \text{as} \ \ x\to\infty,\\ W(x,T)=\max \{ e^x-100,0\} \\ \end{array}\right. \end{equation}


Assuming that above system has a unique solution, $(U,V)$, how can I find that solution. I would be satisfied to given a reference to a paper from which I can learn a method to solve it.



Can Mathematica solve this system?


Added after I got the answer from the above system: when I modified the codes of bbgodfrey to solve the followin system :


\begin{equation} \displaystyle\left\{\begin{array}{l} \frac{\partial U}{\partial t}+(\textbf{a}_1+b x)\frac{\partial U}{\partial x}-(c+k_1)U+k_1V=0, \\ \frac{\partial V}{\partial t}+(\textbf{a}_2+b x)\frac{\partial V}{\partial x}-(c+k_2)V+k_2 U=0, \\ \end{array}\right. t\in [s,T] \end{equation}


when I run the program, Mathematican seems runs out of memory. Is there any way to fix this issues or this is because Mathematica cannot solve the new system ?



Answer



The constant c can be eliminated from the equations by a standard transformation.


eq1 = (Unevaluated[D[u[x, t], t] + (a + b x) D[u[x, t], x] - (c + k1) u[x, t] + k1 v[x, t]]
/. {u[x, t] -> uu[x, t] E^(c t), v[x, t] -> vv[x, t] E^(c t)})/E^(c t) // Simplify
(* -(k1*uu[x, t]) + k1*vv[x, t] + Derivative[0, 1][uu][x, t] +
a*Derivative[1, 0][uu][x, t] + b*x*Derivative[1, 0][uu][x, t] *)


and similarly for the second expression, designated eq2. Taking the difference between these two expressions yields


Collect[(eq1 - eq2) // Simplify, {a + b x, k1 + k2}, Simplify]
(* (k1 + k2)*(-uu[x, t] + vv[x, t]) + Derivative[0, 1][uu][x, t] - Derivative[0, 1][vv][x, t]
+ (a + b*x)*(Derivative[1, 0][uu][x, t] - Derivative[1, 0][vv][x, t]) *)

which can be rewritten as


-((k1 + k2)*zz[x, t]) + Derivative[0, 1][zz][x, t] + (a + b*x)*Derivative[1, 0][zz][x, t]

where zz == uu - vv. And, this equation can be solved



First@DSolve[% == 0, zz[x, t], {x, t}]
(* {zz[x, t] -> (a + b*x)^(k1/b + k2/b) C[1][(b t - Log[a + b x])/b]} *)

Undoing the original transformation then yields


First@Solve[% /. Rule -> Equal /. zz[x, t] -> z[x, t] E^(-c t), z[x, t]]
{* {z[x, t] -> E^(c t) (a + b*x)^(k1/b + k2/b) C[1][(b t - Log[a + b x])/b]} *)

Note that C[1] is an arbitrary function of (b t - Log[a + b x])/b, which can be chosen to satisfy the boundary conditions in x.


Alternative, Simpler Approach


DSolve cannot integrate the two equations as written in the question. However, the equations can be separated, after which DSolve can integrate them without difficulty.



r0 = First@Solve[{z[x, t] == u[x, t] - v[x, t], 
y[x, t] == u[x, t] + v[x, t] k1/k2}, {u[x, t], v[x, t]}];
eq1 = (Unevaluated[D[u[x, t], t] + (a + b x) D[u[x, t], x] - (c + k1) u[x, t] +
k1 v[x, t]] /. %) // Simplify;
eq2 = (Unevaluated[D[v[x, t], t] + (a + b x) D[v[x, t], x] - (c + k2) v[x, t] +
k2 u[x, t]] /. %%) // Simplify;

Simplify[eq1 - eq2];
r1 = Simplify[#] & /@ DSolve[% == 0, z[x, t], {x, t}][[1, 1]]
(* z[x, t] -> (a + b x)^((c + k1 + k2)/b) C[1][t - Log[a + b x]/b] *)


Simplify[eq1 + eq2 k1/k2];
r2 = Simplify[#] & /@ DSolve[% == 0, y[x, t], {x, t}][[1, 1]] /. C[1] -> C[2]
(* y[x, t] -> (a + b x)^(c/b) C[2][t - Log[a + b x]/b] *)

r0 /. {r1, r2}
(* {u[x, t] -> -((-k1 (a + b x)^((c + k1 + k2)/b)
C[1][t - Log[a + b x]/b] - k2 (a + b x)^(c/b) C[2][t - Log[a + b x]/b])/(k1 + k2)),
v[x, t] -> -((k2 (a + b x)^((c + k1 + k2)/b)
C[1][t - Log[a + b x]/b] - k2 (a + b x)^(c/b) C[2][t - Log[a + b x]/b])/(k1 + k2))} *)


Note that the solution contains two arbitrary functions C[1] and C[2] of (b t - Log[a + b x])/b, as it must, because the original equations form a second order system of advective equations.


Note also that the earlier, incomplete solution would eventually have reached the same point.


Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

dynamic - How can I make a clickable ArrayPlot that returns input?

I would like to create a dynamic ArrayPlot so that the rectangles, when clicked, provide the input. Can I use ArrayPlot for this? Or is there something else I should have to use? Answer ArrayPlot is much more than just a simple array like Grid : it represents a ranged 2D dataset, and its visualization can be finetuned by options like DataReversed and DataRange . These features make it quite complicated to reproduce the same layout and order with Grid . Here I offer AnnotatedArrayPlot which comes in handy when your dataset is more than just a flat 2D array. The dynamic interface allows highlighting individual cells and possibly interacting with them. AnnotatedArrayPlot works the same way as ArrayPlot and accepts the same options plus Enabled , HighlightCoordinates , HighlightStyle and HighlightElementFunction . data = {{Missing["HasSomeMoreData"], GrayLevel[ 1], {RGBColor[0, 1, 1], RGBColor[0, 0, 1], GrayLevel[1]}, RGBColor[0, 1, 0]}, {GrayLevel[0], GrayLevel...

Is there a way to do conditional matrix loop using 'continue'

I have the following: n = 3; m = 5; ww = RandomReal[{0, 0.1}, {n, n}]; uu = RandomReal[{0, 1}, {m, n}]; pp = RandomReal[{0, 1}, {n, n}]; ss = RandomInteger[{0, 5}, {m, n}]; Grid[{{"ww", "uu", "pp", "ss"}, {ww // TableForm, uu // TableForm, pp // TableForm, ss // TableForm}}, Spacings -> {5, 2}, Dividers -> All] where I would like to look at every element of matrix ss and produce a matrix tt , with zeroes at the locations in ss which have zeroes, and in all other positions do the following: tt = (-1/Subscript[ww, m]) Log[(1 - uu)/(Subscript[pp, m - 1])], where Subscript[ww, m] is the value at index of ww matrix and where Subscript[pp, m - 1] is the value at index-1 of pp matrix. So for example if the first value ever read from matrix ss happens to be 2, then value taken from matrix ww would be from the row 2, but from pp would be from row 1. Also how to tell difference between a 0 as a valid value from within the matrix elemen...