Related papers: A Constructive Cayley Representation of Orthogonal…
Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD)…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
Let $\Gamma$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn:Sabidussi:1997}), it is shown that the diameter of the…
For a random set $\mathcal{S} \subset U(d)$ of quantum gates we provide bounds on the probability that $\mathcal{S}$ forms a $\delta$-approximate $t$-design. In particular we have found that for $\mathcal{S}$ drawn from an exact $t$-design…
We construct an algorithm for implementing the discrete wavelet transform by means of matrices in SO_2(R) for orthonormal compactly supported wavelets and matrices in SL_m(R), m > = 2, for compactly supported biorthogonal wavelets. We show…
Matrix-valued optimization tasks, including those involving symmetric positive definite (SPD) matrices, arise in a wide range of applications in machine learning, data science and statistics. Classically, such problems are solved via…
Sets of orthogonal martingales are importants because they can be used as stochastic integrators in a kind of chaotic representation property, see [20]. In this paper, we revisited the problem studied by W. Schoutens in [21], investigating…
Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…
We use the Cayley transform to provide an explicit isomorphism at the level of cycles from van Daele $K$-theory to $KK$-theory for graded $C^*$-algebras with a real structure. Isomorphisms between $KK$-theory and complex or real $K$-theory…
Let U/K represent a connected, compact symmetric space, where theta is an involution of U that fixes K, phi: U/K to U is the geodesic Cartan embedding, and G is the complexification of U. We investigate the intersection of phi(U/K) with the…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
We provide a new algorithm that translates a unitary matrix into a quantum circuit according to the G=KAK theorem in Lie group theory. With our algorithm, any matrix decomposition corresponding to type-AIII KAK decompositions can be derived…
Many important applications across science, data analytics, and AI workloads depend on distributed matrix multiplication. Prior work has developed a large array of algorithms suitable for different problem sizes and partitionings including…
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…
Modern advances in general-purpose computer algebra systems offer solutions to a variety of problems, which in the past required substantial time investments by trained mathematicians. An excellent example of such development are the…
We present an algorithm for computing semistable degeneration of double octic Calabi-Yau threefolds. Our method has a combinatorial representation by the means of double octic diagrams. The proposed algorithm is applicable both in classical…
We present a general method to obtain a closed, finite formula for the exponential map from the Lie algebra to the Lie group, for the defining representation of the orthogonal groups. Our method is based on the Hamilton-Cayley theorem and…
A novel algorithm for designing optimized orthonormal transform-matrix codebooks for adaptive transform coding of a non-stationary vector process is proposed. This algorithm relies on a block-wise stationary model of a non-stationary…
We obtain many objects of discrete differential geometry as reductions of skew parallelogram nets, a system of lattice equations that may be formulated for any unit associative algebra. The Lax representation is linear in the spectral…