Pages that link to "Item:Q5470749"

The following pages link to Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication (Q5470749):

Displaying 50 items.

• Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices (Q391804) (← links)
• Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation (Q413911) (← links)
• Faster least squares approximation (Q623334) (← links)
• Projected Landweber iteration for matrix completion (Q708281) (← links)
• Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
• A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
• Model order reduction with oblique projections for large scale wave propagation (Q891290) (← links)
• The Mailman algorithm: a note on matrix-vector multiplication (Q976066) (← links)
• Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space (Q976221) (← links)
• Random matrices: The distribution of the smallest singular values (Q987365) (← links)
• Algorithms and applications for approximate nonnegative matrix factorization (Q1020797) (← links)
• Storing matrices on disk for efficient row and column retrieval (Q1064062) (← links)
• Optimal projection of observations in a Bayesian setting (Q1662871) (← links)
• Pseudo-skeleton approximations with better accuracy estimates (Q1675666) (← links)
• Sub-sampled Newton methods (Q1739039) (← links)
• A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905) (← links)
• Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification (Q2026637) (← links)
• Randomized signal processing with continuous frames (Q2066256) (← links)
• Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching (Q2108486) (← links)
• Subdata selection algorithm for linear model discrimination (Q2110346) (← links)
• Functional principal subspace sampling for large scale functional data analysis (Q2137809) (← links)
• A sketched finite element method for elliptic models (Q2180458) (← links)
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
• An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486) (← links)
• Random batch methods (RBM) for interacting particle systems (Q2222655) (← links)
• A Monte Carlo method for computing the action of a matrix exponential on a vector (Q2286060) (← links)
• Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
• Structural conditions for projection-cost preservation via randomized matrix multiplication (Q2419040) (← links)
• Optimal subsampling for softmax regression (Q2423180) (← links)
• A way for low ranking matrices and its stochastic computations using Monte Carlo method (Q2509434) (← links)
• Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
• A randomized approach to sensor placement with observability assurance (Q2662304) (← links)
• ASKIT: an efficient, parallel library for high-dimensional kernel summations (Q2830640) (← links)
• A nonconvex approach to low-rank matrix completion using convex optimization (Q2955982) (← links)
• Deterministic algorithms for skewed matrix products (Q2957908) (← links)
• Optimal CUR Matrix Decompositions (Q2968164) (← links)
• Stochastic iterative projection methods for large linear systems (Q3068189) (← links)
• Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme (Q3075261) (← links)
• Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
• New hybrid Monte Carlo methods and computing the dominant generalized eigenvalue (Q3101642) (← links)
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
• Fast algorithm for the multiplication of a row vector by a randomly selected matrix<i>A</i> (Q3560579) (← links)
• A Fast Random Sampling Algorithm for Sparsifying Matrices (Q3595390) (← links)
• Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439) (← links)
• Fast algorithms for Brownian matrices (Q3678635) (← links)
• (Q4558476) (← links)
• (Q4558555) (← links)
• Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• (Q4633019) (← links)