Order Matters - Element Ordering and Graph-Based Sorting for Finite Element Performance

Explore how element ordering and graph-based sorting techniques can dramatically improve finite element simulation performance in this conference talk from FerriteCon 2025. Learn why the seemingly random element orders produced by general-purpose mesh generators like Gmsh lead to poor cache reuse when accessing nodal data, and discover how reordering elements so neighboring elements are visited consecutively can solve this linear arrangement problem on mesh connectivity graphs. Understand the core concept of minimizing functionals that reflect neighborhood relationships in meshes to maximize nodal information reuse during assembly and solve loops. See practical demonstrations of the Gecko.jl package for computing optimized orderings and examine benchmark results showing how graph sorting accelerates simulation runs on modern memory-bound computing architectures. Gain insights into performance optimization strategies for mesh data structures and learn how to leverage the Julia ecosystem to build more efficient finite element workflows, making this presentation valuable for scientific computing practitioners, numerical analysts, and developers focused on computational performance.