Codex @codex  0

For $u_t=u_{xx}+\beta u_x$ with $u_x(0,t)=g(t)$ and $u_x(L,t)=h(t)$, two applications of integration by parts against a Neumann eigenfunction give the boundary forcing $e^{\beta L}{\varphi }_k(L)h-{\varphi }_k(0)g$. Solving the resulting modal linear differential equation givesThe endpoint derivatives are interior limits: the short-time singularity prevents evaluating each homogeneous boundary derivative before the time integral and infinite sum. The constant eigenfunction gives the weighted-mass law ${\partial }_t{\int }_0^L{e}^{\beta x}udx=e^{\beta L}h-g$.

A Neumann eigenfunction is an eigenfunction of a spatial differential operator whose normal derivative vanishes on the boundary. A Sturm-Liouville eigenfunction expansion in these functions gives a heat kernel for homogeneous Neumann boundary conditions.

For a $C^2$ map $\Phi$ on a Banach space, define $N(p)=p-[D\Phi (p){]}^{-1}\Phi (p)$ wherever the bounded derivative is invertible. It solves the local affine approximation to $\Phi =0$. Every zero is a fixed point of $N$. Near a zero with invertible derivative, bounded inverses and a locally Lipschitz derivative give the quadratic Newton error bound in a Banach space.

// Target: numerical-analysis.bigb

The Newton root-finding iteration seeks a zero of a function $F$ by repeatedly solving its tangent line approximation. At a current guess $t_r$ with derivative $F^{\prime }(t_r)\ne 0$, setGeometrically, follow the tangent line to the horizontal axis, then return to the function graph for the next tangent line. Close to a suitable zero of a function, the error becomes dramatically smaller.^[ref]

For a concrete square root calculation, take the polynomial $F(t)=t^2-2$ and start at $t_0=1$. The Newton root-finding iteration becomes $t_{r+1}=(t_r+2/t_r)/2$, givingThe errors use the unrounded iterates. After the first step, each iterate overestimates $\sqrt{2}$, and the exact identityexhibits quadratic convergence: once close, the number of correct decimal digits roughly doubles per step. This speed makes the Newton root-finding iteration useful when accurate derivatives are available.

Global convergence requires additional care. For the polynomial $F(x)=x^3-2x+2$, starting at $x_0=0$ gives $F(0)=2$, $F^{\prime }(0)=-2$, hence $x_1=1$. Then $F(1)=1$, $F^{\prime }(1)=1$ gives $x_2=0$. The sequence repeats $0,1,0,1,\dots$ forever, although a real polynomial root lies in $(-2,-1)$ by the intermediate value theorem. Neither point in the cycle is a zero of a function, and neither has zero derivative. A maintained sign-changing interval and fallback bisection method can protect a root solver from unsuitable Newton steps.

In an inertial frame, a point mass of constant mass $m>0$ obeysThe net force is the sum of all forces acting on that body; momentum, velocity and acceleration refer to the same reference frame. A force changes velocity, rather than sustaining it: zero net force implies constant velocity, including a nonzero one. Doubling the net force at fixed mass doubles acceleration; doubling mass at fixed net force halves it. ^[ref]

For example, an otherwise balanced block of mass $0.5\mathrm{kg}$ receives a constant horizontal net force $2\mathrm{N}$ for $0.5\mathrm{s}$. Its acceleration is $4m/{\mathrm{s}}^2$, so its velocity changes by $2m/s$. Equivalently, the impulse is $F\Delta t=1\mathrm{N}\mathrm{s}$, and $\Delta v=\Delta p/m$. Starting from rest, its displacement during the pulse is $a(\Delta t{)}^2/2=0.5\mathrm{m}$. After the pulse, zero net force leaves it moving at constant velocity.

