Society for Industrial and Applied Mathematics

By C. Chow, Julian Cole Lectureship. 2010

476 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition (2011, unknown): “In the solve phase we use the Full Approximation Scheme (FAS) [7, 10, 13, 40] to efficiently obtain an accurate solution.”
N on-linear evolution of f(R) cosm ologies II:power spectrum (2008, result): “For comparison we also show the fit of Smith et al. [36], which scales the linear theory predictions (also shown) into the non-linear regime.”
Implementing sparse matrix-vector multiplication on throughput-oriented processors (2009, methodology): “The remaining part of these iterative methods (e.g., the conjugate gradient method [19]), typically reduce to dense linear algebra operations that are readily handled by optimized BLAS [14] and LAPACK [1] implementations.”
Iterative Bregman Projections for Regularized Transportation Problems (2014, background): “…is constant and the two measures have the same number N of Dirac masses, this problem reduces to an optimal matching problem, for which dedicated discrete optimization methods exist [17], that roughly have O ( N 3 ) complexity, which is still computationally too demanding for most applications.”