Additive composite expansion Created 2026-09-24 Updated 2026-10-14
An additive composite expansion combines an inner expansion and an outer expansion by subtracting their common behavior in the overlap region:
The subtraction removes the part counted twice. Near the boundary layer, the outer expansion cancels the overlap contribution; away from the boundary layer, the inner expansion cancels it. An error estimate is needed to establish accuracy across the whole domain.[ref]
For the singular perturbation problem , , , the outer solution is one, the leading inner expansion is , and their overlap is one. Thus . With , comparison with the exact normalized solution gives
The supremum norm error is therefore exponentially small on the entire interval, even though the outer solution alone has error one. This is an error bound for function values; errors in derivatives have additional powers of .
The composite satisfies the differential equation exactly but has right boundary condition . Dividing it by restores that boundary condition and recovers the exact solution. This example makes both the strength and the limit of matching explicit: it gives a global approximation, while finite- normalization can still carry information beyond every algebraic order.
Analysis Created 2026-09-24 Updated 2026-11-05
Analysis studies limits, continuity, derivatives and integrals, and the spaces in which these operations make sense. Its central question is how information about nearby or approximating objects controls an exact answer. Real analysis makes calculus rigorous; complex analysis studies holomorphic functions; functional analysis treats entire functions as points in spaces such as a Banach space or a Hilbert space.
For example, the geometric series gives . Passing to the limit gives only for . The restriction is part of the theorem: algebra supplies the finite identity, while analysis justifies the infinite operation. This distinction matters whenever differential equations or numerical methods replace exact quantities by approximations.
Asymptotic expansion Created 2026-09-24 Updated 2026-10-14
An asymptotic expansion describes a function near a specified limit by successively smaller scales. Each fixed finite truncation has a remainder smaller than its last retained scale. The central question is how the approximation improves as the parameter approaches the limit; convergence of the entire infinite series at a fixed parameter is a separate question. For the inverse-power scale ,
means that, for every fixed nonnegative integer ,
The little o notation makes the accuracy requirement precise. With expansions to all orders, this is also equivalent to an remainder after the th term; the implied bound may depend on .[ref]
For a quick convergent example, the finite geometric series identity gives
For , both the asymptotic expansion as and the ordinary convergent geometric series describe this function. The exact remainder displays the required extra inverse power.
The more surprising example under a divergent factorial series can approximate a convergent integral has a convergent integral but a divergent series at every fixed positive :
A few terms can estimate well, even though adding sufficiently many terms eventually destroys the approximation. Optimal truncation explains where to stop.
This makes asymptotic expansions useful when an exact expression is a complicated integral or differential equation solution, but a parameter is very large or very small. The leading term reveals the scale; corrections reveal which effects matter next. The asymptotic sequence must be specified: integer powers, fractional powers, logarithms, and exponential functions can encode different kinds of behavior. A good finite approximation includes a remainder estimate or an independently checked range of use.
Boundary condition Created 2026-09-24 Updated 2026-09-24
A boundary condition prescribes values of an unknown function or its derivatives at the boundary of the domain of a differential equation.
Boundary layer Created 2026-09-24 Updated 2026-10-14
A boundary layer is a thin region next to a surface in which viscosity remains significant even when inertia dominates the outer fluid flow. Its simplest example is laminar flow along a stationary flat plate: the no-slip boundary condition imposes zero velocity at the plate, while the outer velocity is . The resulting thin velocity profile contains a large normal velocity gradient, so small dynamic viscosity can still produce appreciable wall shear stress. The Blasius boundary layer makes this competition quantitative and explains how a plate aligned with the incoming fluid flow acquires drag.
The same balance appears in a singular perturbation of a differential equation: large derivatives in a thin region can keep a term with a small coefficient significant. For on with and , the inner variable resolves a left boundary layer of width .
Boundary value problem Created 2026-09-24 Updated 2026-11-05
A boundary value problem asks for a differential equation solution together with conditions on the boundary of a specified domain. These can prescribe the value, a normal derivative, a flux, or a combination. For an ordinary differential equation on an interval, the conditions are often distributed between its endpoints; a partial differential equation uses the spatial boundary and, for evolution, also needs appropriate initial data.
For the Dirichlet boundary conditions in
twice integrating gives . The boundary conditions determine the two constants. By contrast, for with derivative-zero conditions at both ends, integrating the equation requires and leaves an additive constant undetermined. This is the Neumann boundary-value problem compatibility and normalization issue.
Existence, uniqueness and continuous dependence on forcing belong to the whole operator/domain/boundary specification. A formal differential formula alone does not establish that a boundary value problem is solvable.[ref]
A bounded function on has a Laplace transform satisfying the displayed bound, by integration of . Consequently its Laplace transform cannot have a pole of order two or higher at . This can eliminate the arbitrary constant introduced when multiplication by turns an ordinary differential equation into a first-order differential equation for its Laplace transform.
For example, transforming with gives . An integrating factor yields
The bound forces , selecting . This selection can be justified without assuming unproved endpoint regularity for every solution: and have nonzero Wronskian on , so they form a fundamental system of solutions. Boundedness removes , and the limit at zero fixes the remaining coefficient. The endpoint limit by itself does not select a unique solution.
Brook Taylor Created 2026-10-13 Updated 2026-11-05
Brook Taylor was a mathematician whose 1715 work developed methods of finite differences and the expansion now called the Taylor series. He also studied vibrations of mechanical strings and mathematical perspective projection.[ref] A Taylor polynomial uses the derivatives of a function at one point to build a local polynomial approximation. For instance, near zero, . The remainder is essential: a finite approximation can have a controlled error without asserting that an infinite Taylor series converges to the function. This distinction makes the method useful in numerical analysis and local analysis of differential equations.
Figure 1.
Portrait of Brook Taylor
. Probably Louis Goupy, circa 1720; National Portrait Gallery, London, NPG 1920. Public domain (author died 1747; life-plus-100, pre-1931 U.S. publication) and faithful reproduction / PD-Art. Source and usage information on the linked Wikimedia file page. Source.
Calculus Created 2026-09-24 Updated 2026-10-18
Calculus connects local change with accumulated change. A derivative asks how fast a function changes near one input; an integral adds its contributions across an interval. The fundamental theorem of calculus explains why these operations fit together: accumulating a continuous rate produces a quantity whose derivative is that rate.
For example, suppose a particle moves along a straight line with position metres at time seconds. Its velocity is metres per second. Between and , adding the velocity over time gives
Here the velocity stays positive, so the displacement also equals the distance travelled. If the particle reverses direction, the integral of its signed velocity still gives displacement, while the integral of its speed gives total distance.
This is useful because local rules are often easier to specify than whole trajectories. A differential equation can prescribe a particle's velocity or a population's growth rate; integration then reconstructs its evolution, subject to an initial condition. In the other direction, a derivative extracts local information from a known function, and optimization uses that information to locate or approach promising inputs. The same two operations therefore connect measurement, prediction and design.
The visual connection is developed in derivative, integral and fundamental theorem of calculus. The definitions depend on limits, which turn progressively finer finite measurements into exact mathematical statements. A graph with a corner need not have a derivative there, and the conditions permitting integration or interchange of limits matter; calculus is more than a collection of symbolic rules.
Historically, Isaac Newton described changing quantities and their rates in the language of fluents and fluxions; his manuscript History of the Method of Fluxions records that approach.[ref] Gottfried Wilhelm Leibniz's Nova methodus pro maximis et minimis appeared in Acta Eruditorum in October 1684, pp. 467–473; the original article is preserved in the HKUST Library collection.[ref] The modern limit definitions used here should not be read back into those seventeenth-century formulations.
A catenary is the static shape of an ideal flexible, inextensible chain hanging under its own gravitational weight in a uniform gravitational field, with uniform linear mass density along its arc length. With the lowest point above , one convenient vertical origin gives
Here has units of length. The supports and the chain's arc length determine the scale and position; horizontal and vertical shifts give the general catenary. [ref]
For , the three points at have heights , , and . If heights should instead be measured from the lowest point, subtract :
The same three heights are then approximately , , and . The shift changes the vertical origin and preserves the catenary shape.
Figure 1.
A hanging chain follows a scaled hyperbolic cosine, with an optional shift of its lowest point to zero
. The left panel marks on . The right panel puts the lowest point at zero, compares three positive scales , and shows the local parabola for . Details.
The scale also measures tension: if is its constant horizontal component, is the linear mass density, and is the magnitude of gravitational acceleration, then . A short force balance explains this. For the portion from the lowest point to , with arc length , vertical tension balances its gravitational weight and horizontal tension gives
Applying differentiation yields . The proposed hyperbolic cosine solves this differential equation, because and . This is the mechanism behind the shape, under the stated ideal chain assumptions.
The same identity simplifies the arc length between symmetric supports at :
For , , exceeding the horizontal span of two. A larger at fixed gives a shallower sag: the Taylor series gives . Thus a parabola is a local approximation, while the exact ideal chain shape is a catenary. The useful connection is that the same hyperbolic Pythagorean identity controls its coordinates, force balance, and arc length.
Cathode-ray attenuation with finite detector acceptance Created 2026-10-18 Updated 2026-10-20
An original toy model separates two ways to lose a central cathode ray signal. Let be forward depth into a uniform gas. Normalize the entering electron population to one. Write for the fraction still in a narrow forward channel, and for the fraction diverted into a wider collection channel. Assume constant removal rate per unit depth in both channels, and constant transfer rate from to , with no return. Removal means that an electron stops or is trapped before reaching the collecting plane; it does not mean that its electric charge disappears. The wide ideal collector accepts all surviving members of both channels. This is a stipulated two-population differential equation model, not a general law of electron transport:
The first equation gives exponential decay. Adding the equations gives for , hence
These formulas also give a conservation check: . The fraction has been removed before the plane, while remains present but misses the narrow collector. An exponential fit to the narrow signal therefore measures , not the removal rate by itself. This is an identifiability issue: one declining signal cannot distinguish the two unknown rates.
For a worked example, choose and . These are invented teaching inputs, not measured coefficients for air or Lenard's apparatus. At ,
Thus about misses the narrow collector, although only about has been removed in this model. Treating the whole narrow-signal deficit as stopping would confuse redistribution with removal.
Figure 1.
Two collecting geometries distinguish redistribution from removal in a toy cathode ray model
. Original calculation with chosen constant rates and . Left: fractions in the narrow channel, diverted channel, and removed population sum to one. Right: logarithmic plots of the narrow and wide surviving fractions have different slopes. The marked depth is . This model omits electron slowing and return between channels; neither panel contains historical measurements. Details.
Suppose a calibrated readout is proportional to arriving electron number with the same response for either channel. Choose an empty-path signal arbitrary units, of which is background; the two collection geometries have the same calibrated reference. The calculated readings at are and . After background subtraction, define for each geometry. Then the original inverse problem has the solution
A single narrow reading would instead allow every nonnegative pair with . Using the raw ratios without subtracting gives an erroneous narrow rate of about . In a real fluorescent screen, the assumed response must be tested: deposited energy and conversion to light need not remain constant as electrons slow. Repeating the comparison at several depths tests the constant slopes, although straight slopes alone do not establish the microscopic mechanism.
Actual electrons change kinetic energy and direction. Electron stopping power describes mean kinetic energy loss per travelled path length ; collisional losses include ionization, while radiative losses include bremsstrahlung. The continuous slowing-down approximation range integrates reciprocal total electron stopping power, neglecting fluctuations. It approximates travelled path length, not forward penetration depth.[ref]
As a separate original limiting example, stipulate a straight path, constant , and entering kinetic energy . Then until stopping, and . In that deterministic model every entering electron reaches each depth below and none crosses a plane beyond it. There is no exponential population tail. Real fluctuations and electron scattering make the situation more complicated, but the example already proves that continuous energy loss does not imply constant-rate removal.
The window also changes the entering population: source kinetic energy before the foil need not equal just outside it. For an electron initially at rest, an ideal static accelerating electric potential difference supplies electrical work , where is the elementary charge. If losses before and within the foil total , a transmitted electron enters the observation chamber with . A screen's brightness determines neither nor . These formulas specify a modern ideal work-energy theorem argument; no numerical historical voltage or foil thickness is inferred from the diagram.
A change of dependent variable expresses the unknown function of a differential equation in terms of a new unknown, while keeping the independent variable fixed. For example, substituting in removes the first derivative and gives when are constant. Transforming the boundary conditions as well is essential, particularly for a Robin boundary condition.
Christian Clason Created 2026-10-13 Updated 2026-11-05
Christian Clason authored an introduction to finite-element methods. The approach replaces a differential equation with a weak formulation and a finite-dimensional approximation space, connecting functional analysis with a computable matrix problem.[ref]
Figure 1.
Portrait of Christian Clason
. External portrait hosted by University of Graz. Source.
Classical solution Created 2026-09-24 Updated 2026-10-25
A classical solution has enough ordinary derivatives for the differential equation and its data to hold pointwise. For the heat equation, and should be continuous in the interior, with the specified initial and boundary traces. A weak solution instead imposes an integrated identity, allowing less regular data; uniqueness must always be stated for the solution class used.
For a closed operator on a Banach space , a positive-time classical solution belongs to , takes values in for positive time, and has . It satisfies the differential equation and the initial condition in . Classical regularity also at time zero requires the corresponding regularity of the initial datum, in particular . For an analytic semigroup and Hölder continuous forcing, the variation-of-constants formula gives such a solution: subtracting the forcing at the current time turns the singular estimate into the integrable bound .
Collocation method 2026-10-14
A collocation method chooses an approximate solution from a finite-dimensional trial space and forces the residual of a differential equation to vanish at selected nodes. Collocation Runge-Kutta methods apply this principle to polynomial approximations on each time step.
Computational physics 2026-11-05
Computational physics uses numerical algorithms to obtain and test predictions of physical models. It includes solving differential equations, simulating stochastic processes and extracting physical quantities from data. The mathematical model, its numerical approximation and its agreement with an experiment are separate questions: an accurately executed algorithm can still solve an unsuitable model.
A simple example is the harmonic oscillator . The explicit Euler method advances it by
For a unit mass, define . Direct substitution gives
The physical oscillator conserves energy, but this algorithm creates it on every step. The discrepancy is a numerical effect, not a discovery about the oscillator. Changing the time step and comparing with a known solution exposes the problem; for long integrations, the choice of numerical method matters as well as the size of the step.
Richard Feynman's lecture on planetary motion gives a concrete historical teaching example: forces determine accelerations, which update velocities and positions through successive arithmetic steps. A computer extends the same approach to systems whose coupled motion has no convenient closed expression.[ref] Conservation checks, comparison against solvable limits, and convergence under finer numerical resolution help distinguish a reliable calculation from an attractive plot. Agreement with measurements then tests the physical model itself.
Constant of integration Created 2026-10-14 Updated 2026-10-31
On a connected open interval, if , every antiderivative of has the form , where is a constant function. Indeed, two solutions satisfy : the zero derivative on a connected open set principle makes their difference constant. In one dimension, the mean value theorem proves this on any closed subinterval. [ref]
An initial condition or boundary condition can determine . If a particular antiderivative is and , then
For , and , this gives . Without that reference value, choosing simply selects one member of the family.
The freedom has a physical meaning in a simple kinematic model. A velocity , with constant acceleration , determines position only as . The initial condition selects ; changing the starting position does not change the prescribed velocity.
For the differential equation on , the antiderivative is . The boundary condition gives . Discarding the constant of integration therefore needs a specified condition or an approximation that quantifies its effect. On a domain with several connected components, the freedom is larger: antiderivatives on disconnected domains require a separate constant on each component.
Coupled boundary condition Created 2026-10-25 Updated 2026-10-31
A linear boundary condition can relate traces at different endpoints rather than prescribe data independently at each endpoint. For a second-order differential equation, examples are together with another independent relation. The resulting operator domain determines whether the boundary form vanishes. Coupling by itself guarantees neither self-adjointness nor its failure.
Deterministic evolution Created 2026-10-14 Updated 2026-10-20
Evolution is deterministic when a specified initial condition and evolution rule select a unique future orbit. For a discrete dynamical system, applying the same map to the same state gives the same next state. For an ordinary differential equation, uniqueness of the initial value problem is required; merely writing a differential equation does not guarantee it.
Determinism permits both asymptotic stability and sensitive dependence on initial conditions. It does not by itself imply reliable prediction from approximate measurements, and sensitivity does not introduce a random choice into the evolution rule.