The Kähler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks

@article{Jeuris2016TheKM,
  title={The K{\"a}hler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks},
  author={Ben Jeuris and Raf Vandebril},
  journal={SIAM J. Matrix Anal. Appl.},
  year={2016},
  volume={37},
  pages={1151-1175}
}
When one computes an average of positive definite (PD) matrices, the preservation of additional matrix structure is desirable for interpretations in applications. An interesting and widely present structure is that of PD Toeplitz matrices, which we endow with a geometry originating in signal processing theory. As an averaging operation, we consider the barycenter, or minimizer of the sum of squared intrinsic distances. The resulting barycenter, the Kahler mean, is discussed along with its… 
A geometric mean for Toeplitz and Toeplitz-block block-Toeplitz matrices
Abstract Using the symbol functions and their associated Fourier series, we introduce a new definition of geometric mean for all positive semi-definite Toeplitz matrices and positive semi-definite
On the structure of the inverse to Toeplitz-block Toeplitz matrices and of the corresponding polynomial reflection coefficients
  • A. Sakhnovich
  • Mathematics
    Transactions of the American Mathematical Society
  • 2019
The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the 1-D (one-dimensional) case are classical and have numerous applications. We consider the
Inversion of the Toeplitz-block Toeplitz matrices and the structure of the corresponding inverse matrices
The results on the inversion of convolution operators and Toeplitz matrices in the 1-D (one dimensional) case are classical and have numerous applications. We consider a 2-D case of Toeplitz-block
On the inversion of the block double-structured and of the triple-structured Toeplitz matrices and on the corresponding reflection coefficients
Abstract The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the 1-D (one-dimensional) case are classical and have numerous applications. Last
Geometric means of quasi-Toeplitz matrices
TLDR
It is proved that if a1, . . . , ap are continuous and positive functions, or are in the Wiener algebra with some further conditions, then means of geometric type, such as the ALM, the NBMP and the Karcher mean of quasi-Toeplitz positive definite matrices associated with a 1, .
Gaussian Distributions on Riemannian Symmetric Spaces: Statistical Learning With Structured Covariance Matrices
TLDR
An original theory of Gaussian distributions on Riemannian symmetric spaces is developed, of their statistical inference, and of their relationship to the concept of Riemansian barycentre, which describes algorithms for density estimation and classification of structured covariance matrices, based on Gaussian distribution mixture models.
Riemannian Laplace Distribution on the Space of Symmetric Positive Definite Matrices
TLDR
New probability distributions, called Riemannian Laplace distributions on the space P m, are introduced and it is shown that these distributions provide a statistical foundation for the concept of the RiemANNian median, which offers improved robustness in dealing with outliers.
Mean and Median of PSD Matrices on a Riemannian Manifold: Application to Detection of Narrow-Band Sonar Signals
TLDR
Two Riemannian distances (RD) are introduced for the measurement of distances between PSD matrices on the manifold and show substantial improvement in detection performance over classical detection method.
On the Riemannian barycentre of a Markov chain
The Riemannian barycentre is one of the most widely used statistical descriptors for probability distributions on Riemannian manifolds. At present, existing algorithms are able to compute the
The Siegel–Klein Disk: Hilbert Geometry of the Siegel Disk Domain
TLDR
It is demonstrated that geometric computing in the Siegel–Klein disk allows one to bypass the time-costly recentering operations to the disk origin required at each iteration of the BC algorithm in theSiegel–Poincaré disk model, and to approximate fast and numerically the S Spiegel-Klein distance with guaranteed lower and upper bounds derived from nested Hilbert geometries.
...
1
2
3
...

References

SHOWING 1-10 OF 49 REFERENCES
Geometric means of structured matrices
The geometric mean of positive definite matrices is usually identified with the Karcher mean, which possesses all properties—generalized from the scalar case—a geometric mean is expected to satisfy.
Information Geometry of Covariance Matrix: Cartan-Siegel Homogeneous Bounded Domains, Mostow/Berger Fibration and Fréchet Median
Information Geometry has been introduced by Rao, and axiomatized by Chentsov, to define a distance between statistical distributions that is invariant to non-singular parameterization
The Riemann Barycenter Computation and Means of Several Matrices
An iterative definition of any n variable mean function is given in this article, which iteratively uses the two-variable form of the corresponding two-variable mean function. This extension method
Interactions between Symmetric Cone and Information Geometries: Bruhat-Tits and Siegel Spaces Models for High Resolution Autoregressive Doppler Imagery
TLDR
For Complex Autoregressive Model, Kahler metric on reflection coefficients based on Kahler potential function given by Doppler signal Entropy is introduced, closely related to Kahler-Einstein manifold and complex Monge-Ampere Equation.
Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle
TLDR
This paper derives algorithms that compute the new Schur parameters after applying a Geronimus transformation, and presents two forward algorithms and one backward algorithm that are efficient and need only O ( n ) flops.
Algorithm comparison for Karcher mean computation of rotation matrices and diffusion tensors
TLDR
In this paper, an explicit expression for the Hessian of the Riemannian squared distance function of these manifolds is given and it is shown that the Newton method outperforms the gradient method in some cases.
Matrix measures on the unit circle, moment spaces, orthogonal polynomials and the Geronimus relations
Abstract We study the moment space corresponding to matrix measures on the unit circle. Moment points are characterized by non-negative definiteness of block Toeplitz matrices. This characterization
Computationally efficient two-dimensional Capon spectrum analysis
TLDR
This work presents a novel method, based on a 2-D lattice algorithm, to compute the needed forward prediction matrix polynomials and discusses the difference in the so-obtained2-D spectral estimate as compared with the one obtained by using the prediction matrixPolynomial given by the Whittle-Wiggins-Robinson algorithm.
Positive Definite Matrices
This book represents the first synthesis of the considerable body of new research into positive definite matrices. These matrices play the same role in noncommutative analysis as positive real
Orthogonal matrix polynomials and applications
Orthogonal matrix polynomials, on the real line or on the unit circle, have properties which are natural generalizations of properties of scalar orthogonal polynomials, appropriately modified for the
...
1
2
3
4
5
...