An ellipse can be defined via a symmetric, invertible and positive-definite (2×2)-matrix Aq. Such a matrix provides a quadratic form which in turn correlates the components of position vectors to points on an ellipse. This post shows that a Cholesky decomposition of the inverse of Aq provides a method to create an ellipse from a simple set of vectors which can be parameterized. We first determine the elements of the inverse of Aq. This will give us a respective lower triangular Cholesky matrix Kch which has to be applied to vectors defining a unit circle.
We work in a Cartesian coordinate system [CCS]. When I speak of “vectors”, I mean position-vectors from the origin of our chosen CCS to points somewhere in our 2-dimensional space. The components of such vectors have values that are equal to the (x,y)-coordinates of the points in our CCS. Required knowledge is some some Linear Algebra.
Related posts:
Introduction
A 2-dimensional ellipse can be defined by a quadratic form. By using a symmetric and invertible (nxn)-matrix An a quadratic form (of the components of a vector v ∈ ℝn is given by a function
The open circle symbolizes the standard matrix multiplication. Writing q(v) in terms of the vector components we find that we get a polynomial. The maximum exponent occurring in terms of vector-components is 2. In a CCS such a polynomial controls the relation between the n coordinates of points on an ellipsoid. The coordinates are equivalent to the component values of vectors reaching from the origin of the CCS to points on the ellipsoid.
A special case is a quadratic form of vectors in a 2-dimensional space. Aq (= A2) then is a (2×2) matrix. Requiring the respective quadratic form to be equal to 1 defines an ellipse
as a special type of a conic section. I.e., condition (2) is fulfilled by vectors vE
reaching from the origin to points on an ellipse.
We name the elements of our (2×2)-matrix α, β/2, γ :
The polynomial equation then becomes
We request the determinant of Aq to be bigger than 0 to guarantee the invertibility and positive definiteness of the matrix
I.e.,
In addition we have shown in the named previous post that for a positive-definite matrix A (and for an ellipse with both half-axes having positive values) the additional conditions
must be fulfilled at the same time. Note: Regarding the positive-definiteness of Aq, a respective condition on the eigenvalues of A leads to the same result. I have shown this already in a previous post (eqs. (47) and (103) there). The geometrical requirement that the half-axes of the related ellipse must have a length > 0 is automatically fulfilled under these conditions.
The inverse of matrix A
Before we turn to a Cholesky decomposition let me give you the elements of the inverse [Aq]-1 of matrix Aq. [Aq]-1 has the elements:
You can simply checking this by showing that we indeed get
The inverse of Aq is again a symmetric, invertible and positive definite matrix.
Cholesky decomposition – and the connection to vectors defining a unit circle
Let us apply a Cholesky decomposition to the inverse of Aq. Such a decomposition for a positive-definite and symmetric matrix is always possible and it actually is unique in the sense that the involved triangular matrices are well and uniquely defined:
Kch is a lower triangular matrix. T symbolizes the transposition operation. It is easy to show that Kch transforms vectors on a unit circle in a well defined way into position vectors of points on our target ellipse. If you insert
into eq. (2) and rearrange terms according to standard matrix rules you just get the definition equation for vectors to points on a unit circle:
Therefore, a specific vector vE to a point on our ellipse is the result of a linear transformation of another specific vector vc,ch reaching to a point on a unit circle:
Kch, of course, operates in a unique way on vectors vc,ch. Our ellipse defined via A can therefore be constructed in a distinct way by applying Kch to all vectors defining the unit circle. Note that we can parameterize vc,ch as
Elements of the lower triangular matrix Kch
Kch gives us a valuable tool to recreate ellipses defined by a symmetric matrix Aq from vectors on a unit circle. We can use it to check other methods to re-construct such an ellipse via linear transformations. The fact that there are alternative ways to create our ellipse with a different matrices has the following reason: As we start with a rotation-invariant unit circle, we can always add some initial rotation as a first step to a linear transformation of this rotational symmetric object. I will show examples in a forthcoming post in this blog.
The elements of Kch can be derived with a somewhat lengthy calculation from the elements of [Aq]-1. I omit details here. I just give you the result:
with
I.e.:
Note that the square roots pose no problem due to the required fulfillment of relations (9).
We will use matrix Kch in a forthcoming post where I present numerical and graphical examples for the re-construction of an ellipse from matrix-elements:
Conclusion
In this post we got familiar with an explicit method to construct an ellipse which is defined by a quadratic form. The quadratic form in turn was mediated by a symmetric, positive-definite matrix A. The construction method is based on the lower triangular matrix of a Cholesky decomposition of the inverse of A. It provides a distinct way to create the ellipse by a well defined linear transformation of vectors defining a unit circle.