betaFeedback

WorksMathematics

Geodesics and intrinsic statistics of isolated connections in Hermitian positive-definite matrices

Abstract

Quantifying change in a single covariance, coherence or spectral connection requires a distance that respects the positive-definiteness constraint and holds the surrounding entries fixed. We characterize the Riemannian geometry induced by the affine-invariant metric when one conjugate off-diagonal pair of a Hermitian positive-definite matrix varies under this constraint. A fixed Schur congruence maps the admissible set to an open complex disk and reduces its metric to a two-dimensional form independent of the ambient matrix dimension. The disk is complete, with Gaussian curvature in (−1/4,0](-1/4,0], and has unique minimizing geodesics and globally defined logarithms. Its intrinsic distance strictly exceeds the ambient affine-invariant distance between distinct points. Conservation of angular momentum reduces the geodesic boundary-value problem to a single scalar equation with elementary angular and length integrals, enabling distance and logarithm evaluation without shooting. For a declared reference distribution with a finite second intrinsic moment, we establish a unique Fréchet centre and consistency of its empirical estimate, together with a sandwich central limit theorem under the stated regularity conditions. Tangent covariance standardization yields moment identities, and exchangeable rank calibration supplies finite-sample score guarantees. These results provide a geometric and statistical framework for isolated connections on a fixed complement, with explicit limits on extension to varying complements.

Figure 7.

Introduction

An entry of a covariance, coherence or spectral-density matrix does not vary freely. Its admissible values are bounded by the entries around it, and a displacement that looks modest in isolation can make the whole matrix singular. For a labelled connection the natural question is therefore not how far it can move in some ambient geometry, but how far it can move while every other entry is held fixed. That question fixes both a domain and a family of admissible paths, and the answer depends on the constraint as well as on the chosen matrix metric.

A fixed-complement model describes, for example, a controlled sensitivity analysis in which one connection is perturbed while the measured diagonal and all other connections are held at their reference values. The resulting distance quantifies admissible change along that slice. Statistical inference across observations with varying surrounding entries requires an additional model, as discussed in § 7.

Other analyses of connectivity treat the matrix as a whole. For example, intrinsic local polynomial regression models how a positive-definite matrix varies with covariates [1], while the Janashia–Lagvilava algorithm studied by Wang et al. factors a matrix-valued spectrum [42]. Here the surrounding entries instead serve as constraints on a single connection.

Geometry for correlation matrices already offers answers to adjacent questions. David and Gu formulated correlation geometry as a quotient by positive diagonal congruence, including the complex Hermitian case [12]. In the real two-variable case this yields a distance proportional to a difference of Fisher transforms [39], and transformed means and dispersions have been used for anomaly analysis [13]. Later work established alternative correlation geometries and identified curvature restrictions on the full quotient-affine correlation manifold [38, 40]. A quotient removes scale directions; requiring the diagonal and the complementary block to stay fixed instead restricts admissible motion. These are different constraints and they produce different metrics.

For covariance matrices the Schur-normalized entry is the classical partial correlation of the two variables after linear adjustment for the complement. After a fixed congruence our surface is exactly the unit-diagonal two-by-two Hermitian correlation family equipped with the restriction of the ambient metric. Results for that induced submanifold therefore apply verbatim. The quotient construction instead minimizes over diagonal rescaling velocities. On the real diameter the squared radial coefficients are respectively 2(1+r2)/(1−r2)22(1+r^2)/(1-r^2)^2 and 2/(1−r2)22/(1-r^2)^2. The distinction also matters for comparisons with totally geodesic SPD submanifolds [41], since the ambient geodesic leaves our slice (§ 4).

Metric choice remains consequential. Log-Euclidean and log-Cholesky constructions supply different coordinate geometries [2, 3, 30], and statistical models on positive-definite manifolds depend on that choice [34, 35, 37]. Here the metric and path constraint are fixed before the distance is defined.

Fixed-entry positive-definite completion and partial-correlation parameterizations supply the algebraic background [14, 21, 25, 29]. We use the Schur complement to isolate one conjugate pair and express its feasible values as a normalized disk. Schur feasibility, correlation geometry, Fréchet averaging [18, 31] and covariance whitening [27] are established ingredients; the contribution developed here is the explicit fixed-complement reduction, the elementary geodesic-leg solution with its branch conditions, and the population and computational consequences on that induced surface.

