Ångström method worked example 2026-10-18
Consider an original stipulated model, not measured material data: thermal diffusivity , period , driven temperature amplitude , and thermometers at and . Without side losses, and thermal penetration depth . ThusThe two no-loss estimates and the combined estimate all return .
Now retain the same thermal diffusivity and drive but introduce . The exact complex wavenumber gives and , henceUsing attenuation alone with the no-loss formula would give ; using lag alone would give . Their disagreement is informative. If an independent volumetric heat capacity measurement gives , the combined estimate implies thermal conductivity and .
The exact complex amplitudes can be checked independently by discretizing and solving the resulting linear system with a tridiagonal matrix. Halving the spatial step quarters the discrepancy, as expected for centered finite differences. Separately fitting the real time traces to a constant plus sine and cosine terms recovers both amplitudes and their lag; this also checks the sign convention used in the combined estimate.
Bernoulli polynomial Created 2026-10-13 Updated 2026-10-20
The Bernoulli polynomials extend the Bernoulli numbers by inserting the exponential function into their exponential generating function:For example, , , , and .[ref]
NIST Digital Library of Mathematical Functions. Karl Dilcher, Chapter 24, equations 24.2.3–24.2.5 and Table 24.2.2
Their crucial property is a finite difference identity:Indeed, subtracting the two exponential generating functions cancels and leaves . Thus plays for discrete summation the role that plays for integration: taking a unit finite difference recovers .[ref]
Binomial inversion Created 2026-10-14 Updated 2026-10-20
These two finite-sum transformations are inverses over any commutative ring. Substitute one sum into the other and use . The inner alternating sum is by the binomial theorem, so only survives. In a Mahler expansion, is the nth finite difference of the sampled values .
Buffer capacity measurement 2026-10-14
A proposed modern measurement extends the weak acid dissociation measurement by estimating the local slope of an acid-base titration. Transfer a measured sample with a pipette into a stirred vessel; clamp a combination glass electrode/reference electrode clear of the stirring magnet and place a temperature probe nearby. A calibrated burette delivers a chemical base of independently standardized concentration , such as sodium hydroxide. Record the initial sample volume , cumulative delivered volume , stable pH, and temperature after each small addition. Use a separate fresh portion for an acidward series. These are proposed measurement conditions, not reported experimental results.
For the instrument calibration, use fresh standard buffer solutions bracketing the measured pH range, with values appropriate to the actual temperature. The Hanna manual specifies separate rinse and calibration portions, gentle stirring, and approximately immersion of the probe tip. It calls for stable readings; the sensing bulb and reference electrode junction must remain immersed. Rinse between standards and samples and avoid carrying rinse water into the measured portion.[ref]
HI5221 & HI5222 Instruction Manual: pH and mV and ISE and Temperature Bench Meters by Hanna Instruments. pp. 45–47: calibration portions, bracketing standards, temperature and immersion; pp. 49–50 and 74–75: stable readings, rinsing, junction immersion and drift
The readout pairs each added amount of substance with the measured pH. With negligible added volume, neighboring readings give the finite difference estimateassigned to the interval's midpoint. High buffer capacity appears as a small change of pH for a measured reagent dose. Choose increments small enough to resolve changing buffer capacity, but large enough that the change of pH exceeds measurement noise. Repeat with a fresh portion and different increment sizes; remeasure a standard afterward to check drift. A water blank can reveal contamination, but its pH must not be subtracted from the sample pH. These controls are proposed tests of the measurement and model assumptions.
If additions appreciably increase volume, even the analytical concentration changes: . Merely dividing the added moles by the current volume does not restore the constant-volume derivative. One alternative is explicitly to report a changing-volume convention. For , defineThis definition includes the reagent's changing concentration and differs from the constant-volume buffer capacity defined above.[ref]
Dynamic Buffer Capacity in Acid–Base Systems by Anna M. Michałowska-Kaczmarczyk and Tadeusz Michałowski. §2, Definition of Dynamic Buffer Capacity, equations (1)–(3): reagent concentration in the combined volume and its derivative
To compare with the constant-volume theory, fit the changing-volume chemical equilibrium model instead of treating the observed slope as . In the same ideal monoprotic acid system, define . For baseward additions, the electric charge balance at each reading isUse a minus sign before for the corresponding acidward series. From the model parameters, evaluate the constant-volume buffer capacity at the chosen analytical concentration and pH. The fit also tests whether one acid dissociation constant describes the observations.
Limitations include incomplete mixing, slow glass electrode response, uncertain reagent concentration, and changes in temperature or ionic strength. Dissolved atmospheric carbon dioxide introduces an additional chemical acid system; comparable exposure and freshly prepared samples help distinguish it from the intended monoprotic acid response. Additional reacting chemical species and nonideal activity coefficients invalidate the simple formula. Especially when pH increments are tiny, measurement noise can dominate the inferred derivative; reporting the dose, pH interval, volume convention, and repeatability is part of reporting a meaningful buffer capacity.
Circulant matrix Created 2026-09-24 Updated 2026-10-14
A circulant matrix applies the same rule at every position of a finite ring: moving both the input and output indices one step leaves its entries unchanged. Its first column determines the whole matrix. For a length- vector , index rows and columns by and defineThe indices use modular arithmetic. Thus each column is the previous column shifted down one place, with the last entry wrapping around to the top. Multiplication is exactly circular convolution:This makes a circulant matrix a natural model for a periodic finite difference rule or a filter acting on a periodic record. Strang's MIT lecture develops this connection between circulant matrices, circular convolution and the discrete Fourier transform.[ref]
For example, the first column givesHere the indices wrap around modulo four. Each output compares a value with its two neighbors; this is the Graph Laplacian of a four-vertex cycle graph. A constant input gives zero, while an alternating input gives a large response. The Fourier diagonalization of a circulant matrix makes this distinction exact: its four eigenvalues are .
Fourier eigenvectors of the four-point cycle Laplacian
. Details. The plotted discrete Fourier modes are complex vectors, shown through their real and imaginary parts. Each entry has modulus one; the Euclidean norm of each length-four vector is two. In particular, modes and have the same real part but opposite imaginary parts, so they are distinct eigenvectors with the same eigenvalue.
The useful surprise is that every length- circulant matrix shares the same basis of eigenvectors, whatever its first column. One change of basis therefore simplifies an entire family of linear maps, instead of requiring a separate eigenvalue computation for each one. Bamieh's tutorial develops the discrete Fourier transform from precisely this simultaneous diagonalization problem.[ref]
https://arxiv.org/abs/1805.05533. Bamieh, Discovering Transforms: A Tutorial on Circulant Matrices, Circular Convolution, and the Discrete Fourier Transform (2018; revised 2022)
Coherent harmonic pulse-train model 2026-10-18
Choose equal-amplitude, monochromatic odd components with orders , , and odd . Fix the complex-field conventionHere is a normalized light intensity after averaging the fast carrier oscillations. Setting every and summing a geometric series givesAt the removable singularities take the continuous limit. Maxima repeat every ; the first zeros on either side of a maximum lie at . The zero-to-zero width is , which is not the full width at half maximum.
Choose orders and driving wavelength . Using with the speed of light gives and burst spacing . Solving the exact half-maximum equation gives a full width at half maximum of approximately attoseconds. These are values of the specified five-component model, not measurements from the 2001 experiment.
A deliberately chosen spectral phase translates the whole attosecond pulse train by without changing its shape. Adding makes neighboring phase increments unequal: the same component intensities then produce a different temporal profile. For the choice and radians per squared harmonic order, the adjacent-component delay estimates arenamely , , and for . This finite difference estimates the group delay at the pair's midpoint. It is not a single common arrival time.
The infinite monochromatic sum is periodic forever and has infinite total energy. A real attosecond pulse train has a finite envelope and finite component linewidths. This calculation isolates coherent addition; it cannot describe an isolated burst or establish its contrast against satellites. As a further check, averaging over one half-period gives for any constant component spectral phases, because the cross terms integrate to zero by Fourier orthogonality. Spectral phase redistributes the light intensity in time while leaving that average fixed.
Common difference Created 2026-09-24 Updated 2026-10-18
The common difference of an arithmetic progression is the fixed difference between consecutive sequence terms. It gives a finite difference that is independent of position. Checking one adjacent pair finds its value only when the arithmetic progression property is already known; otherwise, other pairs can disagree. For example, the differences in are three and four, so the three entries do not form an arithmetic progression.
Consider the original small Poisson equation exampleIts exact solution is the quadratic polynomial . Use a uniform mesh with and three interior unknowns . The finite difference method replaces the negative second derivative byMultiplying by and moving the prescribed Dirichlet boundary conditions to the right givesThe endpoint values contribute and to the first and last equations; they are not additional unknowns. The Thomas algorithm givesand back substitution yieldsAll three values equal exactly: the centered finite difference for the second derivative is exact on a quadratic polynomial. This special nodal exactness does not assert exactness for arbitrary forcing or for the piecewise-linear curve joining the nodes.
Exact quadratic Dirichlet Poisson solution and the three interior values recovered by tridiagonal elimination
. Details. For any interior points with , the scaled tridiagonal matrix has and . Its pivot elements are : start at and use . All are positive. Interior rows have equality in diagonal dominance, so strict diagonal dominance is not the reason this example works. Instead it is a symmetric positive-definite matrix, since for a real vector with ,Zero would force every neighbouring value equal and hence all values zero. This connects the boundary constraints directly to the safe pivots for tridiagonal elimination.
Discrete sine transform Poisson solver 2026-10-14
For on a square with homogeneous Dirichlet boundary conditions, the five-point finite difference operator on a mesh is diagonalized by . Its eigenvalues are . A two-dimensional discrete sine transform, division by these nonzero eigenvalues and the inverse transform give the solution. Odd extension realizes each one-dimensional transform by a Fast Fourier transform of length , making the total cost and storage . These finite-difference eigenvalues should not be confused with the continuous spectral eigenvalues .
Electric potential Created 2026-09-24 Updated 2026-10-14
In electrostatics, the electric potential tells us the interaction potential energy per unit test electric charge in the electric field of prescribed sources. Its most directly useful quantity is an electric potential difference: how much work per unit electric charge an external agent must supply to move that test electric charge slowly between two points. This replaces the bookkeeping of a vector force along a path with the difference of two scalar values. The test electric charge must be small enough not to rearrange the sources appreciably.
For motion from to , write . With fixed sources and only the electric force doing work,Here is interaction potential energy, is kinetic energy, and the line integral uses the electric field produced by the other electric charges. For slow transport with unchanged kinetic energy, the external work is , so for nonzero . This external work has the opposite sign to the work done by the electric field. The SI unit is the volt,A volt measures energy per unit electric charge, not energy itself. For example, crossing an electric potential difference of changes the potential energy of by , but changes that of by . Both test electric charges encounter the same electric potential difference; their opposite signs reverse the energy change.[ref]
7.2 Electric Potential and Potential Difference. §7.2, equations 7.4–7.7: energy per charge, work and potential difference
The electrostatic potential is a scalar function of position. The electric field is a conservative vector field, and all three components follow from the negative gradient of the electric potential:The electric field points toward decreasing electric potential. A positive test electric charge feels electric force in that direction; a negative test electric charge feels electric force in the opposite direction, since . A freely accelerated negative test electric charge therefore moves toward higher electric potential while lowering its potential energy .[ref]
Only differences fix physical electrostatic potentials: adding the same constant everywhere, , changes neither the gradient nor any electric potential difference. Choosing an electrical reference potential is this elementary gauge transformation. Setting zero at infinity is convenient for finitely many localized point charges; it is not available for an ideal uniform electric field extending to infinity. There we can choose a finite reference point. Assigning zero at ground is a convention, whereas physically grounding an electrical conductor also allows exchange of electric charge to impose a boundary value. Zero electric potential at a point never by itself implies zero electric field.[ref]
7.3 Calculations of Electric Potential. §7.3, equation 7.8 and Figure 7.18: infinity and ground references
For a fixed point charge at the origin in vacuum, choose zero at infinity. Coulomb's law giveswhere is the vacuum permittivity. Use the stipulated approximation and . At ,A test electric charge has and radial electric force , directed inward. Moving it inward from to raises the electric potential from to but lowers its potential energy:This is the Coulomb potential energy calculation using electric potentials. The source's singular self-field at is excluded; when finding the force on a source point charge, use only the electric field of the other sources.[ref]
For a uniform electric field , choose . ThenMoving from to gives . For the change in potential energy is and the electric field does of work. For , the same prescribed displacement gives : the external agent must supply that work for slow transport. This uniform electric field approximates the interior of a parallel-plate capacitor sufficiently far from the edges; the fringing field of a capacitor limits the approximation.[ref]
Analytic electric potential models: point charge equipotentials, a uniform electric field, and the sign of the change in potential energy
. Details. An equipotential is a level set . On a smooth equipotential with nonzero gradient, every tangent displacement has , so the electric field is normal to the equipotential. Thus moving a test electric charge along an equipotential requires no net electrical work. Around a point charge, the equipotentials are spheres; the circles in the diagram are their sections, not an assumption of two-dimensional Coulomb's law. A uniform electric field has parallel plane equipotentials. For contours separated by the same small electric potential difference, smaller normal separation means a stronger electric field, approximately . At a point where , the electric field is zero and has no direction to call normal.[ref]
7.5 Equipotential Surfaces and Conductors. §7.5, Figures 7.30–7.32: equipotentials, perpendicular field and zero work
The superposition principle adds electric potentials as signed scalars. For finitely many stationary point charges at in vacuum,For example, the electric dipole with at and at has zero electric potential everywhere in the midplane , yet its electric field at the midpoint is . With and , this is . At , the same model gives and . Cancellation of electric potentials is quite different from cancellation of vector electric fields.
Computed dipole equipotentials and electric-field directions: zero potential on the vertical midline still permits a nonzero field
. Details. A motivating measurement is conductive-paper electric potential mapping. A documented teaching experiment uses slightly conductive paper on an insulating board, two circular electrodes in highly conducting ink, a steady supply, and a digital voltmeter. Connect the supply to the two electrodes, keep the voltmeter common lead on the negative electrode, and use its other lead as a movable probe. Adjust the supply using the measured electric potential difference between electrodes; the published procedure uses . The observable is the voltmeter reading at the probe position . Locate several points reading , record their positions on a separate map, and join them into an equipotential; repeat at other readings. Lift the probe between contacts so it does not damage the paper. This procedure makes the electrical reference potential concrete: every reading compares two contacts.[ref]
From neighboring readings infer an electric field component by a finite difference, . Reconstruct two in-plane components with displacements along two independent directions. Alternatively, draw the electric field normal to mapped equipotentials, toward lower electric potential. The second diagram illustrates the same measurement principle with bar electrodes spanning a uniform sheet, insulating top and bottom edges, and a synthetic model . The model readings at and at imply . These values are calculated illustrations, not reported experimental data. The documented circular-electrode experiment similarly estimates the electric field from readings at successive centimetre marks.[ref]
Voltmeter setup for conductive-paper electric potential mapping and a synthetic profile whose negative derivative gives the electric field
. Details. Useful controls include checking the voltmeter zero, checking that the electric potential difference along each painted electrode is negligible, and repeating reference readings to detect supply drift. Reversing the supply should reverse the signs relative to the same reference contact. Contact resistance, leakage electric currents, and touching the sheet can distort the map. A voltmeter has finite input electrical resistance and draws a small electric current; voltmeter loading changes the quantity being measured if that electrical resistance is insufficiently large relative to the sheet's effective source electrical resistance.[ref][ref]
10.4 Electrical Measuring Instruments. §10.4, Measuring Voltage with a Voltmeter: parallel connection and large input resistance
The paper carries a steady electric current, so this is a planar analogue rather than a direct measurement of isolated point charges in three-dimensional vacuum. For constant electrical conductivity, Ohm's law and steady charge conservation give and , hence the two-dimensional Laplace equation away from electrodes. Insulating sheet edges impose zero normal electric current, while finite electrodes fix boundary values. This derivation explains both the analogy and its limits: inhomogeneous paper, finite boundaries, and finite electrodes can change the contours. One should not fit the three-dimensional point charge formula to a planar map without testing that model. Small probe spacing resolves spatial variation better, but amplifies uncertainty in the inferred finite difference. The published laboratory instructions explicitly ask students to assess whether their proposed field fit is appropriate.[ref][ref]
The scalar description has a crucial limit. Faraday's law of induction for a stationary closed path sayswhere is magnetic flux. Nonzero changing magnetic flux gives nonzero circulation, incompatible with a single-valued electric potential alone. More generally, a scalar electric potential and a magnetic vector potential together giveConsequently, in the presence of induction, two voltmeter lead routes between the same contacts can produce different readings if the enclosed magnetic flux changes. This follows by subtracting the two path line integrals; it is a deduction from Faraday's law of induction, not a claimed outcome of the paper experiment. The steady setup and negligible induction justify interpreting its readings as electric potential differences. Merely introducing a scalar electric potential that depends on time cannot supply a nonzero curl of the electric field.[ref]
A short mathematical justification connects the statements above. Along a smooth path, the chain rule gives . Integrating and using yields the endpoint formula by the fundamental theorem for line integrals, proving path independence. Conversely, vanishing circulation around every closed path lets us define independently of the route, with . Zero curl is a local test; for a continuously differentiable curl-free vector field, a simply connected open region suffices for a global potential. The explicit finite-source formula already gives a global electric potential away from its source points.[ref]
Finite-difference Jacobian 2026-10-20
An approximation to a Jacobian matrix obtained using finite differences instead of analytic partial derivatives. For a vector-valued function , the forward-difference entry is , where is a coordinate basis vector. The step balances truncation and rounding errors; the resulting matrix can be used in a Newton root-finding iteration.
Adding one sequence term changes a partial sum by exactly that entry, so . Taking another finite difference givesThus arithmetic sequence terms produce partial sums with constant second finite differences. Conversely, if these second finite differences are a fixed and , then those entries form an arithmetic progression. For nonzero , the displayed sum formula is a quadratic function; for , it reduces to the linear expression .
Integer power sum 2026-10-14
An integer power sum adds a fixed nonnegative integer power of consecutive integers. Let be a nonnegative integer and a nonnegative integer. For , use the constant polynomial , including at zero, so . Summing the Bernoulli polynomial finite difference identity makes the intermediate terms cancel and givesThe sum is empty when . For the endpoints , the formula valid also at is insteadFor , , and this becomes the standard positive-endpoint formula. The exception at is essential: .[ref]
NIST Digital Library of Mathematical Functions. Karl Dilcher, Chapter 24, equations 24.4.1 and 24.4.7; the displayed equation 24.4.7 needs the endpoint adjustment at exponent zero
For , adding to changes the contribution from to . Equivalently,where only differs from our Bernoulli numbers. A quick endpoint check is : the sums over and are and , respectively. The latter is a triangular number.
Laplacian as departure from a local average 2026-10-18
The Laplacian detects whether a value lies below or above nearby values, to second order. For a scalar field whose partial derivatives through order four are continuous functions, take the arithmetic mean of four equally spaced neighbors:Applying Taylor's theorem in each coordinate cancels the first- and third-order terms between opposite neighbors. The two pairs leaveThis is an asymptotic expansion, rather than an equality for arbitrary . Rearranging gives the familiar central finite difference approximationThis finite difference replaces partial derivatives by five sampled values. The arithmetic mean lies above the center for a sufficiently small if the Laplacian is strictly positive there, and below if it is strictly negative. A zero Laplacian cancels this second-order discrepancy without requiring equality of individual values.
At , the bowl has center value zero and four neighbor values , so the discrepancy is exactly . The saddle has neighbor values , whose arithmetic mean is exactly zero. For the Gaussian function the discrepancy is , agreeing with .
A harmonic function need not equal this four-neighbor arithmetic mean for a finite . The polynomial has everywhere, but . Higher-order terms remain even when the second-order terms cancel.
At a local minimum, each coordinate second derivative is at least zero, hence the Laplacian is at least zero. At a local maximum the inequality reverses. The sum alone does not characterize an extremum: cancellation at a saddle point of a scalar function can also produce zero. The local-average interpretation explains why the heat equation smooths differences, and helps motivate the heat equation maximum principle.
Let be a complete discrete valuation ring with a continuous -algebra structure. Every continuous function on with values in has a unique uniformly convergent expansion in the binomial polynomials, with . This is the coefficient-ring version of the Mahler theorem. To see that , approximate the function modulo any power of the maximal ideal by a function of period . In the expansion of , all intermediate binomial coefficients are divisible by , while kills the periodic function. Iterating makes its differences vanish modulo the prescribed ideal power. Finite differences do not increase the uniform norm, so the same conclusion holds for the original function. Binomial inversion gives agreement at the nonnegative integers, and their density in the p-adic integers gives the expansion everywhere. This gives the dual description of p-adic measures by arbitrary bounded sequences of binomial moments, and hence the Amice transform.
Mapping a capacitor fringing field 2026-10-14
The Field Mapper Kit (PK-9023), Product Manual 012-04346D by PASCO scientific (p. 3, Parallel plate capacitor) proposes a direct investigation of the plate-length-to-gap ratio using conductive-paper electric potential mapping. Its finite straight electrodes represent a cross-section of the plates. The apparatus is a gridded resistive sheet on a corkboard, silver-ink electrodes, pushpin electrical contacts, a – direct supply capable of , and a voltmeter with input electrical resistance at least . The manual specifies waiting 20 minutes for the ink to reach its maximum electrical conductivity, then checking each electrode: its internal voltage drop should be no more than of the applied electric potential difference.[ref]
For the readout, keep one voltmeter lead on the reference electrode and scan the other across the sheet. Mark points having the same reading to trace an equipotential. A second method holds the two probe tips at a fixed separation and pivots them to find the largest electric potential difference; a suggested separation is one centimetre. Avoid printed grid marks when making contact.[ref]
Charge, Equipotential, and Field Mapper (ES-9060), Instruction Manual by PASCO scientific. pp. 8–10, Parts III–IV: equipotential tracing and paired-probe field-gradient mapping
The inference follows from the measured electric potential, rather than assuming straight electric field lines. With probe separation and direction , a local finite difference givesAn arrow toward rising electric potential follows , so it must be reversed to show . To investigate the fringing field of a capacitor, compare contours well inside the gap with contours near and beyond the ends, then repeat at a changed gap while keeping the sheet boundary and plate length fixed. Curving contours and an outside gradient establish nonuniformity in this planar setup. Compare at recorded positions to distinguish simple voltage rescaling from geometric changes; no measured values are supplied here.
Additional useful controls are repeat reference readings to detect drift, reversal of supply polarity, and repeating selected readings with reduced probe spacing. Keep contact quality and sheet edges fixed during the aspect-ratio comparison. Finite probe separation averages the gradient; reducing it improves spatial resolution but magnifies the effect of voltage uncertainty. Voltmeter loading, imperfect ink electrodes, and inhomogeneous sheet electrical conductivity can mimic distortions. These proposed checks supplement the manufacturer's electrode check, rather than claiming a completed experiment.
The sheet carries a steady electric current. For uniform electrical conductivity, Ohm's law and electric charge conservation give the two-dimensional Laplace equation away from electrodes, as explained in conductive-paper electric potential mapping. Uncontacted sheet edges have zero normal electric current, whereas the diagram model fixes zero outer electric potential. These distinct boundary conditions must be matched before a quantitative comparison. The apparatus reveals a planar electric potential map; it does not directly measure the free-space three-dimensional capacitance of metal plates.
Multigrid method Created 2026-10-06 Updated 2026-10-14
A multigrid method solves a linear system by combining local relaxation with coarse-grid correction on a hierarchy of meshes. The key is to divide the work by scale: a suitable relaxation removes rapidly oscillating approximation error, while coarse-grid correction addresses slowly varying approximation error that relaxation barely changes. A broad error hump occupies many fine-grid points but fewer coarse-grid points; it becomes easier to resolve by relaxation after enough coarsening. This complementary action is why multigrid methods are useful for large finite difference method and finite element method systems.
For a concrete model, take the one-dimensional Poisson equation with homogeneous Dirichlet boundary conditions:Use interior points , , and the centered finite difference systemThus is a symmetric matrix and a positive-definite matrix. The minus sign in fixes this positive convention; changing both and to their negatives leaves the relaxation update unchanged. For , the linear system has the exact discrete solution , since the centered finite difference is exact on this quadratic polynomial. In general, the exact discrete solution need not equal the sampled continuous solution: solving the linear system removes algebraic approximation error, not the global discretization error.
Let solve , let be the current approximation, and define the signed approximation error . The linear-system residual is , so . In particular, a linear-system residual is available without knowing ; it supplies the right-hand side for a correction equation. With , a weighted Jacobi method sweep isThe sine eigenvectors shared by and the iteration matrix are , . Their eigenvalues areFor , one weighted Jacobi method sweep with multiplies the lowest Fourier frequency mode by about , but the highest Fourier frequency mode by about . Four sweeps retain about of the first amplitude and of the second. The sign reversal of the second amplitude is harmless when its magnitude shrinks. However, the plain Jacobi method, , has factor : at it is about . A nearly alternating mode near the grid's Nyquist limit therefore persists almost as strongly as the smoothest mode. Plain Jacobi method convergence on a fixed Dirichlet boundary condition grid does not imply effective smoothing.[ref] The high-frequency smoothing factor of weighted Jacobi is uniformly at most for and ; the exact finite-grid high-frequency Jacobi smoothing optimum distinguishes this convenient uniform choice from the finite-grid optimum.[ref]
Analytic Poisson error modes: weighted Jacobi damps short wavelengths while plain Jacobi struggles near the Nyquist limit
. Details. One two-grid cycle applies a few weighted Jacobi method sweeps, computes the linear-system residual, performs coarse-grid correction, and applies a few more sweeps. The first relaxation makes the remaining approximation error easier to represent on a coarse mesh; the last relaxation damps oscillatory components left after the transferred correction. In a geometric multigrid V-cycle, replace the expensive exact coarse solve by one recursive cycle on the coarse correction equation, starting its correction from zero. Repeat until a tiny coarsest linear system can be solved directly, then return through the levels by adding each interpolated correction and post-smoothing. The descent and return give the cycle its V shape.[ref]
For this one-dimensional model, fixed sweep counts and bounded local finite difference and transfer work give a geometric multigrid V-cycle cost proportional to , hence in Big O notation. A fixed error reduction also needs a contraction factor bounded below one independently of ; per-cycle work alone does not establish that. Starting from arbitrary approximation error and demanding a relative reduction generally adds a factor proportional to in the cycle count. Full multigrid uses coarse solutions as initial guesses on successively finer meshes to target the global discretization error efficiently. The two-grid Poisson factor with weighted Jacobi illustrates favorable convergence for this model. Other partial differential equations, strong anisotropy, or poorly chosen coarse spaces and relaxation can defeat these choices; a linear-work guarantee for arbitrary linear systems does not follow.
A historical example of the multilevel viewpoint is Achi Brandt's April 1977 paper, which analyzes adaptive meshes and reports numerical experiments on linear and nonlinear boundary value problems. This is a documented development of the approach, not a claim that the paper was its first invention.[ref] The figure above is generated from the displayed eigenvalues, with lines joining discrete nodes; it contains no experimental measurements.
Suppose a piecewise finite difference uses two translated evaluations divided by . If the pulled-back evaluation intervals cover almost every input point at most times, then gives . This converts an interval-overlap count into an operator norm estimate without requiring pointwise values of an L2 space equivalence class outside the almost-everywhere evaluation rule.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 57 8 Solution Created 2026-10-03 Updated 2026-10-14
For data values, define the discrete Fourier transform byDirect evaluation costs operations. For even , split the sum into even and odd indices. If and are the length- transforms of and , thenThe fact that makes the two smaller transforms reusable; gives the second output. This is the FFT butterfly. For recursively splitting until length one givesAn iterative Cooley-Tukey FFT algorithm can arrange the input in bit-reversed order and apply butterflies of lengths . The factors are the twiddle factors. Each level uses work, and in-place organization uses storage. The inverse uses the conjugate roots with the final normalization . Mixed-radix factorizations extend the same idea beyond powers of two. For a two-dimensional array, transforming rows and then columns implements the two-dimensional transform, again exploiting separability.
For a concrete Poisson application, choose in the unit square with zero Dirichlet boundary conditions. Let and use interior indices . The five-point finite difference equation isThe product sine vectors diagonalize this matrix. Their eigenvalues areDefine the two-dimensional discrete sine transform coefficients byThe sine orthogonality identity gives the inverse reconstruction. The discrete sine transform Poisson solver is thereforeAll eigenvalues are positive, so there is no division by a zero mode for Dirichlet data. Nonzero prescribed boundary values are moved to the right side at neighboring interior points before transforming.
To compute the sine transform with a Fast Fourier transform, extend a one-dimensional interior vector oddly to length : set and . Its length- Fourier coefficient is . Thus ordinary FFTs compute each sine transform. Apply this along all rows and columns, divide the coefficients, and apply inverse transforms. The total cost is operations and storage for unknowns. The method solves the finite-difference linear system directly to rounding accuracy; discretization error is separate and is second order for sufficiently smooth data and solution.
Boundary conditions determine the appropriate transform. Periodic data use the ordinary two-dimensional discrete Fourier transform and eigenvalues . The constant mode then requires zero-mean forcing, and the solution mean is fixed separately. Neumann conditions similarly use an appropriate discrete cosine transform, with a compatibility condition and an undetermined additive constant. A Fourier spectral discretization would use continuous spectral eigenvalues instead of the finite-difference eigenvalues above. The speed comes from a constant-coefficient separable operator on a regular rectangle; a general irregular domain or variable-coefficient equation is not diagonalized by this simple FFT construction.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 48 3 d Solution Created 2026-10-03 Updated 2026-10-14
Refining time alone converges to the fixed-grid, spatially discretized solution, assuming the time-dependent coefficients and boundary forcing are suitably regular. In time-to-maturity , the grid values solve a finite system . For fixed , the explicit Euler method converges to this system as ; time-step error decreases to zero.
The spatial finite difference error remains. Thus the limit is not in general the exact continuous pricing solution: sufficiently small time steps reveal an error plateau of order under the usual smooth-solution assumptions. A truncated-domain boundary error also remains fixed unless negligible as stipulated.







