BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160555Z
LOCATION:Track 8
DTSTART;TZID=America/New_York:20201112T152000
DTEND;TZID=America/New_York:20201112T154500
UID:submissions.supercomputing.org_SC20_sess214_ws_lasalss108@linklings.co
 m
SUMMARY:Replacing Pivoting in Distributed Gaussian Elimination with Random
 ized Techniques
DESCRIPTION:Workshop\n\nReplacing Pivoting in Distributed Gaussian Elimina
 tion with Randomized Techniques\n\nLindquist, Luszczek, Dongarra\n\nGaussi
 an elimination is a key technique for solving\ndense, non-symmetric system
 s of linear equations. Pivoting is\nused to ensure numerical stability but
  can introduce significant\noverheads. We propose replacing pivoting with 
 recursive butterfly\ntransforms (RBTs) and iterative refinement. RBTs use\
 nan FFT-like structure and randomized elements to provide an\nefficient, t
 wo-sided preconditioner for factoring. This approach\nwas implemented and 
 tested using Software for Linear Algebra\nTargeting Exascale (SLATE). In n
 umerical experiments, our\nimplementation was more robust than Gaussian el
 imination with\nno pivoting (GENP), although failed to solve all the probl
 ems\nsolvable with Gaussian elimination with partial pivoting (GEPP).\nFur
 thermore, the proposed solver was able to outperform GEPP\nwhen distribute
 d on heterogeneous nodes.\n\nTag: Algorithms, Extreme Scale Computing, Per
 formance/Productivity Measurement and Evaluation, Scalable Computing, Scie
 ntific Computing\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR