Blendenpik
From MaRDI portal
Software:21202
swMATH9210MaRDI QIDQ21202FDOQ21202
Author name not available (Why is that?)
Cited In (49)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- An Effective Method for Parameter Estimation with PDE Constraints with Multiple Right-Hand Sides
- Sketching for Principal Component Regression
- 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
- 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
- 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
- Randomized extended Kaczmarz for solving least squares
- Incremental regularized least squares for dimensionality reduction of large-scale data
- 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
- The fast Cauchy transform and faster robust linear regression
- Faster Kernel Ridge Regression Using Sketching and Preconditioning
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
- RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression
- A Practical Randomized CP Tensor Decomposition
- Randomized Algorithms for Matrices and Data
- A Fast Randomized Algorithm for Orthogonal Projection
- 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
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views
- Faster Subset Selection for Matrices and Applications
- Title not available (Why is that?)
- Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems
- Toward a unified theory of sparse dimensionality reduction in Euclidean space
- Randomized LU decomposition
- Compressed and Penalized Linear Regression
- Title not available (Why is that?)
- Semi-Infinite Linear Regression and Its Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Multiway Monte Carlo Method for Linear Systems
- Relations Among Some Low-Rank Subspace Recovery Models
- Title not available (Why is that?)
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Faster least squares approximation
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Simple backward error bounds for linear least-squares problems
- Fast and memory-optimal dimension reduction using Kac's walk
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
This page was built for software: Blendenpik