#### Filter Results:

- Full text PDF available (58)

#### Publication Year

1987

2017

- This year (1)
- Last 5 years (11)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are Coulombic or gravitationai in nature. For a system of N particles, an amount of work of the order O(N’) has traditionally been required to evaluate all pairwise interactions. unless some approximation or… (More)

- A. Dutt, Vladimir Rokhlin
- SIAM J. Scientific Computing
- 1993

Abstract. A group of algorithms is presented generalizing the fast Fourier transform to the case of noninteger frequencies and nonequispaced nodes on the interval [-r, r]. The schemes of this paper are based on a combination of certain analytical considerations with the classical fast Fourier transform and generalize both the forward and backward FFTs. Each… (More)

- Alok Duttf, Leslie Greengardf, Vladimir Rokhlin

- Bradley K. Alpert, Gregory Beylkin, Ronald R. Coifman, Vladimir Rokhlin
- SIAM J. Scientific Computing
- 1993

A class of vector-space bases is introduced for the sparse representation of discretizations of integral operators. An operator with a smooth, nonoscillatory kernel possessing a finite number of singularities in each row or column is represented in these bases as a sparse matrix, to high precision. A method is presented that employs these bases for the… (More)

- Bradley K. Alpert, Vladimir Rokhlin
- SIAM J. Scientific Computing
- 1991

- 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 rank-deficient approximation is at most a few digits (measured in the spectral norm, relative to the spectral norm of the matrix being approximated). In such… (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 value decompositions of numerically low-rank matrices. Being probabilistic, the schemes described here have a finite probability of failure; in most cases, this… (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 to each column of A, where l is an integer near to, but greater than, k. The structure of R allows us to apply it to an arbitrary m× 1 vector at a cost… (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 epsilon, the procedure computes an n x 1 vector x such that x minimizes the Euclidean norm ||Ax - b || to relative precision epsilon. The algorithm typically… (More)

- Hongwei Cheng, William Y. Crutchfield, +6 authors Junsheng Zhao
- J. Comput. Physics
- 2006

We describe a wideband version of the Fast Multipole Method for the Helmholtz equation in three dimensions. It unifies previously existing versions of the FMM for high and low frequencies into an algorithm which is accurate and efficient for any frequency, having a CPU time of O(N) if low-frequency computations dominate, or O(N logN) if high-frequency… (More)