BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260805T205606Z
LOCATION:Room 403  B
DTSTART;TZID=America/Los_Angeles:20260722T155500
DTEND;TZID=America/Los_Angeles:20260722T160500
UID:siggraph_SIGGRAPH 2026_sess115_papers_1130@linklings.com
SUMMARY:Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers
DESCRIPTION:Behrooz Zarebavani (University of Toronto); Ahmed Mahmoud and 
 Ana Dodik (Massachusetts Institute of Technology (MIT)); Changcheng Yuan (
 Texas A&M University); Serban Porumbescu and John Owens (University of Cal
 ifornia Davis); Maryam Mehri Dehnavi (University of Toronto, NVIDIA); and 
 Justin Solomon (Massachusetts Institute of Technology (MIT))\n\nWe present
  a fast sparse matrix permutation algorithm tailored to mesh-based direct 
 solvers. By exploiting mesh structure through patch-based nested dissectio
 n, our method reduces permutation overhead while preserving high-quality o
 rderings, leading to substantial end-to-end speedups in sparse Cholesky fa
 ctorization on both CPUs and GPUs.\n\nInterest Area: Research & Education\
 n\nKeyword: Animation, Artificial Intelligence/Machine Learning, Fabricati
 on, Geometry, Modeling, Simulation\n\nRegistration Category: Full Conferen
 ce Supporter, Full Conference\n\nSession Chair: Danny Kaufman (Adobe, Univ
 ersity of Toronto)\n\n
END:VEVENT
END:VCALENDAR