Method of Characteristics

First-order partial differential equations may be analyzed (and sometimes, even solved) by using the Method of Characteristics. We consider a family of curves, along which the solution to the partial differential equation is constant. (At least, intuitively.)

When we cannot solve a first-order PDE, we can still extract useful information about it using the method of characteristics. This post will just give some intuition and basic algorithms for the linear case, and generalize it to the semilinear and quasilinear cases.

Linear Partial Differential Equations

Example 1. Suppose we are working in 2-dimensions and we have a first-order partial differential equation, say the transport equation: Here is a nonzero constant (the wave speed). How can we solve it?

We could consider a curve , such that the total derivative of the solution to our PDE along this curve is our original partial differential equation: This means we have several ordinary differential equations to solve and These have solutions of the form where , are constants of integration.

In particular, observe that is a constant. This means that any (sufficiently smooth) function satisfies the transport equation: This seems like some black magic, or bizarre accident. What's going on?

Example 1'. Let's try solving the transport equation with a different scheme. Let's try to change coordinates to make the transport equation of the form How can we do this?

Step 1: Find direction. We want to point in the direction of . Why? Well, we could then treat the PDE as the directional derivative . We can construct the line through the origin and using the formula . Supposing we didn't know how to construct a line (or it's impossible for some reason), we could determine the direction by the differential equation which gives the solution for some constant of integration .

Step 2: Construct axes. We then want to use as the formula for , i.e., we want to construct lines so when we plug in we have be constant. Now we assert this is the -axis for .

The -axis would be perpendicular to this, i.e., or is the -axis.

Step 3: Cleaning up. Along the -axis, is constant. Along (for some "intercept parameters" ) parallel to the -axis, we expect to be constant. That is to say, we have and similar reasoning suggests is constant along lines parallel to , which is equivalent to asserting Why? Well, given any point in the line , we see is constant. Similarly, for any point , we find is constant, too.

If we change coordinates, then we have and Using the chain rule, we find and similarly We then have Rearranging terms, we have Erm, progress?

Yes, progress! Because we have discovered what , , , and are! We did it in step 1. We see , , and . This tells us that identically.

Our partial differential equation becomes And we conclude that a generic solution must look like for sufficiently smooth . This is precisely the result we got before.

Example 2. Let's consider a harder PDE, with variable coefficients: There are two ways to tackle this:

1. Geometrically, find curves and such that is our original PDE; or
2. Algorithmically change variables, so we have and such that we choose to satisfy identically, and is whatever works, so our PDE becomes .

The algorithm changes slightly, because now we have variable coefficients, but it is morally the same.

Step 1. Find the direction such that Before this was easy because for constant coefficients, which was used as the slope of the -direction.

Step 2. Since from step 1 is unique up to some constant of integration , "invert it" to produce some function such that it produces the constant of integration.

Step 3. Set equal to this function obtained in step 2: The assertion is that is constant in the direction, and so any arbitrary (but sufficiently smooth) function satisfies the original PDE.

If you look back at example 1', you'll see that , too. You'll also see the steps carried out as described.

So how do these two methods relate to each other? Well, if we parametrize instead of and , then we recover the algorithmic method from the geometric method. In other words, the geometric method is more general and contains (as a special case) the algorithmic method.

More general case with variable coefficients. If we have something of the form then everything we did can carry over. The only difference is our partial differential equation becomes which is a first-order ODE. We know how to solve them!

Semilinear Equations

For a semilinear PDE of the form the geometric method carries over. But we now have the system of ODEs: as before, and also This new equation intuitively encodes the characteristic of the solution: .

Our PDE along this curve is then such that Care must be taken if working with initial conditions or boundary values.

Quasilinear Equations

For a quasilinear PDE of the form the geometric method carries over. But we now have the system of ODEs: Unlike the semilinear case, we have more complications to deal with, which I'll discuss in another post. What sort of complications? Let's look at an example.

Example 3. Consider the nonlinear transport equation (where wave-speed is the magnitude of the wave): The characteristics satisfy the system of equations We can solve these equations We have and hence or more precisely: This tells us the generic solution looks like which is an implicit equation. Here is determined by the initial conditions. There is no general solution beyond this.

Exercise 1. Plug in this "solution" to the nonlinear transport equation. Is it really a solution?

References

1. Walter Strauss, Partial Differential Equations: An Introduction.
2. Julie Levandosky, First-Order Equations: Method of Characteristics. Handout, Stanford University, Math 220A, Fall 2002.