Abstract
The subject of partial differential equations (PDEs) is enormous. At the same time, it is very important, since so many phenomena in nature and technology find their mathematical formulation through such equations. Knowing how to solve at least some PDEs is therefore of great importance to engineers. In an introductory book like this, nowhere near full justice to the subject can be made. However, we still find it valuable to give the reader a glimpse of the topic by presenting a few basic and general methods that we will apply to a very common type of PDE.
We shall focus on one of the most widely encountered partial differential equations: the diffusion equation, which in one dimension looks like
The multidimensional counterpart is often written as
We shall restrict the attention here to the onedimensional case.
The unknown in the diffusion equation is a function \(u(x,t)\) of space and time. The physical significance of u depends on what type of process that is described by the diffusion equation. For example, u is the concentration of a substance if the diffusion equation models transport of this substance by diffusion. Diffusion processes are of particular relevance at the microscopic level in biology, e.g., diffusive transport of certain ion types in a cell caused by molecular collisions. There is also diffusion of atoms in a solid, for instance, and diffusion of ink in a glass of water.
Keywords
 Partial Differential Equation
 Diffusion Equation
 Mesh Point
 Implicit Method
 Python Code
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download chapter PDF
The subject of partial differential equations (PDEs) is enormous. At the same time, it is very important, since so many phenomena in nature and technology find their mathematical formulation through such equations. Knowing how to solve at least some PDEs is therefore of great importance to engineers. In an introductory book like this, nowhere near full justice to the subject can be made. However, we still find it valuable to give the reader a glimpse of the topic by presenting a few basic and general methods that we will apply to a very common type of PDE.
We shall focus on one of the most widely encountered partial differential equations: the diffusion equation, which in one dimension looks like
The multidimensional counterpart is often written as
We shall restrict the attention here to the onedimensional case.
The unknown in the diffusion equation is a function \(u(x,t)\) of space and time. The physical significance of u depends on what type of process that is described by the diffusion equation. For example, u is the concentration of a substance if the diffusion equation models transport of this substance by diffusion. Diffusion processes are of particular relevance at the microscopic level in biology, e.g., diffusive transport of certain ion types in a cell caused by molecular collisions. There is also diffusion of atoms in a solid, for instance, and diffusion of ink in a glass of water.
One very popular application of the diffusion equation is for heat transport in solid bodies. Then u is the temperature, and the equation predicts how the temperature evolves in space and time within the solid body. For such applications, the equation is known as the heat equation. We remark that the temperature in a fluid is influenced not only by diffusion, but also by the flow of the liquid. If present, the latter effect requires an extra term in the equation (known as an advection or convection term).
The term g is known as the source term and represents generation, or loss, of heat (by some mechanism) within the body. For diffusive transport, g models injection or extraction of the substance.
We should also mention that the diffusion equation may appear after simplifying more complicated partial differential equations. For example, flow of a viscous fluid between two flat and parallel plates is described by a onedimensional diffusion equation, where u then is the fluid velocity.
A partial differential equation is solved in some domain Ω in space and for a time interval \([0,T]\). The solution of the equation is not unique unless we also prescribe initial and boundary conditions. The type and number of such conditions depend on the type of equation. For the diffusion equation, we need one initial condition, \(u(x,0)\), stating what u is when the process starts. In addition, the diffusion equation needs one boundary condition at each point of the boundary \(\partial\Omega\) of Ω. This condition can either be that u is known or that we know the normal derivative, \(\nabla u\cdot\boldsymbol{n}=\partial u/\partial n\) (n denotes an outward unit normal to \(\partial\Omega\)).
Let us look at a specific application and how the diffusion equation with initial and boundary conditions then appears. We consider the evolution of temperature in a onedimensional medium, more precisely a long rod, where the surface of the rod is covered by an insulating material. The heat can then not escape from the surface, which means that the temperature distribution will only depend on a coordinate along the rod, x, and time t. At one end of the rod, \(x=L\), we also assume that the surface is insulated, but at the other end, x = 0, we assume that we have some device for controlling the temperature of the medium. Here, a function \(s(t)\) tells what the temperature is in time. We therefore have a boundary condition \(u(0,t)=s(t)\). At the other insulated end, \(x=L\), heat cannot escape, which is expressed by the boundary condition \(\partial u(L,t)/\partial x=0\). The surface along the rod is also insulated and hence subject to the same boundary condition (here generalized to \(\partial u/\partial n=0\) at the curved surface). However, since we have reduced the problem to one dimension, we do not need this physical boundary condition in our mathematical model. In one dimension, we can set \(\Omega=[0,L]\).
To summarize, the partial differential equation with initial and boundary conditions reads
Mathematically, we assume that at t = 0, the initial condition (5.4) holds and that the partial differential equation (5.1) comes into play for t > 0. Similarly, at the end points, the boundary conditions (5.2) and (5.3) govern u and the equation therefore is valid for \(x\in(0,L)\).
The initial and boundary conditions are extremely important. Without them, the solution is not unique, and no numerical method will work. Unfortunately, many physical applications have one or more initial or boundary conditions as unknowns. Such situations can be dealt with if we have measurements of u, but the mathematical framework is much more complicated.
What about the source term g in our example with temperature distribution in a rod? \(g(x,t)\) models heat generation inside the rod. One could think of chemical reactions at a microscopic level in some materials as a reason to include g. However, in most applications with temperature evolution, g is zero and heat generation usually takes place at the boundary (as in our example with \(u(0,t)=s(t)\)).
Before continuing, we may consider an example of how the temperature distribution evolves in the rod. At time t = 0, we assume that the temperature is \(10\,^{\circ}\)C. Then we suddenly apply a device at x = 0 that keeps the temperature at \(50\,^{\circ}\)C at this end. What happens inside the rod? Intuitively, you think that the heat generation at the end will warm up the material in the vicinity of x = 0, and as time goes by, more and more of the rod will be heated, before the entire rod has a temperature of \(50\,^{\circ}\)C (recall that no heat escapes from the surface of the rod).
Mathematically, (with the temperature in Kelvin) this example has \(I(x)=283\) K, except at the end point: \(I(0)=323\) K, \(s(t)=323\) K, and g = 0. The figure below shows snapshots from four different times in the evolution of the temperature.
5.1 Finite Difference Methods
We shall now construct a numerical method for the diffusion equation. We know how to solve ordinary differential equations, so in a way we are able to deal with the time derivative. Very often in mathematics, a new problem can be solved by reducing it to a series of problems we know how to solve. In the present case, it means that we must do something with the spatial derivative \(\partial^{2}/\partial x^{2}\) in order to reduce the partial differential equation to ordinary differential equations. One important technique for achieving this, is based on finite difference discretization of spatial derivatives.
5.1.1 Reduction of a PDE to a System of ODEs
Introduce a spatial mesh in Ω with mesh points
The space between two mesh points x _{ i } and \(x_{i+1}\), i.e. the interval \([x_{i},x_{i+1}]\), is call a cell. We shall here, for simplicity, assume that each cell has the same length \(\Delta x=x_{i+1}x_{i}\), \(i=0,\ldots,N1\).
The partial differential equation is valid at all spatial points \(x\in\Omega\), but we may relax this condition and demand that it is fulfilled at the internal mesh points only, \(x_{1},\ldots,x_{N1}\):
Now, at any point x _{ i } we can approximate the secondorder derivative by a finite difference:
It is common to introduce a short notation \(u_{i}(t)\) for \(u(x_{i},t)\), i.e., u approximated at some mesh point x _{ i } in space. With this new notation we can, after inserting (5.6) in (5.5), write an approximation to the partial differential equation at mesh point \((x_{i},t\)) as
Note that we have adopted the notation \(g_{i}(t)\) for \(g(x_{i},t)\) too.
What is (5.7)? This is nothing but a system of ordinary differential equations in \(N1\) unknowns \(u_{1}(t),\ldots,u_{N1}(t)\)! In other words, with aid of the finite difference approximation (5.6), we have reduced the single partial differential equation to a system of ODEs, which we know how to solve. In the literature, this strategy is called the method of lines.
We need to look into the initial and boundary conditions as well. The initial condition \(u(x,0)=I(x)\) translates to an initial condition for every unknown function \(u_{i}(t)\): \(u_{i}(0)=I(x_{i})\), \(i=0,\ldots,N\). At the boundary x = 0 we need an ODE in our ODE system, which must come from the boundary condition at this point. The boundary condition reads \(u(0,t)=s(t)\). We can derive an ODE from this equation by differentiating both sides: \(u_{0}^{\prime}(t)=s^{\prime}(t)\). The ODE system above cannot be used for \(u_{0}^{\prime}\) since that equation involves some quantity \(u_{1}^{\prime}\) outside the domain. Instead, we use the equation \(u_{0}^{\prime}(t)=s^{\prime}(t)\) derived from the boundary condition. For this particular equation we also need to make sure the initial condition is \(u_{0}(0)=s(0)\) (otherwise nothing will happen: we get u = 283 K forever).
We remark that a separate ODE for the (known) boundary condition \(u_{0}=s(t)\) is not strictly needed. We can just work with the ODE system for \(u_{1},\ldots,u_{N}\), and in the ODE for u _{0}, replace \(u_{0}(t)\) by \(s(t)\). However, these authors prefer to have an ODE for every point value u _{ i }, \(i=0,\ldots,N\), which requires formulating the known boundary at x = 0 as an ODE. The reason for including the boundary values in the ODE system is that the solution of the system is then the complete solution at all mesh points, which is convenient, since special treatment of the boundary values is then avoided.
The condition \(\partial u/\partial x=0\) at \(x=L\) is a bit more complicated, but we can approximate the spatial derivative by a centered finite difference:
This approximation involves a fictitious point \(x_{N+1}\) outside the domain. A common trick is to use (5.7) for \(i=N\) and eliminate \(u_{N+1}\) by use of the discrete boundary condition (\(u_{N+1}=u_{N1}\)):
That is, we have a special version of (5.7) at the boundary \(i=N\).
What about simpler finite differences at the boundary?
Some reader may think that a smarter trick is to approximate the boundary condition \(\partial u/\partial x\) at \(x=L\) by a onesided difference:
This gives a simple equation \(u_{N}=u_{N1}\) for the boundary value, and a corresponding ODE \(u_{N}^{\prime}=u_{N1}^{\prime}\). However, this approximation has an error of order \(\Delta x\), while the centered approximation we used above has an error of order \(\Delta x^{2}\). The finite difference approximation we used for the secondorder derivative in the diffusion equation also has an error of order \(\Delta x^{2}\). Thus, if we use the simpler onesided difference above, it turns out that we reduce the overall accuracy of the method.
We are now in a position to summarize how we can approximate the partial differential equation problem (5.1)–(5.4) by a system of ordinary differential equations:
The initial conditions are
We can apply any method for systems of ODEs to solve (5.9)–(5.11).
5.1.2 Construction of a Test Problem with Known Discrete Solution
At this point, it is tempting to implement a real physical case and run it. However, partial differential equations constitute a nontrivial topic where mathematical and programming mistakes come easy. A better start is therefore to address a carefully designed test example where we can check that the method works. The most attractive examples for testing implementations are those without approximation errors, because we know exactly what numbers the program should produce. It turns out that solutions \(u(x,t)\) that are linear in time and in space can be exactly reproduced by most numerical methods for partial differential equations. A candidate solution might be
Inserting this u in the governing equation gives
What about the boundary conditions? We realize that \(\partial u/\partial x=3t+2\) for \(x=L\), which breaks the assumption of \(\partial u/\partial x=0\) at \(x=L\) in the formulation of the numerical method above. Moreover, \(u(0,t)=L(3t+2)\), so we must set \(s(t)=L(3t+2)\) and \(s^{\prime}(t)=3L\). Finally, the initial condition dictates \(I(x)=2(xL)\), but recall that we must have \(u_{0}=s(0)\), and \(u_{i}=I(x_{i})\), \(i=1,\ldots,N\): it is important that u _{0} starts out at the right value dictated by \(s(t)\) in case \(I(0)\) is not equal this value.
First we need to generalize our method to handle \(\partial u/\partial x=\gamma\neq 0\) at \(x=L\). We then have
which inserted in (5.7) gives
5.1.3 Implementation: Forward Euler Method
In particular, we may use the Forward Euler method as implemented in the general function ode_FE from Sect. 4.2.6. The ode_FE function needs a specification of the righthand side of the ODE system. This is a matter of translating (5.9), (5.10), and (5.14) to Matlab code (in file test_diffusion_pde_exact_linear.m ):
Note that dudx is the function representing the γ parameter in (5.14). Also note that the rhs function relies on access to global variables beta, dx, L, and x, and global functions dsdt, g, and dudx.
We expect the solution to be correct regardless of N and \(\Delta t\), so we can choose a small N, N = 4, and \(\Delta t=0.1\). A test function with N = 4 goes like
With N = 4 we reproduce the linear solution exactly. This brings confidence to the implementation, which is just what we need for attacking a real physical problem next.
5.1.4 Application: Heat Conduction in a Rod
Let us return to the case with heat conduction in a rod (5.1)–(5.4). Assume that the rod is 50 cm long and made of aluminum alloy 6082. The β parameter equals \(\kappa/(\varrho c)\), where κ is the heat conduction coefficient, \(\varrho\) is the density, and c is the heat capacity. We can find proper values for these physical quantities in the case of aluminum alloy 6082: \(\varrho=2.7\cdot 10^{3}\hbox{ kg/m}^{3}\), \(\kappa=200\,\,\frac{\hbox{W}}{\hbox{mK}}\), \(c=900\,\,\frac{\hbox{J}}{\hbox{Kkg}}\). This results in \(\beta=\kappa/(\varrho c)=8.2\cdot 10^{5}\hbox{ m}^{2}/\hbox{s}\). Preliminary simulations show that we are close to a constant steady state temperature after 1 h, i.e., T = 3600 s.
The functions s, dsdt, f, and dudx must be changed, but the rhs function becomes almost identical to the one from the previous section:
Some new parameter values must also be set, and for the timestep, let us use \(\Delta t=0.00034375\). We may also make an animation on the screen to see how \(u(x,t)\) develops in time (see file rod_FE.m ):
The plotting statements update the \(u(x,t)\) curve on the screen. In addition, we save a fraction of the plots to files tmp_0000.png, tmp_0001.png, tmp_0002.png, and so on. These plots can be combined to ordinary video files. A common tool is ffmpeg or its sister avconv.
These programs take the same type of commandline options. To make a Flash video movie.flv, run
The i option specifies the naming of the plot files in printf syntax, and r specifies the number of frames per second in the movie. On Mac, run ffmpeg instead of avconv with the same options. Other video formats, such as MP4, WebM, and Ogg can also be produced:
The results of a simulation start out as in Figs. 5.1 and 5.2. We see that the solution definitely looks wrong. The temperature is expected to be smooth, not having such a sawtooth shape. Also, after some time (Fig. 5.2), the temperature starts to increase much more than expected. We say that this solution is unstable, meaning that it does not display the same characteristics as the true, physical solution. Even though we tested the code carefully in the previous section, it does not seem to work for a physical application! How can that be?
The problem is that \(\Delta t\) is too large, making the solution unstable. It turns out that the Forward Euler time integration method puts a restriction on the size of \(\Delta t\). For the heat equation and the way we have discretized it, this restriction can be shown to be [10]
This is called a stability criterion. With the chosen parameters, (5.15) tells us that the upper limit is \(\Delta t=0.0003125\), which is smaller than our choice above. Rerunning the case with a \(\Delta t\) equal to \(\Delta x^{2}/(2\beta)\), indeed shows a smooth evolution of \(u(x,t)\). Find the program rod_FE.m and run it to see an animation of the \(u(x,t)\) function on the screen.
Scaling and dimensionless quantities
Our setting of parameters required finding three physical properties of a certain material. The time interval for simulation and the time step depend crucially on the values for β and L, which can vary significantly from case to case. Often, we are more interested in how the shape of \(u(x,t)\) develops, than in the actual u, x, and t values for a specific material. We can then simplify the setting of physical parameters by scaling the problem.
Scaling means that we introduce dimensionless independent and dependent variables, here denoted by a bar:
where u _{ c } is a characteristic size of the temperature, \(u^{*}\) is some reference temperature, while x _{ c } and t _{ c } are characteristic time and space scales. Here, it is natural to choose \(u^{*}\) as the initial condition, and set u _{ c } to the stationary (end) temperature. Then \(\bar{u}\in[0,1]\), starting at 0 and ending at 1 as \(t\rightarrow\infty\). The length L is x _{ c }, while choosing t _{ c } is more challenging, but one can argue for \(t_{c}=L^{2}/\beta\). The resulting equation for \(\bar{u}\) reads
Note that in this equation, there are no physical parameters! In other words, we have found a model that is independent of the length of the rod and the material it is made of (!).
We can easily solve this equation with our program by setting \(\beta=1\), L = 1, \(I(x)=0\), and \(s(t)=1\). It turns out that the total simulation time (to ‘‘infinity’’) can be taken as 1.2. When we have the solution \(\bar{u}(\bar{x},\bar{t})\), the solution with dimension Kelvin, reflecting the true temperature in our medium, is given by
Through this formula we can quickly generate the solutions for a rod made of aluminum, wood, or rubber – it is just a matter of plugging in the right β value.
Figure 5.3 shows four snapshots of the scaled (dimensionless) solution \(\bar{(}\bar{x},\bar{t})\).
The power of scaling is to reduce the number of physical parameters in a problem, and in the present case, we found one single problem that is independent of the material (β) and the geometry (L).
5.1.5 Vectorization
Occasionally in this book, we show how to speed up code by replacing loops over arrays by vectorized expressions. The present problem involves a loop for computing the righthand side:
This loop can be replaced by a vectorized expression with the following reasoning. We want to set all the inner points at once: rhs(2:N) (this goes from index 2 up to, and including, N). As the loop index i runs from 2 to N, the u(i+1) term will cover all the inner u values displaced one index to the right (compared to 2:N), i.e., u(3:N+1). Similarly, u(i1) corresponds to all inner u values displaced one index to the left: u(1:N1). Finally, u(i) has the same indices as rhs: u(2:N). The vectorized loop can therefore be written in terms of slices:
This rewrite speeds up the code by about a factor of 10. A complete code is found in the file rod_FE_vec.m .
5.1.6 Using Odespy to Solve the System of ODEs
A nice feature with having a problem defined as a system of ODEs is that we have a rich set of numerical methods available. Matlab/Octave contains generalpurpose ODE software such as the ode45 routine that we may apply. However, we shall here step out of the Matlab/Octave world and make use of the Odespy package (see Sect. 4.3.6). Odespy requires the problem to be formulated in Python code. Since Python and Matlab have very similar syntax for the type of programming encountered when using Odespy, it should not be a big step for Matlab/Octave users to utilize Odespy.
Suppose we have defined the righthand side of our ODE system in a function rhs, the following Python program makes use of Odespy and its adaptive RungeKutta method of order 4–5 (RKFehlberg) to solve the system.
The very nice thing is that we can now easily experiment with many different integration methods. Trying out some simple ones first, like RK2 and RK4, quickly reveals that the time step limitation of the Forward Euler scheme also applies to these more sophisticated RungeKutta methods, but their accuracy is better. However, the Odespy package offers also adaptive methods. We can then specify a much larger time step in time_points, and the solver will figure out the appropriate step. Above we indicated how to use the adaptive RungeKuttaFehlberg 4–5 solver. While the \(\Delta t\) corresponding to the Forward Euler method requires over 8000 steps for a simulation, we started the RKFehlberg method with 100 times this time step and in the end it required just slightly more than 2500 steps, using the default tolerance parameters. Lowering the tolerance did not save any significant amount of computational work. Figure 5.4 shows a comparison of the length of all the time steps for two values of the tolerance. We see that the influence of the tolerance is minor in this computational example, so it seems that the blowup due to instability is what governs the time step size. The nice feature of this adaptive method is that we can just specify when we want the solution to be computed, and the method figures out on its own what time step that has to be used because of stability restrictions.
We have seen how easy it is to apply sophisticated methods for ODEs to this PDE example. We shall take the use of Odespy one step further in the next section.
5.1.7 Implicit Methods
A major problem with the stability criterion (5.15) is that the time step becomes very small if \(\Delta x\) is small. For example, halving \(\Delta x\) requires four times as many time steps and eight times the work. Now, with N = 40, which is a reasonable resolution for the test problem above, the computations are very fast. What takes time, is the visualization on the screen, but for that purpose one can visualize only a subset of the time steps. However, there are occasions when you need to take larger time steps with the diffusion equation, especially if interest is in the longterm behavior as \(t\rightarrow\infty\). You must then turn to implicit methods for ODEs. These methods require the solutions of linear systems, if the underlying PDE is linear, and systems of nonlinear algebraic equations if the underlying PDE is nonlinear.
The simplest implicit method is the Backward Euler scheme, which puts no restrictions on \(\Delta t\) for stability, but obviously, a large \(\Delta t\) leads to inaccurate results. The Backward Euler scheme for a scalar ODE \(u^{\prime}=f(u,t)\) reads
This equation is to be solved for \(u^{n+1}\). If f is linear in u, it is a linear equation, but if f is nonlinear in u, one needs approximate methods for nonlinear equations (Chap. 6).
In our case, we have a system of linear ODEs (5.9)–(5.11). The Backward Euler scheme applied to each equation leads to
This is a system of linear equations in the unknowns \(u_{i}^{n+1}\), \(i=0,\ldots,N\), which is easy to realize by writing out the equations for the case N = 3, collecting all the unknown terms on the lefthand side and all the known terms on the righthand side:
A system of linear equations like this, is usually written on matrix form \(Au=b\), where A is a coefficient matrix, \(u=(u_{0}^{n+1},\ldots,n_{N}^{n+1})\) is the vector of unknowns, and b is a vector of known values. The coefficient matrix for the case (5.19)–(5.21) becomes
In the general case (5.16)–(5.18), the coefficient matrix is an \((N+1)\times(N+1)\) matrix with zero entries, except for
If we want to apply general methods for systems of ODEs on the form \(u^{\prime}=f(u,t)\), we can assume a linear \(f(u,t)=Ku\). The coefficient matrix K is found from the righthand side of (5.16)–(5.18) to be
We see that \(A=I\Delta t\,K\).
To implement the Backward Euler scheme, we can either fill a matrix and call a linear solver, or we can apply Odespy. We follow the latter strategy. Implicit methods in Odespy need the K matrix above, given as an argument jac (Jacobian of f) in the call to odespy.BackwardEuler. Here is the Python code for the righthand side of the ODE system (rhs) and the K matrix (K) as well as statements for initializing and running the Odespy solver BackwardEuler (in the file rod_BE.py ):
The file rod_BE.py has all the details and shows a movie of the solution. We can run it with any \(\Delta t\) we want, its size just impacts the accuracy of the first steps.
Odespy solvers apply dense matrices!
Looking at the entries of the K matrix, we realize that there are at maximum three entries different from zero in each row. Therefore, most of the entries are zeroes. The Odespy solvers expect dense square matrices as input, here with \((N+1)\times(N+1)\) elements. When solving the linear systems, a lot of storage and work are spent on the zero entries in the matrix. It would be much more efficient to store the matrix as a tridiagonal matrix and apply a specialized Gaussian elimination solver for tridiagonal systems. Actually, this reduces the work from the order N ^{3} to the order N.
In onedimensional diffusion problems, the savings of using a tridiagonal matrix are modest in practice, since the matrices are very small anyway. In two and threedimensional PDE problems, however, one cannot afford dense square matrices. Rather, one must resort to more efficient storage formats and algorithms tailored to such formats, but this is beyond the scope of the present text.
5.2 Exercises
Exercise 5.1 (Simulate a diffusion equation by hand)
Consider the problem given by (5.9), (5.10) and (5.14). Set N = 2 and compute \(u_{i}^{0}\), \(u_{i}^{1}\) and \(u_{i}^{2}\) by hand for i = 0,1,2. Use these values to construct a test function for checking that the implementation is correct. Copy useful functions from test_diffusion_pde_exact_linear.m and make a new test function test_diffusion_hand_calculation.
Filename: test_rod_hand_calculations.m.
Exercise 5.2 (Compute temperature variations in the ground)
The surface temperature at the ground shows daily and seasonal oscillations. When the temperature rises at the surface, heat is propagated into the ground, and the coefficient β in the diffusion equation determines how fast this propagation is. It takes some time before the temperature rises down in the ground. At the surface, the temperature has then fallen. We are interested in how the temperature varies down in the ground because of temperature oscillations on the surface.
Assuming homogeneous horizontal properties of the ground, at least locally, and no variations of the temperature at the surface at a fixed point of time, we can neglect the horizontal variations of the temperature. Then a onedimensional diffusion equation governs the heat propagation along a vertical axis called x. The surface corresponds to x = 0 and the x axis point downwards into the ground. There is no source term in the equation (actually, if rocks in the ground are radioactive, they emit heat and that can be modeled by a source term, but this effect is neglected here).
At some depth \(x=L\) we assume that the heat changes in x vanish, so \(\partial u/\partial x=0\) is an appropriate boundary condition at \(x=L\). We assume a simple sinusoidal temperature variation at the surface:
where P is the period, taken here as 24 hours (\(24\cdot 60\cdot 60\) s). The β coefficient may be set to \(10^{6}\,\text{m}^{2}/\text{s}\). Time is then measured in seconds. Set appropriate values for T _{0} and T _{ a }.

