Dendro  5.01
Dendro in Greek language means tree. The Dendro library is a large scale (262K cores on ORNL's Titan) distributed memory adaptive octree framework. The main goal of Dendro is to perform large scale multiphysics simulations efficeiently in mordern supercomputers. Dendro consists of efficient parallel data structures and algorithms to perform variational ( finite element) methods and finite difference mthods on 2:1 balanced arbitary adaptive octrees which enables the users to perform simulations raning from black holes (binary black hole mergers) to blood flow in human body, where applications ranging from relativity, astrophysics to biomedical engineering.
Public Member Functions | List of all members
ot::NodeTuple Struct Reference

#include <mesh.h>

Public Member Functions

 NodeTuple (unsigned int xi, unsigned int yj, unsigned int zk, unsigned int owner)
unsigned int getX () const
unsigned int getY () const
unsigned int getZ () const
unsigned int getLevel () const

Detailed Description

Structure to order the send recv nodes based on the (e,i,j,k ) ordering.

The documentation for this struct was generated from the following file: