BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T055401Z
LOCATION:224
DTSTART;TZID=America/Chicago:20211115T162000
DTEND;TZID=America/Chicago:20211115T165000
UID:submissions.supercomputing.org_SC21_sess350_ws_ia105@linklings.com
SUMMARY:Sparse Exact Factorization Update
DESCRIPTION:Workshop\n\nSparse Exact Factorization Update\n\nChen, Davis, 
 Lourenco, Moreno-Centeno\n\nTo meet the growing need for extended or exact
  precision solvers, an efficient framework based on Integer-Preserving Gau
 ssian Elimination (IPGE) has been recently developed which includes dense/
 sparse LU/Cholesky factorizations and dense LU/Cholesky factorization upda
 tes for column and/or row replacement. In this paper, we discuss our on-go
 ing work developing the sparse LU/Cholesky column/row-replacement update a
 nd the sparse rank-1 update/downdate. We first present some basic backgrou
 nd for the exact factorization framework based on IPGE. Then we give our p
 roposed algorithms along with some implementation and data-structure detai
 ls. Finally, we provide some experimental results showcasing the performan
 ce of our update algorithms. Specifically, we show that updating these exa
 ct factorizations can be typically 10x to 100x faster than (re-)factorizin
 g the matrices from scratch.\n\nTag: Algorithms, Architectures, Big Data, 
 Data Analytics, Memory Systems, Numerical Algorithms\n\nRegistration Categ
 ory: Workshop Reg Pass
END:VEVENT
END:VCALENDAR