Zobrazeno 1 - 10
of 441
pro vyhledávání: '"Holzer Markus"'
We implement and analyse a sparse / indirect-addressing data structure for the Lattice Boltzmann Method to support efficient compute kernels for fluid dynamics problems with a high number of non-fluid nodes in the domain, such as in porous media flow
Externí odkaz:
http://arxiv.org/abs/2408.06880
This study develops a computationally efficient phase-field lattice Boltzmann model with the capability to simulate thermocapillary flows. The model was implemented into the open-source simulation framework, waLBerla, and extended to conduct the coll
Externí odkaz:
http://arxiv.org/abs/2401.03041
Autor:
Holzer, Markus, Rauch, Christian
Publikováno v:
EPTCS 386, 2023, pp. 127-141
The study of the operational complexity of minimal pumping constants started in [J. DASSOW and I. JECKER. Operational complexity and pumping lemmas. Acta Inform., 59:337-355, 2022], where an almost complete picture of the operational complexity of mi
Externí odkaz:
http://arxiv.org/abs/2309.02757
Autor:
Holzer, Markus, Badwaik, Jayesh, Vavrik, Radim, Staffelbach, Gabriel, Herten, Andreas, Vysocky, Ondrej, Rocchi, Ilan, Riha, Lubomir, Cuidard, Romain, Ruede, Ulrich
The primary goal of the EuroHPC JU project SCALABLE is to develop an industrial Lattice Boltzmann Method (LBM)-based computational fluid dynamics (CFD) solver capable of exploiting current and future extreme scale architectures, expanding current cap
Externí odkaz:
http://arxiv.org/abs/2305.09910
The scientific code generation package lbmpy supports the automated design and the efficient implementation of lattice Boltzmann methods (LBMs) through metaprogramming. It is based on a new, concise calculus for describing multiple relaxation-time LB
Externí odkaz:
http://arxiv.org/abs/2211.02435
Autor:
Rauch, Christian, Holzer, Markus
Publikováno v:
EPTCS 367, 2022, pp. 177-189
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by permutation automata: union, quotient, complement, difference, intersec
Externí odkaz:
http://arxiv.org/abs/2208.14731
Autor:
Schwarzmeier, Christoph, Holzer, Markus, Mitchell, Travis, Lehmann, Moritz, Häusl, Fabian, Rüde, Ulrich
Publikováno v:
Journal of Computational Physics 473 (2023)
This study compares the free-surface lattice Boltzmann method (FSLBM) with the conservative Allen-Cahn phase-field lattice Boltzmann method (PFLBM) in their ability to model two-phase flows in which the behavior of the system is dominated by the heav
Externí odkaz:
http://arxiv.org/abs/2206.11637
Automatic code generation is frequently used to create implementations of algorithms specifically tuned to particular hardware and application parameters. The code generation process involves the selection of adequate code transformations, tuning par
Externí odkaz:
http://arxiv.org/abs/2204.14242
Autor:
Arrighi, Emmanuel, Fernau, Henning, Hoffmann, Stefan, Holzer, Markus, Jecker, Ismaël, Oliveira, Mateus de Oliveira, Wolf, Petra
In the Intersection Non-Emptiness problem, we are given a list of finite automata $A_1,A_2,\dots,A_m$ over a common alphabet $\Sigma$ as input, and the goal is to determine whether some string $w\in \Sigma^*$ lies in the intersection of the languages
Externí odkaz:
http://arxiv.org/abs/2110.01279