a)
Show that the present problem has an analytical solution of the form
$$u(x,t)=A+Be^{rx}\sin(\omega trx),$$for appropriate values of A, B, r, and ω.

b)
Solve this heat propagation problem numerically for some days and animate the temperature. You may use the Forward Euler method in time. Plot both the numerical and analytical solution. As initial condition for the numerical solution, use the exact solution during program development, and when the curves coincide in the animation for all times, your implementation works, and you can then switch to a constant initial condition: \(u(x,0)=T_{0}\). For this latter initial condition, how many periods of oscillations are necessary before there is a good (visual) match between the numerical and exact solution (despite differences at t = 0)?
Filename: ground_temp.m.
Exercise 5.3 (Compare implicit methods)
An equally stable, but more accurate method than the Backward Euler scheme, is the socalled 2step backward scheme, which for an ODE \(u^{\prime}=f(u,t)\) can be expressed by
The Odespy package offers this method as odespy.Backward2Step. The purpose of this exercise is to compare three methods and animate the three solutions:

1.
The Backward Euler method with \(\Delta t=0.001\)

2.
The backward 2step method with \(\Delta t=0.001\)

3.
The backward 2step method with \(\Delta t=0.01\)
Choose the model problem from Sect. 5.1.4.
Filename: rod_BE_vs_B2Step.m.
Exercise 5.4 (Explore adaptive and implicit methods)
We consider the same problem as in Exercise 5.2 . Now we want to explore the use of adaptive and implicit methods from Odespy to see if they are more efficient than the Forward Euler method. Assume that you want the accuracy provided by the Forward Euler method with its maximum \(\Delta t\) value. Since there exists an analytical solution, you can compute an error measure that summarizes the error in space and time over the whole simulation:
Here, \(U_{i}^{n}\) is the exact solution. Use the Odespy package to run the following implicit and adaptive solvers:

