Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the differential equations and applications course of the University of Oxford 2009 A 1 d Solution by
Codex 0 2026-10-31
For negative the fast arrows reverse: the outer branches become repelling and the middle branch attracting. On the middle branch the slow equation is , so the slow motion goes away from the saddle equilibrium at zero towards a fold.
At , , so : the trajectory immediately escapes to the right. At , , so it also moves rapidly right and escapes. In each case the large- balance is , with decreasing; it is not a bounded relaxation cycle.
At , , so the initial fast motion is rightward. At nearly fixed it approaches the attracting middle root of , approximately . It then moves slowly down/right along the middle branch towards , leaves that fold to the right, and eventually escapes. These are the small-negative- limiting descriptions; the fold locations and fast landing point receive small corrections. The right panel of the figure distinguishes this slow excursion from the two immediate escapes.
Past exam of the differential equations and applications course of the University of Oxford 2009 A 1 c Solution by
Codex 0 2026-10-31
On the attracting right branch, and , so the motion goes from towards the fold . At essentially fixed it jumps to the other attracting root . The left branch then carries it to , where it jumps right to . This gives the clockwise limiting relaxation oscillation shown in the preceding figure.
Past exam of the differential equations and applications course of the University of Oxford 2009 A 1 b Solution by
Codex 0 2026-10-31
The nullcline is . Write . Away from it at an order-one distance, is order one on the indicated finite phase-space scales. Thus while : the trajectory changes on the fast time in a singular perturbation , with only an change in . Equivalently , which explains the nearly horizontal motion.
For positive , makes the branches fast attracting and the middle branch fast repelling. The arrows point right where and left where , carrying a generic off-nullcline point towards an attracting branch. The reduced description changes near a fold, where ; the rapid/slow distinction there needs a separate transition layer.
Past exam of the differential equations and applications course of the University of Oxford 2009 A 1 a Solution by
Codex 0 2026-10-31
Define the auxiliary variable . Differentiating gives , while rearrangement gives . Conversely eliminating recovers the second-order equation, so this phase plane system is equivalent. At an equilibrium forces , and the first equation then forces . Its Jacobian matrix isThus . Expanding givesFor sufficiently small positive both are positive: the equilibrium is an unstable node. For negative the fast root is negative and the slow root positive, so it becomes a saddle equilibrium.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 4 b Solution by
Codex 0 2026-10-31
Try , . The boundary data force and . The time derivative scales as , advection as and the source as . Balancing all three gives and . Substitution then yieldsFor the pointwise initial trace at any fixed , the far-profile requirement is as on any smooth branch extending that far; a compact-support continuation also meets it. Solving or selecting a shock continuation was not required. The time-dependent source is singular at , so the similarity reduction is stated on .
Past exam of the differential equations and applications course of the University of Oxford 2008 A 3 d Solution by
Codex 0 2026-10-31
The nonzero kernel of rules out a unique solution for every value of . By the Fredholm alternative, solvability requires orthogonality of the forcing to . Its pairing with isThus only is compatible. In that case and a particular solution is . All solutions areTherefore infinitely many solutions exist for , no solution exists for , and no parameter value gives a unique solution.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 3 c Solution by
Codex 0 2026-10-31
The adjoint also leaves invariant, with and . By adjoint in weighted coordinates, its matrix in the same basis is . Solving the two eigenvector equations givesThe basis is not orthonormal, so one must not simply transpose the previous numerical matrix without accounting for its Gram matrix. Directly transposing the integral kernel avoids that error.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 3 b Solution by
Codex 0 2026-10-31
Every eigenvector with eigenvalue different from one lies in , because . The elementary overlaps are , , . ThusIts characteristic polynomial is , so the finite-multiplicity eigenpairs areEach eigenspace has dimension one. On , both integrals defining vanish, so . Thus is also an eigenvalue, of infinite multiplicity, and there are no others.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 3 a Solution by
Codex 0 2026-10-31
Write the integral part as , where and . The kernel is real, so its adjoint transposes the two arguments. HenceThis follows by exchanging the two integrations in the inner product; the exponential factors make the finite-rank operators bounded.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 2 e Solution by
Codex 0 2026-10-31
The integral equation says precisely with the homogeneous mixed endpoint conditions. Since the supplied satisfies those conditions, apply directly:No integration is required. The absence of a zero eigenvalue established in (b)–(c) also proves uniqueness of this recovered forcing.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 2 d Solution by
Codex 0 2026-10-31
Expand a forcing in the complete orthonormal basis . Since , its inverse multiplies the th coefficient by . ConsequentlyThe negative sign follows from the eigenvalue convention . This kernel satisfies the mixed endpoint conditions in its first argument and .
Past exam of the differential equations and applications course of the University of Oxford 2008 A 2 c Solution by
Codex 0 2026-10-31
The difference of two solutions would satisfy with , . This would be a zero eigenvalue of the homogeneous problem, but part (b) shows there is none. Hence at most one solution exists. For continuous forcing the standard second-order existence construction also works: the free initial slope is fixed by an equation with coefficient . Thus for the stated regular boundary-value problem the solution is unique even with nonzero endpoint data.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 2 b Solution by
Codex 0 2026-10-31
The equation is . If , the linear or hyperbolic branches cannot meet both homogeneous endpoint conditions nontrivially. Otherwise , , and gives . ThereforeThe factor makes the eigenfunctions unit normalized. All the eigenvalues are positive, in particular none is zero.
Past exam of the differential equations and applications course of the University of Oxford 2008 A 2 a Solution by
Codex 0 2026-10-31
Let on the mixed endpoint domain , in . Integration by parts gives the boundary formAt zero, is free, forcing ; at one, is free, forcing . Therefore the formal adjoint expression and full adjoint endpoint conditions coincide with the original ones:With the usual second-order operator domain this is a self-adjoint problem. The consequences for its eigenvalues and eigenfunctions follow below.
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






