Related papers: On parallelizing the Clifford algebra product for …
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be…
CylindricalAlgebraicDecomposition.m2 is the first implementation of Cylindrical Algebraic Decomposition (CAD) in Macaulay2. CAD decomposes space into 'cells' where input polynomials are sign-invariant. This package computes an Open CAD…
Here I present the 'clifford' package for working with Clifford algebras in the R programming language. The algebra is described and package idiom is given.
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
We show that a particular class of parallel algorithm for linear functions can be straightforwardly generalized to a parallel algorithm of their tensor product. The central idea is to take a model of parallel algorithms -- Bulk Synchronous…
A blend of two Taylor series for the same smooth real- or complex-valued function of a single variable can be useful for approximation. We use an explicit formula for a two-point Hermite interpolational polynomial to construct such blends.…
Hopf algebraic structures will replace groups and group representations as the leading paradigm in forthcoming times. K-theory, co-homology, entanglement, statistics, representation categories, quantized or twisted structures as well as…
A variety of universal similarity factorization equalities over real Clifford algebras ${\cal R}_{p,q}$ are established. On the basis of these equalities, real, complex and quaternion matrix representations of elements in ${\cal R}_{p,q}$…
Let $R$ be a left-symmetric conformal algebra and $Q$ be a $\mathbb{C}[\partial]$-module. We introduce the notion of a unified product for left-symmetric conformal algebras and apply it to construct an object $\mathcal{H}^2_R(Q,R)$ to…
In order to obtain more accurate solutions of polynomial systems with numerical continuation methods we use multiprecision arithmetic. Our goal is to offset the overhead of double double arithmetic accelerating the path trackers and in…
Parametric linear programming is a central operation for polyhedral computations, as well as in certain control applications.Here we propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.This type…
We study the exactness of the reduced crossed product of a semigroup dynamical system and the reduced $C^{*}$-algebra of a product system. We show that for a semigroup dynamical system $(A, P,\alpha)$, under reasonable hypotheses (e.g., $P$…
We provide a Cuntz-Pimsner model for graph of groups $C^*$-algebras. This allows us to compute the $K$-theory of a range of examples and show that graph of groups $C^*$-algebras can be realised as Exel-Pardo algebras. We also make a…
Clifford algebras are a natural generalization of the real numbers, the complex numbers, and the quaternions. So far, solely Clifford algebras of the form $Cl_{p,q}$ (i.e., algebras without nilpotent base vectors) have been studied in the…
Parametric linear programming is central in polyhedral computations and in certain control applications.We propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.
Given a correspondence X over a C*-algebra A, we construct a C*-algebra and a Hilbert C*-bimodule over it whose crossed product is isomorphic to the augmented Cuntz-Pimsner C*-algebra of X. This construction enables us to establish a…
Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
The computation of the tropical prevariety is the first step in the application of polyhedral methods to compute positive dimensional solution sets of polynomial systems. In particular, pretropisms are candidate leading exponents for the…
We provide a systematic way to design computable bilinear forms which, on the class of subspaces $W^* \subseteq \mathcal{V}'$ that can be obtained by duality from a given finite dimensional subspace $W$ of an Hilbert space $\mathcal{V}$,…