Extensions of Dynamic Programming for Element-based Trees (initiative project) OverviewDevelopment of mathematical and algorithmic foundations for extensions of dynamic programming approach for element-based trees over rectangular meshes (counting of the number of optimal trees, multi-stage optimization, construction of the set of Pareto optimal points, and study of relationships between two cost functions). Experimental study of meshes containing point and edge singularities. Details This is joint project with Victor Calo, KAUST and Maciej Paszynski, AGH University, Krakow. The aim of project is to create dynamic programming tools for optimization of elimination trees for 2D and 3D finite element method. We consider cost functions which characterize time and space complexity of computation for various degrees of parallelization.
