A short note on the use of the red-black tree in Cartesian adaptive mesh refinement algorithms.
Jaber J. HasbestanInanc SenocakPublished in: J. Comput. Phys. (2017)
Keyphrases
- data structure
- database
- learning algorithm
- times faster
- computationally efficient
- mesh refinement
- neural network
- recently developed
- significant improvement
- computational cost
- machine learning algorithms
- worst case
- adaptive algorithms
- computational efficiency
- tree structure
- orders of magnitude
- data mining techniques
- search space
- lower bound
- computational complexity
- data sets