Empirical Means on Pseudo-Orthogonal Groups

: The present article studies the problem of computing empirical means on pseudo-orthogonal groups. To design numerical algorithms to compute empirical means, the pseudo-orthogonal group is endowed with a pseudo-Riemannian metric that affords the computation of the exponential map in closed forms. The distance between two pseudo-orthogonal matrices, which is an essential ingredient, is computed by both the Frobenius norm and the geodesic distance. The empirical-mean computation problem is solved via a pseudo-Riemannian-gradient-stepping algorithm. Several numerical tests are conducted to illustrate the numerical behavior of the devised algorithm


Introduction
The present article aims at investigating a least-squares problem on the pseudo-orthogonal Lie group O(p, q) (we follow the nomenclature in [1]) endowed with a pseudo-Riemannian metric that affords the computation of geodesic in closed form, with the aim of computing the empirical mean value µ of a finite collection of pseudo-orthogonal matrices.The empirical mean value µ of a distribution of points on a manifold is instrumental in several applications (see, for example, the article [2] that concerns the statistics of covariance matrices for biomedical engineering applications, the article [3] that deals with urban mobility analysis and the article [4] that concerns water quality assessment).The mean value µ is, by definition, close to all points in the distribution and this makes the tangent space at µ a good candidate as a reference space for numerical calculations (see, for example, [5]) as well as empirical statistical evaluations (see, for example, [6] and, for a recent account, [7]).
Since, in general, an empirical mean of a collection of mathematical objects living in a metric space is the closest point in the space to all points in the collection, the problem of defining and computing an empirical mean may be formulated in terms of minimization of a sum-of-squared distance problem.Function minimization over smooth matrix manifolds has received considerable attention due to its broad application range [8][9][10][11][12][13].In general, smooth manifolds in function optimization serve to conveniently represent non-linear constraints.Constrained optimization arises in several branches of science, ranging from applied mathematics [14][15][16] to information sciences [14,17,18].In [19,20], optimization-based mean-computation problems over the space of the symmetric positive-definite matrices, the special Euclidean group and the space of unipotent matrices were studied.The authors of [21] investigated the problem of computing empirical arithmetic averages over the Stiefel manifolds by tangent-bundle maps.Similarly, in [22], the authors studied empirical arithmetic-mean computation algorithms over the Grassmann manifolds.In [23], the author studied non-compact matrix-type manifolds (for example, the real symplectic group).
A special case of pseudo-orthogonal group is the Lorentz group O(1, 3), which describes Lorentz transformations of Minkowski space-time, the classical setting for non-gravitational physical phenomena.Lorentz groups are likewise relevant in classical ray optics [24].Moreover, the Lorentz group is related with Poincaré groups, which may be seen as the semidirect product of Lorentz and translation groups [25].In engineering, the Lorentz group plays a fundamental role, e.g., in the analysis of motion of charged particles in electromagnetism.For instance, the article [26] investigates on the computation of the trajectory of a charged particle in a magnetic field (such as an electron trapped in a cusp-shaped magnetic field) in terms of the Lorentz-group's Lie-algebra map.
The present article is organized as follows.Section 2 recalls some fundamental notions on the geometry of pseudo-Riemannian manifolds and the gradient-steepest-descent function-minimization method on pseudo-Riemannian manifolds.The present article takes the route of embedding a pseudo-orthogonal group O(p, q) into the Euclidean ambient space R (p+q)× (p+q) and to formulate all equations without recurring to any specific coordinate system nor any specific base for the associated tangent bundle.Section 3 introduces the pseudo-Riemannian geometric structure of the pseudo-orthogonal group and presents the necessary calculations to tackle function-minimization problems over such matrix group.Section 4 presents results of several numerical tests about computing a mean matrix over a pseudo-orthogonal group.Section 5 concludes the article.

Function Minimization on Pseudo-Riemannian Smooth Manifolds
For a certain pseudo-Riemannian manifold M endowed with a distance function d(•, •), the empirical mean µ ∈ M of a finite collection of points In the present section, we summarize the notion of function minimization over a smooth pseudo-Riemannian manifold from previous research endeavors.Section 2.1 recalls fundamental notions from differential geometry, while Section 2.2 summarizes the main ideas behind pseudo-gradient-based function minimization on pseudo-Riemannian manifolds.