Three features of the induced surface are worth stating at the outset. First, one congruence that is constant across the leaf removes the complement from the tangent energy, so the geometry is two-dimensional in the complex case and one-dimensional in the real case, independently of the ambient matrix dimension. Second, the complex surface is complete and nonpositively curved, with curvature varying between zero and −1/4-1/4; the Cartan–Hadamard theorem then gives unique minimizing geodesics and global logarithms, and the resulting convexity of the squared distance, together with a finite second moment, gives a unique empirical Fréchet centre. Third, the real restriction has an elementary signed arc coordinate, and that sign is exactly what a squared joint score cannot retain.

The geodesic problem on the disk reduces to a single scalar equation. Angular momentum is conserved, so every pair of points determines a Clairaut constant through either a monotone branch or a branch with one radial turning point. We show that both legs of that reduction are exactly integrable, which turns the numerical problem into one bounded root find followed by an evaluation, and we give the branch conditions and the limiting cases at the origin, on a diameter and at equal radii. The elementary legs avoid quadrature at a moving turning point, where a fixed-node rule can misjudge an objective difference. Stable limits and precision refinement are therefore part of the evaluation procedure.

Statistical standardization requires a probability law in addition to a metric. Intrinsic means and covariance-weighted logarithms are established tools [31]; whitening fixes the covariance while retaining rotational freedom in the interpretation of components [27]. We apply these tools to a declared fixed-complement law, separate individual dispersion from uncertainty in the estimated centre [10], and give a conservative rank for a score frozen after fitting under exchangeability [28]. The limit theory we need is the Fréchet-mean central limit theorem and its refinements on manifolds with and without cut loci [8, 16, 17, 24, 26], together with convergence rates for empirical barycenters in metric spaces [1]; regression and analysis of variance for manifold-valued responses provide the natural population frameworks [15, 32]. Common normalized geometry neither identifies a common distribution nor supplies conditional calibration for arbitrary pooled complements [5], and the conformal literature makes the finite-sample guarantee and its exchangeability requirement precise [4, 6, 7, 11, 33].

§ 2 constructs the surface and proves completeness and the curvature bound. § 3 develops the reference population, the covariance standardization and the rank cases. § 4 compares the constrained distance with ambient and quotient constructions, and § 5 records the invariances of the declared slice. § 6 solves the geodesic problem and defines logarithms and parallel transport. § 7 treats estimation, calibration and independent-replicate inference. § 8 reports the numerical validation and § 9 discusses scope and limits. The appendices collect the ambient support reduction, the varying-complement derivative, the stable evaluation of the arc coordinate and the moment and derivative conditions used by the statistical limit theory.

An isolated connection as a Riemannian surface

The declared slice and its reduction

A connection is defined in a declared matrix frame. Throughout, n≥2n \ge2, AA is Hermitian positive definite (HPD), and only the entries A12=zA_{12}=z and A21=zˉA_{21}=\bar{z} are permitted to vary. After a simultaneous row and column permutation that places the selected pair first, write

A(z)=(B(z)EE∗C),B(z)=(azzˉb),(1)A(z)=\begin{pmatrix} B(z) & E \\ E^* & C \end{pmatrix}, \qquad B(z)=\begin{pmatrix} a & z \\ \bar{z} & b \end{pmatrix}, \tag*{(1)}

with C∈C(n−2)×(n−2)C \in\mathbb{C}^{(n-2)\times(n-2)} and E∈C2×(n−2)E \in\mathbb{C}^{2\times(n-2)}. For n=2n=2 the blocks EE and CC are absent and no empty inverse is used.

The metric convention throughout is the affine-invariant Riemannian metric

gA(U,V)=Re⁡tr⁡(A−1UA−1V),(2)g_A(U,V)=\operatorname{Re}\operatorname{tr}(A^{-1}UA^{-1}V), \tag*{(2)}

on Hermitian tangent vectors with real scalar coefficients. A complex connection therefore carries two real degrees of freedom. The adjoint ∗* denotes conjugate transpose, and the norm associated with Eq. (2) is its positive square root. Entries may carry covariance units; ρ\rho, lengths under Eq. (2) and standardized scores are dimensionless.

