Heuristic Partitioning Algorithm for General Purpose Transportation Networks and Finite Element Meshes

Recently developed heuristic algorithms for efficient domain partitioning (DP) of large-scale finite element applications are thoroughly discussed in this chapter. Examples are provided to clarify the steps involved in DP. Numerical performance (to reduce/minimize the system boundary nodes among adjacent subdomains) of the developed DP algorithm is also compared to popular METIS software. Real-life transportation networks and finite element meshes are used to validate the developed DP algorithms.