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 2013 iii Paper 65 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the planar geometry indicated by the supplied equation and streamfunction; the source heat input is then measured per unit out-of-plane span. Let and defineThis is the buoyancy part of Darcy law. Let denote the constant heat capacity per volume consistent with the given transport equation; for the fluid heat-flux convention . Porosity or matrix heat-storage factors, if retained, must be used consistently in this coefficient and the effective transport parameters.
For plume width , continuity gives . Both and are consequently of order : lateral advection must not be discarded. Lateral thermal diffusion is of order , while vertical diffusion is smaller by . The slender steady porous thermal plume model is thereforeWriting it in conservative form,and integrating across the plume, where and lateral diffusive/advective heat transport vanish at large , provesIn steady state with no lateral heat loss and negligible vertical conductive flux, this equals the heat supplied at the source. Define .
For characteristic velocity and width , flux conservation gives and the advection-diffusion balance gives . ConsequentlyThe dimensional scales are and . The plume becomes relatively more slender, , away from the source.
To find the profile, put and , so andInserting into givesIts coefficient is constant under the derived scaling. Choose the width normalization . Integrating once with decaying velocity derivatives gives . A second integration gives after normalizing the centreline velocity to ; symmetry has . The decaying, positive solution is . Hence the hyperbolic-secant porous plume profile isSince , the precise amplitudes areThey satisfy both and . The derived supplies lateral entrainment; setting would not reproduce this profile or satisfy continuity.
A heat-weighted head speed of a porous plume estimate follows by filling the column below a head height with this steady profile. Its excess heat per unit height isConservation of the total injected heat gives . Differentiating,Thus a heat-weighted head advances at a speed of order the local centreline velocity and decelerates as . With ,The factor is the energy-conserving estimate for a truncated steady column; the foremost centreline parcels have characteristic speed instead. The steady calculation does not resolve the transient nose or define an exact sharp temperature front. A truly axisymmetric point-source plume would require different geometry and cannot use this planar profile unchanged.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 64 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An image segmentation separates an observed image signal into regions that are smooth within themselves and separated by meaningful image edges. Pure image smoothing blurs the very transitions that ought to define these regions. The Mumford–Shah segmentation model instead chooses the reconstruction and its discontinuity set together. For a bounded planar Lipschitz domain and bounded grey-value data , one standard normalization isHere is the relatively closed edge set and can have different traces on its two sides. The first term is quadratic fidelity, the second penalizes variation within regions, and the Hausdorff measure term charges total edge length. It balances fitting, denoising and economical region geometry. The model was developed by David Mumford and Jayant Shah; their 1989 paper formulates this joint variational approach.
All three terms matter. Without fidelity, a constant reconstruction with no edge has zero energy. Without the gradient term, smooth data can be fitted exactly with no edge penalty. Without the length term, fine partitions with nearly constant region means can drive fidelity arbitrarily low while creating excessive boundaries. This is segmentation overfitting without an edge penalty. Increasing favors flatter regions; increasing makes extra boundaries more expensive and can remove small features. These parameter effects describe a balance, not a guaranteed monotone evolution of every individual boundary.
For fixed , varying gives the fixed-edge Euler-Lagrange equation for Mumford–Shah:The boundary condition is a separate one-sided Neumann boundary condition on each side of an edge, not continuity of across it. The fidelity makes this fixed-edge problem strictly convex, so its weak solution is unique by the Lax-Milgram theorem. Optimizing the edge set remains a different geometric problem. The nonconvexity of Mumford–Shah segmentation prevents a general uniqueness assertion or a guarantee that a numerical stationary point is globally optimal.
The piecewise-constant Mumford–Shah problem imposes on regions . It minimizesThe factor counts each shared internal boundary once. The region means in piecewise-constant segmentation give , provided . Thus the remaining optimization concerns the partition. For a smooth interface between and , moving it in the normal pointing out of changes fidelity by per unit displacement, while length changes by its curvature . The resulting segmentation interface curvature balance isWith equal isotropic interface costs, three freely meeting smooth edges satisfy the triple-junction angle in isotropic segmentation: force balance of their unit tangents gives angles of degrees. These are local stationarity conditions on regular interfaces, not a description of every singular edge configuration.
A simple piecewise-constant segmentation contrast threshold explains why small objects can disappear. On a domain of area , suppose two constant intensities differ by , occupying areas and with internal boundary length . Keeping that boundary fits the data exactly and costs . Merging both regions costs the within-region squared error . Among these two candidates, splitting wins precisely when . Other partitions may beat either candidate, so this is not a universal global segmentation formula.
This original synthetic example compares those two candidate geometries using their least-squares means. It illustrates the edge cost; it does not claim to compute the globally optimal Mumford–Shah segmentation.
Existence is cleanly stated in the relaxed SBV space formulation:where is the jump set of a bounded-variation function and the Cantor part of a bounded-variation derivative is absent. Clip a minimizing sequence to the bounded data range: this cannot increase fidelity, gradient energy or jump length. Its values are uniformly bounded, its gradients bounded in , and its jump lengths bounded. The SBV compactness theorem supplies an -convergent subsequence staying in the special class; bounded values also give strong convergence. The fidelity then converges, while gradient energy and jump length are lower semicontinuous. The direct method in the calculus of variations produces a minimizer. The essential closedness of Mumford–Shah jump sets is the additional regularity result connecting this relaxed minimizer to a closed-edge formulation; existence in alone does not assert that every edge set is smooth.
A practical continuous approximation is the Ambrosio–Tortorelli approximation, introduced in Ambrosio and Tortorelli's 1990 paper. An auxiliary field is near one in regions and near zero at edges. One normalized energy isThe edge field weakens smoothing across a narrow transition, and its own energy approximates interface length. The Gamma-convergence result, together with the required compactness, relates global minimizing sequences to the limiting segmentation energy; it does not make the finite-parameter problem jointly convex. Alternating the two fields solves quadratic elliptic subproblems, but initialization and stopping can affect which local stationary configuration is found. The strengths of the model are joint denoising and segmentation, sharp transitions and a geometric cost. Limitations include competing local minima, sensitivity to scale parameters, loss of fine texture, and boundaries driven by intensity rather than semantic object identity.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 64 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The bounded classical solution is the heat-kernel convolutionThe two-dimensional heat kernel has integral one. Boundedness of permits differentiation under the integral for , proving and . Its approximate identity property gives , locally uniformly since is continuous. This bounded solution satisfies the required Gaussian-growth bound.
For heat-equation uniqueness under Gaussian growth, let be the difference of two solutions, so and on a finite time interval. Choose and a slab . The positive comparison solutionsatisfies . For any , its faster spatial growth makes on a sufficiently large lateral cylinder boundary. At the initial boundary, . The heat equation maximum principle applied to proves the same inequality inside. First allow the cylinder radius to increase, then let . Repeating these slabs proves uniqueness on every finite interval with the stated uniform growth bound. No spatial integrability of is required.
At time , this is Gaussian filtering with covariance , hence per coordinate. With the angular-frequency Fourier transform convention , the Gaussian filtering Fourier multiplier isFor merely bounded , this identity is understood through tempered distributions. The multiplier leaves the zero frequency unchanged and attenuates large frequencies exponentially: it suppresses rapid noise fluctuations but blurs image edges. In cycles-per-length frequency , the multiplier is .
For the printed Perona-Malik equation, retain the supplied conductance , which includes an extra factor . In one dimension write and . Then , withThe forward-backward threshold for gradient-weighted exponential diffusion is thereforeAt and the coefficient vanishes, giving degenerate diffusion. Increasing increases the forward-diffusion range. Small nonzero slopes smooth, while large slopes formally sharpen; a negative coefficient produces short-wave growth and ill-posedness, so this is a dynamics explanation, not a general existence theorem for arbitrary data. Replacing the printed conductance by would give threshold , but that is a different equation.
The four-neighbour mean expansion follows by Taylor expansion: opposing first and third derivatives cancel, soIf for every sufficiently small , division by and passage to the limit give . This is a pointwise conclusion; it does not assert harmonicity in a whole neighbourhood.
For the area median over the disk, the disk-median curvature expansion, at a point where , isConsequently the analogous median fixed-point condition yieldsThis is the vanishing of the level-line curvature at : to second order the level line is straight there. It need not be a straight segment. For example has zero disk median at the origin for every radius, by odd symmetry, but its zero level line is the cubic . Vanishing curvature on an entire connected regular level arc would force that arc to be straight. The factor is for the disk's uniform area measure; a circle-boundary median has a different scale factor, while producing the same zero-curvature equation.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 64 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Positivity means almost everywhere, since the real logarithm must belong to . A positivity-preserving operator gives . For fixed , the scalar shifted Poisson data fidelity is , withComposition with the linear operator proves convexity in , and strict convexity holds along pairs whose forward images differ on a set of positive measure. The admissible class itself is convex: the concavity of the logarithm gives , controlling its negative part, while controls its positive part.
Because and , the Jensen inequality gives the requested bound:The final equality uses nonnegativity and the unit area. Since , this controls the forward-image norm on energy sublevels.
The printed strictly positive problem has no minimizer. This is nonattainment under strict positivity for shifted Poisson fidelity, rather than a failure of the coercivity calculation. Indeed, with and , implies . Also cannot vanish identically for a strictly positive . To see this, let . If , positivity and give . But in and continuity of would imply , contradicting the hypothesis. Thus every admissible has positive fidelity and hence positive total energy.
Conversely, the constants are admissible, have zero total variation, and satisfyTheir logarithms are integrable for each , but the limit is excluded. ThereforeA bounded minimizing sequence and bounded-variation compactness do not repair a nonclosed positivity/logarithm constraint. In particular, a literal existence or uniqueness proof for that domain is impossible.
The natural correction is to minimize over with , omitting the unnecessary condition: the fidelity only contains , which is already integrable. Here is the full existence for nonnegative shifted Poisson regularization argument, also valid for any bounded nonnegative data . Let , , and take a minimizing sequence of energy at most . The displayed bound gives and . Write . The Poincaré inequality for total variation and mean control for positive imaging operators yieldThe denominator is nonzero, so the full norm is bounded. Bounded-variation compactness gives in along a subsequence, with . Continuity gives in . On , , so the fidelity converges in the integral; lower semicontinuity of variation completes the direct method in the calculus of variations.
For the actual printed data , the corrected problem has the unique minimizer , even if is not injective. Zero attains energy zero. Any other zero-energy candidate would have both and ; on the connected square, zero variation makes a nonnegative constant, and forces that constant to vanish. For general positive bounded data, an injective is a sufficient uniqueness condition, because its fidelity is strictly convex; injectivity is not a necessary condition in every instance.
In the finite-dimensional interpretation, let . Independent Poisson observations with these intensities have negative log-likelihood . Removing the constant gives precisely the stated fidelity. Thus the model is Poisson counting noise with a unit background intensity, or an approximate version of it for rescaled/continuous grey values. Literal Poisson counts are integers; the constraint is a grey-value normalization, not a literal unscaled count sample.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 64 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write for the total variation seminorm on a domain. For a locally integrable real function its dual definition isThe bounded-variation space consists of functions with finite , equipped with . In the equivalent distributional derivative description, is a finite vector-valued Radon measure and is its total variation measure.
To establish completeness of the bounded-variation space, let be Cauchy in this norm. Completeness of gives in . Given , choose so that whenever . For fixed , the given lower semicontinuity yieldsSince , we obtain . In particular has finite variation; the triangle inequality then puts in the BV space. The same bound proves convergence in the full norm, so this is a Banach space.
For the disk data, put and assume . The exact total variation denoising of a disk isHere is the positive part. A total variation calibration certifies global optimality, including competitors that are not radial or piecewise constant. Define the bounded vector fieldIt has . Its normal component is continuous across the circle, so the distributional divergence has no extra boundary measure. Direct differentiation gives . The dual definition implies : for the standard domain one can cut off at radius , with the error bounded by , and then smooth the test field. In the larger homogeneous bounded-variation space, the same error is bounded by . Thus both usual whole-plane formulations give the same certificate.
Use the perimeter identity and . If , then and . Consequently every competitor satisfiesIf , replace by . Its norm is still at most one, its divergence is , and equality in the calibration holds at . The identical comparison proves optimality and uniqueness of zero, including the threshold . The only general results used are completeness of , lower semicontinuity of variation, the indicator-perimeter identity, the distributional integration-by-parts/dual variation formula and the quadratic norm identity. For , the unique squared-error minimizer is simply .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 63 7 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A stability analysis asks whether perturbations in an evolution remain bounded on a fixed physical time interval by a constant independent of the mesh. For a linear update , the basic requirement isThis permits physical growth bounded by ; it need not require every step to be a contraction. Consistency of a numerical method measures how well its stencil reproduces the differential equation, whereas stability of a numerical method controls the accumulated defects. For a well-posed linear problem, the Lax equivalence theorem connects stability and convergence for a consistent approximation in the specified norm.
On the whole line or a periodic grid, constant-coefficient stencils commute with translations. The Fourier modes diagonalize such spatial operators, turning a scalar one-step scheme intoThe Fourier symbol is found simply by replacing a shift by . The Parseval identity makes this modal calculation a norm estimate: if at every resolvable frequency, then the discrete norm cannot increase. More generally, a uniform gives and a fixed-time stability bound. All frequencies matter, including those near the grid scale; a small-wavenumber expansion establishes consistency but cannot test the entire stability range.
For the heat equation, put and . The Forward Euler diffusion scheme hasThe condition for every is exactly . This illustrates a parabolic time-step restriction . The Backward Euler diffusion scheme instead haswhich is contractive for every . The Crank-Nicolson diffusion scheme hasand is likewise unconditionally stable. However, its high-frequency amplification approaches for large , so it need not damp rapidly decaying modes effectively and may produce alternating transients from nonsmooth data. An A-stable time integrator can stabilize a diffusion semidiscretization with left-half-plane spectrum, but damping and accuracy remain separate questions.
For transport , define the hyperbolic Courant number . Forward Euler with a centered spatial difference gives and . It is unstable under a fixed nonzero CFL ratio. For , the upwind finite difference scheme hasThus is the stable range. Upwinding for negative reverses the spatial difference and gives . The Lax-Wendroff advection scheme gives a second-order example:It is stable for , but that result does not imply monotonicity or exclude oscillations at shocks. The Courant–Friedrichs–Lewy condition has a domain-of-dependence interpretation for explicit hyperbolic schemes; the Fourier calculation supplies the sharper algebraic stability criterion for the particular stencil.
For multilevel methods, each frequency gives an amplification polynomial and a companion matrix. Every amplification root must lie in the closed unit disk, with unit-modulus roots simple. Uniformity across frequencies and meshes is essential: one also needs control of the associated matrix powers, for example through a uniformly bounded diagonalization or the uniform power bound from separated amplification roots. A repeated unit root generates a Jordan block and polynomial growth in the number of steps. The same issue occurs for systems: checking only eigenvalue moduli of a nonnormal Fourier amplification matrix is insufficient. For instancehas unit eigenvalues but no fixed-time mesh-uniform bound as . For a hyperbolic system with a constant coefficient matrix admitting a uniformly bounded characteristic diagonalization, scalar modal estimates for each characteristic speed do give a system estimate. A positive energy symmetrizer provides another route. Frozen-coefficient Fourier tests for variable coefficients are useful local diagnostics, but a global estimate must also account for coefficient variation and boundary terms.
Boundary conditions change the allowable modes and can change the conclusion. A periodic calculation is exact only for a periodic closure. On a finite interval with zero Dirichlet boundary conditions, the centered diffusion matrix is diagonalized instead by the discrete sine transform. On interior points its eigenvalues are before scaling by . Thus the exact fixed-grid Forward Euler restriction iswhich tends to the whole-line threshold as the grid is refined. Backward Euler and Crank-Nicolson remain stable for all nonnegative . An appropriate Neumann boundary condition uses cosine-type modes and includes a constant mode with eigenvalue zero. The constant mode must be preserved, rather than forced to decay; depending on the boundary stencil, the natural discrete inner product may have endpoint weights.
For hyperbolic transport, the continuous and discrete boundary closures must respect the direction of propagation. If on , prescribe the left inflow value; prescribing an independent outflow value can overdetermine the problem. The energy method exposes this directly:Homogeneous inflow is dissipative, while forced inflow contributes data to the estimate. A compatible upwind boundary update has the same one-sided information flow. For diffusion,The last term vanishes for homogeneous Dirichlet or Neumann conditions. With Robin boundary conditions of dissipative sign it contributes a further nonpositive term. A non-dissipative boundary can produce genuine PDE growth, which a valid stability estimate should represent rather than incorrectly suppress.
Even a perfectly stable interior symbol cannot detect every defective boundary closure of a difference scheme. As a concrete counterexample, leave a stable explicit heat stencil on all grid points away from the left endpoint, but replace its first interior row by , still keeping . The interior Fourier symbol is unchanged, yet makes the finite-interval update unstable. The faulty boundary-adjacent row creates a mode absent from the periodic interior calculation. Thus the entire finite update matrix, or an energy estimate including its boundary rows, must be examined.
A more systematic boundary stability of a finite-difference method analysis transforms time and any tangential spatial variables, then looks for modes with and on a half-line. The interior dispersion relation selects decaying spatial modes; the boundary equations must determine their coefficients without admitting a nonzero growing homogeneous mode. A uniform inverse estimate for the boundary system, expressed by the Uniform Kreiss--Lopatinskii condition, also rules out arbitrarily weak boundary control near limiting frequencies. Merely excluding one obvious unstable mode is weaker than proving a mesh-uniform estimate. Discrete summation by parts and suitable boundary penalties offer an energy-based alternative.
Finally, nonlinear scalar conservation laws can develop discontinuities, so linearized Fourier stability is only one part of the analysis. A monotone conservative scheme, such as the Engquist-Osher method under its CFL restriction, has an invariant state range and L1 contraction of a monotone conservative scheme, with a discrete entropy inequality selecting admissible shocks. These complement the Fourier and boundary estimates. For an evolution problem, the meaningful outcome is a stability bound in a specified norm, uniform over the chosen mesh family and compatible with the actual boundary and initial data.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 63 6 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The Engquist-Osher method is a conservative finite volume method built by separating positive and negative characteristic speeds. Take , a uniform cell width , a time step , and cell averages . Write and define the numerical fluxThe Engquist-Osher flux uses the left state for right-going transport and the right state for left-going transport. Its conservative update isIt is consistent because . The integrals have their ordinary oriented meaning even for negative states. For the Inviscid Burgers equation, gives the useful exampleIn a region where all characteristic speeds have one sign, the flux reduces to the corresponding upwind flux. In smooth regions, this basic piecewise-constant, forward-time version is first order in space and time; its main virtue is robust nonlinear stability across shocks.
Here is a precise stability proof. Assume the data lie in a bounded interval and chooseWork on a periodic grid, or on the infinite grid with summable differences; on a finite interval the inflow boundary data and boundary fluxes must be treated monotonically as well. Define the three-point update mapWriting and , its three partial derivatives areThus it is a monotone conservative scheme. Since , comparison with the constant states provesThe interval is invariant, so the same Courant–Friedrichs–Lewy condition remains valid at every step. This is an bound relative to constant states, not a claim that arbitrary pairs of solutions are contractive in .
For a stronger perturbation estimate, let denote the global update and use componentwise maxima. Monotonicity gives . ThereforeSum over the grid. The shared interface flux cancels telescopically, so conservation givesInterchanging and adding yields the L1 contraction of a monotone conservative scheme:This is a mesh-independent nonlinear stability estimate. On an infinite grid the telescoping argument is justified by summability of the differences and the bounded characteristic-speed range, or by truncation followed by a limit. For unequal prescribed boundary data, additional boundary flux terms enter the estimate.
The method is also a total variation diminishing scheme. Let shift a grid sequence by one cell. Translation invariance gives . Applying the preceding contraction to and showsHence initially finite discrete total variation cannot grow.
Finally, monotonicity supplies a discrete entropy inequality, explaining why the stability is compatible with the physically admissible entropy solution. For a constant , defineComparison of with the clipped triples above and below givesIndeed and , and subtracting these two update formulas yields exactly the right side. Also , the Kruzhkov entropy flux. Under the displayed CFL condition the method therefore has an invariant state range, contraction, decreasing discrete total variation and entropy dissipation. These estimates remain meaningful at discontinuities, where linearized Fourier analysis alone cannot establish the corresponding nonlinear stability.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 63 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For fixed finite matrices, the matrix exponential and a Taylor expansion showThis agrees through degree two with , even when and do not commute. On a fixed time interval, and the telescoping identityturns the one-step defect into global error for . Hence Strang splitting is second order in general; for commuting matrices it is exact.
For the spatial discretization, use , and the interior vector , with . The central finite differences giveHere lists lower diagonal, main diagonal and upper diagonal, in that order. Thus and . Discrete summation by parts givesThe matrix exponential is consequently a contraction in the Euclidean norm, while is an orthogonal matrix for real . ThereforeRepeated split steps are contractive in the mesh-weighted norm , uniformly in the spatial mesh and without a Courant–Friedrichs–Lewy condition. The split semidiscretization is unconditionally stable. No commutativity or shared eigenvectors are needed for this Strang splitting contraction for symmetric diffusion and skew advection. Its time-order proof is for fixed spatial matrices; as , commutators can grow, so this stability result alone is not a uniform-in-mesh second-order error estimate.
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






