Related papers: Fast matrix representation for Clifford algebras

Clifford algebras are naturally associated with quadratic forms. These algebras are Z_2-graded by construction. However, only a Z_n-gradation induced by a choice of a basis, or even better, by a Chevalley vector space isomorphism Cl(V) <->…

We study briefly some properties of real Clifford algebras and identify them as matrix algebras. We then show that the representation space on which Clifford algebras act are spinors and we study in details matrix representations. The…

In this paper we propose a global optimization-based approach to jointly matching a set of images. The estimated correspondences simultaneously maximize pairwise feature affinities and cycle consistency across multiple images. Unlike…

In this paper we presented the algorithm designed to efficient coordinate cross-match of objects in the modern massive astronomical catalogues. Preliminary data sort in the existed catalogues provides the opportunity for coordinate…

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

The geometric calculus based on Clifford algebra is a very useful tool for geometry and physics. It describes a geometric structure which is much richer than the ordinary geometry of spacetime. A Clifford manifold (C-space) consists not…

Finite element analysis of solid mechanics is a foundational tool of modern engineering, with low-order finite element methods and assembled sparse matrices representing the industry standard for implicit analysis. We use performance models…

Recently, the numerical schemes of the Fokker-Planck equations describing anomalous diffusion with two internal states have been proposed in [Nie, Sun and Deng, arXiv: 1811.04723], which use convolution quadrature to approximate the…

In this paper we address the problem of constructing a class of representations of Clifford algebras that can be named "alphabetic (re)presentations". The Clifford algebras generators are expressed as m-letter words written with a…

In many real-world applications, data are represented by matrices or high-order tensors. Despite the promising performance, the existing two-dimensional discriminant analysis algorithms employ a single projection model to exploit the…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

Given a fixed binary form $f(u,v)$ of degree $d$ over a field $k$, the associated \emph{Clifford algebra} is the $k$-algebra $C_f=k\{u,v\}/I$, where $I$ is the two-sided ideal generated by elements of the form $(\alpha u+\beta…

We define a reduction covariant for the representations a la Vinberg associated to stably graded Lie algebras. We then give an analogue of the LLL algorithm for the odd split special orthogonal group and show how this can be combined with…

Kernel methods are a highly effective and widely used collection of modern machine learning algorithms. A fundamental limitation of virtually all such methods are computations involving the kernel matrix that naively scale quadratically…

We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…

In this paper we study representations of ultragraph Leavitt path algebras via branching systems and, using partial skew ring theory, prove the reduction theorem for these algebras. We apply the reduction theorem to show that ultragraph…

In the present study, we establish two new block variants of the Conjugate Orthogonal Conjugate Gradient (COCG) and the Conjugate A-Orthogonal Conjugate Residual (COCR) Krylov subspace methods for solving complex symmetric linear systems…

Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…

Recent work has constructed neural networks that are equivariant to continuous symmetry groups such as 2D and 3D rotations. This is accomplished using explicit Lie group representations to derive the equivariant kernels and nonlinearities.…

We review the basic outline of the highly successful diffusion Monte Carlo technique commonly used in contexts ranging from electronic structure calculations to rare event simulation and data assimilation, and propose a new class of…