Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods

Scott, J. ORCID: https://orcid.org/0000-0003-2130-1091 and Tuma, M. (2017) Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods. SIAM Journal on Scientific Computing, 39 (6). A2422-A2437. ISSN 1095-7197 doi: 10.1137/16M1108339

Abstract/Summary

The efficient solution of large linear least-squares problems in which the system matrix A contains rows with very different densities is challenging. Previous work has focused on direct methods for problems in which A has a few relatively dense rows. These rows are initially ignored, a factorization of the sparse part is computed using a sparse direct solver, and then the solution is updated to take account of the omitted dense rows. In some practical applications the number of dense rows can be significant and for very large problems, using a direct solver may not be feasible. We propose processing rows that are identified as dense separately within a conjugate gradient method using an incomplete factorization preconditioner combined with the factorization of a dense matrix of size equal to the number of dense rows. Numerical experiments on large-scale problems from real applications are used to illustrate the effectiveness of our approach. The results demonstrate that we can efficiently solve problems that could not be solved by a preconditioned conjugate gradient method without exploiting the dense rows.

Item Type	Article
URI	https://reading-clone.eprints-hosting.org/id/eprint/72066
Item Type	Article
Refereed	Yes
Divisions	Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Publisher	Society for Industrial and Applied Mathematics
Download/View statistics	View download statistics for this item