Pages that link to "Item:Q93618"

The following pages link to Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions (Q93618):

Displaying 50 items.

• Taylor approximation and variance reduction for PDE-constrained optimal control under uncertainty (Q2214671) (← links)
• Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach (Q2217423) (← links)
• A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? (Q2220600) (← links)
• Adaptive dimension reduction to accelerate infinite-dimensional geometric Markov chain Monte Carlo (Q2221416) (← 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)
• Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems (Q2226293) (← links)
• Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
• An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. I: Fundamentals (Q2230582) (← links)
• Effective implementation to reduce execution time of a low-rank matrix approximation problem (Q2231284) (← links)
• Reduced rank regression with matrix projections for high-dimensional multivariate linear regression model (Q2233570) (← links)
• On the convergence of Krylov methods with low-rank truncations (Q2234488) (← links)
• Hierarchical matrix approximations for space-fractional diffusion equations (Q2236145) (← links)
• Domain-decomposition least-squares Petrov-Galerkin (DD-LSPG) nonlinear model reduction (Q2237492) (← links)
• Reduced order modelling of nonlinear cross-diffusion systems (Q2242711) (← links)
• Matrix recipes for hard thresholding methods (Q2251217) (← links)
• Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes (Q2259812) (← links)
• A randomized method for solving discrete ill-posed problems (Q2263217) (← links)
• On spectral and numerical properties of random butterfly matrices (Q2274705) (← links)
• Distributed estimation of principal eigenspaces (Q2284361) (← links)
• A randomized balanced proper orthogonal decomposition technique (Q2292020) (← links)
• A cross-product approach for low-rank approximations of large matrices (Q2293619) (← links)
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
• A fast neural network learning algorithm with approximate singular value decomposition (Q2299166) (← links)
• Perspectives on CUR decompositions (Q2300772) (← links)
• Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
• Randomized linear algebra for model reduction. I. Galerkin methods and error estimation (Q2305558) (← links)
• Single-pass randomized algorithms for LU decomposition (Q2306297) (← links)
• Low rank tensor methods in Galerkin-based isogeometric analysis (Q2309006) (← links)
• Randomized core reduction for discrete ill-posed problem (Q2309262) (← links)
• Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches (Q2310028) (← links)
• Hessian-based adaptive sparse quadrature for infinite-dimensional Bayesian inverse problems (Q2310097) (← links)
• Matrix completion for cost reduction in finite element simulations under hybrid uncertainties (Q2310529) (← links)
• ALORA: affine low-rank approximations (Q2312001) (← links)
• Detecting localized eigenstates of linear operators (Q2319765) (← links)
• A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems (Q2321349) (← links)
• Enabling numerically exact local solver for waveform inversion -- a low-rank approach (Q2321974) (← links)
• Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) (← links)
• Small-deviation inequalities for sums of random matrices (Q2338012) (← links)
• A class of Laplacian multiwavelets bases for high-dimensional data (Q2343249) (← links)
• Randomized algorithms for low-rank matrix factorizations: sharp performance bounds (Q2345951) (← links)
• On the de-randomization of space-bounded approximate counting problems (Q2348703) (← links)
• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation (Q2350005) (← links)
• A high-order accurate accelerated direct solver for acoustic scattering from surfaces (Q2350719) (← links)
• Robust computation of linear models by convex relaxation (Q2351804) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Numerically safe Gaussian elimination with no pivoting (Q2359570) (← links)
• Multi-dimensional functional principal component analysis (Q2361466) (← links)
• Efficient algorithms for CUR and interpolative matrix decompositions (Q2363512) (← links)
• Effective matrix-free preconditioning for the augmented immersed interface method (Q2374867) (← links)