Miriam Mehl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Miriam Mehl has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Hans-Joachim Bungartz
Department of Informatics Technical University of Munich Germany
5 shared publications - Tobias Neckel
Technical University of Munich
5 shared publications - Bernhard Gatzhammer
Technische Universität München
2 shared publications - Atanas Atanasov
Technische Universität München, Munich, Germany
1 shared publication Chr. Zenger
Institut für Informatik, TU München, Boltzmannstraße 3, 85748 Garching, Germany
1 shared publication- Christoph van Treeck
Fraunhofer-Institut für Bauphysik
1 shared publication
Latest Publications
- 27 July 2011
- Published by Springer Nature in Computational Mechanics
- Vol. 48 (3) , 365-376
Towards multi-phase flow simulations in the PDE framework Peano
- 27 July 2011
- Published by Springer Nature in Computational Mechanics
- Vol. 48 (3) , 365-376
Towards multi-phase flow simulations in the PDE framework Peano
- 29 November 2010
- Published by Wiley in International Journal for Numerical Methods in Fluids
- Vol. 65 (1-3) , 67-86
Navier–Stokes and Lattice–Boltzmann on octree‐like grids in the Peano framework
The Navier–Stokes equations (NS) and the Lattice–Boltzmann method (LBM) are the main two types of models used in computational fluid dynamics yielding similar results for certain classes of flow problems both having certain advantages and disadvantages.We present the realization of both approaches—laminar incompressible NS and LB—on the same code basis, our PDE framework Peano. Peano offers a highly memory efficient implementation of all grid and data handling issues for structured adaptive grids. Using a common code basis allows to compare NS and LB without distorting the results by differences in the maturity and degree of hardware‐optimality of the technical implementation.In addition to a comparison for some test examples, we briefly present the coupling of NS and LB in one single simulation. Such a coupling might be useful to simulate boundary effects happening on a smaller scale more accurately with LB but still using NS in the main part of the domain. Copyright © 2010 John Wiley & Sons, Ltd.
- 29 November 2010
- Published by Wiley in International Journal for Numerical Methods in Fluids
- Vol. 65 (1-3) , 67-86
Navier–Stokes and Lattice–Boltzmann on octree‐like grids in the Peano framework
The Navier–Stokes equations (NS) and the Lattice–Boltzmann method (LBM) are the main two types of models used in computational fluid dynamics yielding similar results for certain classes of flow problems both having certain advantages and disadvantages.We present the realization of both approaches—laminar incompressible NS and LB—on the same code basis, our PDE framework Peano. Peano offers a highly memory efficient implementation of all grid and data handling issues for structured adaptive grids. Using a common code basis allows to compare NS and LB without distorting the results by differences in the maturity and degree of hardware‐optimality of the technical implementation.In addition to a comparison for some test examples, we briefly present the coupling of NS and LB in one single simulation. Such a coupling might be useful to simulate boundary effects happening on a smaller scale more accurately with LB but still using NS in the main part of the domain. Copyright © 2010 John Wiley & Sons, Ltd.
- 28 July 2010
- Published by Springer Nature
- p. 255-284
Partitioned Simulation of Fluid-Structure Interaction on Cartesian Grids
- 28 July 2010
- Published by Springer Nature
- p. 255-284
Partitioned Simulation of Fluid-Structure Interaction on Cartesian Grids
- 1 January 2010
- Published by Springer Nature
- p. 63-74
Computational Steering of Complex Flow Simulations
- 1 January 2010
- Published by Springer Nature
- p. 63-74
Computational Steering of Complex Flow Simulations
- 4 November 2009
- Published by Springer Nature in Computational Mechanics
- Vol. 46 (1) , 103-114
The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids
- 4 November 2009
- Published by Springer Nature in Computational Mechanics
- Vol. 46 (1) , 103-114
The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids
- 10 May 2008
- Published by Springer Nature in Computational Mechanics
- Vol. 43 (1) , 115-124
An Eulerian approach for partitioned fluid–structure simulations on Cartesian grids
- 10 May 2008
- Published by Springer Nature in Computational Mechanics
- Vol. 43 (1) , 115-124
An Eulerian approach for partitioned fluid–structure simulations on Cartesian grids
- 15 February 2006
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 13 (2-3) , 275-291
A cache‐oblivious self‐adaptive full multigrid method
This paper presents a new efficient way to implement multigrid algorithms on adaptively refined grids. To cope with todays demands in high‐performance computing, we cannot do without such highly sophisticated numerical methods. But if we do not implement them very carefully, we lose a lot of efficiency in terms of memory usage: using trees for the storage of hierarchical multilevel data causes a large amount of non‐local (in terms of the physical memory space) data accesses, and often requires the storage of pointers to neighbours to allow the evaluation of discrete operators (difference stencils, restrictions, interpolations, etc.). The importance of this problem becomes clear if we remember that storage and not the CPUs is the bottleneck on modern computers.We established a cache‐oblivious and storage‐minimizing algorithm based on the concept of space‐tree grids combined with a cell‐oriented operator evaluation, a linear ordering of grid cells along a space‐filling curve, and a sophisticated construction of linearly processed data structures for vertex data. In this context, we could show that the implementation of a dynamically adaptiveF‐cycle is, first, very natural and, second, does not cause any overhead in terms of storage usage and access as adaptivity and multilevel data do not disturb the linear processing order of our data structures. Copyright © 2006 John Wiley & Sons, Ltd.
- 15 February 2006
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 13 (2-3) , 275-291
A cache‐oblivious self‐adaptive full multigrid method
This paper presents a new efficient way to implement multigrid algorithms on adaptively refined grids. To cope with todays demands in high‐performance computing, we cannot do without such highly sophisticated numerical methods. But if we do not implement them very carefully, we lose a lot of efficiency in terms of memory usage: using trees for the storage of hierarchical multilevel data causes a large amount of non‐local (in terms of the physical memory space) data accesses, and often requires the storage of pointers to neighbours to allow the evaluation of discrete operators (difference stencils, restrictions, interpolations, etc.). The importance of this problem becomes clear if we remember that storage and not the CPUs is the bottleneck on modern computers.We established a cache‐oblivious and storage‐minimizing algorithm based on the concept of space‐tree grids combined with a cell‐oriented operator evaluation, a linear ordering of grid cells along a space‐filling curve, and a sophisticated construction of linearly processed data structures for vertex data. In this context, we could show that the implementation of a dynamically adaptiveF‐cycle is, first, very natural and, second, does not cause any overhead in terms of storage usage and access as adaptivity and multilevel data do not disturb the linear processing order of our data structures. Copyright © 2006 John Wiley & Sons, Ltd.