Related papers: Finite Boolean Algebras for Solid Geometry using J…
We consider and discretize a mixed formulation for linear elasticity with weakly imposed symmetry in two and three dimensions. Whereas existing methods mainly deal with simplicial or polygonal meshes, we take advantage of isogeometric…
We introduce a finite element method for numerical upscaling of second order elliptic equations with highly heterogeneous coefficients. The method is based on a mixed formulation of the problem and the concepts of the domain decomposition…
Closed form solutions for the computation of the solid angle from polygonal cross-sections are well known, however similar formulae for computation of projected solid angle are not generally available. Formulae for computing the projected…
In this contribution, we present a numerical analysis of the continuous stochastic gradient (CSG) method, including applications from topology optimization and convergence rates. In contrast to standard stochastic gradient optimization…
We describe the GPU implementation of shifted or multimass iterative solvers for sparse linear systems of the sort encountered in lattice gauge theory. We provide a generic tool that can be used by those without GPU programming experience…
This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
Multi-degree splines are piecewise polynomial functions having sections of different degrees. They offer significant advantages over the classical uniform-degree framework, as they allow for modeling complex geometries with fewer degrees of…
Approximating partial differential equations for extensive industrial and scientific applications requires leveraging the power of modern high-performance computing. In large-scale parallel computations, the geometrical discretisation…
We survey results on multiserial algebras, special multiserial algebras and Brauer configuration algebras. A structural property of modules over a special multiserial algebra is presented. Almost gentle algebras are introduced and we…
Spatial regression is widely used for modeling the relationship between a dependent variable and explanatory covariates. Oftentimes, the linear relationships vary across space, when some covariates have location-specific effects on the…
Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…
This paper proposes a novel heterogeneous grid convolution that builds a graph-based image representation by exploiting heterogeneity in the image content, enabling adaptive, efficient, and controllable computations in a convolutional…
A new stabilizer free weak Galerkin (WG) method is introduced and analyzed for the biharmonic equation. Stabilizing/penalty terms are often necessary in the finite element formulations with discontinuous approximations to ensure the…
A geometric formula for the zeros of the partition function of the inhomogeneous 2d Ising model was recently proposed in terms of the angles of 2d triangulations embedded in the flat 3d space. Here we proceed to an analytical check of this…
Let Y be a weighted homogeneous (singular) subvariety of C^n. The main objective of this paper is to present an explicit formula for solving the d-bar-equation $f=\dbar{g}$ on the regular part of Y, where $f$ is a d-bar-closed $(0,1)$-form…
The \emph{deterministic} sparse grid method, also known as Smolyak's method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about…
This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a new developed…
The Program Semantic Graph (PSG) introduced in prior work on Dimensional Type Systems and Deterministic Memory Management encodes compilation-relevant properties as binary edge relations between computation nodes. This representation is…
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…