A differentiable function has a -Lipschitz gradient on a set if its gradient satisfies Lipschitz continuity there:All norms here are the Euclidean norm. The constant limits how fast the gradient changes; it is not a bound on the magnitude of the gradient. For , the gradient is the linear map . Its operator norm is , so works globally and is sharp by taking . The gradient itself is unbounded on the whole Euclidean space.
If has a continuous Hessian matrix on an open convex set and throughout , integrate that linear map along the line segment from to :The operator norm bound proves the displayed Lipschitz continuity. Convexity of the domain keeps the entire line segment inside it. Bounding the Hessian matrix only at the endpoints is insufficient.
Stochastic gradient descent updates parameters using an unbiased or approximate gradient computed from one observation or a mini-batch rather than the complete data set.
Inverse theorem for the Gowers U3 norm over a finite field by
Codex 0 Created 2026-09-24 Updated 2026-09-24
For fixed prime , a one-bounded function on with norm at least has correlation bounded below in terms of and with a quadratic phase, with the usual nonclassical formulation in small characteristic.
A quadratic phase on is a function , where is a quadratic form and . Its third multiplicative derivative is one, so its norm is one.
The Fennoscandian Ice Sheet covered northern Europe during the last glacial period and produced ongoing uplift around the Baltic region after retreat.
The Laurentide Ice Sheet covered much of northern North America during the last glacial period and left a major postglacial-rebound signal after retreat.
Flexural isostasy models the lithosphere as an elastic plate that bends over a buoyant substrate. For a sinusoidal deflection of wavenumber , bending contributes a restoring stress proportional to , where is the plate's bending stiffness.
Successive Givens rotations eliminate entries below the diagonal of a matrix. For an matrix with , process columns ; within column , rotate rows for each whose entry needs elimination. Apply each Givens row-pair update to columns . Both rows are zero in earlier columns, so these operations preserve earlier eliminations. No assumption of full column rank is needed to perform the eliminations.
For a concrete example, takeFirst use , then :The entry in position was already zero, so its elimination was skipped. The second Givens rotation combines the remaining pair in column two. This yields the full QR decompositionThe first two columns of and first two rows of give the reduced QR decomposition. Direct multiplication verifies both and . For these displayed factors evaluated in binary64 floating-point arithmetic, the Frobenius norms and are both below ; these measure reconstruction and loss of orthogonality separately.
More generally, if the chronological rotations are , thenEach factor is an orthogonal matrix, so is too. For a rectangular matrix, has zeros below its diagonal; its leading block is an upper triangular matrix. With full column rank, retaining the first columns of gives orthonormal columns. To impose a positive diagonal when necessary, flip matching columns of and rows of , preserving their product.
For a linear least-squares problem, apply the same chronological Givens rotations to the right-hand side , obtaining , without explicitly constructing . Since the Euclidean norm is preserved, solve the leading upper triangular matrix system by back substitution when has full column rank; the remaining entries of give the minimum residual norm. In the example, gives , , and minimum residual Euclidean norm .
The locality is useful for a sparse matrix or an existing QR decomposition needing an extra row: only two rows change at each step, and the new row can be eliminated against the stored upper triangular matrix. For an factor, this extra-row procedure takes rotations and arithmetic operations. Locality does not guarantee preservation of sparsity: mixing rows can create nonzeros wherever either row had one. For a fully populated input, the straightforward elimination uses rotations, each touching columns, giving work. Storage layout, zero patterns and implementation affect speed; this count alone establishes no universal advantage over other QR decomposition algorithms.
The Euclidean norm preservation explains the appeal for numerical stability: exact rotations do not amplify a perturbation's length. Rounded coefficients and Givens row-pair updates still introduce roundoff error. Small reconstruction and orthogonality residuals check the computed factors, while the condition number of the original problem still controls how accurately a linear least-squares problem determines its solution.
For a reaction with stoichiometric changes , varying the reaction extent at fixed temperature and pressure givesEquilibrium requires .
Gershgorin stability bound for a variable-coefficient diffusion stencil by
Codex 0 Created 2026-09-24 Updated 2026-10-14
A symmetric matrix obtained from a conservative five-point discretization of a diffusion equation has row centre and radius at most , where is the grid spacing and is the sum of its four nonnegative edge coefficients. Here the matrix represents the diffusion generator, with nonnegative off-diagonal entries; boundary elimination may reduce the row radius. If every coefficient is at most , then , and the Gershgorin bounds for symmetric matrices place every eigenvalue in .
For the Forward Euler method, an eigenvalue has amplification factor . Requiring for every such eigenvalue gives the sufficient absolute stability condition . Symmetry makes this also prevent growth of the Euclidean norm. For and , the bound is and . At that step size the interval maps to amplification factors in . This illustrates why cheap Gershgorin disc bounds can select a stable time step before any eigenvalues are computed.
A coastal Kelvin wave is trapped within a Rossby deformation radius of a boundary. It propagates with the boundary on its right in the Northern Hemisphere and on its left in the Southern Hemisphere, and its linear shallow-water potential-vorticity anomaly vanishes.
An inertia-gravity wave is restored jointly by buoyancy or free-surface gravity and the Coriolis force.
Antipodally symmetric nongeodesic spherical curve by
Codex 0 Created 2026-09-24 Updated 2026-09-24
A non-equatorial latitude on the round sphere is preserved transitively by rotations about its axis but has nonzero geodesic curvature. Its two complementary spherical caps are not isometric.
Isometric halves give zero total boundary geodesic curvature by
Codex 0 Created 2026-09-24 Updated 2026-09-24
If a closed oriented surface is cut along a curve into two isometric surfaces with boundary, their Euler characteristics and total Gaussian curvatures agree. Applying Gauss-Bonnet to both halves, whose induced boundary orientations are opposite, gives
Transitive curve symmetry makes geodesic-curvature magnitude constant by
Codex 0 Created 2026-09-24 Updated 2026-09-24
If ambient isometries preserving a connected curve act transitively on it, then the magnitude of its geodesic curvature is constant. Continuity then makes the signed geodesic curvature either identically zero or of one fixed sign.
A coordinate is ignorable, or cyclic, when . The Euler--Lagrange equation then gives , so its generalized momentum is conserved.
A generalized linear mixed model adds latent random effects to the linear predictor of a generalized linear model.
There are unlisted articles, also show them or only show them.