Definition 2.1 (Fixed-complement slice). For n>2n>2, fix a,b∈Ra,b\in\mathbb{R}, EE and C≻0C\succ0, and let H=EC−1E∗H=EC^{-1}E^*, with α=a−H11\alpha=a-H_{11}, β=b−H22\beta=b-H_{22} and γ=H12\gamma=H_{12}. Assume α,β>0\alpha,\beta>0. The slice is the set S={A(z):z∈C,A(z)≻0}\mathcal{S}=\{A(z):z\in\mathbb{C}, A(z)\succ0\} together with the restriction of Eq. (2). The normalized connection is ρ=(z−γ)/αβ\rho=(z-\gamma)/\sqrt{\alpha\beta}. For n=2n=2, set H=0H=0 and γ=0\gamma=0, so α=a\alpha=a and β=b\beta=b.

With dense inputs one Cholesky factorization of CC costs O((n−2)3)O((n-2)^3) operations. Two triangular solves and their Gram matrix give HH in a further O((n−2)2)O((n-2)^2) operations. The same HH serves all endpoints on the slice. Each subsequent normalization has constant cost in nn, while the scalar geodesic solver also depends on endpoint conditioning and precision. Small Schur pivots amplify relative errors in the normalization. Singular positive-semidefinite estimates lie outside this model. Regularization changes the matrix and thereby the connection being scored.

Theorem 2.2 (Feasibility and dimension-independent reduction). Under Definition 2.1, A(z)≻0A(z)\succ0 if and only if ∣ρ∣<1|\rho|<1. *Moreover a single congruence, independent of ρ\rho, maps A(z)A(z) to diag⁡(R(ρ),In−2)\operatorname{diag}(R(\rho),I_{n-2}) with

R(ρ)=(1ρρˉ1),(3)R(\rho)=\begin{pmatrix}1&\rho\\\bar{\rho}&1\end{pmatrix}, \tag*{(3)}

and carries the metric Eq. (2) on the slice to that of R(ρ)R(\rho) alone. The complementary block contributes exactly zero to the induced metric.*

Proof. For n>2n>2 multiply on the left by L=(I2−EC−10In−2)L=\begin{pmatrix}I_2&-EC^{-1}\\0&I_{n-2}\end{pmatrix} and on the right by L∗L^*. Block multiplication gives LA(z)L∗=diag⁡(S(z),C)LA(z)L^*=\operatorname{diag}(S(z),C) with

S(z)=B(z)−EC−1E∗=(αz−γzˉ−γˉβ).(4)S(z)=B(z)-EC^{-1}E^*=\begin{pmatrix}\alpha&z-\gamma\\\bar{z}-\bar{\gamma}&\beta\end{pmatrix}. \tag*{(4)}

Since LL is invertible, Sylvester’s law of inertia gives A(z)≻0⟺C≻0A(z)\succ0\Longleftrightarrow C\succ0 and S(z)≻0S(z)\succ0. For the 2×22\times2 matrix S(z)S(z), positive definiteness is equivalent to α>0\alpha>0 and det⁡S=αβ−∣z−γ∣2>0\det S=\alpha\beta-|z-\gamma|^2>0; together these imply β>0\beta>0. Writing z−γ=ραβz-\gamma=\rho\sqrt{\alpha\beta} turns the determinant condition into ∣ρ∣<1|\rho|<1, proving the first claim.

For the second, let D=diag⁡(α,β)D=\operatorname{diag}(\alpha,\beta) and set T=diag⁡(D−1/2,C−1/2)LT=\operatorname{diag}(D^{-1/2},C^{-1/2})L. Then TA(z)T∗=diag⁡(R(ρ),In−2)TA(z)T^*=\operatorname{diag}(R(\rho),I_{n-2}), because D−1/2S(z)D−1/2=R(ρ)D^{-1/2}S(z)D^{-1/2}=R(\rho) and C−1/2CC−1/2=In−2C^{-1/2}CC^{-1/2}=I_{n-2}.

It remains to show that TT is a tangent isometry for Eq. (2). For any invertible TT, (TAT∗)−1=T−∗A−1T−1(TAT^*)^{-1}=T^{-*}A^{-1}T^{-1}. Substituting U↦TUT∗U\mapsto TUT^* and V↦TVT∗V\mapsto TVT^* gives

tr⁡(T−∗A−1T−1TUT∗T−∗A−1T−1TVT∗)=tr⁡(A−1UA−1V)\begin{aligned} \operatorname{tr}(T^{-*}A^{-1}T^{-1}TUT^*T^{-*}A^{-1}T^{-1}TVT^*) \\ &=\operatorname{tr}(A^{-1}UA^{-1}V) \end{aligned}

