BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000630Z
LOCATION:401-402
DTSTART;TZID=America/Denver:20231116T103000
DTEND;TZID=America/Denver:20231116T120000
UID:submissions.supercomputing.org_SC23_sess158@linklings.com
SUMMARY:Linear Algebra II
DESCRIPTION:ReFloat: Low-Cost Floating-Point Processing in ReRAM for Accel
 erating Iterative Linear Solvers\n\nResistive random access memory (ReRAM)
  is a promising technology that can perform low-cost and in-situ matrix-ve
 ctor multiplication (MVM) in analog domain. Scientific computing requires 
 high-precision floating-point (FP) processing. However, performing floatin
 g-point computation in ReRAM is challeng...\n\n\nLinghao Song (University 
 of California Los Angeles (UCLA)), Fan Chen (Indiana University), and Hai 
 Li and Yiran Chen (Duke University)\n---------------------\nDASP: Specific
  Dense Matrix Multiply-Accumulate Units Accelerated General Sparse Matrix-
 Vector Multiplication\n\nSparse matrix-vector multiplication (SpMV) plays 
 a key role in computational science and engineering, graph processing and 
 machine learning applications. Much SpMV work was devoted to resolving pro
 blems such as random access to vector x and unbalanced load. However, we h
 ave experimentally found that...\n\n\nYuechen Lu and Weifeng Liu (China Un
 iversity of Petroleum, Beijing)\n---------------------\nHigh-Performance S
 VD Partial Spectrum Computation\n\nWe introduce a new singular value decom
 position (SVD) solver based on the QR-based Dynamically Weighted Halley (Q
 DWH) algorithm for computing the partial spectrum SVD (QDWHpartial-SVD) pr
 oblems. By optimizing the rational function underlying the algorithms only
  in the desired part of the spectrum, Q...\n\n\nDavid Keyes and Hatem Ltai
 ef (King Abdullah University of Science and Technology (KAUST)); Yuji Naka
 tsukasa (Mathematical Institute University of Oxford); and Dalal Sukkari (
 University of Tennessee, Innovative Computing Laboratory (ICL))\n\nTag: Al
 gorithms, Linear Algebra, Post-Moore Computing\n\nRegistration Category: T
 ech Program Reg Pass\n\nReproducibility Badges: Artifact Available, Artifa
 ct Functional, Results Reproduced\n\nSession Chair: Julien Langou (Univers
 ity of Colorado Denver; University of Colorado, Department of Mathematical
  and Statistical Sciences)
END:VEVENT
END:VCALENDAR