Rotational flux through an ellipsoidal graph patch Created 2026-10-20 Updated 2026-10-25
Take the upward-oriented graph over , , where , , and . The surface flux of the vector field is the displayed formula. Indeed the vector surface element is , soThe change of variables , changes to . Integrating over gives , proving the result. When , the value of the vector field is a tangent vector to the ellipsoid at every point, and the surface flux vanishes pointwise.
Semi-axis 2026-10-25
Half the length of one principal diameter of an ellipsoid. For a centred quadratic form with symmetric positive definite and , its semi-axis lengths are , where are the eigenvalues of . The shortest centre-to-surface distance corresponds to the largest eigenvalue.
Signature transition from an ellipsoid to an elliptic cylinder and a one-sheet hyperboloid 2026-10-18
After an orthogonal diagonalization, the sign of the third coefficient classifies the displayed quadric surface. If , it is an ellipsoid with semiaxes . If , it is an elliptic cylinder parallel to the axis, with elliptical transverse section. If , it is a one-sheet hyperboloid with axis and waist ellipse . The continuous limit sends the associated axial length scale to infinity. Repeated positive eigenvalues make the corresponding principal-axis choices nonunique within their eigenspace, without changing the surface.
Solid ellipsoid 2026-10-14
Spheroid 2026-10-14
A spheroid is an ellipsoid of revolution obtained by rotating an ellipse about a principal axis. Rotation about the shorter axis gives an oblate spheroid; rotation about the longer axis gives a prolate spheroid. Thus the oblate form is a member of the general family.
Support function of a centred ellipsoid 2026-10-25
Let be a real symmetric positive definite matrix, and . The Cauchy-Schwarz inequality in the -weighted inner product gives . Equality is attained by a positive multiple of . Thus the displayed maximum holds. For a translated ellipsoid, add for its centre . This computes a coordinate extremum without constructing a rotation matrix.
Symmetric preconditioning as energy geometry 2026-10-18
For a symmetric positive-definite matrix , solving is equivalent to minimizing the quadratic form with linear termWriting the error vector and expanding gives the exact energy norm identityThe cross term vanishes because . With and , the same quantity is . Symmetric positive-definite preconditioning changes coordinates without changing the energy assigned to a corresponding error vector.
In an orthonormal eigenbasis of , the level set has semiaxis lengths . Its longest-to-shortest axis ratio is . A large spectral condition number of a positive-definite matrix therefore appears geometrically as a thin ellipsoid. Good scaling makes the transformed ellipsoid rounder, allowing a simple search direction to improve all coordinates together.
The negative gradient of is the linear-system residual . Relative to the norm , a steepest direction is : the Cauchy-Schwarz inequality applied to shows that the greatest decrease per unit -length occurs along this direction. Equivalently, ordinary gradient descent in becomes preconditioned steepest descent in .[ref]
Two-chart smooth atlas of an ellipsoid Created 2026-10-06 Updated 2026-10-14
If is invertible, sends the ellipsoid to the unit sphere. On , the two stereographic projections and omit opposite poles and have inverses , with the sign chosen for the appropriate pole. Their overlap transition is , smooth and involutive on . Composing their inverses with gives a two-chart smooth atlas of the ellipsoid. Its subspace topology is Hausdorff and has a second-countable space topology, so it is a smooth manifold. For the overlap is empty and each chart is a point.
Let be a real positive-definite matrix and minimize the displayed quadratic function over all of . Its gradient is , so its only stationary point solves the linear system . The matrix is an invertible matrix, making this solution exist and be unique. Completing the square around that solution proves the stronger global statement:The quadratic function is strictly convex, and its level sets above the minimum are translated ellipsoids. Positivity therefore turns solving a linear system into locating the bottom of a bowl.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §3.1.4, Example 3.2, p. 71: a quadratic function is strictly convex exactly when its symmetric coefficient matrix is positive definite
For the opening matrix , take and . Then , , and . Every displacement raises the value by ; along the unit eigenvectors and the increases are respectively and for displacement or .
For a singular positive semidefinite matrix, a solution of is still a global minimizer, but adding any kernel vector gives another. If is outside the image of a linear map defined by , some kernel vector has , and is unbounded below. For an indefinite quadratic form, a negative eigenvalue gives a direction along which the quadratic term tends to regardless of . Thus a stationary point alone does not establish a minimum. The same energy-difference identity extends to the quadratic variational principle for a symmetric positive operator, with additional existence hypotheses in infinite dimension.
Velocity ellipsoid 2026-10-06
The velocity ellipsoid represents the positive velocity covariance tensor by its orthogonal principal axes and eigenvalue square roots. The uncentered second-moment tensor differs from covariance when a population streams. Vanishing mixed second moments align the second-moment ellipsoid with the chosen frame; for pure azimuthal streaming in a phase-mixed axisymmetric model, the off-diagonal covariance also vanishes.