Solving the Heat Equation — Question 7

Section 28-5 · Calculus pages 4953–4954

Show solutionHide solution

Question 7

For the zero-endpoint heat problem ut=uxxu_t=u_{xx} on (0,π)(0,\pi), let f∈L2(0,π)f\in L^2(0,\pi) with ∥f∥2≤M\|f\|_2\le M, where M>0M>0. Its solution for t>0t>0 is u=∑n≥1bne−n2tsin⁡(nx),uN=∑n=1Nbne−n2tsin⁡(nx),N≥1.u=\sum_{n\ge 1}b_ne^{-n^2t}\sin(nx),\qquad u_N=\sum_{n=1}^N b_ne^{-n^2t}\sin(nx),\quad N\ge 1. You may use Parseval: ∑bn2=2∥f∥22/π\sum b_n^2=2\|f\|_2^2/\pi, and Cauchy–Schwarz.

Tasks

  1. Prove ∥u−uN∥2≤Me−(N+1)2t\|u-u_N\|_2\le M e^{-(N+1)^2t}. Show that the bound is sharp over the stated data class for each N,tN,t.

  2. Derive a uniform-in-xx error bound using Cauchy–Schwarz and the tail sum ∑n>Ne−2n2t\sum_{n>N}e^{-2n^2t}.

  3. Bound that sum by a geometric series using n=N+1+jn=N+1+j, j≥0j\ge 0, and obtain an explicit bound requiring no infinite summation.

  4. For M=1,t≥0.1M=1,t\ge 0.1, certify that six modes give a uniform error below 0.010.01. Explain why the available bound does not certify five modes, and why this does not prove that five modes fail for every particular initial field.

Question 7 – Solution

Strategy. A truncation certificate needs a bound on the omitted coefficients, not just a graph of the retained modes.

Step 1: Prove the sharp norm estimate. Orthogonality gives ∥u−uN∥22=π2∑n>Nbn2e−2n2t≤e−2(N+1)2t∥f∥22.\|u-u_N\|_2^2=\frac\pi 2\sum_{n>N}b_n^2e^{-2n^2t} \le e^{-2(N+1)^2t}\|f\|_2^2. Taking square roots proves the bound. Equality is attained by f=M2/πsin⁡((N+1)x)f=M\sqrt{2/\pi}\sin((N+1)x): all its energy lies in the first omitted mode. Thus the rate and constant are sharp for the whole L2L^2 ball.

Step 2: Control pointwise errors uniformly. Using |sin⁡nx|≤1|\sin nx|\le 1 and Cauchy–Schwarz, |u−uN|≤(∑n>Nbn2)1/2(∑n>Ne−2n2t)1/2≤2πM(∑n>Ne−2n2t)1/2.|u-u_N|\le\left(\sum_{n>N}b_n^2\right)^{1/2} \left(\sum_{n>N}e^{-2n^2t}\right)^{1/2} \le\sqrt{\frac 2\pi}M\left(\sum_{n>N}e^{-2n^2t}\right)^{1/2}. This bound is independent of xx and finite for t>0t>0. It also justifies uniform convergence of the positive-time solution for arbitrary L2L^2 data.

Step 3: Replace the tail by a geometric bound. For the integer j≥0j\ge 0, (N+1+j)2≥(N+1)2+(2N+3)j(N+1+j)^2\ge(N+1)^2+(2N+3)j, since j2≥jj^2\ge j. Therefore ∑n>Ne−2n2t≤e−2(N+1)2t1−e−2(2N+3)t,∥u−uN∥∞≤2πMe−(N+1)2t1−e−2(2N+3)t.\sum_{n>N}e^{-2n^2t}\le \frac{e^{-2(N+1)^2t}}{1-e^{-2(2N+3)t}},\qquad \boxed{\|u-u_N\|_\infty\le \sqrt{\frac 2\pi}\,\frac{M e^{-(N+1)^2t}}{\sqrt{1-e^{-2(2N+3)t}}}.} The denominator is positive because t>0t>0. Each factor makes this certificate decrease as time increases.

Step 4: Make a numerical guarantee with the correct scope. At t=0.1t=0.1, the bound is less than 0.006110.00611 for N=6N=6 and greater than 0.02260.0226 for N=5N=5. Hence six modes certify the requested 0.010.01 uniform error for every t≥0.1t\ge 0.1 and every datum with ∥f∥2≤1\|f\|_2\le 1. The five-mode certificate is too large; it does not prove failure for each field. For example, a datum supported entirely in the first five modes has zero truncation error with five modes. The bound is a sufficient test, not an exact error formula for unknown data.