Hans-Georg Matuttis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hans-Georg Matuttis has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Alessia Faggian
Department of Physics, University of Trento, 38123 Trento, Italy
6 shared publications - Dandolo Flumini
Zurich University of Applied Sciences
6 shared publications - David Anthony Barrow
Cardiff University
6 shared publications - Federica Casiraghi
University of Trento
6 shared publications - Jin Li
Cardiff School of Engineering, Cardiff University
6 shared publications - Johannes Josef Schneider
Zurich University of Applied Sciences
6 shared publications
Latest Publications
- Open Access
- 28 September 2026
- Published by Springer Nature
- p. 74-84
Tree Code Based Neighborhood Algorithms for Discrete Element Methods
We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code needs $$N\log N$$ , as does the sort and sweep approach. For our choice of boundary conditions (a rotating drum) and system sizes (up to several thousand particles), the performance of the tree-code is slightly better, but the algorithm is considerably more complicated than the sort and sweep approach.- 28 September 2026
- Published by Springer Nature
- p. 74-84
Open AccessTree Code Based Neighborhood Algorithms for Discrete Element Methods
We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code needs $$N\log N$$ , as does the sort and sweep approach. For our choice of boundary conditions (a rotating drum) and system sizes (up to several thousand particles), the performance of the tree-code is slightly better, but the algorithm is considerably more complicated than the sort and sweep approach. - Open Access
- 1 December 2025
- Published by EDP Sciences in EPJ Web of Conferences
- Vol. 340, 09007
Implementing van der Waals forces for polytope particles in DEM simulations of clay
Clay minerals are non-spherical nano-scale particles that usually form flocculated, house-of-card like structures under the influence of inter-molecular forces. Numerical modeling of clays is still in its infancy as the required inter-particle forces are available only for spherical particles. A polytope approach would allow shape-accurate forces and torques while simultaneously being more performant. The Anandarajah solution provides an analytical formulation for van der Waals forces for cuboid particles but in its original form is not suitable for implementation in DEM simulations. In this work, we discuss the necessary changes for a functional implementation of the Anandarajah solution in a DEM simulation of rectangular particles and their extension to cuboid particles.
- 1 December 2025
- Published by EDP Sciences in EPJ Web of Conferences
- Vol. 340, 09007
Open AccessImplementing van der Waals forces for polytope particles in DEM simulations of clay
Clay minerals are non-spherical nano-scale particles that usually form flocculated, house-of-card like structures under the influence of inter-molecular forces. Numerical modeling of clays is still in its infancy as the required inter-particle forces are available only for spherical particles. A polytope approach would allow shape-accurate forces and torques while simultaneously being more performant. The Anandarajah solution provides an analytical formulation for van der Waals forces for cuboid particles but in its original form is not suitable for implementation in DEM simulations. In this work, we discuss the necessary changes for a functional implementation of the Anandarajah solution in a DEM simulation of rectangular particles and their extension to cuboid particles.
- Open Access
Implementing van der Waals forces for polytope particles in DEM simulations of clay
Clay minerals are non-spherical nano-scale particles that usually form flocculated, house-of-card like structures under the influence of inter-molecular forces. Numerical modeling of clays is still in its infancy as the required inter-particle forces are available only for spherical particles. A polytope approach would allow shape-accurate forces and torques while simultaneously being more performant. The Anandarajah solution provides an analytical formulation for van der Waals forces for cuboid particles but in its original form is not suitable for implementation in DEM simulations. In this work, we discuss the necessary changes for a functional implementation of the Anandarajah solution in a DEM simulation of rectangular particles and their extension to cuboid particles.
Open AccessImplementing van der Waals forces for polytope particles in DEM simulations of clay
Clay minerals are non-spherical nano-scale particles that usually form flocculated, house-of-card like structures under the influence of inter-molecular forces. Numerical modeling of clays is still in its infancy as the required inter-particle forces are available only for spherical particles. A polytope approach would allow shape-accurate forces and torques while simultaneously being more performant. The Anandarajah solution provides an analytical formulation for van der Waals forces for cuboid particles but in its original form is not suitable for implementation in DEM simulations. In this work, we discuss the necessary changes for a functional implementation of the Anandarajah solution in a DEM simulation of rectangular particles and their extension to cuboid particles.
- Open Access
Tree Code Based Neighborhood Algorithms for Discrete Element Methods
We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code needs $N\log N$, as does the sort and sweep approach. For our choice of boundary conditions (a rotating drum) and system sizes (up to several thousand particles), the performance of the tree-code is slightly better, but the algorithm is considerably more complicated than the sort and sweep approach.Open AccessTree Code Based Neighborhood Algorithms for Discrete Element Methods
We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code needs $N\log N$, as does the sort and sweep approach. For our choice of boundary conditions (a rotating drum) and system sizes (up to several thousand particles), the performance of the tree-code is slightly better, but the algorithm is considerably more complicated than the sort and sweep approach. - Open Access
- 30 March 2024
- Published by Springer Nature
- p. 141-160
Kauffman Model with Spatially Separated Ligation and Cleavage Reactions
One of the open questions regarding the origin of life is the problem how macromolecules could be created. One possible answer is the existence of autocatalytic sets in which some macromolecules mutually catalyze each other’s formation. This mechanism is theoretically described in the Kauffman model. We introduce and simulate an extension of the Kauffman model, in which ligation and cleavage reactions are spatially separated in different containers connected by diffusion, and provide computational results for instances with and without autocatalytic sets, focusing on the time evolution of the densities of the various molecules. Furthermore, we study the rich behavior of a randomly generated instance containing an autocatalytic metabolism, in which molecules are created by ligation processes and destroyed by cleavage processes and vice versa or generated and destroyed both by ligation processes.
- 30 March 2024
- Published by Springer Nature
- p. 141-160
Open AccessKauffman Model with Spatially Separated Ligation and Cleavage Reactions
One of the open questions regarding the origin of life is the problem how macromolecules could be created. One possible answer is the existence of autocatalytic sets in which some macromolecules mutually catalyze each other’s formation. This mechanism is theoretically described in the Kauffman model. We introduce and simulate an extension of the Kauffman model, in which ligation and cleavage reactions are spatially separated in different containers connected by diffusion, and provide computational results for instances with and without autocatalytic sets, focusing on the time evolution of the densities of the various molecules. Furthermore, we study the rich behavior of a randomly generated instance containing an autocatalytic metabolism, in which molecules are created by ligation processes and destroyed by cleavage processes and vice versa or generated and destroyed both by ligation processes.
- Open Access
- 30 March 2024
- Published by Springer Nature
- p. 161-174
Percolation Breakdown in Binary and Ternary Monodisperse and Polydisperse Systems of Spherical Particles
We perform computer simulations of an agglomeration process for monodisperse and polydisperse systems of spherical particles in a cylindrical container, using a simplified stochastic-hydrodynamic model. We consider a ternary system with three particle types A, B, and C, in which only connections of the type $$A-B$$ can be forged, while any other connections with particles of the same type or with C-particles are forbidden, and for comparison a binary system with two particle types A and C, in which only connections of the type $$A-A$$ can be formed. We study the breakdown of the percolation in the agglomeration at the bottom of the cylinder with an increasing fraction of C-particles.- 30 March 2024
- Published by Springer Nature
- p. 161-174
Open AccessPercolation Breakdown in Binary and Ternary Monodisperse and Polydisperse Systems of Spherical Particles
We perform computer simulations of an agglomeration process for monodisperse and polydisperse systems of spherical particles in a cylindrical container, using a simplified stochastic-hydrodynamic model. We consider a ternary system with three particle types A, B, and C, in which only connections of the type $$A-B$$ can be forged, while any other connections with particles of the same type or with C-particles are forbidden, and for comparison a binary system with two particle types A and C, in which only connections of the type $$A-A$$ can be formed. We study the breakdown of the percolation in the agglomeration at the bottom of the cylinder with an increasing fraction of C-particles. - 30 April 2023
- Published by Springer Nature
- p. 107-118
Artificial Chemistry Performed in an Agglomeration of Droplets with Restricted Molecule Transfer
Within the scope of the European Horizon 2020 project ACDC – Artificial Cells with Distributed Cores to Decipher Protein Function, we aim at the development of a chemical compiler governing the three-dimensional arrangement of droplets, which are filled with various chemicals. Neighboring droplets form bilayers with pores which allow chemicals to move from one droplet to its neighbors. With an appropriate three-dimensional configuration of droplets, we can thus enable gradual biochemical reaction schemes for various purposes, e.g., for the production of macromolecules for pharmaceutical purposes. In this paper, we demonstrate with artificial chemistry simulations that the ACDC technology is excellently suitable to maximize the yield of desired reaction products or to minimize the relative output of unwanted side products.
- 30 April 2023
- Published by Springer Nature
- p. 107-118
Artificial Chemistry Performed in an Agglomeration of Droplets with Restricted Molecule Transfer
Within the scope of the European Horizon 2020 project ACDC – Artificial Cells with Distributed Cores to Decipher Protein Function, we aim at the development of a chemical compiler governing the three-dimensional arrangement of droplets, which are filled with various chemicals. Neighboring droplets form bilayers with pores which allow chemicals to move from one droplet to its neighbors. With an appropriate three-dimensional configuration of droplets, we can thus enable gradual biochemical reaction schemes for various purposes, e.g., for the production of macromolecules for pharmaceutical purposes. In this paper, we demonstrate with artificial chemistry simulations that the ACDC technology is excellently suitable to maximize the yield of desired reaction products or to minimize the relative output of unwanted side products.
- 30 April 2023
- Published by Springer Nature
- p. 94-106
Network Creation During Agglomeration Processes of Polydisperse and Monodisperse Systems of Droplets
We simulate the movement and agglomeration of oil droplets in water under constraints, using a simplified stochastic-hydrodynamic model. We analyze both local and global properties of the networks formed by the agglomerations of droplets for various system sizes. We focus on the differences of these properties for monodisperse and polydisperse systems of droplets. For the mean degree, we obtain different values for critical exponents.
- 30 April 2023
- Published by Springer Nature
- p. 94-106
Network Creation During Agglomeration Processes of Polydisperse and Monodisperse Systems of Droplets
We simulate the movement and agglomeration of oil droplets in water under constraints, using a simplified stochastic-hydrodynamic model. We analyze both local and global properties of the networks formed by the agglomerations of droplets for various system sizes. We focus on the differences of these properties for monodisperse and polydisperse systems of droplets. For the mean degree, we obtain different values for critical exponents.
- 30 April 2023
- Published by Springer Nature
- p. 82-93
Computational Investigation of the Clustering of Droplets in Widening Pipe Geometries
Experimentally, periodically released droplets in systems of widening pipes show clustering. This is surprising, as purely hydrodynamic interactions are repulsive so that agglomeration should be prevented. In the main part of this paper, we investigate the clustering of droplets under the influence of phenomenological hydrostatic forces and some hypothetical attraction. In two appendices, we explain why a direct numerical simulation for this system is rather more difficult (and probably not possible with current methods) than the “simple” geometry would suggest.
- 30 April 2023
- Published by Springer Nature
- p. 82-93
Computational Investigation of the Clustering of Droplets in Widening Pipe Geometries
Experimentally, periodically released droplets in systems of widening pipes show clustering. This is surprising, as purely hydrodynamic interactions are repulsive so that agglomeration should be prevented. In the main part of this paper, we investigate the clustering of droplets under the influence of phenomenological hydrostatic forces and some hypothetical attraction. In two appendices, we explain why a direct numerical simulation for this system is rather more difficult (and probably not possible with current methods) than the “simple” geometry would suggest.
- 1 January 2022
- Published by Springer Nature
- p. 51-62
The Good, the Bad and the Ugly: Droplet Recognition by a “Shootout”-Heuristics
We explain how to optimize the image analysis of mixed clusters of red and green droplets in solvents with various degrees of sharpness, brightness, contrast and density. The circular Hough Transform is highly efficient for separated circles with reasonable background contrast, but not for large amounts of partially overlapping shapes, some of them blurred, as in the images of our dense droplet suspensions. We explain why standard approaches for image improvement fail and present a “shootout” approach, where already detected circles are masked, so that the removal of sharp outlines improves the relative optical quality of the remaining droplets. Nevertheless, for intrinsic reasons, there are limits to the accuracy of data which can be obtained on very dense clusters.
- 1 January 2022
- Published by Springer Nature
- p. 51-62
The Good, the Bad and the Ugly: Droplet Recognition by a “Shootout”-Heuristics
We explain how to optimize the image analysis of mixed clusters of red and green droplets in solvents with various degrees of sharpness, brightness, contrast and density. The circular Hough Transform is highly efficient for separated circles with reasonable background contrast, but not for large amounts of partially overlapping shapes, some of them blurred, as in the images of our dense droplet suspensions. We explain why standard approaches for image improvement fail and present a “shootout” approach, where already detected circles are masked, so that the removal of sharp outlines improves the relative optical quality of the remaining droplets. Nevertheless, for intrinsic reasons, there are limits to the accuracy of data which can be obtained on very dense clusters.