Notes on Pseudo-Riemannian Manifolds
Let M denote a p-dimensional pseudo-Riemannian submanifold of the general linear group and let T x M denote the tangent space of M at the point x.The symbol TM : denotes the tangent bundle associated to the manifold M and the symbol Γ(TM) denotes the set of vector fields on M. The cotangent space of M at a point x is denoted by T * x M. We denote by the symbol •, • E the Euclidean inner product.
A pseudo-Riemannian manifold is endowed with an indefinite inner product •, • x : An indefinite inner product is a non-degenerate, smooth, symmetric, bilinear map which assigns a real number to pairs of tangent vectors at each tangent space of a manifold.In pseudo-Riemannian geometry, the metric tensor is symmetric and invertible but not necessarily positive-definite. Let x M and satisfies the relationship d f x (v) = ∇ x f , v x , where ∇ x f ∈ T x M denotes the pseudo-Riemannian gradient.Once a metric is selected, the pseudo-Riemannian gradient of a smooth function can be computed by the condition The covariant derivative of a vector field v ∈ Γ(TM) in the direction of a tangent vector w ∈ T x M is denoted as ∇ w v.In the present article, the notion of connection refers to a Levi-Civita connection.The calculation of the expression of geodesics associated to a given metric on a pseudo-Riemannian manifold may be formulated in variational terms as recalled in the following Lemma 1 ([23]).Let γ : [0, 1] → M be a sufficiently regular curve with fixed endpoints, then the geodesic equation ∇ γ γ = 0 is equivalent to the equation where δ denotes the variation of the integral functional.Namely, γ satisfies the geodesic equation if and only if it is a critical point of the energy functional (define on the space of C 1 -paths with fixed endpoints).
This is, indeed, a well-known result: although the metric is pseudo-Riemannian, its proof is the same as in the Riemannian case where there exist several references (see, e.g., [27]).
The variational formulation to compute the explicit expression of geodesics in embedded manifolds is easier to use in practical calculations than the covariant-derivative-based definition.

Gradient-Based Function Minimization on Pseudo-Riemannian Manifolds
On a geodesically complete Riemannian manifold M, the metric is positive definite, hence the squared geodesic distance connecting two points x 1 , x 2 ∈ M is defined as If the geodesic is denoted as γ x,v (t), which indicates that the geodesic arc is departing from the point x ∈ M with initial direction v ∈ T x M, then the squared geodesic distance equals v 2 x .When the Riemannian manifold of interest M and a regular criterion function f : M → R are specified, a geodesic-based Riemannian-gradient-steepest-descent function-minimization method is expressed as where ≥ 0 denotes an iteration step-counter, t ( ) denotes a step-size schedule and the initial guess x (0) ∈ M is arbitrarily chosen.Since a pseudo-Riemannian manifold is a manifold endowed with a metric that is not necessarily positive-definite, on a pseudo-Riemannian manifold M, the quantity v 2 x may be positive, negative or null even for 0 = v ∈ T x M. A key step in pseudo-Riemannian geometry is to decompose each tangent space Given a pseudo-Riemannian manifold M and a regular criterion function f : M → R, a "gradient steepest descent" function minimization rule is expressed as which can be implemented numerically by a geodesic-based stepping method which moves a point along a short self-parallel arc in the direction of the pseudo-Riemannian gradient The step-size schedule t ( ) may be defined on the basis of an optimality condition, which resembles Armijo's line search method [28], under the assumption that ∇ x ( ) f / ∈ T 0 x ( ) M (see [23]).Define the function f( where The value f( ) (0) − f( ) (t) ≥ 0 denotes the decrease of the criterion function f subject to a pseudo-geodesic step of size t.If the value of the geodesic step-size t is small enough, such decrease can be expanded in Taylor series as f( where the coefficients f1( ) , f2( ) of the Taylor expansion are defined as Under such second-order Taylor approximation, the step-size value that maximizes the decrease rate is The above choice for the step-size schedule is optimal only if f1( ) ≤ 0, f2( ) > 0, because these two conditions ensure that t ( ) ≥ 0, hence that the algorithm is always seeking for the minimum of the criterion function f .Given a precision value > 0 and under the assumption that ∇ x f / ∈ T 0 x M, the numerical procedure stops at step ¯ if This condition expresses the fact that the value taken by the first derivative of the function f is so small that no further improvements can be gained by continuing with the iteration.For the sake of consistency, it is assumed that the function f be bounded from below in M.

