Blendenpik

swMATH9210MaRDI QIDQ21202FDOQ21202

Author name not available (Why is that?)

Cited In (47)

• Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
• Fast approximation of matrix coherence and statistical leverage
• Estimating Leverage Scores via Rank Revealing Methods and Randomization
• Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches
• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
• Randomized core reduction for discrete ill-posed problem
• Stochastic boundary methods of fundamental solutions for solving PDEs
• Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm
• Sampled limited memory methods for massive linear inverse problems
• Randomized numerical linear algebra: Foundations and algorithms
• A statistical perspective on algorithmic leveraging
• Randomized extended Kaczmarz for solving least squares
• Weighted SGD for \(\ell_p\) regression with randomized preconditioning
• Multiway Monte Carlo method for linear systems
• Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
• Relations among some low-rank subspace recovery models
• A fast randomized algorithm for orthogonal projection
• Incremental regularized least squares for dimensionality reduction of large-scale data
• More efficient estimation for logistic regression with optimal subsamples
• Stochastic reformulations of linear systems: algorithms and convergence theory
• Fast randomized matrix and tensor interpolative decomposition using countsketch
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
• Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms
• Sketching for principal component regression
• An effective method for parameter estimation with PDE constraints with multiple right-hand sides
• The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
• Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
• A Practical Randomized CP Tensor Decomposition
• Randomized Algorithms for Matrices and Data
• On spectral and numerical properties of random butterfly matrices
• Blendenpik: Supercharging LAPACK's Least-Squares Solver
• Tikhonov regularization and randomized GSVD
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
• Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
• Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems
• Randomized LU decomposition
• Compressed and Penalized Linear Regression
• Title not available (Why is that?)
• Semi-Infinite Linear Regression and Its Applications
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• RidgeSketch: a fast sketching based solver for large scale ridge regression
• Faster kernel ridge regression using sketching and preconditioning
• Faster least squares approximation
• LSRN: A parallel iterative solver for strongly over- or underdetermined systems
• Simple backward error bounds for linear least-squares problems
• Faster subset selection for matrices and applications
• Fast and memory-optimal dimension reduction using Kac's walk

This page was built for software: Blendenpik