Original solutions to past examinations of the numerical solutions of partial differential equations course of the University of Oxford, using finite difference methods, energy estimates and Fourier stability analysis.
Original solutions to all three questions of the numerical solutions of partial differential equations course of the University of Oxford Part B examination, held on 6 June 2023. Source: original released PDF, bundle pages 292–295; paper pages 1–4. The numbering follows the paper. In 3(e), the growth constant must be allowed to depend on the mesh; the literal mesh-independent assertion in the native PDF is false. The corrected result and the intended failure of practical stability of a finite difference scheme are proved below.
Write and . Subtraction of the two boundary value problems gives , with . Multiply by and apply integration by parts:Consequently the required energy identity isThe nonlinear term is nonnegative pointwise, sinceThis is the monotonicity energy estimate for a semilinear Dirichlet problem for the monotone function . Apply Young's inequality for products, , inside the last integral and discard the nonnegative nonlinear term. Moving to the left givesIn particular, equal forcing gives , proving uniqueness and a quantitative continuous dependence on forcing estimate for this boundary value problem.
Let and , and define the scaled forward difference operator, backward difference operator and second-order central difference byThe two finite difference methods are the nonlinear systemswith the prescribed Dirichlet boundary conditions and . These equations determine the interior nodal values.
For clarity distinguish the interior and edge inner products and their norms:The bracketed norm includes the last edge . Let , so , and put for . Direct telescoping gives discrete summation by parts:Subtract the two nonlinear systems, multiply each equation by and sum. The resulting discrete energy identity isThe nonlinear summands are nonnegative by the factorization in (a). Using Young's inequality for products at every node givesThis also proves uniqueness of each discrete solution. Existence can be seen by minimizing, with the endpoints fixed, the strictly convex energy functionalIt is a coercive function of its finitely many interior values, so it attains a minimum. Its first derivatives are ; thus its minimizer solves the scheme. The same argument applies to .
Use for the sampled exact solution, and let . The Dirichlet boundary conditions imply . The definition of the truncation error gives the exact discrete equationSubtracting it from the numerical equation therefore givesThe sign on the right is positive because was defined as the difference approximation minus the exact second derivative. Multiply by , sum over the interior nodes and apply discrete summation by parts:Again . By Young's inequality for products, . HenceNo fourth derivative is needed for this step: the assumed twice continuous differentiability suffices to define and obtain the discrete energy estimate.
On the vector space of nodal values with zero endpoints define the discrete Sobolev normIt is a norm because it is the Euclidean norm of the scaled list of nodal values and first finite differences, and vanishes only for the zero list. It is the discrete counterpart of the Sobolev space norm. Here has zero endpoints, so this definition applies directly.
Set , finite by the assumed continuity. Taylor's theorem with fourth-order remainders gives, for suitable and ,Adding the two expansions cancels the odd derivatives, soConsequently . Doubling the bound in (c) gives , and thereforeThus is a valid nonnegative constant. To satisfy the request for a strictly positive constant even when , take , independent of . This proves second-order convergence of a numerical method in a discrete Sobolev norm, including control of the backward difference operator applied to the error.
For , direct differentiation yieldsSince the planar Laplacian is , the required eigenvalue of isOn the sides the first sine factor vanishes, and on the second sine factor vanishes. Thus the homogeneous Dirichlet boundary condition holds on the whole boundary. The eigenfunction is nonzero, for instance at , where its value is one.
The five-point Laplacian on the square grid isIt adds the second-order central differences in the two coordinate directions and uses the given zero Dirichlet boundary conditions when a neighbouring node lies on the boundary.
The sine addition formula impliesApply this identity with in the direction and with in the direction. For , it givesHence the discrete eigenvalues areBoth sine factors vanish on their respective boundary sides. Also , since and lie strictly between zero and . Thus each array is a nonzero discrete eigenvector, rather than merely the zero solution of the homogeneous system. The separated structure is also described by the five-point Dirichlet Laplacian as a Kronecker sum.
Set , so . The formulas in (a) and (b) giveFor , and . ThereforeThese trigonometric inequalities implySubstitution yields the explicit eigenvalue error boundThis constant is asymptotically sharp: Taylor's theorem gives , so . Here denotes Big O notation.
For these highest-index eigenvalues, use and to obtainDivide by and take the limit:For example, eventually the normalized difference exceeds , so the unnormalized difference is at least and tends to . This does not contradict (c): there the indices stay fixed as the grid is refined; here the eigenfunctions oscillate increasingly quickly, with wavelength comparable to the mesh spacing. It illustrates the high-frequency eigenvalue error of the discrete Laplacian.
Use the Backward Euler method in time and the prescribed central finite differences in space. With and , the implicit finite difference method for the advection-diffusion equation isEquivalently, for and , the new time level solvesThe spatial terms are evaluated at the new time level, making this an implicit scheme. On the whole line there are no finite-endpoint boundary conditions; in the next part its solution is chosen in the l2 sequence space.
For a grid sequence define its semidiscrete Fourier transform in the dimensionless frequency variable byFor general square-summable data the transform is interpreted as an limit in the L2 norm, rather than an absolutely convergent pointwise sum. The Parseval identity in this normalization isThe Fourier symbols of and are and . Transforming the implicit equation givesIts amplification factor is consequentlyThe denominator has real part at least one because . It never vanishes, so multiplication by defines a unique next value in the l2 sequence space, andThe Parseval identity now givesThis is unconditional practical stability of a finite difference scheme: in the course's terminology the numerical evolution does not increase this norm. Linearity gives the same estimate for perturbations of the initial data. This contraction convention is stronger than a finite-time mesh-uniform bound allowing physical exponential growth.[ref]
https://www.numerical.rl.ac.uk/media/people/tyrone-rees/nsde/notes/Lecture12.pdf. Archived Oxford NSDE I Lecture 12, PDF page 2, definition of practical stability as non-growth of the discrete norm
Use the forward Euler method in time and evaluate both spatial finite difference operators at the old time level:With and , the explicit update isEvery value on the new time level is computed directly from three old values. The sum of the stencil weights is one, as required to preserve constant solutions of the advection-diffusion equation.
Using the semidiscrete Fourier transform from (b), the explicit scheme has amplification factorSet and , so . Direct expansion givesThe expression in square brackets is an affine function of . At the two endpoints its values areusing precisely . Every intermediate value is a convex combination of these endpoints, so for every frequency. The Parseval identity provesThus the scheme is practically stable under the given condition. For it is equivalent to and . This is the Forward Euler stability for centered advection-diffusion calculation with the diffusion coefficient retained. The proof does not require all three stencil weights to be nonnegative.
When , the explicit amplification factor becomesA single Fourier mode has constant modulus in space and is not in the l2 sequence space. Instead choose a whole interval of frequencies on which there is definite growth. LetThe inverse Fourier transform here gives the real sequenceBy the Parseval identity, its squared norm is , finite and strictly positive. These data are also compatible with sampling a bounded continuous function: useThe value at zero is the limit of the displayed quotient, and .
On we have . Therefore the transformed solution and the Parseval identity giveFor each fixed pair , takeTaking square roots proves for every . In particular the norm already increases at the first step, so no positive mesh pair gives practical stability in the contraction sense of (b).
The native PDF places the existence of before the universal quantifier over mesh pairs. If this means a single positive independent of , that assertion is false for nonzero data. Indeed, for every datum the same Fourier symbol givesFor any proposed fixed , choose . The upper bound then contradicts the requested lower bound at . The correct quantifiers are , with nonzero square-summable data as constructed above.
Finally, failure of this stronger practical stability of a finite difference scheme should not be confused with every possible refinement notion of numerical stability. If , then givesThus a finite-time mesh-uniform bound can hold under this severe refinement even though contraction fails on every positive mesh. This is the distinction recorded in centered-advection refinement-dependent stability.
Articles by others on the same topic
There are currently no matching articles.