Related papers: Constructing matrix geometric means
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
We construct new invariants and give several theorems which determine in general (i) the number of physically meaningful phases in quark mass matrices and (ii) which elements of these matrices can be rendered real by rephasings. We…
Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
Construction on the measurement matrix $A$ is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix…
We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…
Stationary states of stochastic models, which have $N$ states per site, in matrix product form are considered. First we give a necessary condition for the existence of a finite $M$-dimensional matrix product state for any ${N,M}$. Second,…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…
It is known that the multiplication of an $N \times M$ matrix with an $M \times P$ matrix can be performed using fewer multiplications than what the naive $NMP$ approach suggests. The most famous instance of this is Strassen's algorithm for…
The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…
It is well-known that many famous pooling designs are constructed from mathematical structures by the "containment matrix" method. In this paper, we propose another method and obtain a family of pooling designs with surprisingly high degree…
A new fast algebraic method for obtaining an $\mathcal{H}^2$-approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum-volume principle to select…
In this paper we examine the descriptive potential of a combinatorial data structure known as "Generating Set" in constructing the boundary maps of a simplicial complex. By refining the approach of \cite{Dumas} in generating these maps, we…
Hierarchical matrices approximate a given matrix by a decomposition into low-rank submatrices that can be handled efficiently in factorized form. $\mathcal{H}^2$-matrices refine this representation following the ideas of fast multipole…
In this study, we consider the realm of covariance matrices in machine learning, particularly focusing on computing Fr\'echet means on the manifold of symmetric positive definite matrices, commonly referred to as Karcher or geometric means.…
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank…
In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We also include a computational comparison of several existing…