1.
BackwardEuler

2.
Backward2Step

3.
RKFehlberg
Experiment to see if you can use larger time steps than what is required by the Forward Euler method and get solutions with the same order of accuracy.
Hint
To avoid oscillations in the solutions when using the RKFehlberg method, the rtol and atol parameters to RKFFehlberg must be set no larger than 0.001 and 0.0001, respectively. You can print out solver_RKF.t_all to see all the time steps used by the RKFehlberg solver (if solver is the RKFehlberg object). You can then compare the number of time steps with what is required by the other methods.
Filename: ground_temp_adaptive.m.
Exercise 5.5 (Investigate the θ rule)

a)
The CrankNicolson method for ODEs is very popular when combined with diffusion equations. For a linear ODE \(u^{\prime}=au\) it reads
$$\frac{u^{n+1}u^{n}}{\Delta t}=\frac{1}{2}(au^{n}+au^{n+1})\thinspace.$$Apply the CrankNicolson method in time to the ODE system for a onedimensional diffusion equation. Identify the linear system to be solved.

b)
The Backward Euler, Forward Euler, and CrankNicolson methods can be given a unified implementation. For a linear ODE \(u^{\prime}=au\) this formulation is known as the θ rule:
$$\frac{u^{n+1}u^{n}}{\Delta t}=(1\theta)au^{n}+\theta au^{n+1}\thinspace.$$For \(\theta=0\) we recover the Forward Euler method, \(\theta=1\) gives the Backward Euler scheme, and \(\theta=1/2\) corresponds to the CrankNicolson method. The approximation error in the θ rule is proportional to \(\Delta t\), except for \(\theta=1/2\) where it is proportional to \(\Delta t^{2}\). For \(\theta\geq 1/2\) the method is stable for all \(\Delta t\).
Apply the θ rule to the ODE system for a onedimensional diffusion equation. Identify the linear system to be solved.