Function Minimization on the Pseudo-Orthogonal Group
Two criterion functions on the pseudo-orthogonal group that encode the notion of average squared distance may be constructed on the basis of the Frobenius norm and of the induced geodesic distance on the pseudo-orthogonal group O(p, q).The related function minimization problem can be solved numerically by a pseudo-Riemannian-gradient-based algorithm.
In the present section, we deal with a matrix manifold, therefore it pays to recall that, on a matrix space, A, B E := tr(A B), where denotes matrix transpose and "tr" denotes a matrix trace operator.The matrix Frobenius norm is defined by A F := A, A E .Section 3.1 surveys the geometric structure of the pseudo-orthogonal group and describes a pseudo-Riemannian metrization.Sections 3.2 and 3.3 describe two different criterion functions to compute the geodesic mean over a pseudo-orthogonal group and present the related numerical function minimization algorithms.

Pseudo-Riemannian Geometric Structure of the Pseudo-Orthogonal Group
A pseudo-orthogonal group O(p, q), as a non-compact matrix Lie group [29], is an instance of quadratic groups and is defined by where the symbol I p denotes a p × p identity matrix and the symbol O p×q denotes a whole-zero p × q matrix.The matrix R p,q enjoys the properties R 2 p,q = I p+q , R p,q = R −1 p,q = R p,q .Pseudo-orthogonal matrices enjoy two properties that are recalled in the following.Lemma 2. Any pseudo-orthogonal matrix X ∈ O(p, q) is invertible.In addition, it holds that X F = X −1 F .
Proof.From the defining property X R p,q X = R p,q , it follows that det(X R p,q X) = det(R p,q ), hence det(X) 2 = 1, which proves the first assertion.From the definition of pseudo-orthogonal matrices, there follow the identities which are often useful in the course of calculations.By the first identity in Equation ( 14), it is easy to see that by the circular shift property of the matrix trace operator.From the second identity in Equation ( 14), it follows that tr((R p,q XR p,q which proves the second assertion.
The tangent bundle of a pseudo-orthogonal Lie group has the structure and the tangent space at the identity of O(p, q), namely the Lie algebra o(p, q), has the structure By the embedding of O(p, q) into the Euclidean space R (p+q) 2 , the normal space at any point X ∈ O(p, q) is defined by The tangent space, the Lie algebra and the normal space associated to the group-manifold O(p, q) can be characterized as follows Let us consider the following indefinite inner product on the general linear group GL(p, R) referred to as Khvedelidze-Mladenov metric (see [30]).The following lemma proves two properties of such metric applied to the pseudo-orthogonal group.
Proof.Let us prove the two parts of the lemma separately.

Proof of Part (i):
A metric on a finite-dimensional space is non-degenerate if and only if U, V X = 0 for every U implies V = 0. Given X ∈ O(p, q) and U, V ∈ T X O(p, q), by the structure of the tangent space T X O(p, q), it is known that X −1 U = R p,q Ω, with Ω = −Ω and X −1 V = R p,q Ψ, with Ψ = −Ψ, therefore, U, V X = tr(R p,q ΩR p,q Ψ).Let us define Ω := R p,q ΩR p,q .Calculations show that Ω = R p,q Ω R p,q = R p,q (−Ω)R p,q = −Ω , hence, Ω is a skew-symmetric matrix.The proof of the claim follows from the observation that and that the Euclidean inner product is non-degenerate on the Lie algebra of skew-symmetric matrices.
Proof of Part (ii): Given X ∈ O(p, q) and V ∈ T X O(p, q), it is known that with The sign of the squared norm V 2 X may be positive, negative or even zero whenever 2 tr(BB ) + tr(A 2 ) + tr(C 2 ) = 0. Let us take, as a special case, the pseudo-orthogonal group O(1, 1), which is the group-manifold of choice in some of the numerical examples presented in Section 4 thanks to its low dimensionality, for which the following result holds: Proof.Every element of O(1, 1) can be written in one of the four forms: − cosh(s) , where s is any real number.Moreover, the inverses of the above representations, which are necessary in the evaluation of the norms, read The tangent vectors corresponding to the above four representations take the form where t is any real number.Hence, straightforward calculations lead to the following values for the tangent vector norms By direct calculations, the assertion follows.
It is worth remarking that, in particular, from the proof of the above lemma, it follows that Under the pseudo-Riemannian metric in Equation (19), it is possible to compute the expression of geodesic over the pseudo-orthogonal group in closed form.To compute the expression of a geodesic curve on O(p, q), we invoke the variational formulation recalled in Section 2.1.
Proof.On the strength of Lemma 1, the geodesic equation expressed in variational form reads where the natural parametrization of the curve is assumed.By computing the variation above, we have that Since the variation δγ ∈ T γ O(p, q) is arbitrary, the sum within the innermost parentheses must belong to the normal space at γ.By the structure of the normal space N γ O(p, q), we have γ − γγ −1 γ = γSR p,q , S = S.
In the above result, the symbol "exp" denotes matrix exponential, defined on the basis of a Taylor series expansion.For low dimensions p + q, the matrix exponential may be computed through special Rodrigues-like closed-form expressions [31].
As an essential ingredient in the formulation of a pseudo-Riemannian-gradient stepping algorithm to minimize a smooth function on a pseudo-orthogonal group, the structure of the pseudo-Riemannian gradient associated to the Khvedelidze-Mladenov metric in Equation (19) in O(p, q) is given by the following.
Theorem 2. The pseudo-Riemannian gradient of a sufficiently regular function f : O(p, q) → R associated to the Khvedelidze-Mladenov metric in Equation (19) reads Proof.According to the relationship in Equation ( 19), the gradient ∇ X f is computed as the solution of the following system of equations Note that the first equation in Equation ( 23) can be rewritten as Since V ∈ T X O(p, q) is arbitrary, the condition above implies that (∂ = R p,q XS, with S = S .Therefore, the pseudo-Riemannian gradient of the function f has the expression Substituting the relation in Equation ( 25) into the second equation of Equation (23) gives Substituting back Equation (26) into the relation in Equation ( 25) completes the proof.
A Riemannian setting for the metrization of the pseudo-orthogonal group was proposed and studied in [12].We believe that both Riemannian and pseudo-Riemannian metrizations are worth investigating as they lead to quite different analytic results.

A Criterion Function Based on the Frobenius Norm over O(p, q)
In the present article, the pseudo-orthogonal group is treated as a pseudo-Riemannian manifold.Although it is possible to introduce a pseudo-distance function that is compatible with the pseudo-Riemannian metric, such function is not positive definite and cannot be interpreted as a distance function.
Therefore, as a first attempt in the construction of a criterion function to define an empirical mean, we consider the distance function on the pseudo-orthogonal group suggested in the research work [32], which is defined as The criterion function f : O(p, q) → R to be minimized to compute an average point out of a collection {X 1 , X 2 , . . ., For the sake of notational convenience, set C := 1 N ∑ k X k , which is the empirical arithmetic average of the collection of points.The criterion function in Equation ( 28) can be recast as f (X) = 1 2 X − C 2 F + constant.On the basis of such expression, it is straightforward to verify that therefore the Euclidean gradient of the function f with respect to X is given by ∂ According to Theorem 2, the pseudo-Riemannian gradient of the criterion function in Equation ( 28) on a pseudo-orthogonal group endowed with the Khvedelidze-Mladenov metric is given by The double squared pseudo-Riemannian norm of the pseudo-Riemannian gradient ∇ X f reads To prove the consistency of the pseudo-Riemannian function minimization algorithm with the function minimization problem at hand, it is necessary to evaluate the sign of the coefficients of the step-size schedule, as discussed in Section 2.2.

Lemma 5. The coefficients f1 and f2 of the function
which proves the assertion.
The following two lemmas examine the signs of the coefficients f1 and f2 .
Proof.In the case that ∇ X f ∈ T + X O(p, q) ∪ T 0 X O(p, q), the algorithm in Equation ( 7) takes V = −∇ X f , hence, by Equation ( 31), Conversely, when ∇ X f ∈ T − X O(p, q), the algorithm in Equation ( 7) takes which proves the assertion.
Proof.The coefficient f2 is computed as the sum of two terms, ||V|| 2 F and tr((X − C) VX −1 V).The first term is nonnegative for every V ∈ T X O(p, q), while the second term is indefinite.Note that As a consequence, fixing ||C|| F , for ||X − C|| F sufficiently small, the coefficient f2 is non-negative.
A consequence of Lemma 7 is that the initial point X (0) may be chosen or randomly generated in O(p, q), provided it meets the condition The proposed procedure to minimize the criterion function in Equation ( 28) can be summarized by the pseudo-code listed in Algorithm 1, where it is assumed that the sequence → X O(p, q).In Algorithm 1, the quantity denotes a step counter, the matrix J ( ) represents the Euclidean gradient of the criterion function in Equation ( 28), the matrix U ( ) represents its pseudo-Riemannian gradient and the sign of the scalar quantity s ( ) determines whether the matrix U ( ) belongs to the space T + X ( ) O(p, q) or to the space T − X ( )

O(p, q).
Algorithm 1 Pseudocode to implement mean-computation over O(p, q) according to the function minimization rule (7) endowed with the step-size-selection rule in Equation ( 11) and the stopping criterion in Equation (12).

A Criterion Function Based on the Geodesic Distance over O(p, q)
We may consider a second instance of distance between two points in the group-manifold O(p, q) defined as follows where the symbol | • | denotes the entry-wise absolute value of the argument matrix.On the basis of the above distance function, the criterion function f : O(p, q) → R to be minimized in the context of computing a mean matrix out of a set of pseudo-orthogonal matrix-samples is defined by Let us fix an element Y ∈ O(p, q) and compute the pseudo-Riemannian gradient of the map X → D2 g (X, Y), where we define an auxiliary function as D2 g (X, Y) := tr(log 2 (X −1 Y)).According to Proposition 2.1 in [20], the differential of the auxiliary function may be written as Therefore, the Euclidean gradient of the auxiliary function is given by According to Theorem 2, the following expression for the pseudo-Riemannian gradient of the distance function in Equation ( 37) is readily obtained The proposed procedure to minimize the criterion function ( 38) is summarized by the pseudocode listed in Algorithm 2, where the notation is the same as in Algorithm 1.In this empirical mean computation algorithm, a fixed step-size η has been selected, as opposed to Algorithm 1 that utilizes a variable step-size schedule.
Algorithm 2 Pseudocode to implement mean-computation over O(p, q) according to the function minimization rule in Equation (7).

Numerical Tests
The present section shows the results of several numerical tests effected on the iterative algorithm in Equation (7).Section 4.1 shows results about gradient-based minimization of a criterion function induced by the Frobenius norm.Section 4.2 shows results about the gradient-based minimization of a criterion function induced by the geodesic distance.
The numerical experiments rely on the availability of a way to generate pseudo-random samples on the pseudo-orthogonal group.Given a point X ∈ O(p, q), which is referred to in the following as "center of mass" or simply center of the random distribution, it is possible to generate a random sample Y ∈ O(p, q) in a neighbor of a matrix X by the rule where the direction V ∈ T X O(p, q) is randomly generated around 0 ∈ T X O(p, q).A set of points Y generated by the exponential rule in Equation (41) distributes around the point X, as confirmed by the following.
According to the structure of the tangent space T X O(p, q), Equation (41) can be written Y = X exp(R p,q (A − A )), where A ∈ R (p+q)×(p+q) has zero-mean randomly-generated entries.Note that Namely, the variance of the entries a ij of A controls the spread of the random pseudo-orthogonal sample-matrices Y around the center of mass X.

Gradient-Based Minimization of a Criterion Function Induced by the Frobenius Norm
The computation of the mean matrix from a dataset of matrices belonging to the pseudo-orthogonal group O(1, 1) is tackled as a first test.Further numerical tests focus on the computation of the empirical mean of a set of pseudo-orthogonal matrices in O(p, q) with p > 1 and q > 1.All tests in the present section refer to Algorithm 1.
Numerical experiment A: Mean matrix computation on the pseudo-orthogonal group O(1, 1).From Lemma 4, we know that every element of the group O(1, 1) can be written in one of four canonical forms: here the first form is studied.This choice was motivated by the observation that the elements of the group O(1, 1) can be rendered graphically on a 2-dimensional drawing.Figure 1 shows the location of N = 50 samples X k (circles) generated randomly around a randomly-selected center of mass (cross), the trajectory of the function minimization algorithm over O(1, 1) (solid-dotted line), and the location of the final point computed by the algorithm (diamond).To emphasize the behavior of the function minimization method in Equation (7), in the present experiment, a constant step-size schedule t ( ) = 1  2 is selected and no stopping criterion is made use of.Figure 1 confirms that the numerical function minimization algorithm is convergent toward the center of mass.(Because of finite sample size, the empirical center of mass differs from the actual one.) Figure 2 shows the values of the criterion function 1 2N ∑ k D 2 F (X, X k ) and of the Frobenius norm of its pseudo-Riemannian gradient during iteration, and the distances D F (X, X k ) before iteration (with initial point chosen as X (0) = I 2 ) and after iteration.In particular, all the distances from the samples X k and the matrix X decreased substantially.(To obtain an easy-to-read graph, we chose to represent a pseudo-orthogonal matrix X ∈ O(1, 1), which is a 2 × 2 matrix, by two fictitious coordinates, namely the entry X (1,1) as first coordinate and the entry X (1,2) as second coordinate.) Numerical experiment B: Mean matrix computation on the pseudo-orthogonal group O(p, q) with p, q > 1. Figure 3 illustrates a result obtained with the iterative algorithm in Equation ( 7) when p = 5, q = 5 and N = 50.Figure 3 shows the values of the criterion function 1 2N ∑ k D 2 F (X, X k ) and of the Frobenius norm of its pseudo-Riemannian gradient during iteration.Such numerical results were obtained by the adaptive step-size schedule explained in Section 2.2, the stopping condition in Equation ( 12) with precision = 10 −6 and an initial point chosen as X (0) = I 10 .Figure 3 also displays the distances D F (X, X k ) before iteration (with initial point chosen as X (0) = I 10 ) and after iteration.Figure 4 shows the value of the index X ( ) R p,q X ( ) − R p,q F during iteration as well as the value of the step-size schedule.In Figure 4, the values of the coefficients f1 and f2 during iteration are displayed as well.28) over the pseudo-orthogonal group O(5, 5): Values of the index X ( ) R p,q X ( ) − R p,q F and of the coefficients t( ) , f1( ) and f2( ) during iteration.
Figures 5 and 6 illustrate the numerical results obtained by means of the iterative algorithm in Equation ( 7) for p = 10, q = 5 and N = 50.As may be readily observed, with the growth of the dimension of the underlying manifold, the minimization problems related to the search for a mean matrix becomes increasingly harder to solve.Compared to the results shown in Figures 3 and 4, the minimization algorithm takes a larger number of iterations to achieve comparable precision levels.28) over the pseudo-orthogonal group O(10, 5): Values of the index X ( ) R p,q X ( ) − R p,q F and of the coefficients t( ) , f1( ) and f2( ) during iteration.
Figure 7 shows the result of an empirical statistical analysis about mean-matrix computation over the pseudo-orthogonal group O(3, 1) on 500 independent trials.In each trial, the algorithm starts from a randomly generated initial point.In particular, Figure 7 displays the distribution of the number of iterations that the numerical minimization algorithm takes to achieve the desired precision level = 10 −6 on each trial.The convergence speed varies with the initial point while the algorithm converges in every trial to the same value of the criterion function (namely, to about 0.0622 in the current test).The largest number of trials converge in about 20-30 iterations.

Gradient-Based Minimization of a Criterion Function Induced by the Geodesic Distance
In the following experiments, a constant step-size η = 1 2 was chosen and, to evidence the numerical stability of the numerical minimization method, no stopping criterion was used.In this set of experiments, empirical means are sought for within the pseudo-orthogonal groups O(1, 1) and O(5, 5) by means of Algorithm 2.
Numerical experiment C: Mean matrix computation on the pseudo-orthogonal group O(1, 1). Figure 8 shows the results of optimization over the low-dimensional pseudo-orthogonal group O(1, 1) rendered on a 2-dimensional drawing.Figure 8 shows the location of 50 samples (or target matrices) X k (circles) generated randomly around a randomly-selected center of mass (cross), the location of the final point of the iteration, namely, the inferred empirical mean (diamond) and the trajectory of the function minimization algorithm over O(1, 1) (solid-dotted line).Figure 9 shows that the algorithm is convergent toward the center of mass.(Again, because of finite sample size, the empirical mean differs from the actual center of mass.) Figure 9 shows the values of the criterion function 1 2N ∑ k D 2 g (X, X k ), the pseudo-norm of its pseudo-Riemannian gradient during iteration and the distances D g (X, X k ) before iteration (with initial point chosen as X (0) = I 2 ) and after iteration.38) during iteration, of the pseudo-norm of its pseudo-Riemannian gradient, of the distances D g (X, X k ) before iteration (X = X (0) ) and after iteration (X = µ).
The numerical function-minimization algorithm converges steadily and quickly to the minimum value of the criterion function and keeps in the vicinity of the empirical mean after convergence.
Numerical experiment D: Mean matrix computation on the pseudo-orthogonal group O(p, q) with p, q > 1. Figure 10 shows a result obtained with the iterative algorithm (7) for p = q = 5 and N = 50.Figure 10 shows the values of the criterion function 1 2N ∑ k D 2 g (X, X k ) and the pseudo-norm of its pseudo-Riemannian gradient during iteration, and the distances D g (X, X k ) before iteration (with initial point chosen as X (0) = I 10 ) and after iteration.The results in Figure 10 confirm that the numerical function minimization algorithm converges steadily toward the minimal distance configuration.In fact, the distances from the found empirical mean are much smaller than the distances from the initial point.38) during iteration, of the pseudo-norm of its pseudo-Riemannian gradient, of the distances D g (X, X k ) before iteration (X = X (0) ) and after iteration (X = µ).

