Related papers: The deal.II Library, Version 8.1
For a singularly perturbed elliptic model problem with two small parameters, we analyze finite element methods of any order on a Bakhvalov-type mesh. For convergence analysis, we construct a new interpolation by using the characteristics of…
We describe the "Fair Dealing Button," a feature designed for authors who have deposited their papers in an Open Access Institutional Repository but have deposited them as "Closed Access" (meaning only the metadata are visible and…
Work package 2 (WP2) aims to develop libraries for energy-efficient inter-process communication and data sharing on the EXCESS platforms. The Deliverable D2.4 reports on the final prototype of programming abstractions for energy-efficient…
In this survey we discuss the results on the finitistic dimension of various stratified algebras. We describe what is already known, present some recent estimates, and list some open problems.
This article presents a comprehensive overview and supplement to recent developments in second-order elliptic partial differential equations formulated in double divergence form, along with an exploration of their parabolic counterparts.
This paper surveys basic properties of finite presentation in groups, Lie algebras and rings. It includes some new results and also new, more elementary proofs, of some results that are already in the literature. In particular, we discuss…
In this paper, we consider the field model for complex ionic fluids with an energy variational structure, and analyze the well-posedness to this model with regularized kernels. Furthermore, we deduce the estimate of the maximal density…
The aim of this paper is to provide a survey of the state of the art in the finite element approach to the Immersed Boundary Method (FE-IBM) which has been investigated by the authors during the last decade. In a unified setting, we present…
We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…
Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial BLAS library implements key computational primitives for…
We consider a financial market in discrete time and study pricing and hedging conditional on the information available up to an arbitrary point in time. In this conditional framework, we determine the structure of arbitrage-free prices.…
This paper deals with bounding the error on the estimation of quantities of interest obtained by finite element and domain decomposition methods. The proposed bounds are written in order to separate the two errors involved in the resolution…
Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…
Some mistaken reasonings at the end of the paper omitted.
This paper covers two major subjects: First, the presentation of a new open-source library called FMI.jl for integrating FMI into the Julia programming environment by providing the possibility to load, parameterize and simulate FMUs.…
We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…
The purpose of this paper is twofold. Firstly, the new matrix domains are constructed with the new infinite matrices and some properties are investigated. Furthermore, dual spaces of new matrix domains are computed and matrix…
Many classical and modern finite element spaces are derived by dividing each computational cell into finer pieces. Such \emph{macroelements} frequently enable the enforcement of mathematically desirable properties such as divergence-free…
This paper presents the methodology for the system requirements and architecture w.r.t. their decomposition and refinement. It also introduces ideas of refinement layers and of refinement-based verification.
Arithmetical properties of a finite group are properties of the group which are defined by its arithmetical parameters such as the order of the group, the element orders and so on. In this paper, we discuss a number of results on…