BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260514T143127
DTSTART;TZID=America/Detroit:20260529T110000
DTEND;TZID=America/Detroit:20260529T120000
SUMMARY:Workshop / Seminar:MICDE - ME seminar: Phani Motamarri\, Indian Institute of Science\, Bangalore
DESCRIPTION:Abstract:\nModern computing architectures increasingly rely on iterative solvers that employ reduced-precision computation and communication-reduction techniques to lower time-to-solution and improve scalability. However\, eigensolvers in scientific simulations have struggled to exploit such approximations without compromising accuracy.  We present an eigensolver R-ChFSI\, a residual-based reformulation of Chebyshev Filtered Subspace Iteration (ChFSI) provably tolerant to inexact matrix–vector products. By expressing the Chebyshev recurrence in terms of residuals rather than eigenvector estimates\, R-ChFSI naturally accommodates multiple sources of approximation\, including reduced-precision arithmetic (FP32 and TF32) in the filtering step\, lossy compression with compression ratios exceeding 4x for inter-process communication\, and approximate inverses for generalized eigenproblems\, while preserving eigensolver robustness. Large-scale experiments on GPU accelerators are conducted using finite-element discretized generalized eigenproblems arising in Kohn–Sham density functional theory for quantum modeling of materials. The results demonstrate that R-ChFSI achieves eigen-residual norms orders of magnitude smaller than standard ChFSI under comparable inexactness\, while delivering substantial performance gains. This work provides a practical pathway toward approximation-tolerant eigensolvers enabling accurate and scalable simulations on modern computing architectures.\n\nBio:\nPhani Motamarri is an Assistant Professor in the Department of Computational and Data Sciences at the Indian Institute of Science\, Bengaluru\, where he leads the MATRIX Lab. He is an alumnus of the University of Michigan–Ann Arbor\, where he earned his PhD in Mechanical Engineering.\nHis research lies at the intersection of computational mechanics\, materials science\, numerical analysis\, and high-performance computing. His work focuses on developing mathematical techniques and hardware-aware algorithms for quantum modeling of materials\, with applications to structural and functional materials and multiscale modeling methodologies. He is also interested in machine learning frameworks for accelerating materials discovery and quantum computing\, particularly in the context of quantum-centric supercomputing.\n\nMotamarri’s research contributions include advances in finite-element methods\, numerical analysis\, and large-scale scientific software development. He is one of the lead developers of DFT-FE\, an open-source\, massively parallel finite-element code for density functional theory calculations. He received the ACM Gordon Bell Prize in 2023 and was a finalist for the ACM Gordon Bell Prize in 2019.
UID:148283-21903800@events.umich.edu
URL:https://events.umich.edu/event/148283
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:College Of Engineering,Computational Science,Engineering,Graduate Students,Mechanical Engineering,Micde,Micde Seminar,Michigan Engineering
LOCATION:Electrical Engineering and Computer Science Building - 1311
CONTACT:
END:VEVENT
END:VCALENDAR