Conclusions
The present article investigated the computation of the empirical mean from a collection of pseudo-orthogonal matrices.
The pseudo-orthogonal group is regarded as a pseudo-Riemannian manifold and a metric is chosen that affords the computation of geodesic arcs in closed form as well as the pseudo-Riemannian gradient of a smooth function.Within such geometric setting, we consider a minimal-distance problem based on the Frobenius norm and on an induced geodesic distance.The related function minimization problem can be solved by a pseudo-Riemannian-gradient-based algorithm.Unlike the geodesic-based Riemannian gradient-steepest-descent function minimization method (see [11]), which converges under appropriate conditions, the geodesic-based stepping method (7) is not necessarily convergent, in general, due to the presence of the tangent-space component T 0 x M.However, the function minimization method (7), endowed with the step-size selection method (11), is shown numerically to enjoy favorable convergence properties in all numerical tests.
In this article, we present numerical tests based on two criterion functions.To illustrate the numerical features of the proposed function-minimization method, several indicators are defined and their values are evaluated on a number of case studies over the pseudo-orthogonal group in low as well as high dimension.

Figure 1 .
Figure 1.Numerical test of function minimization applied to the criterion function in Equation (28) over the pseudo-orthogonal group O(1, 1): Data set and result of mean-matrix computation.(To obtain an easy-to-read graph, we chose to represent a pseudo-orthogonal matrix X ∈ O(1, 1), which is a 2 × 2 matrix, by two fictitious coordinates, namely the entry X(1,1) as first coordinate and the entry X(1,2) as second coordinate.)

Figure 6 .
Figure 6.Minimization of the criterion function in Equation (28) over the pseudo-orthogonal group O(10, 5): Values of the index X ( ) R p,q X ( ) − R p,q F and of the coefficients t( ) , f1( ) and f2( ) during iteration.

Figure 7 .
Figure 7. Minimization of the criterion function in Equation (28) over the pseudo-orthogonal group O(3, 1): Distribution of the number of iterations to converge on each trial on a total of 500 independent trials.

Figure 8 .Figure 9 .
Figure 8. Minimization of the criterion function in Equation (38) over the pseudo-orthogonal group O(1, 1): Data set and result of mean-matrix computation.

Figure 10 .
Figure 10.Mean-matrix computation over the pseudo-orthogonal group O(5, 5): Values of the criterion function in Equation (38) during iteration, of the pseudo-norm of its pseudo-Riemannian gradient, of the distances D g (X, X k ) before iteration (X = X (0) ) and after iteration (X = µ).