Asymptotic analysis 2026-10-14
Asymptotic analysis describes what remains dominant as an argument approaches a specified limit. It compares functions or sequences by scale: how much of a complicated expression can be replaced by a simpler one, and how large is the omitted part? The limit may be for a growing input or for a shrinking approximation parameter.
For example, is eventually dominated by its quadratic term, since division by gives . But at , the linear term contributes , compared with only from the quadratic term. A statement about the limiting scale and a good approximation at a particular input are different claims.
Three useful comparisons keep their strengths distinct. Big O notation supplies an eventual upper bound up to a constant multiplier; big theta notation supplies both an upper bound and a lower bound up to constants; asymptotic equivalence makes the ratio tend to one. Little o notation says that a term becomes negligible relative to a specified scale. These distinctions make approximations checkable instead of merely calling one expression small.
The same language connects time complexity with Taylor remainders. In an operation-count model, one asks how a cost scales with input size. In a Taylor expansion, one asks how the approximation error scales with the increment. Neither use requires interpreting the unspecified constant as one. The asymptotic comparison of exponential functions gives another example: dividing by the largest contributing exponential reveals the terms that disappear.
Bennett rate function 2026-10-05
The Bennett rate function has Taylor expansion near zero. It is the optimized exponent in the Chernoff bound based on the moment-generating function estimate for the Bennett inequality.
A transformed-response regression estimates the conditional mean on the transformed scale. Inverting that mean does not generally estimate the original-scale mean, because nonlinear transformations do not commute with expected values. For a smooth inverse and centered transformed error of variance , a second-order Taylor expansion gives the displayed local correction. For at positive , it is . The variance is the response's residual variance, not the sampling variance of the estimated mean. This approximation requires errors small enough that the inverse is meaningful over the relevant range; it is not an exact moment formula for arbitrary transformed noise.
Bounded density tilt 2026-10-07
For bounded measurable with , the formula defines a normalized positive probability density function for . A uniform Taylor expansion of the square root proves differentiability in quadratic mean with score function : the squared remainder is . Such paths realize all bounded centered directions of an unrestricted density model.
Central limit theorem Created 2026-09-24 Updated 2026-10-14
Let be real independent and identically distributed random variables with expected value and finite, strictly positive variance . Write and for their sum and sample mean. The central limit theorem statesPrecisely, for every real ,where is the standard normal distribution function. The conclusion is convergence in distribution to the standard normal distribution. If the variance is zero, every observation equals almost surely; the displayed normalization is then undefined and there is no fluctuating error to describe.
The striking feature is that the observations need not have a normal distribution. They may be binary, bounded, or strongly skewed. Their detailed probability distribution disappears from this limit except through the expected value and variance. The subtraction removes predictable growth: . The division implements variance normalization: variance additivity for independent random variables gives , so every has expected value zero and variance one. For nonzero , an uncentered sum drifts; without rescaling its spread grows.
For a concrete example, let each have a Bernoulli distribution with success probability . Then has a binomial distribution, with expected value and variance . Its exact probability mass function and its normalized count areHere is a binomial coefficient. Individual trials are conspicuously skewed, yet their centered, rescaled counts approach the same standard normal distribution as sums of fair trials.
Exact standardized binomial distributions approach the standard normal curve
. For independent Bernoulli trials with , each blue bar has width equal to the normalized lattice spacing and area equal to the exact binomial distribution mass at its center. Heights are mass divided by spacing, so they can be compared with the orange probability density function of the standard normal distribution. All four normalized counts have expected value zero and variance one. The rectangles visualize discrete masses; they do not make the discrete probability distributions continuous. Details.At , has expected value and standard deviation . The exact binomial distribution gives . A normal approximation with the continuity correction uses the interval to :The small discrepancy is an approximation error, not an equality supplied by the central limit theorem.
The strong law of large numbers and weak law of large numbers locate the average: , respectively by almost sure convergence and convergence in probability. The central limit theorem magnifies that shrinking error and describes its shape. In terms of the sample mean, the resulting normal approximation is , with standard error . This explains why four times as many independent observations halve the standard error. When is known, has approximately coverage for at large , giving a confidence interval. This coverage refers to repeated samples, not a guarantee for an individual interval.
A useful application is the Monte Carlo method: estimate a success probability by the proportion of successful simulated trials. Nicholas Metropolis and S. Ulam's original paper, "The Monte Carlo Method" (1949), illustrates this with games of solitaire and estimation of a region's volume by randomly selected points, and discusses why estimates require probabilistic error control. The strong law of large numbers justifies convergence of such proportions for independent repetitions; the central limit theorem supplies their large-sample error scale when .[ref]
https://hedibert.org/wp-content/uploads/2013/12/1949MetropolisUlam.pdf. Metropolis and Ulam, The Monte Carlo Method, JASA 44 (1949), 335–341, especially pp. 336–337
There are three useful limits to this picture:
- A heavy-tailed distribution can have infinite variance, so the displayed hypothesis must be checked. A Pareto distribution with minimum one and shape has finite expected value three but infinite variance. The strong law of large numbers still applies, but the stated central limit theorem does not. More dramatically, the Cauchy sample mean has an unchanged distribution: even averaging need not concentrate when the expected value is undefined. A heavy-tailed distribution with finite variance is allowed by the stated central limit theorem.
- Independence matters. If all equal the same nonconstant Bernoulli random variable, then and . There is no accumulation of new information, and the variance of the sum grows like , not . Other versions of the central limit theorem can allow dependence, but require hypotheses controlling it.
- Convergence in distribution is a limiting assertion, with no universal sample size or error rate under finite variance alone. It does not automatically give accurate relative estimates of very small tail probabilities. Nor does it mean that discrete point masses converge as probability density functions: a binomial distribution remains discrete for every finite . If the success probability changes with so that and , the relevant result is the Poisson limit theorem, rather than the fixed- argument above.
A historical original-paper reference is J. W. Lindeberg's "Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung" (1922), published in Mathematische Zeitschrift 15, pp. 211–225. The Lindeberg condition and Lindeberg-Feller central limit theorem below describe a version for sums whose summands need not share a probability distribution.[ref]
https://doi.org/10.1007/BF01494395. Lindeberg, Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung (1922)
A brief proof outline uses the characteristic function of . Its expected value is zero and its variance is one, so the finite second moment givesThe Taylor expansion of the complex exponential, with its remainder controlled by , and the dominated convergence theorem justify this step without a third-moment assumption. Independence then gives the characteristic function of :The limit is the characteristic function of the standard normal distribution; the Lévy continuity theorem turns this into convergence in distribution.
Compact fourth-order Helmholtz stencil 2026-10-14
Let have center weight , axial weights and diagonal weights , and let have center weight and axial weights . Taylor expansion gives and . On a smooth solution of the constant-coefficient Helmholtz equation, the second-order term becomes . Thus the normalized PDE residual is fourth order, while the original unscaled stencil residual is sixth order. This local cancellation alone does not prove uniform global accuracy at or near a resonance.
Embedded Runge-Kutta pair Created 2026-10-14 Updated 2026-10-14
Two Runge-Kutta methods share a stage matrix and nodes but use different output weights. An order- and order- pair with gives an output difference generally of order , estimating the lower-order defect. Shared stage evaluations reduce the cost. The adaptive step-size controller exponent must reflect this estimator order, rather than blindly the higher reported solution order.
Using the slope convention for Runge-Kutta stages, an embedded Runge-Kutta pair computesIts Butcher tableau has two output rows, and . Evaluating is often the expensive part of solving an ordinary differential equation; after the shared slopes have been computed, the extra row needs only another linear combination.[ref]
Write for the exact endpoint from the current numerical state, and define signed local defects and . Then . If and , with , the difference reproduces the leading lower-order defect. It does not reproduce the leading higher-order defect. Here the powers use big O notation and a smooth Taylor expansion; a vanishing leading coefficient or accidental cancellation can make the estimate misleading.
A common choice accepts after testing with absolute and relative error tolerances. With the scale approximately unchanged on a retry, the adaptive step-size controller uses exponent . Accepting a better endpoint does not change the power in the quantity being tested. The Euler-Heun embedded pair makes this visible without a large coefficient table.[ref]
Euler-Heun embedded pair 2026-10-14
The Euler-Heun 1(2) pair combines the explicit Euler method and Heun's method. Here 1(2) names their respective order of a numerical method; the accepted endpoint in this article is the second-order one. Its shared Runge-Kutta stages and endpoints areThe first output row in this Butcher tableau is Heun's method; the second is the explicit Euler method. Both outputs cost two evaluations of together, rather than one for Euler method plus two for a separately computed Heun's method.
For the initial value problem , , take . The first slope is ; the stage state is , giving . ThereforeThe exact exponential function gives signed local defects approximately for the explicit Euler method and for Heun's method. Their difference is exactly . Thus the pair difference estimates the larger Euler defect; calling it the actual Heun defect would miss by a factor about fourteen here.
More generally, a step from on hasThese original Taylor expansions separate three quantities: the accepted Heun's method has local truncation error and global error under suitable numerical stability, while the tested local error estimator is . For with held approximately fixed, use . A cube-root update would model a different quantity, the actual higher-order local defect.
Stipulate a fixed source point mass , two equal test particles of mass , and . This is a chosen model, not a measurement of a particular object. Place the test particles on the outward radial axis at and , with midpoint distance and separation . Neglect their mutual attraction, other sources and all supporting forces.
Each signed radial gravitational acceleration is inward:Their separation has outward relative accelerationThe exact value is . The midpoint tidal tensor predicts , an underestimate of relative to the exact value. For these equal masses, the difference of external forces has the same numerical value in the SI unit of force, the newton. It is not an additional mutual force between the test particles.
The exact formula requires and describes the instantaneous relative acceleration. Because the two sample positions are symmetric about the midpoint, the Taylor expansion error relative to the linear result starts at order ; a one-sided comparison with a reference point generally has relative error of order . If either test particle enters an extended source, use that source's interior Newtonian gravitational field instead of extrapolating the singular point mass model.
The Taylor expansion of the exact-solution residual for a linear multistep method has the same coefficient sequence asVanishing through degree is therefore equivalent to order at least . Exact order additionally requires a nonzero coefficient at degree . This symbol conveniently collects all polynomial consistency and order conditions.
Four-neighbour mean expansion Created 2026-10-07 Updated 2026-10-14
Fourth-order centered second derivative 2026-10-14
This symmetric finite difference method approximates a second derivative with for sufficiently smooth functions. Matching the constant, second-derivative and fourth-derivative coefficients of a symmetric five-node Taylor expansion determines the displayed weights uniquely; its sixth-derivative coefficient is nonzero. The Fourier symbol is . Thus the semidiscrete heat equation is contractive in the discrete L2 norm by the discrete Parseval identity. This says nothing by itself about stability of a subsequently chosen time update.
Free fall in a constant gravitational field 2026-10-14
Take downward displacement as positive, assume a constant gravitational acceleration , and release a point mass from rest at . Integrating twice givesFor a downward distance , the arrival time and speed areFor the model values and , these are approximately and . Doubling the height multiplies both quantities by ; it does not double them. The same speed follows from the work-energy theorem, .
For intervals of length , the successive downward displacements areThus equal spacing in time produces increasingly separated positions. This is the odd-number pattern in Galileo's result. It assumes constant acceleration and release from rest; a nonzero initial velocity adds a linear term to .
The approximation can be estimated for a spherical source of radius and standard gravitational parameter . Writing , the gravitational magnitude at height isFor , a Taylor expansion gives . Small height relative to the source's radius makes nearly constant gravity plausible; negligible drag force remains a separate requirement.
Gaussian envelope in a Klein-Gordon medium 2026-10-14
For the stipulated Klein-Gordon packet velocities, take the original normalized spectral amplitudewith and . Here is the width of the spectral amplitude, not the standard deviation of its squared magnitude. Initially , a Gaussian function multiplying a carrier wave. Taking gives a real solution of the Klein-Gordon equation with the corresponding initial velocity. The tiny negative- tail is retained in this exact integral; the statement that it is mainly right-going is a narrow-spectrum approximation, not a claim of strictly positive wavenumbers.
Original Klein-Gordon packet evolution: exact spectral integral, slower envelope and carrier phase reference
. Details. The dimensionless figure uses and at . Blue curves are , orange bounds are , and the marked carrier wave reference is ; it need not be a crest of the full wavefield. The dashed envelope-centre reference is a leading approximation. These are calculated curves, not experimental records. The exact dispersion relation makes the packet slightly asymmetric; a quadratic approximation predicts symmetric broadening about .
The first-order Taylor expansion translates the initial wave envelope without changing its shape. Retaining curvature instead givesThe distinction between translation and curvature-driven spreading is the same one exposed by the Gaussian pulse calculation in Pulse Propagation by Richard Fitzpatrick (equations 9.8–9.18). Its first-order approximation is not an assertion that a dispersive packet keeps its shape indefinitely.
Evaluating the quadratic Gaussian integral gives the original approximationand henceHere is the amplitude width: the standard deviation of the normalized intensity is . The peak falls as the packet widens, while stays constant. This conserved integral is not the complete physical wave energy of the Klein-Gordon equation.
Rigid translation requires . The quadratic approximation can allow that quantity to be order one, but still requires the accumulated neglected cubic wave phase to be small over the appreciable spectrum, for example . This sufficient check controls only the stated three-width spectral window; the Gaussian tails must also be negligible at the required accuracy. Higher derivatives or very long times require returning to the exact spectral integral. The width is therefore a controlled local approximation; it neither predicts front velocity nor establishes a universal identity between group velocity and information velocity.
Gaussian peak behind Stirling's formula 2026-10-14
Repeated integration by parts gives the Gamma integralThe logarithm of its integrand is , whose unique maximum is at . Write . For fixed and large , a Taylor expansion givesThe Big O notation here is for a fixed , or uniformly for in a fixed bounded interval. It does not claim a uniform approximation over the entire growing integration domain. Consequently the peak, divided by its height, approaches .
The exact substitution givesReplacing the integral by the Gaussian integral produces . Thus the estimate is peak height times width times the area of a standard Gaussian peak. This is Laplace's method in a concrete form; controlling the integral's tails justifies the replacement. The next terms, including their products after exponentiation, produce the Stirling correction by Gaussian moments.
For a binary star viewed far from its centre of mass, let be the separation and the reduced mass, the total mass, and . The Taylor expansion of the point-mass Newtonian gravitational potential has zero dipole because . Its second moment is , soThis holds for an instantaneous separation in any orbit, not only a circular orbit. The mass quadrupole moment convention gives .
Group velocity Created 2026-09-24 Updated 2026-10-14
The group velocity of a differentiable, real dispersion relation branch isIt describes the leading translation of a narrow-band wave packet centred on wavevector , assuming a linear model, a locally uniform medium and negligible loss. Narrow-band means that the appreciably excited wavevectors occupy a small neighbourhood on which one smooth branch can be linearized. Write its complex wavefield asThe Taylor expansion givesThus the rapid wave phase follows the phase velocity, while the slowly varying wave envelope follows the group velocity. This Fourier analysis argument is an outline of the approximation, rather than a statement that every wave packet translates rigidly forever. In one dimension a useful short-time condition is , where is the characteristic spectral width; neglected higher derivatives must also remain small. Curvature of the dispersion relation eventually changes the wave envelope.[ref]
Two nearby plane waves make the derivative visible without an integral. For equal wave amplitudes , define , , and . The superposition principle gives the exact identityThe periodic wave envelope has speed , approaching group velocity as the two wavenumbers coalesce, while the carrier wave phase has speed . Two tones alone form an infinite beat train, not a localized wave packet. The figure shows an exact two-tone surface gravity wave model with dimensionless : , . Its carrier phase velocity is approximately , its finite-difference envelope velocity approximately , and is the limiting group velocity. The marked carrier phase line need not coincide exactly with a maximum of the full modulated wave.
Exact analytical two-tone gravity-wave model: carrier phase advances through a slower periodic envelope
. Details. The deep-water surface gravity wave therefore has , whereas the deep-water capillary wave limit has : crests can drift either forward or backward relative to a wave envelope. For finite-depth surface gravity waves, differentiating the dispersion relation givesHere is the hyperbolic sine. The shallow-water limit has ; the deep-water limit has .[ref]
In the wave tank, produce a finite train with a smooth turn-on and turn-off and time the same wave envelope feature at two probes separated by distance ; its transit estimate is . Independently follow wave crests through that train. Techet's 2003 lab asks students to observe a deep-water train's foremost crest disappearing as the group moves forward, and to compare deep- and shallow-water cases. The interpretation is that a wave crest overtakes the slower wave envelope, dwindling at its front while other crests become visible at its rear. This is a qualitative expected observation in the teaching protocol, not a published set of measured curves.[ref]
A useful controlled version keeps the paddle wave amplitude small, records and , and checks both and . Compare runs with and , rather than assuming every ripple tank is shallow relative to every wavelength. Increase train duration at fixed central frequency to narrow its spectrum, and check that the envelope transit estimate stabilizes. Calibrate both probes, sample fast enough to resolve the carrier, and compare records before reflected waves return; an absorbing beach reduces this contamination. A current changes laboratory velocities, large wave amplitudes introduce nonlinear effects, and very short wavelengths require surface tension. Strong damping or noticeable reshaping makes the chosen threshold or peak an unreliable marker of simple group velocity. These are proposed controls and model limits, not claims that the cited lab measured every correction.
Three velocities should consequently be kept separate. The group velocity predicts narrow-band wave envelope motion. An energy-transport velocity is energy flux divided by energy density, using the appropriate time average; it agrees with group velocity in standard lossless linear wave models when all stored energy is included.[ref] A signal-front velocity concerns the earliest response to a new disturbance and requires a causal model over its full spectrum. A strictly band-limited wave packet has no sharply bounded onset, and a mathematical two-tone envelope cannot test front arrival. In strongly absorbing or broadband propagation, a single group velocity need not describe the observed peak, energy transport, or first detectable response. A complex or also prevents interpreting its derivative as an ordinary real transport velocity without further analysis.
In particular, an unusually large or negative group velocity from pulse reshaping does not establish superluminal information transmission. For the causal dielectric model analysed by Fitzpatrick, the field ahead of the front vanishes for , even when its phase velocity exceeds the vacuum speed of light . That result concerns the electromagnetic model's causality; the ideal water-wave diagrams above contain no relativistic signal-front claim.[ref]
Finally, zero wavenumber requires care: the positive-frequency wave equation branch is not differentiable at , so it has no unique group velocity there, although its one-sided values are . A smooth gapped branch such as the Klein-Gordon equation instead has despite undefined phase velocity at . The same signed branch must be used in both derivatives and ratios; a negative group velocity means an envelope moving in the negative coordinate direction, not a negative elapsed time. The practical value of group velocity is precisely this translation between a local slope on a dispersion diagram and a measurable packet transit, with its assumptions made explicit.
The Gaussian envelope in a Klein-Gordon medium supplies a quantitative next step: the first derivative translates the wave envelope, the second derivative spreads it, and higher derivatives limit that approximation. At finite spectral width, a peak's measured speed need not equal the group velocity at the central wavenumber. Neither a peak nor a fixed fraction of its height generally identifies front velocity.
Heun's method 2026-10-14
Here Heun's method means the explicit endpoint-averaging Runge-Kutta method: take an Euler predictor , sample there, and average it with for the output. The second Runge-Kutta stage is evaluated at the predictor, not at the corrected endpoint. In particular it requires no implicit solve as the ODE trapezoidal rule does. Naming conventions vary between books; the formulas specify the method unambiguously.[ref]
Numerical solution of ordinary differential equations: One step methods by André Jürgen Massing. André Massing, Numerical solution of ordinary differential equations: One step methods, October 3, 2021, page 1, Example 1.1: Euler and Heun increment functions
For smooth , a Taylor expansion about gives , where is the state Jacobian matrix. Consequently the output is , matching the exact solution through degree two by the chain rule. This gives local truncation error and, with the usual bounded smoothness and Lipschitz continuity hypotheses on a fixed finite interval, global error . The Euler-Heun embedded pair compares this output with its Euler predictor.
Euler-Heun stage geometry for y prime equals y: sample at the Euler predictor, then average slopes for the corrected endpoint
. Details. For , and , the sampled slopes are and . Transporting the second slope to the starting point would end at ; the average slope instead ends at . The exact exponential function reaches . The magnified endpoint comparison separates the pair difference from the actual Heun local defect .
Higher-order saddle test 2026-10-14
Suppose a function near a critical point has Taylor expansion , where is its first nonzero homogeneous polynomial term. If takes both positive and negative values on directions, then is a saddle point of a scalar function. Indeed, on rays the leading term is ; for each chosen direction its sign dominates the remainder for small positive . This works even when the Hessian matrix is zero. For example, is negative on and positive on , hence detects a saddle despite having degree four.
Identical-mean EM trap 2026-10-14
In the Known-variance Gaussian mixture EM example, initialize both means at the same value . The mixture responsibilities are then for every observation. Each M-step sets both means to the sample mean, zero here; the next E-step again gives . Thus is a fixed point with log-likelihood , despite the better fit found from .
One can check the failure without trusting an iteration plot. Separate the means as and use the hyperbolic cosine identity:The Taylor expansion uses . Small nonzero separation therefore improves the log-likelihood, whereas translating both means to changes it by . This stationary point has both improving and worsening directions. Identical initialization cannot discover the separation because every observation keeps identical label probabilities. Trying several distinct initial fits and comparing their final log-likelihoods is useful, but does not prove global optimality.
Keeping the variance fixed also removes a different pathology. With known , every component probability density function is at most , so . If separate component variances are allowed to shrink without restriction, one mixture component can concentrate at an observation while another retains positive density at the other observations, making the likelihood function unbounded. The fixed positive variance in this example prevents that collapse; it does not remove initialization traps.




