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:20260417T190113Z
LOCATION:West Building\, Rooms 118-120
DTSTART;TZID=America/Los_Angeles:20250813T140000
DTEND;TZID=America/Los_Angeles:20250813T153000
UID:siggraph_SIGGRAPH 2025_sess155@linklings.com
SUMMARY:Numerics & Parallelization
DESCRIPTION:Adaptive Algebraic Reuse of Reordering in Cholesky Factorizati
 ons with Dynamic Sparsity Patterns\n\nParth delivers adaptive fill-reducin
 g ordering to accelerate Cholesky solvers in simulations with dynamic spar
 sity patterns, such as contact modelling, achieving up to 255× ordering sp
 eedups. With seamless, three-line integration into popular solvers like MK
 L and Accelerate, Parth ensures reliable, ...\n\n\nBehrooz Zarebavani (Uni
 versity of Toronto), Danny M. Kaufman (Adobe Research), and David I. W. Le
 vin and Maryam Mehri Dehnavi (University of Toronto)\n--------------------
 -\nAccelerated Gamut Discovery via Massive Parallelization\n\nThis paper p
 roposes a scalable framework using Bayesian Neural Networks and a novel 2m
 D acquisition function to efficiently discover gamut boundaries in perform
 ance space. Combining NSGA-II's diversity and Bayesian Optimization's effi
 ciency, the method enables large-batch, parallel optimization, out...\n\n\
 nNavid Ansari, Hans-Peter Seidel, and Vahid Babaei (Max Planck Institute f
 or Informatics)\n---------------------\nMiSo: A DSL for robust and efficie
 nt MINIMIZE and SOLVE problems\n\nMany problems in graphics can be formula
 ted as a non-linearly constrained global minimization (MINIMIZE), or solut
 ion of a system of non-linear constraints (SOLVE). We introduce MiSo, a do
 main-specific language and compiler for generating efficient code for low-
 dimensional MINIMIZE and SOLVE problem...\n\n\nFederico Sichetti and Enric
 o Puppo (Università di Genova), Zizhou Huang (New York University), Marco 
 Attene (CNR IMATI), and Denis Zorin and Daniele Panozzo (New York Universi
 ty)\n---------------------\nMGPBD: A Multigrid Accelerated Global XPBD Sol
 ver\n\nIn high-stiffness, high-resolution simulations, while primal space 
 methods typically fail, the dual-space XPBD method produces unphysical sof
 tening artifacts due to convergence stall. We design an innovative Algebra
 ic Multigrid method to enhance XPBD, utilizing lazy-update prolongators an
 d near-kern...\n\n\nChunlei Li and Peng Yu (Beihang University); Tiantian 
 Liu (Taichi Graphics); Siyuan Yu (Zenustech); and Yuting Xiao, Shuai Li, A
 imin Hao, Yang Gao, and Qinping Zhao (Beihang University)\n---------------
 ------\nLinear-Time Transport with Rectified Flows\n\nWe propose a simple,
  parallelizable algorithm inspired by rectified flows to match probability
  distributions. With linear-time complexity, it approximates optimal trans
 port by employing summed-area tables and direct particle advection. We ill
 ustrate our applications in stippling, mesh parameterizati...\n\n\nKhoa Do
  (University of Michigan), David Coeurjolly (CNRS - LIRIS), Pooran Memari 
 (CNRS - LIX), and Nicolas Bonneel (CNRS - LIRIS)\n---------------------\nN
 umerics & Parallelization - Interactive Discussion\n\nAfter the summary pr
 esentations, attendees will participate in an interactive discussion. Outs
 ide the room will be a series of poster boards for authors to gather aroun
 d with the audience. Authors are invited to bring any material related to 
 their paper that could instigate further conversation such...\n\n\nInteres
 t Area: Research & Education\n\nRecording: Livestreamed, Not Livestreamed,
  Recorded, Not Recorded\n\nRegistration Category: Full Conference, Virtual
  Access, Wednesday\n\nSession Chair: Timothy Langlois (Adobe)
END:VEVENT
END:VCALENDAR