Peano

Peano - a Framework for Solvers on Spacetree Grids. Peano is an open source C++ solver framework. It is based upon the fact that spacetrees, a generalisation of the classical octree concept, yield a cascade of adaptive Cartesian grids. Consequently, any spacetree traversal is equivalent to an element-wise traversal of the hierarchy of the adaptive Cartesian grids. The software Peano realises such a grid traversal and storage algorithm, and it provides hook-in points for applications performing per-element, per-vertex, and so forth operations on the grid. It also provides interfaces for dynamic load balancing, sophisticated geometry representations, and other features. Some properties are enlisted below. ...


References in zbMATH (referenced in 25 articles , 3 standard articles )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Kemm, Friedemann; Gaburro, Elena; Thein, Ferdinand; Dumbser, Michael: A simple diffuse interface approach for compressible flows around moving solids of arbitrary shape based on a reduced Baer-Nunziato model (2020)
  2. Burstedde, Carsten; Holke, Johannes; Isaac, Tobin: On the number of face-connected components of Morton-type space-filling curves (2019)
  3. Cerveny, Jakub; Dobrev, Veselin; Kolev, Tzanio: Nonconforming mesh refinement for high-order finite elements (2019)
  4. Weinzierl, Tobias: The Peano software -- parallel, automaton-based, dynamically adaptive grid traversals (2019)
  5. Collom, Gerald; Redman, Colin; Robey, Robert W.: Fast mesh-to-mesh remaps using hash algorithms (2018)
  6. Dumbser, Michael; Fambri, Francesco; Tavelli, Maurizio; Bader, Michael; Weinzierl, Tobias: Efficient implementation of ADER discontinuous Galerkin schemes for a scalable hyperbolic PDE engine (2018)
  7. Schornbaum, Florian; Rüde, Ulrich: Extreme-scale block-structured adaptive mesh refinement (2018)
  8. Xu, Lincheng; Tian, Fang-Bao; Young, John; Lai, Joseph C. S.: A novel geometry-adaptive Cartesian grid based immersed boundary-lattice Boltzmann method for fluid-structure interactions at moderate and high Reynolds numbers (2018)
  9. Burstedde, Carsten; Holke, Johannes: Coarse mesh partitioning for tree-based AMR (2017)
  10. Descombes, Stéphane; Duarte, Max; Dumont, Thierry; Guillet, Thomas; Louvet, Violaine; Massot, Marc: Task-based adaptive multiresolution for time-space multi-scale reaction-diffusion systems on multi-core architectures (2017)
  11. Donna Calhoun, Carsten Burstedde: ForestClaw: A parallel algorithm for patch-based adaptive mesh refinement on a forest of quadtrees (2017) arXiv
  12. Jannis Teunissen, Ute Ebert: Afivo: a framework for quadtree/octree AMR with shared-memory parallelization and geometric multigrid methods (2017) arXiv
  13. Meister, Oliver; Rahnema, Kaveh; Bader, Michael: Parallel memory-efficient adaptive mesh refinement on structured triangular meshes with billions of grid cells (2017)
  14. Reps, Bram; Weinzierl, Tobias: Complex additive geometric multilevel solvers for Helmholtz equations on spacetrees (2017)
  15. Burstedde, Carsten; Holke, Johannes: A tetrahedral space-filling curve for nonconforming adaptive meshes (2016)
  16. Deiterding, Ralf; Domingues, Margarete O.; Gomes, Sônia M.; Schneider, Kai: Comparison of adaptive multiresolution and adaptive mesh refinement applied to simulations of the compressible Euler equations (2016)
  17. Schornbaum, Florian; Rüde, Ulrich: Massively parallel algorithms for the lattice Boltzmann method on nonuniform grids (2016)
  18. Schreiber, Martin; Neckel, Tobias; Bungartz, Hans-Joachim: Evaluation of an efficient stack-RLE clustering concept for dynamically adaptive grids (2016)
  19. Neumann, Philipp; Eckhardt, Wolfgang; Bungartz, Hans-Joachim: Hybrid molecular-continuum methods: from prototypes to coupling software (2014)
  20. Neumann, Philipp; Neckel, Tobias: A dynamic mesh refinement technique for lattice Boltzmann simulations on octree-like grids (2013)

1 2 next