Hierarchical Orthogonal Factorization: Sparse Least Squares Problems

by   Abeynaya Gnanasekaran, et al.

In this work, we develop a fast hierarchical solver for solving large, sparse least squares problems. We build upon the algorithm, spaQR (sparsified QR), that was developed by the authors to solve large sparse linear systems. Our algorithm is built on top of a Nested Dissection based multifrontal QR approach. We use low-rank approximations on the frontal matrices to sparsify the vertex separators at every level in the elimination tree. Using a two-step sparsification scheme, we reduce the number of columns and maintain the ratio of rows to columns in each front without introducing any additional fill-in. With this improvised scheme, we show that the runtime of the algorithm scales as 𝒪(M log N) and uses 𝒪(M) memory to store the factorization. This is achieved at the expense of a small and controllable approximation error. The end result is an approximate factorization of the matrix stored as a sequence of sparse orthogonal and upper-triangular factors and hence easy to apply/solve with a vector. Finally, we compare the performance of the spaQR algorithm in solving sparse least squares problems with direct multifrontal QR and CGLS iterative method with a standard diagonal preconditioner.


page 1

page 2

page 3

page 4


Hierarchical Orthogonal Factorization: Sparse Square matrices

In this work, we develop a new fast algorithm, spaQR – sparsified QR, fo...

Robust and Practical Solution of Laplacian Equations by Approximate Elimination

We introduce a new algorithm and software for solving linear equations i...

Second Order Accurate Hierarchical Approximate Factorization of Sparse SPD Matrices

We describe a second-order accurate approach to sparsifying the off-diag...

Sparse Linear Regression via Generalized Orthogonal Least-Squares

Sparse linear regression, which entails finding a sparse solution to an ...

U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology

Persistent homology is a leading tool in topological data analysis (TDA)...

Algebraic Inverse Fast Multipole Method: A fast direct solver that is better than HODLR based fast direct solver

This article presents a fast direct solver, termed Algebraic Inverse Fas...

Solving the k-sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algori...

Please sign up or login with your details

Forgot password? Click here to reset