Geometric Distortion of Numerical Ranges under Similarity and Metric Similarity ()
1. Introduction
The numerical range of a linear operator, introduced independently by Toeplitz [1] and Hausdorff [2], has become one of the most important tools in operator theory. For an operator
acting on a complex Hilbert space
, the numerical range
encodes fundamental information about the operator’s action, providing a bridge between algebraic properties and geometric structure. Comprehensive treatments can be found in Gustafson and Rao [3] and Halmos [4].
Scope of the paper. Throughout this paper, we work in the finite-dimensional setting:
with the standard inner product, and all operators are identified with matrices in
. This restriction matters for the spectral inclusion: for a matrix
, the numerical range
is compact and
; for a general bounded operator on an infinite-dimensional Hilbert space,
need not be closed and only the inclusion
holds ([3], Section 1.2). All results in Sections 4 - 9 are stated and proved for matrices.
The Toeplitz-Hausdorff theorem [1] [2], which establishes that
is always convex, represents one of the earliest triumphs of functional analysis. The numerical range contains the spectrum
(in the finite-dimensional setting adopted here) and provides bounds on the operator norm through the numerical radius
, which satisfies the fundamental inequalities
(1)
as established in [3] [4]. Refinements of these inequalities have been studied extensively by Kittaneh [5] and others.
The behavior of numerical ranges under operator transformations reveals deep structural properties. Under unitary equivalence
, the numerical range is preserved:
. This invariance, discussed in [3] [6], reflects the geometric nature of unitary transformations as rotations and reflections of the underlying space. However, the situation becomes considerably more subtle for similarity transformations
, where
is merely invertible rather than unitary.
This paper investigates the nature of numerical-range distortion under similarity and the more general metric similarity. While similarity preserves the spectrum [7], it distorts the numerical range in a manner that can be controlled through the condition number of the similarity transformation. We establish rigorous two-sided bounds on the distortion of the numerical radius, extending the circle of ideas around generalized inclusion relations of Goldberg and Straus [8], and, for important special cases, exact formulas. We emphasize at the outset what our bounds do not say: the numerical range
is in general not contained in any fixed dilate
of the prototype region (Example 4.1), so the distortion is genuinely a distortion of size and shape, not a radial rescaling.
The study is motivated by applications in numerical analysis, where condition numbers govern the stability of computational algorithms [7] [9], and by connections to the theory of
-isometries and geometric similarity (similitude) in metric spaces [10]. Our prototype-model framework provides a natural geometric language:
serves as a prototype whose size, and in special cases exact shape, determines that of the model
.
2. Preliminaries
Throughout,
with inner product
linear in the first argument, and
is the algebra of
complex matrices. Standard references for this section are [3] [4] [7].
2.1. Numerical Range and Its Properties
Definition 2.1. ([3] Definition 1.1.1). For
, the numerical range is the set
and the numerical radius is
Since the unit sphere of
is compact,
is a compact subset of
and the maxima above are attained. The following classical results will be used throughout.
Theorem 2.2 (Toeplitz-Hausdorff, [1] [2]). For any
, the numerical range
is a convex subset of
.
Theorem 2.3. ([3], Theorem 1.2.1). For any
, the spectrum satisfies
.
Remark 2.4. Theorem 2.3 is a genuinely finite-dimensional statement. For a bounded operator
on an infinite-dimensional Hilbert space, the correct general inclusion is
, and the closure cannot be omitted: the unilateral shift
has
while
is the open unit disk. This is the reason for the finite-dimensional scope fixed in the Introduction.
Theorem 2.5 (Elliptical range theorem, ([3] Theorem 1.3.1)). For any 2 × 2 matrix
with eigenvalues
, the numerical range
is a (possibly degenerate) closed elliptical disk with foci at
and
and minor axis of length
2.2. Similarity Relations
Definition 2.6 ([7] Chapter 1). Let
and let
be invertible.
1)
and
are similar, written
, if
.
2)
and
are unitarily equivalent, written
, if
for some unitary
.
3)
and
are metrically similar, written , if
for some unitary
and positive invertible
.
The chain of implications is strict in general. Each relation preserves the spectrum:
([7], Theorem 1.3.20). However, their effects on the numerical range differ fundamentally, as noted in [3] [6].
Definition 2.7 ([7] Section 5.8). The condition number of an invertible
is
.
The condition number satisfies
, with equality if and only if
is a positive scalar multiple of a unitary matrix [9]. For diagonal matrices
with
we have
. Note that
for every scalar
; the condition number is a scale-invariant quantity, and correspondingly
and
implement the same similarity transformation.
We shall also need the classical Kantorovich inequality; see [7] (Section 7.4) or [9].
Lemma 2.8 (Kantorovich inequality). Let
be positive definite with spectrum contained in
,
. Then for every unit vector
,
2.3. Geometric Similarity
Definition 2.9 ([10]). Two sets
are geometrically similar (or similitudes) if there exist
,
, and
such that
The parameters are:
(scale factor),
(rotation angle), and
(translation vector). We call
the prototype and
the model.
For geometrically similar sets, the length ratio is
and the area ratio is
. This framework allows us to describe numerical-range distortion in precise geometric terms—when an exact similitude relation actually holds, which, as we shall see, is the exception rather than the rule.
3. Numerical Range Examples
We begin by illustrating the variety of numerical-range shapes through representative examples, following the exposition in [3] [4]. These will serve as test cases for our distortion analysis.
Example 3.1 (Nilpotent matrix, [3] Example 1.3.4). The matrix
is nilpotent with
. Its numerical range is the closed disk
centered at the origin with radius
. More generally, for
we have
. This example is fundamental because
is a perfect disk, making distortion effects clearly visible. The set is plotted in Figure 1.
Figure 1. Numerical range of the nilpotent matrix
. The numerical range is a disk of radius 1/2 centered at the origin. The sole eigenvalue
lies at the center.
Example 3.2 (Hermitian matrix, [3] Theorem 1.2.2). For a Hermitian matrix
, all eigenvalues
are real, and
The numerical range degenerates to a line segment on the real axis, and
. Figure 2 illustrates this degenerate case.
Figure 2. Numerical range of a Hermitian matrix. Since
, all eigenvalues are real and
is the line segment connecting the extreme eigenvalues.
Example 3.3 (Upper triangular matrix, [3] Theorem 1.3.1). For
, the eigenvalues are
and
. By the elliptical range theorem,
is an elliptical disk with foci at 1 and 3. The semi-axes depend on the off-diagonal entry: larger values produce rounder ellipses. See Figure 3.
Figure 3. Numerical range of the upper triangular matrix
. The elliptical disk has foci at the eigenvalues
and
.
Example 3.4 (3 × 3 matrix). For
, numerical ranges exhibit richer geometry. The matrix
has eigenvalues 1, 2, 3. The numerical range
is a convex set containing these points, with a boundary that may have both flat and curved portions; it is displayed in Figure 4.
Figure 4. Numerical range of a 3 × 3 upper triangular matrix with eigenvalues at 1, 2, 3. The boundary exhibits curvature characteristic of higher-dimensional numerical ranges.
4. Distortion under Similarity Transformations
We now establish the fundamental results on numerical-range distortion under similarity. Before stating the main theorem, we record two elementary observations and one cautionary example. The example shows that the most naive picture of distortion—a radial dilation of the numerical range by the condition number—is false, and thereby delimits what any correct theorem can assert.
Example 4.1 (No inclusion
). Let
Here,
is Hermitian, so
, and
is again a subset of the real axis, for any value of
. On the other hand, by the elliptical range theorem (Theorem 2.5),
is the ellipse with foci ±1 and minor axis
: a nondegenerate elliptical disk reaching the points
on the imaginary axis. Hence
No scalar multiple of the prototype region can contain the model region: similarity can genuinely change the shape and dimension of the numerical range, not merely its size. Any correct distortion theorem must therefore bound the size of
—for instance, through the numerical radius—rather than assert a set inclusion into a dilate of
.
4.1. The Distortion Bound
The following theorem is our replacement for the set-inclusion statement discussed above. It gives a rigorous, dimension-free bound for the numerical radius of
, sharp in the unitary case
.
Theorem 4.2 (Numerical radius distortion bound). Let
, let
be invertible, and let
. Then
(2)
and consequently
(3)
Proof. Step 1: reduction to a positive similarity. Let
be the polar decomposition, with
unitary and
positive definite. Then
and
(unitary invariance), while
since
and
have the same singular values. We may therefore assume
is positive definite. Moreover, since
and
induce the same similarity for
and
, we may normalize
so that its spectrum satisfies
Step 2: a constrained bilinear form. Fix a unit vector
and let
. Since
is self-adjoint,
The vectors
satisfy the two key constraints
and, by the Kantorovich inequality (Lemma 2.8) applied to
, whose spectrum lies in
,
Step 3: balancing. For
, replacing
by
changes neither
nor
. Choosing
we may assume
, where
the lower bound following from
(Cauchy-Schwarz).
Step 4: orthogonal decomposition. Write
with
. Then
, and
Hence
For the first term,
, so
For the second term, using
from (1),
Since
,
Combining the two estimates,
As
was arbitrary, (2) and (3) follow. □
Corollary 4.3 (Two-sided distortion bound). With
and the hypotheses of Theorem 4.2,
Proof. The upper bound is Theorem 4.2. For the lower bound, apply Theorem 4.2 to
, noting
. □
Remark 4.4. Three comments on the quality of the bound
.
1) At
(i.e.,
a scalar multiple of a unitary),
and the theorem recovers the exact unitary invariance
. The bound is therefore sharp at
.
2) The bound always improves the naive estimate obtained from
: indeed
for all
.
3) The nilpotent example of Section 5 attains the ratio
, so the optimal constant lies between
and
; the gap is less than 1, uniformly in
. Extensive numerical experiments (random search over
for
, and Nelder-Mead optimization of the ratio
over pairs of complex 2 × 2 matrices, which converges to 1 from below) support the following conjecture.
Conjecture 4.5 (Optimal distortion constant). For all
and invertible
,
By Theorem 5.1 below, the constant
would be optimal.
Remark 4.6. The bound in Corollary 0.16 is a statement about the numerical radius—the size of
—and, by (3), about containment of
in a disk. In view of Example 4.1, this is the strongest type of containment statement available at this level of generality:
need not be contained in any dilate of
itself. The actual scale factor
depends on the interplay between the structure of
and the geometry of
; in Section 5, we establish exact formulas for special cases.
4.2. Computational Examples
We illustrate the distortion effect through computed examples.
Example 4.7 (Expansion,
). Let
and
. Then
We have
,
, so the scale factor is
. The condition number is
; the conjectured optimal bound
is attained exactly, and the proven bound
holds with room to spare. Figure 5 compares the two numerical ranges.
Example 4.8 (Contraction,
). With the same
but
, we obtain
. Now
and
. Note that
but
, giving
. The scale factor
demonstrates that contraction is governed by
; see Figure 6.
Figure 5. Similarity with
: the numerical range expands by factor 2. Blue shows
(prototype), red shows
(model). The scale factor equals
.
Figure 6. Similarity with
: the numerical range contracts by a factor of 0.5. The scale factor equals the diagonal parameter
, not
.
Example 4.9 (Transpose similarity). For any matrix
, its transpose
is similar to
; this classical result ([7], Corollary 3.2.4) has implications for numerical ranges. For
, the similarity
with
gives
. Remarkably,
, reflecting the fact that
for all matrices, as noted in [6]. This illustrates that the scale factor can be exactly 1 even when
and
; the two coincident numerical ranges are shown in Figure 7.
Figure 7. A matrix and its transpose have identical numerical ranges despite being related by a non-trivial similarity. This illustrates that the scale factor can be exactly 1 even when
.
5. Exact Scale Factor for Nilpotent Matrices
Our computational investigations reveal an exact formula for the scale factor in the nilpotent case, demonstrating that the constant
in Conjecture 4.5 is attained.
Theorem 5.1 (Exact scale factor). Let
be a
nilpotent matrix with
, and let
with
. If
, then
Consequently,
and
are concentric disks with length ratio
and area ratio
.
Proof. Direct computation yields
By Example 31, the numerical range of
is
with numerical radius
. Therefore
and the ratio is
. □
Corollary 5.2 (Scale-invariant sharpness). For the nilpotent case with diagonal similarity
, we have
and
In particular, the conjectured bound
is attained with equality whenever
, and the lower extreme
is attained whenever
. Both statements are invariant under rescaling
(
), as they must be, since
and
implement the same similarity. (When
the two cases agree:
and
.)
Proof. Immediately from Theorem 5.1 and
if
then
; if
then
. □
Remark 5.3. Theorem 5.1 reveals that for nilpotent matrices, the scale factor depends on the ratio of the diagonal entries, not on their individual magnitudes or on the operator norms separately. This geometric insight is obscured by condition-number bounds, which treat expansion and contraction asymmetrically.
Table 1 records the computed scale factors for a range of values of
, and Figure 8 plots them against the prediction of Theorem 5.1.
Table 1. Scale-factor analysis for
with
. The scale factor
exactly, confirming Theorem 5.1. For
(
) the ratio equals
; for
it equals
, in accordance with Corollary 5.2.
|
|
|
|
|
|
0.25 |
1.000 |
4.000 |
4.000 |
0.250 |
0.25 |
0.50 |
1.000 |
2.000 |
2.000 |
0.500 |
0.50 |
1.00 |
1.000 |
1.000 |
1.000 |
1.000 |
1.00 |
2.00 |
2.000 |
1.000 |
2.000 |
2.000 |
2.00 |
4.00 |
4.000 |
1.000 |
4.000 |
4.000 |
4.00 |
Limitations of the exact analysis. We emphasize the scope of what has been proved in this section. The exact distortion formula of Theorem 5.1, and the resulting exact similitude between
and
, are established only for 2 × 2 nilpotent matrices under diagonal similarity. In this very special situation, both numerical ranges are disks centered at the origin, so size determines shape. For general matrices
and general invertible
, our results (Theorem 4.2, Corollary 4.3) are bounds on the numerical radius, not a geometric classification of
: Example 4.1 shows that
may fail to be geometrically similar to
in any sense—indeed, a segment may deform into a genuinely two-dimensional ellipse. Section 9 makes this rigidity phenomenon precise in the 2 × 2 case. A full geometric classification of the possible pairs
for
remains open.
![]()
Figure 8. Systematic verification of Theorem 5.1. For each value of
, the computed scale factor
equals
exactly.
6. Metric Similarity
We now extend our analysis to metric similarity, establishing a fundamental invariance result. Metric similarity, which combines similarity with unitary equivalence, arises naturally in the study of operator algebras and has connections to the polar decomposition [4] [9].
6.1. The Invariance Theorem
Theorem 6.1 (Metric similarity invariance). Let
, let
be positive invertible, and let
be unitary. Then
The unitary component
has no effect on the numerical range.
Proof. For any matrix
and unitary
we have
: the substitution
shows that as
ranges over unit vectors so does
, and
Applying this with
yields the result. □
Corollary 6.2. For numerical-range analysis, metric similarity and ordinary similarity are equivalent:
for some positive invertible
.
All results established for similarity in Sections 4-5 apply unchanged to metric similarity.
6.2. Computational Verification
To verify Theorem 6.1 computationally, we tested five different unitary matrices
with the same positive
: 1)
(identity); 2)
(permutation); 3)
(diagonal); 4)
(complex); (v)
a random unitary drawn from Haar measure. In all cases, the computed numerical radius was
, confirming the theorem. Figure 9 superimposes the numerical ranges obtained under ordinary and metric similarity for
, and Figure 10 reports the outcome for all five unitaries.
Figure 9. Metric similarity analysis. The numerical ranges
(ordinary similarity) and
(metric similarity) are identical. The numerical radii satisfy
exactly.
Figure 10. Verification with multiple unitary matrices. All five choices of
produce identical numerical radius
, confirming that
has no effect on the numerical range.
7. Comparison of Equivalence Relations
We summarize in Table 2 the effects of the three equivalence relations on key operator-theoretic quantities. This classification extends the systematic study of numerical-range preservers initiated in [6] and connects to the broader theory of operator equivalences in [4].
Table 2. Comparison of equivalence relations and their preservation properties.
Relation |
Definition |
Spectrum |
Num. Range |
Num. Radius |
Unitary Equivalence |
|
Preserved |
Preserved |
Preserved |
Metric Similarity |
|
Preserved |
Distorted |
Distorted |
Similarity |
|
Preserved |
Distorted |
Distorted |
The spectrum
is preserved under all three relations because similar matrices have identical characteristic polynomials ([7], Theorem 1.3.20). However, the numerical range, being defined through the inner-product structure, is sensitive to non-unitary transformations [3].
Theorem 7.1 (Distortion hierarchy). Let
and let
be related to
by one of the three equivalence relations. With
:
(i) If
(unitary equivalence), then
and
.
(ii) If
(metric similarity), then
and
(iii) If
(similarity), the same bounds hold.
Proof. (1) is classical; (iii) is Corollary 4.3; (ii) follows from (iii) together with Theorem 6.1. □
The identity
shows that metric similarity factors through ordinary similarity for numerical-range purposes. The unitary component affects the eigenvector structure but not the numerical range.
8. The Prototype-Model Framework
Our results admit a natural geometric interpretation through the lens of similitude, connecting to the theory of self-similar sets developed by Hutchinson [10] and the geometric study of convex sets [9].
Definition 8.1. Given
, we call
the prototype and
the model. The similarity transformation
induces a quantitative relationship between these sets characterized by:
(i) Scale factor:
, which by Corollary 4.3 satisfies
(ii) Length ratio:
and area ratio
, whenever
and
are in fact geometrically similar in the sense of Definition 2.9.
For nilpotent matrices with diagonal
, Theorem 5.1 shows that
and
are exact similitudes (concentric disks) with scale factor
, so the length and area ratios in (ii) are meaningful and computable. In general, however,
and
need not be similar to one another: Example 4.1 exhibits a similarity carrying a line segment to a nondegenerate elliptical disk, and Section 9 shows that for 2 × 2 matrices with distinct eigenvalues, an exact similitude relation forces
. Accordingly, in the general case, the prototype-model relationship must be understood through the proven numerical-radius bounds: the model’s size is controlled by
and not by any radial containment between
and
themselves. In particular, the containments
asserted in an earlier version of this work are false in general and have been withdrawn; Example 4.1 is a counterexample to both inclusions.
9. The Rotation Question: Partial Results and a Counterexample
For
, write
for the numerical ranges normalized to unit numerical radius (assuming
; note
iff
iff
). An earlier version of this work conjectured, on visual evidence, that for some rotation angle
depending on
. In this section we settle the question completely in the 2 × 2 case: the conjecture holds—trivially, and with
—for nilpotent
, but fails in general, and we characterize exactly when it holds. The key mechanism is a rigidity phenomenon: because similarity preserves eigenvalues, and eigenvalues are the foci of the elliptical numerical range, an exact similitude relation between
and
is severely constrained.
Proposition 9.1 (Nilpotent case: the conjecture holds with
). Let
be nilpotent,
, and let
be invertible. Then
is nilpotent, both
and
are closed disks centered at the origin, and
Proof.
is nilpotent since similarity preserves the characteristic polynomial.Every nonzero nilpotent
is unitarily equivalent to
with
(Schur triangularization), so by Example 0.10,
is the closed disk of radius
centered at 0. Normalizing by the numerical radius yields the closed unit disk in both cases. □
Proposition 9.2 (Rigidity for distinct eigenvalues). Let
have distinct eigenvalues
, let
be invertible, and let
. The following are equivalent:
(a)
for some
,
,
(i.e.,
is a similitude of
);
(b)
;
(c)
.
Proof. (b)
(a) is trivial. For (a)
(b): by Theorem 2.5,
and
are (possibly degenerate) elliptical disks with the same foci
, since
. A similitude
maps an elliptical disk to an elliptical disk and maps foci to foci (also in the degenerate case, where the segment’s endpoints are the foci). Hence, the similitude in (a) maps
onto
. Comparing the distances between the foci gives
, so
and the map is an isometry
fixing
setwise. If it fixes each focus, then
forces
,
, and the map is the identity. If it swaps the foci, then
forces
and
, i.e., the point reflection through the midpoint
. An elliptical disk is centrally symmetric about its center, which is the midpoint of its foci; hence, in either case, the image of
is an elliptical disk with foci
and the same minor axis as
. Thus,
and
share foci and minor axis, so
.
(b)
(c): two elliptical disks with the same foci coincide iff their minor axes agree, and by Theorem 2.5, the minor axis of
is
; since
and
have the same eigenvalues, equality of minor axes is precisely (c). □
Theorem 9.3 (Resolution of the rotation question for
). Let
,
, let
be invertible, and let
. Then
for some
is nilpotent, or
.
Moreover, whenever the relation holds, it holds with
:
.
Proof. (
) If
is nilpotent this is Proposition 9.1; if
then also
and
.
(
) Suppose , i.e.,
a similitude with translation
, and suppose
is not nilpotent.
Case 1:
. Proposition 9.2 applies and gives
.
Case 2:
(equal eigenvalues;
since
is not nilpotent). Write
and
with
nilpotent,
. By Proposition 9.1 (or trivially if
),
and
are disks centered at
with radii
. The relation
forces equality of centers,
, whence
, so
,
, and then
, i.e.,
.
Finally, in every case where the relation holds we have shown either
(nilpotent case) or
; in both,
works. □
Example 9.4 (Explicit counterexample to the general rotation conjecture). Take
and
as in Example 4.1, so
. Then
is a segment, while
is the elliptical disk with foci ±1 and semi-axes
(major) and 1 (minor), so
and
is a nondegenerate elliptical disk with semi-axes 1 and
. A rotated segment can never equal a two-dimensional ellipse, so for every
. (Consistency check:
and
, in accordance with Conjecture 4.5 and Theorem 4.2.)
Remark 9.5. (Higher dimensions and boundary generating curves). The mechanism behind Proposition 9.2 is that the eigenvalues, which are invariant under similarity, serve as the foci of the boundary of
in the 2 × 2 case. For
the natural tool is Kippenhahn’s determinantal representation [11]: writing
with
Hermitian, the numerical range
is the convex hull of the real affine part of the algebraic curve dual to
and the (real) foci of this boundary generating curve are precisely the eigenvalues of
. Since similarity preserves eigenvalues, any exact similitude between the boundary generating curves of
and
is subject to the same focus-rigidity as in Proposition 9.2. However, for
the set
does not determine its generating curve, and a similitude of the convex sets need not extend to a similitude of the curves; a complete classification is therefore open. We record the two questions our analysis leaves open in the form suggested by the
resolution.
Open Problem 9.6. Characterize the pairs
,
,
invertible, for which
is a similitude of
. Theorem 9.3 resolves the case
: for distinct eigenvalues, this occurs only trivially (
), while for coincident eigenvalues, it always occurs, with rotation angle 0. We conjecture that also for
, whenever the similitude relation holds, the rotation angle can be taken to be
modulo the symmetries of
.
10. Conclusions and Future Directions
This paper develops a framework for understanding numerical-range distortion under similarity and metric similarity of matrices, in the tradition of Toeplitz [1], Hausdorff [2], and Goldberg-Straus [8]. Our principal contributions are:
1) Distortion bounds. We proved the two-sided numerical-radius bound
with
(Theorem 4.2, Corollary 4.3), sharp in the unitary case, and we showed by an explicit example that no set inclusion of the form
can hold in general (Example 4.1). We conjecture that the optimal constant is
(Conjecture 4.5), which is attained on the nilpotent family.
2) Exact formulas. For nilpotent 2 × 2 matrices with diagonal similarity
, we established the exact scale factor formula
, with the scale-invariant sharpness dichotomy of Corollary 0.24.
3) Metric similarity invariance. We proved the identity
, showing that the unitary component has no effect on numerical-range distortion; this extends the invariance properties cataloged in [6].
4) Resolution of the rotation question for
. We showed that the normalized numerical ranges
and
are related by a rotation precisely when
is nilpotent or
, and that the rotation angle can then be taken to be zero (Theorem 9.3); the general similitude classification for
is posed as Open Problem 9.6, together with the Kippenhahn-curve approach sketched in Remark 9.5.
Limitations. We reiterate the boundaries of the present work. All results are proved for matrices on finite-dimensional spaces; in infinite dimensions, even the spectral inclusion must be modified (Remark 2.4). The exact distortion formula is proved only for 2 × 2 nilpotent matrices under diagonal similarity; for general
our results are quantitative bounds on the numerical radius rather than a geometric classification of the numerical range, and the optimal distortion constant (conjecturally
) remains open. The rotation/similitude question is fully resolved only for
.
Beyond Conjecture 4.5 and Open Problem 9.6, natural directions include exact scale factors for larger classes of matrices (e.g., quadratic operators, whose numerical ranges are elliptical), the behavior of the boundary generating curve under similarity for
via Kippenhahn’s classification [11], and analogs for the q-numerical range and the numerical ranges of operator polynomials.
Author Contributions
Faith Mwangi was involved in conceptualization, analysis, and writing; Benard Nzimbi and Stephen Luketero were involved in conceptualization and review of the manuscript.
Statement
Computational work was performed using Python with NumPy, SciPy, and Matplotlib.