Related papers: On parallelizing the Clifford algebra product for …
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
Viewing the complex Clifford algebra $C(V)$ of a real inner product space $V$ as a superalgebra, we offer several proofs of the fact that if $W$ is a subspace of the complexification of $V$ then the supercommutant of the Clifford algebra…
Positive linear programs (LPs) model many graph and operations research problems. One can solve for a $(1+\epsilon)$-approximation for positive LPs, for any selected $\epsilon$, in polylogarithmic depth and near-linear work via variations…
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a…
We decompose the crossed product functor for actions of crossed modules of locally compact groups on C*-algebras into more elementary constructions: taking crossed products by group actions and fibres in C*-algebras over topological spaces.…
We describe our implementation of a multigrid solver for Wilson-clover fermions, which increases parallelism by solving for multiple right-hand sides (MRHS) simultaneously. The solver is based on Grid and thus runs on all computing…
The problem of Bayesian filtering and smoothing in nonlinear models with additive noise is an active area of research. Classical Taylor series as well as more recent sigma-point based methods are two well-known strategies to deal with these…
We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this…
We present GSPMD, an automatic, compiler-based parallelization system for common machine learning computations. It allows users to write programs in the same way as for a single device, then give hints through a few annotations on how to…
In this paper, we present a parallel computing method for the coupled-cluster singles and doubles (CCSD) in periodic systems. The CCSD in periodic systems solves simultaneous equations for single-excitation and double-excitation amplitudes.…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
In this paper we introduce the concept of metric Clifford algebra $\mathcal{C\ell}(V,g)$ for a $n$-dimensional real vector space $V$ endowed with a metric extensor $g$ whose signature is $(p,q)$, with $p+q=n$. The metric Clifford product on…
This paper describes a massively parallel algebraic multigrid method based on non-smoothed aggregation. It is especially suited for solving heterogeneous elliptic problems as it uses a greedy heuristic algorithm for the aggregation that…
We derive formulas for the Coulomb matrix within the full-potential linearized augmented-plane-wave (FLAPW) method. The Coulomb matrix is a central ingredient in implementations of many-body perturbation theory, such as the Hartree-Fock and…
The notion of crossed product by a coquasi-bialgebra H is introduced and studied. The resulting crossed product is an algebra in the monoidal category of right H-comodules. We give an interpretation of the crossed product as an action of a…
We study completely contractive representations of product systems of $C^*$-correspondences over semigroups. For a product system of $C^*$-correspondences over the semigroup $\mathbb{N}^2$, we prove that every such representation can be…
We tackle the problem of graph partitioning for image segmentation using correlation clustering (CC), which we treat as an integer linear program (ILP). We reformulate optimization in the ILP so as to admit efficient optimization via…
We provide a differential structure on arbitrary cleft extensions $B:=A^{\mathrm{co}H}\subseteq A$ for an $H$-comodule algebra $A$. This is achieved by constructing a covariant calculus on the corresponding crossed product algebra…
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications within algebraic geometry and beyond. We recently reported on a new implementation of CAD in Maple which…
A new method for solving Laplacian linear systems proposed by Kelner et al. involves the random sampling and update of fundamental cycles in a graph. Kelner et al. proved asymptotic bounds on the complexity of this method but did not report…