3 citations · 5 across the 6 of their papers we have counts for
6 papers
Adaptive Mesh Refinement for arbitrary initial Triangulations
Lars Diening, Lukas Gehring, Johannes Storn
We introduce a simple initialization of the Maubach bisection routine for adaptive mesh refinement which applies to any conforming initial triangulation and terminates in linear ti…
The Constant in the Theorem of Binev-Dahmen-DeVore-Stevenson and a Generalisation of it
Lukas Gehring
A triangulation of a polytope into simplices is refined recursively. In every refinement round, some simplices which have been marked by an external algorithm are bisected and some…
PyExperimenter: Easily distribute experiments and track results
Tanja Tornede, Alexander Tornede, Lukas Fehring +5
PyExperimenter is a tool to facilitate the setup, documentation, execution, and subsequent evaluation of results from an empirical study of algorithms and in particular is designed…
A Strengthened Alexandrov Maximum Principle or Uniform Hölder Continuity for Solutions of the Monge--Ampère Equation with Bounded Right-Hand Side
Lukas Gehring
This article is about the convex solution of the Monge--Ampère equation on an at least 2-dimensional open bounded convex domain with Dirichlet boundary data and nonnegative bou…
Algorithm Selection on a Meta Level
Alexander Tornede, Lukas Gehring, Tanja Tornede +2
The problem of selecting an algorithm that appears most suitable for a specific instance of an algorithmic problem class, such as the Boolean satisfiability problem, is called inst…
Estimating the density of a set of primes with applications to group theory
Carlos Esparza, Lukas Gehring
We estimate the asymptotic density of the set of primes satisfying the constraint that and have only one prime divisor larger than . We also estimate t…