University College London · FACULTY OF ECONOMICS

ECON0006 Chap.7 Boundary Value Problems

- one subject, every graph, every model, every mark
7 Chapters4-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 7 of 10 · ECON0006

Boundary Value Problems

Boundary Value Problems uses conditions at endpoints or other specified locations to select one path from a family generated by a higher-order equation. The equation's order indicates how much independent information is required. Initial-value data are concentrated at the start, whereas boundary data may be split across the domain. The selected path must satisfy both the dynamic relation and every supplied condition.

In this chapter

What this chapter covers

  • 01

    Second-order equations

  • 02

    Path families

  • 03

    Free constants

  • 04

    Independent conditions

  • 05

    Initial values

  • 06

    Boundary values

  • 07

    Whole-path verification

Worked example · free

Recognise an underdetermined path

Q [4 marks]. A second-order model has one endpoint value and no other condition. Explain the result. The marks shown in this condition audit are not from an official UCL allocation; they organise the practice response.
The faint curves satisfy a common dynamic shape, but only the highlighted path passes through both stated boundary values and therefore solves the full problem.The faint curves satisfy a common dynamic shape, but only the highlighted path passes through both stated boundary values and therefore solves the full problem.left boundaryright boundarytwo boundary conditions select one path
The faint curves satisfy a common dynamic shape, but only the highlighted path passes through both stated boundary values and therefore solves the full problem.
  • 1Count the free constants in the general path.
  • 1Compare them with the one independent condition.
  • 2Report the remaining family and the missing information.
One condition cannot select all constants, so a family of paths remains. The weighting is original practice guidance.
Sia tip — Count independent conditions before solving constants.
Glossary

Key terms

Initial value
A condition specified at the starting point of a dynamic path.
Boundary value
A condition specified at an endpoint or another stated location.
Path family
The collection of solutions remaining before enough independent conditions are applied.
FAQ

Boundary Value Problems FAQ

How many conditions does a higher-order problem need?

The equation's order indicates the expected number of independent pieces of information, but the conditions must also be compatible and genuinely independent. Check that each condition adds a distinct restriction.

Why are boundary problems not simple forward simulations?

Information at a later endpoint helps select the whole path, so the calculation must satisfy conditions at different locations simultaneously. Forward iteration alone may miss that endpoint requirement.

How do I verify a selected path?

Substitute it into the original dynamic relation and every initial or boundary condition. Matching endpoints alone does not prove the equation is satisfied between them.

How can I compare initial and boundary information?

Use the same dynamic relation twice, first with all conditions at the starting point and then with information split across endpoints. Count independent restrictions in both versions, show how each determines the free constants and verify the resulting paths. The comparison reveals that equation order controls how much information is needed, while condition placement controls how the path must be selected.

Study strategy

Exam move

Identify the equation order and count the free quantities in the general path. Translate each initial or boundary statement into a separate condition equation and check that it adds independent information. Solve the condition system without setting leftover constants to zero for convenience. Substitute the selected path into both the dynamic relation and all conditions.

For numerical solutions, inspect residuals and state the approximation convention. Keep an error log for wrong endpoint, redundant condition, missing constant and a curve that fits boundaries but fails the underlying equation. Build a comparison table with one initial-value problem and one boundary-value problem using the same dynamic relation.

In the first column, record where the information is supplied; in the second, show how it determines the free constants; in the third, state how the path is verified. This makes it clear that the distinction concerns the placement of conditions, not a different meaning of the underlying equation. Change one condition at a time and predict how the selected path should move before doing the algebra.

If the resulting path violates that prediction, inspect the condition substitution and the sign of each constant. Practise condition counting before attempting a solution method. For a first-order, second-order and small system example, write the expected number of independent restrictions and then classify the supplied information as sufficient, redundant, inconsistent or incomplete.

When two conditions appear similar, translate both into equations and compare their coefficient rows instead of assuming that two written statements provide two independent restrictions. If a free parameter remains, describe the whole solution family and what one further observation would identify. If a contradiction appears, retain it in the answer as evidence that no path satisfies every requirement.

For a numerical boundary calculation, separate model error from solution error. Record the grid or step convention, compute how closely the candidate satisfies the dynamic relation between endpoints, and report the residual at each stated boundary. Repeat with a finer convention when possible and compare the path rather than only the terminal number.

A visually smooth curve is not enough: it may interpolate endpoints while violating the law of motion. Write a short conclusion naming whether the result is exact or approximate, unique or one member of a family, and which conditions are responsible for that classification. On a timed question, reserve the final minute for a three-part audit. First substitute the proposed path into the original relation.

Next evaluate it at every initial or boundary location using the coordinates exactly as stated. Finally count the remaining constants and explain whether the conditions select one path. This closing sequence earns clarity even when earlier algebra is incomplete because it shows what a valid solution must achieve.

Avoid interpreting convergence, terminal targets or economic adjustment until this mathematical compatibility has been established.

Working through Boundary Value Problems in ECON0006? Sia is AskSia’s AI Economics tutor — ask any ECON0006 Boundary Value Problems question and get a clear, step-by-step explanation grounded in how ECON0006 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 32 of your subjects at University College London, plus 1,000+ more Bibles across the AskSia library.
Sia - your ECON0006 tutor, unlimited, worked the way the exam marks it
The full 4-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works