Computer Science

Colloquium Speaker, Dr.Laura Grigori, INRIA Paris — Rocquencourt, France

Title: “Increasing the scalability of dense and sparse linear algebra algorithms by avoiding communication”

Dr. Laura Grigori
INRIA Paris — Rocquencourt, France

When: April 30th, 2015, 3:10pm

Where: 1131 Kemper Hall

Host: Zhaojun Bai

The cost of moving data in an algorithm can surpass by several orders
of magnitude the cost of performing arithmetics, and this gap has been
steadily and exponentially growing over time. This talk will review
work performed in the recent years on a new class of algorithms for
numerical linear algebra that provably minimize communication. After
a brief overview of algorithms for direct methods of factorization,
the talk will focus on iterative methods and associated
preconditioners. Numerical results on matrices issued from different
applications as flow in porous media will outline the behavior of the
proposed methods.

Dr. Grigori received a Ph.D. in Computer Science (december 2001) from Université Henri Poincaré, France, INRIA Lorraine. After spending two years at UC Berkeley and LBNL as a postdoctoral researcher, she joined INRIA in january 2004. She was a member of Sage group at INRIA Rennes and Grand-Large group at INRIA Saclay – Ile de France and LRI, Paris 11 University. Since January 2013 She is leading Alpines, a joint group between INRIA Paris – Rocquencourt and J.L. Lions Laboratory, UPMC.

1131 Kemper Hall

Loading Map....