Presentation

<
Adaptive Algebraic Reuse of Reordering in Cholesky Factorizations with Dynamic Sparsity Patterns
SessionNumerics & Parallelization
DescriptionParth delivers adaptive fill-reducing ordering to accelerate Cholesky solvers in simulations with dynamic sparsity patterns, such as contact modelling, achieving up to 255× ordering speedups. With seamless, three-line integration into popular solvers like MKL and Accelerate, Parth ensures reliable, high-performance computations for applications in computer graphics and scientific computing.
Authors
Behrooz Zarebavani
University of Toronto
Danny M. Kaufman
Adobe Research
David I. W. Levin
University of Toronto
Maryam Mehri Dehnavi
University of Toronto
Event Type
Technical Paper
TimeWednesday, 13 August 20252:20pm - 2:30pm PDT
LocationWest Building, Rooms 118-120
ACM Digital Library Journal Papers' PDFs
Conference Papers' PDFs
Session Time & Location
Sunday, 10 August 20256:00pm - 8:45pm PDTWest Building, Ballroom AB
Wednesday, 13 August 20252:00pm - 3:30pm PDTWest Building, Rooms 118-120
Interest Areas
Research & Education
Recordings
Livestreamed
Recorded
Registration Categories
Full Conference
Virtual Access
Wednesday
Next PresentationNext PresentationMiSo: A DSL for robust and efficient MINIMIZE and SOLVE problems
Similar Presentations
Variational Elastodynamic Simulation
Optimal r-Adaptive In-Timestep Remeshing for Elastodynamics
Fast But Accurate: A Real-Time Hyperelastic Simulator with Robust Frictional Contact