Pages that link to "Item:Q952399"

The following pages link to A fast randomized algorithm for the approximation of matrices (Q952399):

Displaying 50 items.

• An \(O(N)\) direct solver for integral equations on the plane (Q2512836) (← links)
• Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
• Randomized generalized singular value decomposition (Q2667344) (← links)
• Tikhonov regularization and randomized GSVD (Q2813331) (← links)
• Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data (Q2818256) (← links)
• On low rank approximation of linear operators in \(p\)-norms and some algorithms (Q2821088) (← links)
• Parallel randomized and matrix-free direct solvers for large structured dense linear systems (Q2830628) (← links)
• Improved matrix algorithms via the subsampled randomized Hadamard transform (Q2866237) (← links)
• Randomized algorithms for the low-rank approximation of matrices (Q3010073) (← links)
• Stochastic iterative projection methods for large linear systems (Q3068189) (← links)
• A fast randomized algorithm for overdetermined linear least-squares regression (Q3073999) (← links)
• Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme (Q3075261) (← links)
• IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM (Q3101550) (← links)
• Randomized Local Model Order Reduction (Q3174769) (← links)
• Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case (Q3460272) (← 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)
• Fast O(n) complexity algorithms for diagonal innovation matrices (Q3698157) (← links)
• Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems (Q4556022) (← links)
• (Q4558555) (← links)
• Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD (Q4584919) (← links)
• Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
• Literature survey on low rank approximation of matrices (Q4603753) (← links)
• (Q4633051) (← links)
• Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices (Q4644411) (← links)
• Using randomization to make recursive matrix algorithms practical (Q4948004) (← links)
• Randomized Sketching Algorithms for Low-Memory Dynamic Optimization (Q4989933) (← links)
• Matrix decompositions using sub-Gaussian random matrices (Q5006500) (← links)
• Sublinear Cost Low Rank Approximation via Subspace Sampling (Q5014667) (← links)
• Deterministic APSP, Orthogonal Vectors, and More (Q5028339) (← links)
• Low-Rank Tucker Approximation of a Tensor from Streaming Data (Q5037558) (← links)
• (Q5075778) (← links)
• Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation (Q5094223) (← links)
• RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression (Q5099418) (← links)
• Interpolative Decomposition Butterfly Factorization (Q5112543) (← links)
• Random Sampling and Efficient Algorithms for Multiscale PDEs (Q5132000) (← links)
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations (Q5137221) (← links)
• Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
• A Model Reduction Method for Multiscale Elliptic Pdes with Random Coefficients Using an Optimization Approach (Q5197631) (← links)
• Fast approximate truncated SVD (Q5227193) (← links)
• Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
• A randomized method for one‐step extrapolation in reverse time migration (Q5247884) (← links)
• Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
• Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
• Butterfly Factorization (Q5266241) (← links)
• Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra (Q5348329) (← links)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859) (← links)
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication (Q5470749) (← links)