The present article studies the problemof computing empiricalmeans 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.
Empirical means on pseudo-orthogonal groups / Wang, J.; Sun, H.; Fiori, S.. - In: MATHEMATICS. - ISSN 2227-7390. - ELETTRONICO. - 7:10(2019), p. 940. [10.3390/math7100940]
Empirical means on pseudo-orthogonal groups
Fiori S.
2019-01-01
Abstract
The present article studies the problemof computing empiricalmeans 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.| File | Dimensione | Formato | |
|---|---|---|---|
|
mathematics-07-00940.pdf
accesso aperto
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza d'uso:
Creative commons
Dimensione
843.58 kB
Formato
Adobe PDF
|
843.58 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


