Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the topic of partitioning unstructured finite element meshes by a class of multilevel graph partitioning algorithms. Two issues are studied, where the first issue concerns the coarsening phase in such multilevel graph partitioning algorithms. In particular,  propose a new heuristic for matching the vertices of a graph during the coarsening phase.  compare our heuristic with two other known matching heuristics in respect of matching ratio and quality of the final partition. As the second issue of the paper,  look at the relation beten the parallel efficiency of finite element computation and different aspects of the partition quality.
['Noureddine Bouhmala', 'Xing Cai']
I am writing a research paper on a idea Partition of Unstructured Finite Element Meshes by a Multilevel Approach
[{"from": "human", "value": "I am writing a research paper on a idea Partition of Unstructured Finite Element Meshes by a Multilevel Approach"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the topic of partitioning unstructured finite element meshes by a class of multilevel graph partitioning algorithms. Two issues are studied, where the first issue concerns the coarsening phase in such multilevel graph partitioning algorithms. In particular,  propose a new heuristic for matching the vertices of a graph during the coarsening phase.  compare our heuristic with two other known matching heuristics in respect of matching ratio and quality of the final partition. As the second issue of the paper,  look at the relation beten the parallel efficiency of finite element computation and different aspects of the partition quality."}]