#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2005

2017

- This year (4)
- Last 5 years (12)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Edo Liberty, Franco Woolfe, Per-Gunnar Martinsson, Vladimir Rokhlin, Mark Tygert
- Proceedings of the National Academy of Sciencesâ€¦
- 2007

We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application (inter alia) to the evaluation of the singularâ€¦ (More)

- Vladimir Rokhlin, Arthur Szlam, Mark Tygert
- SIAM J. Matrix Analysis Applications
- 2009

Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of PCA, the best possible accuracy of anyâ€¦ (More)

We introduce a randomized procedure that, given an mÃ—n matrix A and a positive integer k, approximates A with a matrix Z of rank k. The algorithm relies on applying a structured lÃ—m random matrix Râ€¦ (More)

- Vladimir Rokhlin, Mark Tygert
- Proceedings of the National Academy of Sciencesâ€¦
- 2008

We introduce a randomized algorithm for overdetermined linear least-squares regression. Given an arbitrary full-rank m x n matrix A with m >/= n, any m x 1 vector b, and any positive real numberâ€¦ (More)

- Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnisky, Mark Tygert
- SIAM J. Scientific Computing
- 2011

Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy â€” even on parallel processors â€” unlike the classicalâ€¦ (More)

Article history: Received 9 April 2008 Revised 23 August 2009 Accepted 13 February 2010 Available online 19 February 2010 Communicated by Charles K. Chui

Given an m Ã— n matrix A and a positive integer k, we introduce a randomized procedure for the approximation of A with a matrix Z of rank k. The procedure relies on applying AT to a collection of lâ€¦ (More)

- Vladimir Rokhlin, Mark Tygert
- SIAM J. Scientific Computing
- 2011

We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as theâ€¦ (More)

- Vladimir Rokhlin, Mark Tygert
- SIAM J. Scientific Computing
- 2006

An algorithm is introduced for the rapid evaluation at appropriately chosen nodes on the two-dimensional sphere S2 in R3 of functions specified by their spherical harmonic expansions (known as theâ€¦ (More)

- Mark Tygert
- J. Comput. Physics
- 2010

We accelerate the computation of spherical harmonic transforms, using what is known as the butterfly scheme. This provides a convenient alternative to the approach taken in the second paper from thisâ€¦ (More)