Blendenpik: Supercharging LAPACK's Least-Squares Solver
From MaRDI portal
Publication:3168789
DOI10.1137/090767911zbMath1213.65069MaRDI 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
algorithms; numerical examples; QR factorization; randomized numerical linear algebra; dense linear least squares; randomized preconditioners
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65Y15: Packaged methods for numerical algorithms
65C99: Probabilistic methods, stochastic differential equations
Related Items
Unnamed Item, Unnamed Item, Faster Kernel Ridge Regression Using Sketching and Preconditioning, A Practical Randomized CP Tensor Decomposition, Unnamed Item, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Sampled limited memory methods for massive linear inverse problems, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Unnamed Item, Semi-Infinite Linear Regression and Its Applications, RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression, Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, The nonequilibrium quantum many-body problem as a paradigm for extreme data science, Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views, Multiway Monte Carlo Method for Linear Systems, Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds, Sketching for Principal Component Regression, Relations Among Some Low-Rank Subspace Recovery Models, Randomized numerical linear algebra: Foundations and algorithms, Zeroth-order optimization with orthogonal random directions, M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions, Model constraints independent optimal subsampling probabilities for softmax regression, Subsampling in longitudinal models, Randomized Nyström Preconditioning, Simple backward error bounds for linear least-squares problems, Toward a unified theory of sparse dimensionality reduction in Euclidean space, Faster least squares approximation, Randomized LU decomposition, Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm, Fast randomized matrix and tensor interpolative decomposition using countsketch, Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms, Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems, Fast and memory-optimal dimension reduction using Kac's walk, Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument, The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform, On spectral and numerical properties of random butterfly matrices, 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, Paved with good intentions: analysis of a randomized block Kaczmarz method, Stochastic boundary methods of fundamental solutions for solving PDEs, Incremental Regularized Least Squares for Dimensionality Reduction of Large-Scale Data, The Fast Cauchy Transform and Faster Robust Linear Regression, Tikhonov Regularization and Randomized GSVD, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, Compressed and Penalized Linear Regression
Uses Software
