Fall 2017

Uniform Sampling and Inverse Maintenance

Monday, Nov. 27, 2017 1:30 pm2:00 pm PST

Add to Calendar

As we all know, Michael has read the proof from the book and gave out some proofs to us from time to time. In this talk, I will describe two of his proofs, one proof is about an input sparsity algorithm for Ax=b by uniform sampling. Another proof is about how to solve a sequence of slowly changing linear systems faster.