BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260421T090513Z
LOCATION:Plenary Room (Bldg. 6 - 001)
DTSTART;TZID=Europe/Stockholm:20260629T194200
DTEND;TZID=Europe/Stockholm:20260629T194300
UID:submissions.pasc-conference.org_PASC26_sess124_pos135@linklings.com
SUMMARY:Hypergraph Partitioning for Sparse Matrix Reordering
DESCRIPTION:Ritvik Ranjan, Vincent Maillou, Alexandros Nikolaos Ziogas, an
 d Mathieu Luisier (ETH Zurich)\n\nFill-in during sparse matrix factorizati
 on remains a critical bottleneck in scientific computing. We present an ef
 ficient hypergraph partitioning approach for sparse matrix reordering base
 d on the Clique-Node Hypergraph (CNH) representation, building on prior wo
 rk by Çatalyürek et al. and Selvitopi et al. Our method transforms the spa
 rsity pattern through an edge-clique cover, creating a hypergraph where cl
 iques become nodes and original vertices become nets. Using a hypergraph p
 artitioner, we generate a symmetric diagonal block form with a separator, 
 then apply established ordering methods to each block. Across a benchmark 
 suite of SuiteSparse matrices, our approach achieves fill-in reductions co
 mpetitive with METIS, often outperforming it. This work demonstrates that 
 hypergraph partitioning is a practical alternative for fill-in minimizatio
 n.\n\n
END:VEVENT
END:VCALENDAR