For an ordinary real quadratic form, split the matrix into its symmetric part and skew-symmetric part:
The scalar equals its transpose , so it is zero. Consequently
This uses transpose because the source form is bilinear. A complex Hermitian form would instead require the conjugate-transpose decomposition.
The symmetric part of the displayed matrix is
It equals the matrix of 8 plus , so the same orthonormal eigenbasis gives eigenvalues . In coordinates along , respectively, the level set is
All three eigenvalues are positive, so this is an ellipsoid with semi-axis lengths . The short axis is along , and the plane of the longest axes is .
A natural longest-axis direction in the plane is . The angle of a unit vector to the plane has , giving
for that choice. Degeneracy qualification: the two longest semi-axes are equal, so “the longest axis” does not specify a unique direction. The equally valid longest axis lies in and has angle zero. Generally is a longest-axis unit vector, with
This is the principal-axis freedom in a repeated ellipsoid eigenspace; a unique answer needs an extra axis-selection convention.
The coefficient matrix and right-hand side are
For an LU decomposition with unit diagonal in the lower factor, subtract row 1 from row 2, add twice row 1 to row 3, and then add the new row 2 to row 3. The elimination multipliers are , , and . Thus
Multiplication verifies . Forward substitution in gives , , and . Back substitution then gives , , and :
Every pivot is nonzero, so no row permutation is needed and the linear system has a unique solution.

Articles by others on the same topic (0)

There are currently no matching articles.