by cyclicity of the trace, so Eq. (2) is invariant under congruence. Applying this to TT and restricting to variations dAdA supported on the selected pair leaves exactly Re⁡tr⁡(R−1dRR−1dR)\operatorname{Re}\operatorname{tr}(R^{-1}dR R^{-1}dR). For n=2n=2 the same argument applies with T=D−1/2T=D^{-1/2} only. □

The set S\mathcal{S} is a submanifold of the HPD manifold, and the question of which submanifolds of the positive-definite cone are totally geodesic has been studied in its own right [41]; the slice here is not one of them in general, which is exactly why its induced geodesics differ from ambient ones. If no positive complement or no positive α,β\alpha,\beta exists, the slice is empty; a disk written formally over a non-positive block is not the geometry of the original matrices. On a non-empty slice the normalization is invertible, so distinct normalized connections are identifiable once the frame and the complementary entries have been declared. Figure 1 draws the admissible disk schematically, and evaluates the induced stretch and an ambient path that leaves the slice.

Figure 1. An isolated connection has its own path geometry. (A) The admissible disk of normalized connections; the heat contours show intrinsic distance from the origin. Only the selected conjugate pair varies. (B) Radial and tangential stretch agree at the origin and diverge toward the boundary. (C) The ambient geodesic changes the diagonal entries, whereas a slice path keeps them fixed.

The induced metric

Theorem 2.3 (The induced complex metric). Identify ρ=x+iy\rho=x+iy with q=(x,y)Tq=(x,y)^{\mathsf{T}} in the open unit disk D\mathbb{D} and put r=∣ρ∣r=|\rho|. The metric induced by Eq. (2) is

G(q)=21−r2I2+4(1−r2)2qqT.(5)G(q)=\frac{2}{1-r^2}I_2+\frac{4}{(1-r^2)^2}qq^{\mathsf{T}}. \tag*{(5)}

In polar coordinates ρ=reiθ\rho=re^{i\theta}, away from the origin,

ds2=a(r) dr2+b(r) dθ2,(6)ds^2=a(r)\,dr^2+b(r)\,d\theta^2, \tag*{(6)}

where

a(r)=2(1+r2)(1−r2)2,b(r)=2r21−r2.(7)a(r)=\frac{2(1+r^2)}{(1-r^2)^2},\qquad b(r)=\frac{2r^2}{1-r^2}. \tag*{(7)}