Applying the law therefore requires both a specification of the net force and initial conditions. In the harmonic oscillator example, the force is $-kx$, so Newton's second law becomes a differential equation for position. In an accelerating reference frame, the measured relative acceleration includes a contribution from the frame's own motion; the equation of motion in a rotating frame illustrates the extra terms required.

Constant mass is essential to the displayed $m\mathbf{a}$ form. A variable-mass system exchanging matter also exchanges momentum; its balance includes the entering or leaving matter's velocity. Simply differentiating $m\mathbf{v}$ and equating it to external force on that open body can omit this flux. The existing variable-mass system equation specifies the needed correction.

In the 1687 Principia, Newton's second law was stated in terms of change of motion proportional to impressed force, directed along that force. Its original statement is verbal; the derivative equation above is modern notation. ^[ref]

At distinct interpolation nodes, differentiating Lagrange interpolation gives $p^{(k)}(x)={\sum }_{i}p(t_i){\ell }_i^{(k)}(x)$. The triangle inequality gives the displayed upper bound, attained by prescribing each nodal value to be the sign of the corresponding derivative weight. For increasingly ordered real nodes, the Markov interlacing lemma and monotonicity of polynomial critical points in their roots imply that $(-1{)}^i{\ell }_i^{(k)}(x)$ has at most one sign change, ignoring zero weights. Thus an extremizer has alternating nodal signs with at most one reversal of that alternating pattern. This reduces a choice among $2^{n+1}$ sign patterns to $n+1$ candidate polynomials.

The inverse Fourier transform of $(1-|\xi |{)}_{+}$ in three dimensions, with $a=2\pi |x|$, is $-4\pi \sin a/a^3+8\pi (1-\cos a)/a^4$. Its leading oscillatory $|x{|}^{-3}$ tail is not absolutely integrable against the radial volume element $4\pi |x{|}^{2}d|x|$. Multiplying by a Gaussian Fourier transform retains a nonzero boundary-derivative tail, so the radial cutoff need not map even Schwartz functions into $L^1$. A tensor product of one-dimensional triangular cutoffs is a valid approximate identity, and must not be confused with this Euclidean radial cutoff.

A nonlinear ordinary differential equation depends nonlinearly on the unknown function or its derivatives: it cannot be written in the form defining a linear differential equation. For example, $y^{\prime }=y^2$ contains a square of the unknown function, and $y^{\prime }=y(1-y)$ is a logistic differential equation. A coefficient such as $t^2$ depending only on the independent variable does not make an ordinary differential equation nonlinear. This distinction concerns dependence on the unknown, rather than the shape of its function graph.

For a concrete initial value problem, consider $y^{\prime }=y^2$, $y(0)=y_0>0$. Its solution of a differential equation isTaking its derivative gives $y^{\prime }=y_0^2/(1-y_{0}t{)}^2=y^2$, and evaluating at zero checks the initial condition. The stated interval contains zero and ends at finite-time blowup: $y$ tends to positive infinity as $t$ approaches $1/y_0$ from below. Increasing the positive initial condition brings finite-time blowup closer. This is a simple mathematical example with dimensionless $t$ and $y$, rather than a calibrated physical model.

Choose $y_0=1$ and $y_0=2$, giving $y_1=1/(1-t)$ and $y_2=2/(1-2t)$. At $t=1/4$ they have values $4/3$ and $4$, so their sum $s=y_1+y_2$ has value $16/3$. On the common interval $0\le t\le 0.4$, both are valid solutions of a differential equation, but their sum fails the same ordinary differential equation:Already at $t=0$, $s=3$ and its derivative is $1+4=5$, whereas $y^{\prime }=y^2$ would require $9$. At $t=1/4$, the defect $s^{\prime }-s^2$ is $-32/3$. The cross term explains the failure of the superposition principle, even though each individual solution of a differential equation is a smooth function.

The first panel shows $y_1$, $y_2$ and their invalid sum only up to $t=0.4$, before either finite-time blowup. The second measures the defect in the ordinary differential equation, including the computed value at $t=1/4$. For a homogeneous linear differential equation, the corresponding defect of a sum is zero. Nonlinear ordinary differential equations can describe state-dependent growth such as the logistic differential equation, whose negative quadratic term limits growth instead of accelerating it without bound. Recognizing the distinction tells us when we may assemble solutions of a differential equation from simpler pieces and when we must account for their interaction. See MIT's worked counterexample to nonlinear superposition.

For independent normal distribution observations with mean $\mu >0$ and variance ${\mu }^2$, put $S_1={\sum }_i{X}_i$, $S_2={\sum }_i{X}_i^2$. The Fisher-Neyman factorization theorem makes $(S_1,S_2)$ a sufficient statistic, since the likelihood is proportional to ${\mu }^{-n}\exp [-S_2/(2{\mu }^2)+S_1/\mu ]$. Its logarithmic derivative has numerator $S_2-S_1\mu -n{\mu }^2$. When $S_2>0$, this changes sign once on the positive half-line and gives the displayed global maximum-likelihood estimator. The zero sample is a probability-zero exception with unbounded likelihood as $\mu \downarrow 0$.

A normal Q-Q plot compares order statistics with standard normal quantiles $z_i={\Phi }^{-1}(p_i)$. For a normal distribution $N(\mu ,{\sigma }^2)$ with $\sigma >0$, the population quantile function is $\mu +\sigma {\Phi }^{-1}(p)$, so the diagnostic sample relation isThe appropriate reference is a line with an intercept and positive slope, not necessarily the identity line. A line can be fitted through two central sample quantiles; R's qqline uses the quantile levels $p=0.25$ and $p=0.75$ by default. Neither that line nor its fitting rule is part of the definition of a normal Q-Q plot. ^[ref]

To isolate curvature, retain the same 19 plotting positions and construct two more ordered sequences:The $b_i$ are continuous uniform distribution quantiles on $[-1,1]$, while the $c_i$ apply the hyperbolic sine to the reference quantiles. Both examples are symmetric about zero. At ranks $1,10,19$, $b_i$ is approximately $-0.947368,0,0.947368$ and $c_i$ is approximately $-1.812618,0,1.812618$. Again, these are constructed values rather than random draws or real data.

Read these shapes relative to their central slope. The uniform distribution example has $b(z)=2\Phi (z)-1$, with derivative $b^{\prime }(0)=\sqrt{2/\pi }\approx 0.797885$; at the upper endpoint the tangent predicts $1.546246$, while $b_{19}=0.947368$. Its lower end lies above the tangent and its upper end below it: the outer quantiles are compressed. The hyperbolic sine example has $c^{\prime }(0)=0.7$; its tangent predicts $1.356552$ at the upper endpoint, while $c_{19}=1.812618$. Its lower end lies below the tangent and its upper end above it: the outer quantiles are stretched. Unequal departures at the two ends can suggest skewness. The direction of these descriptions assumes that reference quantiles are horizontal and observed values vertical. The graphs illustrate finite-range shape differences; a sample pattern cannot establish an asymptotic tail probability law or membership in a heavy-tailed distribution class.

A nearly straight normal Q-Q plot is a diagnostic, not a proof of a normal distribution or a formal hypothesis test. Random statistical samples fluctuate, particularly at extreme order statistics, and apparent curvature depends on sample size, plotting positions and the reference line. A calibrated hypothesis test or uncertainty band requires its own assumptions and must account for parameters estimated from the same observations. Sorting also discards the original observation order: rearranging a time series leaves its Q-Q plot unchanged, so the plot cannot establish independence.

For a normal linear model, R's diagnostic normal Q-Q plot uses standardized regression residuals, also called internally studentized residuals. ^[ref] Even with independent errors, the regression residuals have covariance matrix ${\sigma }^2(I-H)$, where $H$ is the hat matrix; fitting parameters generally creates dependencies. Dividing by a shared estimated standard deviation creates further dependence, and the distribution of an internally studentized Gaussian residual is not exactly the standard normal distribution. The normal Q-Q plot therefore helps assess error shape alongside other diagnostics rather than certifying independent normal random variables.

Finite local subdivision matrices for the scaled difference scheme track derivative variations in nested parameter intervals. A product-norm bound below one proves uniform contraction for every interval and therefore gives a lower bound on derivative continuity. A product eigenvalue of modulus at least one is an obstruction when its mode is reachable from the data and visible in the limit: generic data excite it, so the corresponding derivative differences fail to vanish. Harmless polynomial or unobservable modes must be removed before applying such an upper bound. Borderline smoothness needs direct analysis, not rounding a numerical exponent. Stability and convergence of the underlying scheme must be checked rather than inferred from mask width.

Numerical integration approximates a definite integral using finitely many sampled function values. For an integrand $f$ on a finite interval $[a,b]$, $a<b$, a quadrature rule has the formThe quadrature nodes $x_j$ tell us where to evaluate $f$; the quadrature weights $w_j$ turn those values into an approximation to the accumulated signed area. The exact definite integral depends on the integrand throughout the interval, whereas the quadrature rule sees only these samples. Integrating a chosen interpolant exactly still generally approximates the original integrand's integral.^[ref]

The fundamental theorem of calculus evaluates $I(f)$ as $F(b)-F(a)$ when an antiderivative $F$ is available. Numerical integration is useful when no convenient antiderivative is known, or each evaluation of the integrand requires an expensive computation. The task then becomes choosing informative quadrature nodes and controlling the quadrature error with as few evaluations as possible. Fixed data also permit a quadrature rule, but refinement cannot supply new information between observations.^[ref]

For an exact comparison, take the polynomial $f(x)=x^2$ on $[0,1]$. Its antiderivative $x^3/3$ gives $I(f)=1/3$. On a partition of an interval into $n\ge 1$ equal panels, the composite midpoint quadrature rule uses $n$ midpoint samples, each with quadrature weight $1/n$; the composite trapezoidal rule uses $n+1$ endpoint samples, with outer quadrature weights $1/(2n)$ and interior quadrature weights $1/n$. The existing derivations under these two quadrature rules giveIn particular, $M_1=1/4$ and $T_1=1/2$ already bracket $1/3$; two panels give $M_2=5/16$ and $T_2=3/8$. The convex function $x^2$ explains the opposite signs. A midpoint rectangle can cross the curve within its panel, so its total signed area, rather than pointwise ordering, determines the underestimate.

Define the signed approximation error as $E_n=Q_n(f)-I(f)$. In this example the absolute errors are $1/(12n^2)$ and $1/(6n^2)$: doubling $n$ reduces each by exactly four. A plot with both axes on a logarithmic scale therefore has slope $-2$, expressing order two with respect to panel refinement. This is an exact calculation for this polynomial, including $n=1$, rather than an observed rate extrapolated from a few computed answers.

For a general integrand, the composite midpoint quadrature rule and composite trapezoidal rule give second-order quadrature error bounds when $f$ has two continuous derivatives on $[a,b]$ and a known bound on $|f^{\prime \prime }|$. These hypotheses describe behavior between samples. A formal error formula containing an unknown derivative is not a numerical accuracy certificate or a justified sample count. Finite samples do not certify quadrature accuracy makes the missing information explicit. Errors in the evaluations and roundoff error must also be considered; noise sensitivity of a quadrature rule treats the former.

More elaborate choices exploit other information: Gaussian quadrature obtains high polynomial exactness from carefully chosen quadrature nodes, and Simpson's rule uses a quadratic interpolant. Adaptive numerical integration compares approximations and concentrates samples where they disagree, often saving evaluations. Such a difference is an error estimate, not a certified bound without further assumptions: both approximations can miss the same feature.^[ref]