most recent 30 from http://mathoverflow.net 2013-06-18T23:19:59Z http://mathoverflow.net/feeds/user/3756 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/37161/random-products-of-projections-bounds-on-convergence-rate/106913#106913 zouzias 2012-09-11T13:54:07Z 2012-09-11T13:54:07Z

<p>Following Suvrit's post, you can also take a look at <a href="http://arxiv.org/abs/1205.5770" rel="nofollow">http://arxiv.org/abs/1205.5770</a> (Algorithm 3). It handles the case where the set of projectors have co-dimension one.</p> <p>By the way, thanks for the links Martin.</p>

http://mathoverflow.net/questions/77434/convergence-speed-of-jacobi-eigenvalue-algorithm-for-parallel-orderingbrent-luk/79391#79391 zouzias 2011-10-28T14:42:47Z 2011-10-28T14:42:47Z

<p>Here is a link to the paper that you are referring to</p> <p><a href="http://epubs.siam.org/sima/resource/1/sjmael/v16/i4/p1197_s1" rel="nofollow">http://epubs.siam.org/sima/resource/1/sjmael/v16/i4/p1197_s1</a></p> <p>Of course, you should have access to SIAM or buy the article.</p> <p>Best,</p>

http://mathoverflow.net/questions/12394/representability-of-finite-metric-spaces/13984#13984 zouzias 2010-02-03T15:36:30Z 2010-02-03T15:36:30Z

<p>For Question 0 :</p> <p>For isometric embedding a standard reference is </p> <p>Deza, M.; Laurent, M. (1997), Geometry of cuts and metrics, Algorithms and Combinatorics, 15, Springer, MR1460488, ISBN 354061611X </p> <p>For approximate embeddings a beautiful exposition from Matouseks' book:</p> <p>Lectures on Discrete Geometry. Jiri Matousek. Year of Publication: 2002. ISBN:0387953744</p>