c)
Implement the θ rule with aid of the Odespy package. The relevant object name is ThetaRule:

d)
Consider the physical application from Sect. 5.1.4. Run this case with the θ rule and \(\theta=1/2\) for the following values of \(\Delta t\): 0.001, 0.01, 0.05. Report what you see.
Filename: rod_ThetaRule.m.
Remarks
Despite the fact that the CrankNicolson method, or the θ rule with \(\theta=1/2\), is theoretically more accurate than the Backward Euler and Forward Euler schemes, it may exhibit nonphysical oscillations as in the present example if the solution is very steep. The oscillations are damped in time, and decreases with decreasing \(\Delta t\). To avoid oscillations one must have \(\Delta t\) at maximum twice the stability limit of the Forward Euler method. This is one reason why the Backward Euler method (or a 2step backward scheme, see Exercise 5.3) are popular for diffusion equations with abrupt initial conditions.
Exercise 5.6 (Compute the diffusion of a Gaussian peak)
Solve the following diffusion problem:
The initial condition is the famous and widely used Gaussian function with standard deviation (or ‘‘width’’) σ, which is here taken to be small, \(\sigma=0.01\), such that the initial condition is a peak. This peak will then diffuse and become lower and wider. Compute \(u(x,t)\) until u becomes approximately constant over the domain.
Filename: gaussian_diffusion.m.
Remarks
Running the simulation with \(\sigma=0.2\) results in a constant solution \(u\approx 1\) as \(t\rightarrow\infty\), while one might expect from ‘‘physics of diffusion’’ that the solution should approach zero. The reason is that we apply Neumann conditions as boundary conditions. One can then easily show that the area under the u curve remains constant. Integrating the PDE gives
Using the Gauss divergence theorem on the integral on the righthand and moving the timederivative outside the integral on the lefthand side results in
(Recall that \(\partial u/\partial x=0\) at the end points.) The result means that \(\int_{1}^{1}udx\) remains constant during the simulation. Giving the PDE an interpretation in terms of heat conduction can easily explain the result: with Neumann conditions no heat can escape from the domain so the initial heat will just be evenly distributed, but not leak out, so the temperature cannot go to zero (or the scaled and translated temperature u, to be precise). The area under the initial condition is 1, so with a sufficiently fine mesh, \(u\rightarrow 1\), regardless of σ.
Exercise 5.7 (Vectorize a function for computing the area of a polygon)
Vectorize the implementation of the function for computing the area of a polygon in Exercise 2.6. Make a test function that compares the scalar implementation in Exercise 2.6 and the new vectorized implementation for the test cases used in Exercise 2.6.
Hint
Notice that the formula \(x_{1}y_{2}+x_{2}y_{3}+\cdots+x_{n1}y_{n}=\sum_{i=0}^{n1}x_{i}y_{i+1}\) is the dot product of two vectors, x(1:end1) and y(2,end), which can be computed as dot(x(1:end1), y(2,end)), or more explicitly as sum(x(1:end1).*y(1: end)).
Filename: polyarea_vec.m.
Exercise 5.8 (Explore symmetry)
One can observe (and also mathematically prove) that the solution \(u(x,t)\) of the problem in Exercise 5.6 is symmetric around x = 0: \(u(x,t)=u(x,t)\). In such a case, we can split the domain in two and compute u in only one half, \([1,0]\) or \([0,1]\). At the symmetry line x = 0 we have the symmetry boundary condition \(\partial u/\partial x=0\). Reformulate the problem in Exercise 5.6 such that we compute only for \(x\in[0,1]\). Display the solution and observe that it equals the right part of the solution in Exercise 5.6.
Filename: symmetric_gaussian_diffusion.m.
Remarks
In 2D and 3D problems, where the CPU time to compute a solution of PDE can be hours and days, it is very important to utilize symmetry as we do above to reduce the size of the problem.
Also note the remarks in Exercise 5.6 about the constant area under the \(u(x,t)\) curve: here, the area is 0.5 and \(u\rightarrow 0.5\) as \(t\rightarrow 0.5\) (if the mesh is sufficiently fine – one will get convergence to smaller values for small σ if the mesh is not fine enough to properly resolve a thinshaped initial condition).
Exercise 5.9 (Compute solutions as \(t\rightarrow\infty\))
Many diffusion problems reach a stationary timeindependent solution as \(t\rightarrow\infty\). The model problem from Sect. 5.1.4 is one example where \(u(x,t)=s(t)=\hbox{const}\) for \(t\rightarrow\infty\). When u does not depend on time, the diffusion equation reduces to
in one dimension, and
in 2D and 3D. This is the famous Poisson equation, or if f = 0, it is known as the Laplace equation. In this limit \(t\rightarrow\infty\), there is no need for an initial condition, but the boundary conditions are the same as for the diffusion equation.
We now consider a onedimensional problem
which is known as a twopoint boundary value problem. This is nothing but the stationary limit of the diffusion problem in Sect. 5.1.4. How can we solve such a stationary problem (5.38)? The simplest strategy, when we already have a solver for the corresponding timedependent problem, is to use that solver and simulate until \(t\rightarrow\infty\), which in practice means that \(u(x,t)\) no longer changes in time (within some tolerance).
A nice feature of implicit methods like the Backward Euler scheme is that one can take one very long time step to ‘‘infinity’’ and produce the solution of (5.38).

