Related papers: Finite Boolean Algebras for Solid Geometry using J…
In this paper we study multiserial and special multiserial algebras. These algebras are a natural generalization of biserial and special biserial algebras to algebras of wild representation type. We define a module to be multiserial if its…
This paper introduces an auto-stabilized weak Galerkin (WG) finite element method for biharmonic equations with built-in stabilizers. Unlike existing stabilizer-free WG methods limited to convex elements in finite element partitions, our…
We approach string phenomenology from the perspective of computational algebraic geometry, by providing new and efficient techniques for proving stability and calculating particle spectra in heterotic compactifications. This is done in the…
The Constructive Solid Geometry (CSG) is a data model providing a set of binary Boolean operators such as Union, Difference and Intersection. In this work, these operators are used to compute topological relations between objects defined by…
We present a new class of $C^\infty$-smooth finite element spaces on Cartesian grids, based on a partition of unity approach. We use these spaces to construct smooth approximations of particle fields, i.e., finite sums of weighted Dirac…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…
Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…
This paper studies the Craig variant of the Golub-Kahan bidiagonalization algorithm as an iterative solver for linear systems with saddle point structure. Such symmetric indefinite systems in 2x2 block form arise in many applications, but…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets…
In this communication the advantages and drawbacks of the isogeometric analysis (IGA) are reviewed in the context of electromagnetic simulations. IGA extends the set of polynomial basis functions, commonly employed by the classical Finite…
We develop the theory of Free Integro-Differential Algebras (FIDA) extending the powerful technique of Free Differential Algebras constructed by D. Sullivan. We extend the analysis beyond the superforms to integral- and pseudo-forms used in…
We present a novel method for isogeometric analysis (IGA) to directly work on geometries constructed by Boolean operations including difference (i.e., trimming), union and intersection. Particularly, this work focuses on the union…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
This paper introduces sparse coding and dictionary learning for Symmetric Positive Definite (SPD) matrices, which are often used in machine learning, computer vision and related areas. Unlike traditional sparse coding schemes that work in…
In this work, we focus on the family of shell formulations referred to as "solid shells", where the simulation of shell-type structures is performed by means of a mesh of 3D solid elements, with typically only one element through the…
This article presents a general approach akin to domain-decomposition methods to solve a single linear PDE, but where each subdomain of a partitioned domain is associated to a distinct variational formulation coming from a mutually…
In this paper, we present a natural implementation of singular value decomposition (SVD) and polar decomposition of an arbitrary multivector in nondegenerate real and complexified Clifford geometric algebras of arbitrary dimension and…
Conformal Geometric Algebra (CGA) is a framework that allows the representation of objects, such as points, planes and spheres, and deformations, such as translations, rotations and dilations as uniform vectors, called multivectors. In this…