Blendenpik: Supercharging LAPACK's Least-Squares Solver
From MaRDI portal
Publication:3168789
DOI10.1137/090767911zbMath1213.65069OpenAlexW2008776938MaRDI QIDQ3168789
Haim Avron, Petar Maymounkov, Sivan Toledo
Publication date: 19 April 2011
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/60954
algorithmsnumerical examplesQR factorizationrandomized numerical linear algebradense linear least squaresrandomized preconditioners
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Packaged methods for numerical algorithms (65Y15) Probabilistic methods, stochastic differential equations (65C99)
Related Items (58)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Unnamed Item ⋮ Semi-Infinite Linear Regression and Its Applications ⋮ Simple backward error bounds for linear least-squares problems ⋮ Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument ⋮ RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ Zeroth-order optimization with orthogonal random directions ⋮ M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions ⋮ Randomized LU decomposition ⋮ Model constraints independent optimal subsampling probabilities for softmax regression ⋮ Faster least squares approximation ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Fast randomized numerical rank estimation for numerically low-rank matrices ⋮ Subsampling in longitudinal models ⋮ Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory ⋮ Randomized Nyström Preconditioning ⋮ XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation ⋮ Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization ⋮ Paved with good intentions: analysis of a randomized block Kaczmarz method ⋮ Sketching for Principal Component Regression ⋮ Relations Among Some Low-Rank Subspace Recovery Models ⋮ The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform ⋮ Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ A Practical Randomized CP Tensor Decomposition ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ Unnamed Item ⋮ The nonequilibrium quantum many-body problem as a paradigm for extreme data science ⋮ Unnamed Item ⋮ On spectral and numerical properties of random butterfly matrices ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views ⋮ Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms ⋮ Low-rank-modified Galerkin methods for the Lyapunov equation ⋮ Fast and forward stable randomized algorithms for linear least-squares problems ⋮ A review on design inspired subsampling for big data ⋮ Fast and accurate randomized algorithms for linear systems and eigenvalue problems ⋮ Optimization of random feature method in the high-precision regime ⋮ \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores ⋮ Leveraging for big data regression ⋮ Stochastic boundary methods of fundamental solutions for solving PDEs ⋮ Incremental Regularized Least Squares for Dimensionality Reduction of Large-Scale Data ⋮ SketchySGD: reliable stochastic optimization via randomized curvature estimates ⋮ The Fast Cauchy Transform and Faster Robust Linear Regression ⋮ Tikhonov Regularization and Randomized GSVD ⋮ Compressed and Penalized Linear Regression ⋮ Randomized core reduction for discrete ill-posed problem ⋮ Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations ⋮ Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems ⋮ Multiway Monte Carlo Method for Linear Systems ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ Sampled limited memory methods for massive linear inverse problems ⋮ Fast and memory-optimal dimension reduction using Kac's walk ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Unnamed Item
Uses Software
This page was built for publication: Blendenpik: Supercharging LAPACK's Least-Squares Solver
