Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 68 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
In diffusion image processing, the observed grey-value image signal is the initial condition for an evolution ; time controls the image smoothing scale. A useful model must suppress image noise while respecting the image signal's geometric boundaries. Unless exterior values are intended, use periodic boundaries or Neumann boundary conditions, so the filter does not lose intensity through the image signal border.
The basic linear model is the heat equation, , . On the whole plane,It is Gaussian image smoothing with variance in each coordinate. In Fourier variables, : high spatial frequencies are damped most strongly. Under zero-flux or periodic boundaries the mean is conserved, the maximum principle keeps values within the initial range, andThese give stable image noise suppression, but a sharp step also contains high frequencies and is blurred across a width of order . Constant diffusivity has no mechanism for distinguishing image noise from an image edge.
Linear sharpening by the backward heat equation would multiply Fourier modes by and amplify arbitrarily fine image noise without bound. It is an ill-posed initial-value problem. A controlled unsharp masking step instead uses , with multiplier . This amplifies high frequencies by at most ; it can improve apparent contrast but also amplifies image noise and cannot reliably restore information already lost by image smoothing.
Nonlinear models use image signal structure to select the diffusion. A gradient-based energy and its formal gradient flow areFor a smooth solution with the corresponding zero-flux condition, . The fidelity term prevents indefinite drift towards a constant reconstruction; pure diffusion is usually stopped at a selected finite time.
The local principal diffusion coefficients distinguish suppression of diffusion from backward diffusion. Where , the flux derivative isIts coefficient along an image signal level curve is ; across that curve it is . Forward parabolic behavior requires both coefficients nonnegative, with strict positive lower bounds giving uniform parabolicity. Merely choosing and decreasing does not establish well-posedness.
For a convex area-type penalty , the coefficients areDiffusion across steep image edges is weak but remains forward. As , the total variation flow formally becomes . Its convex subgradient formulation handles flat regions and discontinuities. It favors piecewise constant image signals and preserves sharp transitions better than Gaussian image smoothing, but can produce staircasing in total variation denoising, shrink small objects and move boundaries by curvature. image edge preservation does not mean exact preservation of all image edge locations or amplitudes.
The Perona-Malik equation takes a decreasing diffusivity such as . Small gradients are smoothed strongly, while large gradients have weak flux. More precisely,For , diffusion in the gradient direction is backward, so a strong transition can steepen. This gives formal image edge enhancement but also causes instability and continuum ill-posedness. The exponential choice similarly has a negative normal coefficient for . Discrete results depend on the stencil, step size and implicit regularization; appealing visual results are not a proof of a well-posed PDE.
A regularized Perona-Malik diffusion computes the conductance from a smoothed image signal, for exampleThe flux still acts on , but the image edge detector is less sensitive to raw image noise. With a smooth kernel and a positive conductance bounded away from zero on the attained range, the local principal diffusion is forward; appropriate regularity and boundary assumptions give a well-posed nonlocal parabolic model. The exact regularization and fixed image smoothing scale are part of the model.
A genuinely directional filter uses a diffusion tensor for image filtering:Here estimates the image edge normal and its tangent. A structure tensor provides robust directions at a second averaging scale. Strong tangent diffusion smooths image noise along an image edge, while weak normal diffusion reduces mixing across it. Related coherence-enhancing choices connect elongated features along their dominant orientation. Positive tensor eigenvalues preserve forward parabolicity; this type of enhancement must be distinguished from Perona–Malik's backward normal diffusion.
For more direct sharpening, a shock filter for image enhancement formally evolves . It is a Hamilton–Jacobi-type transport mechanism, not a positive diffusion operator, and steepens transitions around inflection boundaries. In practice it can be combined with regularized forward diffusion to control image noise. Any enhancement method needs a scale or stopping rule and an honest treatment of image noise amplification.
Linear heat flow offers predictable image smoothing but blurs image edges; convex nonlinear diffusion can preserve them; backward or shock mechanisms sharpen them at a greater stability cost. Gradient thresholds, conductance regularization and positive tensor directions determine which of these behaviors a proposed filter actually has.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 68 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A rigorous Mumford–Shah functional permits nonsmooth image signals and free discontinuities. One classical admissible class consists of relatively closed countably rectifiable sets with finite Hausdorff measure , and with finite energy. No exterior boundary values are prescribed. For an existence argument, use the equivalent relaxed classA special bounded-variation space excludes the Cantor part of a bounded-variation derivative of the derivative: . The jump set of a bounded-variation function is the relaxed image edge set. Clipping to decreases squared fidelity, does not increase the gradient term, and does not create jumps, so this bound loses no minimizers.
Take a minimizing sequence and compare with a constant image signal. Its gradient norms and jump lengths are bounded. Alsoso the sequence is bounded in . The SBV compactness theorem for bounded values, superlinear gradient growth and bounded jump measure yields an limit in , weak convergence of gradients in , and lower semicontinuity of both the Dirichlet term and the jump measure. The uniform value bound upgrades convergence to , so fidelity converges. This proves existence of a relaxed minimizer. Essential closedness of Mumford–Shah jump sets then supplies a relatively closed representative , without added length, and . This completes the outline for the classical pair problem. Arbitrary Hausdorff convergence of image edge sets alone is not an adequate substitute for these compactness and regularity results. No uniqueness is claimed for segmentation.
As with fixed, bounded energy forces in . The reduced piecewise-constant Mumford–Shah problem isEquivalently, use a Caccioppoli partition of the image signal domain and constants :The relative perimeter counts only interior boundaries, and the factor one half counts each interface once. Adjacent equal-valued regions can be merged, removing unnecessary boundaries.
For fixed , let be its positive-area regions. Minimization over reduces to independent scalar least-squares fits:The minimized fidelity is . Thus region means in piecewise-constant segmentation give the optimal grey values for a fixed segmentation.
For a fixed full spatial function , the image edge set must contain its jumps; any extra curve only adds length. The optimal choice is its essential jump set, with a relatively closed representative when appropriate. There is no independent relocation of boundaries while that full function is held fixed. A different common alternating step fixes the values but allows the labels to move. It minimizes the fidelity-plus-perimeter partition functional above. Without the perimeter term each point takes its nearest grey value; with it, interface length is penalized. At a smooth interface between two labels, outward normal displacement of has first variationwhere is positive for an outward normal to a circle. The stationary segmentation interface curvature balance isThis is the geometric interpretation of optimizing boundaries with fixed grey levels, and distinguishes it from fixing the whole spatial image signal.
As with fixed, a constant competitor bounds the minimum independently of , forcing . compactness in the relaxed formulation leaves no jump or Cantor part of a bounded-variation derivative, so the limit is in on the connected rectangle. The reduced edge-free Mumford–Shah limit isA set of zero length can be omitted; this does not impose a zero image signal or a Dirichlet boundary value. Comparison with any fixed competitor and lower semicontinuity justify the limit minimization.
For completeness, the bilinear form on is continuous and coercive, with . The right-hand side is bounded because on the bounded rectangle. The Lax-Milgram theorem gives a unique satisfyingIt is the unique minimizer by strict convexity. Formally,with the Neumann condition understood through this weak formulation. Equivalently, subtracting the weak equation shows that the energy increase at is for nonzero .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 68 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Interpret the printed Euclidean norm literally on the full vector array . It is a single global norm, not the sum of pixelwise gradient lengths in discrete isotropic total variation. Set and let be its exact adjoint operator for the chosen difference and boundary conventions. The closed dual ball and its image signal areThe set is nonempty, convex and compact, hence closed, because it is a linear image signal of a compact ball in finite dimensions. Euclidean norm duality givesthe support function of .
The metric projection onto a closed convex set uniquely minimizes over . Its variational characterization of convex projection saysPut . This inequality says precisely that . For any , the primal energy satisfiesCompleting the square shows that the right side is uniquely minimized by . At that point the inequality is equality, soThis also follows from the proximal operator of a support function and Moreau decomposition: the convex conjugate of is the indicator functional of a constraint set for . The squared fidelity is strictly convex and coercive, so the primal minimizer exists and is unique.
The convex projection in this formula is the removed component , not generally itself. A metric convex projection onto one fixed closed convex set is idempotent. On a right singular vector direction with positive singular value of any nonzero , this denoising map reduces to soft thresholding with a positive threshold, and applying it twice shrinks again. It therefore cannot be such a convex projection for all data. This qualifies the printed convex projection wording while giving the required global gradient-norm projection residual.
Compute by solving the convex dual least-squares problemIts gradient is and has Lipschitz constant . Projected gradient descent givesFor fixed , the finite-dimensional projected-gradient convergence theorem ensures that converges to a dual minimizer. Reconstruct ; its limit is the unique primal solution even if dual minimizers are nonunique. If , the primal solution is simply and no iteration is needed. For unit-grid forward differences with periodic or zero-difference boundaries, , so is sufficient. Grid-spacing factors or other boundary stencils change this bound.
The normalization here is global. If a pixelwise sum of gradient lengths had instead been intended, the dual feasible set would be a product of pixelwise balls and convex projection would normalize each block separately; it is a different regularizer and should not be silently substituted.
For the discrete Hessian-norm denoising variant, write and useThis is again a compact convex image signal of a Euclidean ball, now under the second-difference adjoint. In suitable conventions is a discrete double divergence, but its exact boundary adjoint is what defines the set. It lies in , so components in are preserved by denoising. Interior second derivatives annihilate affine image signals; whether all such image signals remain in the kernel depends on the boundary convention. With a pixelwise Hessian norm, the corresponding balls would instead be four-component blocks.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 68 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A one-dimensional Sobolev representative is absolutely continuous. For , the fundamental theorem of calculus and Holder inequality giveThus has a representative in . The qualification about representatives matters because a Sobolev space element is an almost-everywhere equivalence class.
In two dimensions, the Sobolev fundamental theorem of calculus on lines and Fubini's theorem imply that almost every horizontal and vertical slice belongs to and has this one-dimensional Hölder continuity. The slice seminorm depends on the slice; this does not give one uniform pointwise estimate on the square. For , Morrey's inequality additionally gives a globally Hölder continuous representative of exponent . For , global continuity need not hold. For example, with a smooth cutoff around an interior point, lies in when , but is unbounded. At , the cutoff version of is unbounded while its gradient has finite squared integral, sinceThese examples distinguish Sobolev slicing and planar continuity from a false two-dimensional application of the interval exponent.
Put . A BV space is a function whose distributional derivative is a finite vector-valued Radon measure. Equivalently its total variation seminorm is finite:The BV space has norm . For , integration by parts against the compactly supported field gives . Conversely the measurable choice on nonzero gradients attains the pointwise bound. Approximating this bounded field by smooth fields, using interior cutoffs and the finite measure , justifies the supremum and givesIt is a norm of the derivative measure, rather than a pointwise derivative at jump discontinuities.
There is a genuine mismatch in the printed definition of the next functional. Its constraints on and are independent. Hence its stated supremum, denoted , separates asThe scalar supremum is , by cutoffs approaching one, and the vector supremum is the variation. For an affine image signal with , this gives , whereas the displayed square-root area would give . The intended relaxed graph-area functional instead uses the coupled pointwise constraint , givingwhere is the singular part of . Both readings have a minimizer, but their equations are different.
Here is the direct method in the calculus of variations for either reading. Let be the literal or the corrected , and define the energy on , assigning infinity elsewhere. A minimizing sequence has bounded energy by comparison with . Both , so its variation is bounded, and the fidelity bounds , hence also and . By bounded-variation compactness, a subsequence converges strongly in to , and after another subsequence almost everywhere. Fatou's lemma provesThe regularizer is a supremum of affine functionals continuous in , since the test-field divergence is bounded. It is therefore lower semicontinuous. Combining the two lower bounds proves existence of a minimizer. In fact the convex regularizer and the strictly convex squared fidelity make the minimizer unique up to null sets. This does not assert that the minimizer must belong to .
For the intended graph area, conditionally assume that the minimizer is in . For , differentiate at . The derivative of the integrand is bounded by , so dominated convergence applies. The weak equation isthat is,This is the graph-area Euler-Lagrange equation. Compactly supported variations impose no boundary condition in this statement.
For the literal printed supremum, the constant drops out and one obtains total variation denoising. Its total variation calibration form isThe distributional equation means . In particular wherever the gradient is nonzero; writing this quotient without handling zero gradients would be incomplete. Formally the one-sided derivative of isMinimality in the directions and bounds the remaining linear functional by the second integral. The Hahn-Banach theorem extends it on that zero-gradient set to a bounded vector field of magnitude at most one, furnishing and the displayed weak equation. Thus the literal definition has a nonsmooth subgradient equation, not the square-root equation above.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 67 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use , so the Fourier transform of is . Distinguish the full degree- polynomial from its homogeneous top-degree part , the principal symbol. The elliptic differential operator condition isIt does not require the full polynomial to be nonzero at small frequencies. Compactness of the unit sphere gives . Homogeneity and the lower-degree remainder implyFor sufficiently large the second term is at most half the first, so the high-frequency lower bound for an elliptic polynomial isHere is the Japanese bracket. The order-zero case just means a nonzero constant and is immediate.
For real , the Sobolev space definition with the current Fourier normalization isChanging the harmless constant in the norm gives the same space. A distribution on belongs to the Local Sobolev space when , extended by zero outside , belongs to for every test function .
A compactly supported distribution of finite order of a distribution has a smooth Fourier transform satisfying , by applying the finite-order estimate to a fixed cutoff times the exponential. Thus its weighted squared transform is bounded by . This is integrable precisely in the sufficient range , and provesThis is the negative Sobolev regularity of a compactly supported distribution; the strict inequality is important, and is not a claim that this sufficient threshold is optimal for each distribution.
To establish elliptic regularity without assuming the answer as an a priori smoothness hypothesis, first obtain a global constant-coefficient gain. For a compactly supported distribution with , the polynomial lower bound at high frequency givesOn , the transform of is smooth and bounded. Therefore implies . Possible low-frequency zeros of are harmless; we never divide by them.
Two elementary mapping facts supply the variable-coefficient argument. Distributional derivatives of order map into . Sobolev multiplication by a smooth cutoff is bounded on for every real , including negative ones. Indeed, for a compactly supported smooth , the Peetre weight inequalityand reduce the bound to Young's convolution inequality with the integrable kernel . Smooth coefficients only need this property on compact subsets, where they can be multiplied by another cutoff.
Write the lower-order part as , with , and suppose provisionally that on a relatively compact neighborhood. For a cutoff function supported there,The bracket is the operator commutator. Its order is at most : in the product rule, every surviving term has at least one derivative falling on . Choose a second cutoff function equal to one near when estimating the products. The derivative and smooth-multiplication bounds then giveThe global gain just proved applies to the compactly supported distribution , and yieldsThis is the cutoff bootstrap for local elliptic regularity; it works for real indices, not just nonnegative integers.
There is always a legitimate starting index. Around any fixed point choose on a smaller neighborhood. The compactly supported distribution has the negative Sobolev regularity proved above, so on that neighborhood for some finite . The index need not be uniform over all of . Repeating the one-step gain finitely many times reaches , or the target is already reached if . Since the point was arbitrary,For the result follows directly by dividing by the nonzero constant.
Finally, if , its forcing belongs to every Local Sobolev space. The gain consequently gives every local Sobolev order for . For each integer , choose an order larger than and apply the Sobolev embedding theorem to a localized solution. It has a representative; the representatives agree because they represent the same distribution. Thus every distributional solution of is smooth on .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 67 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For , choose a cutoff function on a neighborhood of its support. Its extension to smooth functions makesindependent of the choice of cutoff. For real frequency, the definition of the distributional Fourier transform gives : interchange the pairing with the integral of a Schwartz function, using the finite-order estimate on the cutoff's compact support. On each compact set of complex frequencies the exponential and all its derivatives have uniformly convergent power series. Continuity of the distribution allows termwise differentiation, withConsequently is entire on .
For the precise exponential type, a fixed enlarged support would give an unnecessarily enlarged radius. Instead use the shrinking-cutoff exponential-type estimate. On one fixed compact neighborhood of the closed radius- ball, has finite order of a distribution . Choose near that ball, supported in the radius- ball, with for . The finite-order estimate givesTake . Its extra exponential is bounded by , while the derivative cost is polynomial. ThusThe entire function was defined with a fixed cutoff; only its bound uses a frequency-dependent cutoff, so no holomorphic dependence is lost. This proves the required estimate with some without enlarging .
For the converse, set . Its restriction to real frequencies has polynomial growth. Define the inverse tempered distribution byRapid decay of the Schwartz function transform proves convergence and continuity, and Fourier inversion gives on real frequencies.
We prove its support directly by contour shifting, rather than assuming the support conclusion of the Paley–Wiener–Schwartz theorem. Let be a real unit vector and take a test function supported in for some . For every integer , integration by parts in the real-frequency Fourier integral givesIndeed, move from the oscillatory exponential to ; its derivatives supply at most powers of .
The product is entire. Rotate coordinates so that is the first coordinate vector and apply Cauchy integral theorem to a rectangle in that one complex coordinate, integrating the remaining real coordinates afterwards. For fixed , choose ; the displayed decay estimate, uniformly on the intervening imaginary segment, makes the vertical faces vanish as the real rectangle width tends to infinity. The horizontal integrals are absolutely convergent. HenceUsing and the growth hypothesis bounds this pairing byIt tends to zero as , so the pairing vanishes. Every point outside the closed radius- ball lies in such a separating half-space; a finite partition of unity for the support of a test function outside the ball proves .
Translate this compactly supported distribution by : define . The Translation property of the Fourier transform givesThe compact-support entire extension agrees with everywhere by the identity theorem, applied successively in the complex coordinates. Fourier inversion also gives uniqueness. This completes both directions of the ball version of the Paley–Wiener–Schwartz theorem.
For the wave equation, take a real constant . The Fourier transform method for the wave equation givesThis inverse tempered distribution is twice differentiable in : time derivatives introduce polynomial frequency factors, still integrable against every Schwartz function. It has the specified initial displacement and zero initial velocity and satisfies the equation distributionally.
To apply the support theorem, replace the real norm by the entire wave cosine multiplierThis series is entire and equals regardless of the square-root choice. Write and . Since ,Together with , this yields . The forward estimate for the translated initial support now givesThe converse therefore proves finite propagation with the stated speed:In particular, itself need not be entire; it is the even cosine series that provides the required entire extension.
For completeness this construction identifies the distributional Cauchy solution even without initially assuming spatial temperedness. The zero-displacement wave multiplier is , entire with bound . Given a compactly supported smooth and final time , the backward solution is smooth, has support in one compact ball for by the same support theorem, and satisfies , . For the difference of two distributional solutions with zero initial data,All pairings use compactly supported test functions. The expression vanishes initially and equals finally. Hence , establishing uniqueness in the usual time-differentiable distributional solution class.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 67 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use complex-linear distribution pairings, without conjugation. Write for the space of test functions. The smoothing convolution with a test function isOn a compact set of values, all the translated test functions have support in one compact set. Continuity of the distribution therefore permits differentiation in , giving for every multi-index. In particular this convolution is a smooth function, even if is not tempered.
For the first associativity identity, integration against and the distribution pairing can be interchanged: the integrand has a common compact support in , depends smoothly on the integration variable, and satisfies the finite-order continuity estimate there. ConsequentlyThe common-support argument matters: a general distribution cannot be paired with arbitrary noncompact functions.
For convolution of distributions with a compactly supported factor, first take with compact support and defineThe inner pairing is interpreted using a cutoff function equal to one near . It is smooth in and has support in . To see continuity, restrict to a fixed compact support . The order of a distribution estimate for controls derivatives of the inner function by finitely many derivatives of , and its support lies in the fixed compact set . Applying the corresponding estimate for givesThus is a distribution, not merely a formal iterated pairing.
Choose an additional cutoff function in equal to one on a neighborhood of . The resulting joint kernel is compactly supported in both variables, so the tensor product of distributions permits reversing the pairings. One justification is to approximate that smooth compact kernel, in all the required derivative seminorms, by finite sums of products of one-variable kernels; the two orders agree on such products and their continuity estimates pass to the limit. Reversing consequently gives . If rather than has compact support, use the same construction with the roles reversed; pairing against a smooth function is then legitimate.
Evaluating the resulting smoothing convolution with a test function givesIf has compact support, is itself a test function; if has compact support, its action on the smooth inner convolution uses a cutoff. This explains the meaning of the formula in either case. It also proves uniqueness: , and reflection runs through all test functions. When both factors have compact support, the same definition gives , their Minkowski sum.
The Schwartz space consists of smooth functions for which every seminorm is finite. A tempered distribution is a continuous linear functional on this space. Fix the angular-frequency Fourier transform conventionThe Fourier transform isomorphism of the Schwartz space makes the dual definition continuous. For a compactly supported distribution, a fixed cutoff function near its support extends the action to smooth functions by . A finite-order estimate controls this by finitely many Schwartz space seminorms, so both compactly supported factors are tempered.
Their Fourier transform of a compactly supported distribution is the smooth function . Applying the compact-support convolution definition to the exponential givesThe convolution theorem has no extra factor with this normalization.
For the spherical surface measure convolution, put . Rotate the polar axis to the direction of ; rotational invariance of surface area givesAt the removable value is , the total sphere area. Hence .
For , angular integration in Fourier inversion now givesThis conditional integral can be made rigorous by first inserting and then taking in tempered distributions. The supplied sine identity gives an integral of when , and zero off that interval. Thusas a regular distribution. To justify the limiting density as well as the signs, expand the product of sines into four sine terms and use . The four arctangents are uniformly bounded; the regularized inverse is bounded by a constant times , which is a locally integrable function in three dimensions. Dominated convergence theorem therefore identifies the distributional limit with the displayed density.
Changing the two endpoint sphere values does not change the regular distribution; this includes the source's closed-interval representative. At a jump, symmetric Fourier inversion instead takes the half-value. If , the singularity at the origin remains locally integrable and is not a point mass. As a normalization check,exactly the product of the original sphere areas.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 66 7 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The finite element method replaces an infinite-dimensional variational problem by a finite-dimensional one, usually using functions that are polynomial on small mesh elements. Ritz method and Galerkin method describe how the discrete equations are selected; neither intrinsically requires piecewise polynomials, though those spaces make assembly local and sparse.
For a concrete realization of the two-point problem, choose homogeneous Dirichlet boundary conditions at both endpoints of . The differential expression alone is not a complete boundary value problem, so this boundary choice is an explicit assumption. Let with , with , and . Use the zero-boundary Sobolev space with norm . By the Poincaré inequality this is equivalent to its full first-order Sobolev norm. Multiplying by a test function and applying integration by parts givesThe endpoint terms vanish by the essential boundary condition. The form is a symmetric bilinear form, bounded byand it is a coercive bilinear form:The load is a bounded linear functional. The Lax-Milgram theorem gives a unique weak solution and a bound . Under the stated coefficient regularity it solves the differential equation in the usual weak sense.
The Ritz method minimizes the energyover , or over a conforming finite-dimensional subspace . Its first variation is ; symmetry and coercivity make the functional strictly convex. In fact, if is the weak solution,Thus the energy minimizer is exactly the weak solution. The Galerkin method instead directly asks for with for all . For this symmetric coercive problem, Ritz-Galerkin equivalence for a symmetric coercive form shows that the discrete minimizer and Galerkin solution coincide. For a nonsymmetric problem, a Galerkin formulation can still apply but the same quadratic minimization generally cannot represent its full bilinear form; appropriate coercivity or inf-sup conditions must then justify the chosen spaces.
Subtract the continuous and discrete weak equations to obtain Galerkin orthogonality . Since defines the energy norm , the Pythagorean identity givesIn a general reference norm, the Céa lemma yieldsThe proof uses together with coercivity and continuity. Dense approximation spaces therefore imply convergence; the estimate reduces a numerical error problem to an approximation problem.
For implementation, partition the interval by nodes . Choose continuous piecewise-linear functions and the interior piecewise-linear hat functions as a basis, with the two boundary coefficients prescribed. Write . The coefficients satisfyThe stiffness matrix is symmetric positive definite: for nonzero interior coefficients. The local supports make it tridiagonal in this one-dimensional linear-element case.
On an element of length , for constant element coefficients , the two-node matrix and constant-load vector areFor variable coefficients, integrate against the same shape functions rather than silently replacing them by constants. Element contributions are added at shared nodes, and boundary values are eliminated or lifted into the right side. A sparse direct solve or a suitable iterative method gives the nodal coefficients. Numerical quadrature should preserve the required accuracy and, with positive coefficients and weights, the positive energy structure.
A finite element interpolation estimate gives for these elements, where is the largest element size and the solution has the stated regularity. The Céa lemma then gives first-order energy error. If the dual elliptic problem has regularity, the Aubin–Nitsche duality argument gives second-order error: for , solve , then use to gain one further factor of . Higher-order elements improve rates when the solution is sufficiently smooth.
Nonzero Dirichlet data are handled by a boundary lifting and an affine trial space. Neumann boundary conditions enter naturally through the integrated boundary term; Robin terms modify both the form and the load. With pure Neumann conditions and , constants lie in the kernel: existence needs the load/flux compatibility condition, uniqueness needs a mean constraint, and the preceding Dirichlet coercivity argument cannot simply be reused. Conforming approximation, boundary conditions and coercivity are the ingredients connecting the finite-element construction to a justified Ritz or Galerkin solution.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 66 6 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-18
A stiff differential equation can contain rapidly decaying modes as well as a slowly changing solution of interest. An explicit scheme may need a very small step solely to keep those already small fast modes from numerical growth. A-stability addresses this restriction through the Dahlquist test equation , whose exact solution decays when .
For a one-step method, write , . Its linear stability domain consists of the points where the update is defined and . A-stability means that this domain contains the closed left half-plane. This is a scalar linear stability property, not an order condition, an existence theorem for an implicit solve, or a general nonlinear contractivity assertion.
For a rational approximation to the exponential, consistency requires , and order requires . Poles must be absent from the relevant half-plane. The Forward Euler method has and the disk , so negative real modes require ; it is not A-stable. The Backward Euler method has , and on the left half-plane, so it is A-stable. The trapezoidal rule and the implicit midpoint rule both have, on the scalar linear problem,They are second-order and A-stable despite being different nonlinear methods. No nonconstant polynomial approximation is A-stable, because its modulus grows without bound on the negative real axis. In particular every nontrivial explicit Runge-Kutta method has a bounded-step stability restriction.
A-stability prevents growth but need not eliminate extremely stiff modes: the trapezoidal factor tends to minus one as . L-stability additionally requires within the left half-plane. Backward Euler is L-stable; trapezoidal and implicit midpoint are not. The distinction explains persistent alternating transients in otherwise stable Crank-Nicolson calculations. Accuracy still constrains useful step sizes even for an A-stable method.
A linear multistep method is characterized by polynomials , and its scalar modes satisfy . There is generally no single scalar amplification factor: every root must lie in the closed unit disk and unit roots must be simple. At , this is the zero-stability root condition. Consistency plus zero-stability gives convergence by the Dahlquist equivalence theorem, with suitable starting values. A-stability demands the amplification root condition throughout the left half-plane, including the zero-step condition. The Second Dahlquist barrier says that an irreducible A-stable linear multistep method has order at most two, and an explicit linear multistep method cannot be A-stable.
Examples include backward Euler, trapezoidal, and the second-order backward differentiation formulaIts zero-step roots are . Its unit-circle boundary quotient has real part , and the leading coefficient is nonzero on the left half-plane, giving A-stability by the same continuation argument as in Question 2. Conversely the third-order member of that question fails A-stability. A formal high order without zero-stability, or after silently cancelling a problematic unit factor, does not evade the barrier.
For an implicit Runge-Kutta method, the stages on the test equation satisfy . Whenever these stages are solvable, its stability function isThis rational function is used to test scalar A-stability; the Butcher order conditions separately establish nonlinear order. The Lobatto IIIA method in Question 3 is an A-stable fourth-order example with the diagonal degree-two Padé approximant. More generally the -stage Gauss--Legendre Runge-Kutta method has order and is A-stable, with the diagonal Padé approximation to ; its stiff-limit factor is nonzero. The -stage Radau IIA method has order and is L-stable. Thus Runge-Kutta stages permit arbitrarily high A-stable order, unlike irreducible linear multistep formulas.
For a normal matrix, scalar amplification bounds transfer through unitary diagonalization. For a non-normal matrix, eigenvalue information alone does not assert Euclidean contraction: transient growth and eigenvector conditioning can matter. Direct energy method arguments, such as the dissipative Cayley-transform proof in Question 1, use the symmetric part and are more informative in that setting.
For nonlinear dissipative vector fields, the stronger B-stability property asks that distances between two numerical solutions not increase. A standard sufficient condition for Runge-Kutta methods is algebraic stability: andis positive semidefinite. It follows from the Runge-Kutta contractivity identity when the implicit stages exist. The three-stage Lobatto IIIA method is A-stable but has the first diagonal entry of that matrix equal to , so scalar A-stability should not be confused with that sufficient nonlinear condition. Stage solvability of an implicit Runge-Kutta method remains a separate issue and computational cost of the implicit equations must be considered. A-stability removes a scalar decay-mode stability restriction; order, stiff damping, nonlinear stability and solvability remain distinct properties.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