a)
Let (5.38) be valid at mesh points x _{ i } in space, discretize \(u^{\prime\prime}\) by a finite difference, and set up a system of equations for the point values u _{ i },\(i=0,\ldots,N\), where u _{ i } is the approximation at mesh point x _{ i }.

b)
Show that if \(\Delta t\rightarrow\infty\) in (5.16)–(5.18), it leads to the same equations as in a).

c)
Demonstrate, by running a program, that you can take one large time step with the Backward Euler scheme and compute the solution of (5.38). The solution is very boring since it is constant: \(u(x)=C\).
Filename: rod_stationary.m.
Remarks
If the interest is in the stationary limit of a diffusion equation, one can either solve the associated Laplace or Poisson equation directly, or use a Backward Euler scheme for the timedependent diffusion equation with a very long time step. Using a Forward Euler scheme with small time steps is typically inappropriate in such situations because the solution changes more and more slowly, but the time step must still be kept small, and it takes ‘‘forever’’ to approach the stationary state. This is yet another example why one needs implicit methods like the Backward Euler scheme.
Exercise 5.10 (Solve a twopoint boundary value problem)
Solve the following twopoint boundaryvalue problem
Hint
Do Exercise 5.9. Modify the boundary condition in the code so it incorporates a known value for \(u(1)\).
Filename: 2ptBVP.m.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
Open Access This chapter is distributed under the terms of the Creative Commons Attribution‐NonCommercial 4.0 International License (http://creativecommons.org/licenses/bync/4.0/), which permits any noncommercial use, duplication, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, a link is provided to the Creative Commons license and any changes made are indicated.
The images or other third party material in this chapter are included in the work’s Creative Commons license, unless indicated otherwise in the credit line; if such material is not included in the work’s Creative Commons license and the respective action is not permitted by statutory regulation, users will need to obtain permission from the license holder to duplicate, adapt or reproduce the material.
Copyright information
© 2016 The Author(s)
About this chapter
Cite this chapter
Linge, S., Langtangen, H.P. (2016). Solving Partial Differential Equations. In: Programming for Computations  MATLAB/Octave. Texts in Computational Science and Engineering, vol 14. Springer, Cham. https://doi.org/10.1007/9783319324524_5
Download citation
DOI: https://doi.org/10.1007/9783319324524_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 9783319324517
Online ISBN: 9783319324524
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)