References

  1. [1]Adil Ahidar-Coutrix, Thibaut Le Gouic, and Quentin Paris. Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesics. Probability Theory and Related Fields, 177: 323–368, 2020. doi: 10.1007/s00440-019-00950-0.
  2. [2]Vincent Arsigny, Pierre Fillard, Xavier Pennec, and Nicholas Ayache. Log-Euclidean metrics for fast and simple calculus on diffusion tensors. Magnetic Resonance in Medicine, 56:411–421, 2006. doi: 10.1002/mrm.20965.DOI
  3. [3]Vincent Arsigny, Pierre Fillard, Xavier Pennec, and Nicholas Ayache. Geometric Means in a Novel Vector Space Structure on Symmetric Positive-Definite Matrices. SIAM Journal on Matrix Analysis and Applications, 29:328–347, 2007. doi: 10.1137/050637996.DOI
  4. [4]Rina Foygel Barber, Emmanuel J. Candès, Aaditya Ram- das, and Ryan J. Tibshirani. Predictive inference with the jackknife+. The Annals of Statistics, 49(1):486–507, 2021. doi: 10.1214/20-AOS1965.
  5. [5]Rina Foygel Barber, Emmanuel J. Candès, Aaditya Ramdas, and Ryan J. Tibshirani. The limits of distribution-free conditional predictive inference. Information and Inference: A Journal of the IMA, 10:455–482, 2021. doi: 10.1093/imaiai/iaaa017.DOI
  6. [6]Rina Foygel Barber, Emmanuel J. Candès, Aaditya Ramdas, and Ryan J. Tibshirani. Conformal prediction beyond exchangeability. The Annals of Statistics, 51(2):816–845, 2023. doi: 10.1214/23-AOS2276.DOI
  7. [7]Stephen Bates, Emmanuel Candès, Lihua Lei, Yaniv Romano, and Matteo Sesia. Testing for Outliers with Conformal p-values. Annals of Statistics, 51(1):149–178, 2023. doi: 10.1214/22-AOS2244.DOI
  8. [8]Rabi Bhattacharya and Lizhen Lin. Omnibus CLTs for Fréchet means and nonparametric inference on non-Euclidean spaces. Proceedings of the American Mathematical Society, 145(1):413–428, 2017. doi: 10.1090/proc/13216.DOI
  9. [9]Rabi Bhattacharya and Vic Patrangenaru. Large sample theory of intrinsic and extrinsic sample means on manifolds. I. Annals of Statistics, 31(1):1–29, 2003. doi: 10.1214/aos/1046294456.DOI
  10. [10]Rabi Bhattacharya and Vic Patrangenaru. Large sample theory of intrinsic and extrinsic sample means on manifolds—II. Annals of Statistics, 33(3):1225–1259, 2005. doi: 10.1214/009053605000000093.DOI
  11. [11]Alejandro Cholaquidis, Fabrice Gamboa, and Leonardo Moreno. Conformal inference for regression on Riemannian Manifolds. arXiv preprint, 2023. doi: 10.48550/arXiv.2310.08209.DOI
  12. [12]Paul David and Weiqing Gu. A Riemannian structure for correlation matrices. Operators and Matrices, 13:607–627, 2019. doi: 10.7153/oam-2019-13-46.DOI
  13. [13]Paul David and Weiqing Gu. Anomaly detection of time series correlations via a novel Lie group structure. Stat, 11:e494, 2022. doi: 10.1002/sta4.494.DOI
  14. [14]A. P. Dempster. Covariance Selection. Biometrica, 28:157–175, 1972. doi: 10.2307/2528966.DOI
  15. [15]Paromita Dubey and Hans-Georg Müller. Fréchet Analysis Of Variance For Random Objects. Biometrika, 106 (4):803–821, 2019. doi: 10.1093/biomet/asz052.DOI
  16. [16]Benjamin Eltzner and Stephan F. Huckemann. A smeary central limit theorem for manifolds with application to high-dimensional spheres. Annals of Statistics, 47(6):3360–3381, 2019. doi: 10.1214/18-AOS1781.DOI
  17. [17]Benjamin Eltzner, Fernando Galaz-Garcia, Stephan F. Huckemann, and Wilderich Tuschmann. Stability of the Cut Locus and a Central Limit Theorem for Fréchet Means of Riemannian Manifolds. Proceedings of the American Mathematical Society, 149(9):3947–3963, 2021. doi: 10.1090/proc/15429.DOI
  18. [18]Maurice Fréchet. Les éléments aléatoires de nature quelconque dans un espace distancié. Annales de l’institut Henri Poincaré, 10(4):215–310, 1948. URL https://www.numdam.org/item/AIHP_1948__10_4_215_0/.
  19. [20]John Geweke. Measurement of Linear Dependence and Feedback between Multiple Time Series. Journal of the American Statistical Association, 77:304–313, 1982. doi: 10.1080/01621459.1982.10477803.DOI
  20. [21]Robert Grone, Charles R. Johnson, Eduardo M. Sá, and Henry Wolkowicz. Positive definite completions of partial Hermitian matrices. Linear Algebra and its Applications, 58:109–124, 1984. doi: 10.1016/0024-3795(84)90207-6.DOI
  21. [22]Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13–30, 1963. doi: 10.1080/01621459.1963.10500830.DOI
  22. [23]Sture Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6(2):65–70, 1979. URL https://www.jstor.org/stable/4615733.DOI
  23. [24]Thomas Hotz, Huiling Le, and Andrew T. A. Wood. Central limit theorem for intrinsic Fréchet means in smooth compact Riemannian manifolds. Probability Theory and Related Fields, 189:1219–1246, 2024. doi: 10.1007/s00440-024-01291-3.DOI
  24. [25]Harry Joe. Generating random correlation matrices based on partial correlations. Journal of Multivariate Analysis, 97:2177–2189, 2006. doi: 10.1016/j.jmva.2005.05.010.DOI
  25. [26]Wilfrid S. Kendall and Huiling Le. Limit theorems for empirical Fréchet means of independent and non-identically distributed manifold-valued random variables. Brazilian Journal of Probability and Statistics, 25(3):323–352, 2011. doi: 10.1214/11-BJPS141.DOI
  26. [27]Agnan Kessy, Alex Lewin, and Korbinian Strimmer. Optimal whitening and decorrelation. The American Statistician, 72(4):309–314, 2018. doi: 10.1080/00031305.2016.1277159.DOI
  27. [28]Jing Lei, Max G’Sell, Alessandro Rinaldo, Ryan J. Tibshirani, and Larry Wasserman. Distribution-Free Predictive Inference for Regression. Journal of the American Statistical Association, 113(523):1094–1111, 2018. doi: 10.1080/01621459.2017.1307116.DOI
  28. [29]Daniel Lewandowski, Dorota Kurowicka, and Harry Joe. Generating random correlation matrices based on vines and extended onion method. Journal of Multivariate Analysis, 100:1989–2001, 2009. doi: 10.1016/j.jmva.2009.04.008.
  29. [30]Zhenhua Lin. Riemannian Geometry of Symmetric Positive Definite Matrices via Cholesky Decomposition. SIAM Journal on Matrix Analysis and Applications, 40: 1353–1370, 2019. doi: 10.1137/18M1221084.DOI
  30. [31]Xavier Pennec. Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements. Journal of Mathematical Imaging and Vision, 25:127–154, 2006. doi: 10.1007/s10851-006-6228-4.DOI
  31. [32]Alexander Petersen and Hans-Georg Müller. Fréchet Regression for Random Objects with Euclidean Predictors. The Annals of Statistics, 47(2):691–719, 2019. doi: 10.1214/17-AOS1624. See also the revised preprint, arXiv:1608.03012v4.DOI
  32. [33]Yaniv Romano, Evan Patterson, and Emmanuel J. Candès. Conformalized Quantile Regression. arXiv primary preprint, 2019. doi: 10.48550/arXiv.1905.03222.DOI
  33. [34]Salem Said, Lionel Bombrun, Yannick Berthoumieu, and Jonathan H. Manton. Riemannian Gaussian Distributions on the Space of Symmetric Positive Definite Matrices. arXiv preprint arXiv:1507.01760, 2015. URL https://arxiv.org/abs/1507.01760.
  34. [35]Salem Said, Hatem Hajri, Lionel Bombrun, and Baba C. Vemuri. Gaussian distributions on Riemannian symmetric spaces: statistical learning with structured covariance matrices. arXiv preprint arXiv:1607.06929, 2016. URL https://arxiv.org/abs/1607.06929.
  35. [36]Louis Scharf and Yuan Wang. Testing for Granger causality using a partial coherence statistic. Signal Processing, 213:109190, 2023. doi: 10.1016/j.sigpro.2023.109190.DOI
  36. [37]Armin Schwartzman. Lognormal Distributions and Geometric Averages of Symmetric Positive Definite Matrices. International Statistical Review, 84:456–486, 2016. doi: 10.1111/insr.12113.DOI
  37. [38]Yann Thanwerdas. Permutation-Invariant Log-Euclidean Geometries on Full-Rank Correlation Matrices. SIAM Journal on Matrix Analysis and Applications, 45:930–953, 2024. doi: 10.1137/22M1538144.DOI
  38. [39]Yann Thanwerdas and Xavier Pennec. Geodesics and Curvature of the Quotient-Affine Metrics on Full-Rank Correlation Matrices. In Geometric Science of Information, volume 12829 of Lecture Notes in Computer Science, pages 93–102, 2021. doi: 10.1007/978-3-030-80209-7_11.DOI
  39. [40]Yann Thanwerdas and Xavier Pennec. Theoretically and Computationally Convenient Geometries on Full-Rank Correlation Matrices. SIAM Journal on Matrix Analysis and Applications, 43:1851–1872, 2022. doi: 10.1137/22M1471729.DOI
  40. [41]Alice Barbara Tumpach and Gabriel Larotonda. Totally geodesic submanifolds in the manifold SPD of symmetric positive-definite real matrices. Information Geometry, 7: 913–942, 2024. doi: 10.1007/s41884-024-00146-z.DOI
  41. [42]Ying Wang, Lasha Ephremidze, Ronaldo García Reyes, and Pedro Valdes-Sosa. Exponential speedup of Janashia-Lagvilava matrix spectral factorization algorithm. arXiv preprint arXiv:2503.02553, 2025. doi: 10.48550/arXiv.2503.02553.arxiv.org/abs/2503.02553

Paper details

vlnc:W_998mz8kj
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents