Accessibility navigation


Strengths and limitations of stretching for least-squares problems with some dense rows

Scott, J. and Tuma, M. (2020) Strengths and limitations of stretching for least-squares problems with some dense rows. ACM Transactions on Mathematical Software (TOMS), 47 (1). pp. 1-25. ISSN 0098-3500

[img]
Preview
Text (Open Access) - Published Version
· Available under License Creative Commons Attribution.
· Please see our End User Agreement before downloading.

549kB
[img] Text - Accepted Version
· Restricted to Repository staff only

779kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1145/3412559

Abstract/Summary

We recently introduced a sparse stretching strategy for handling dense rows that can arise in large-scale linear least-squares problems and make such problems challenging to solve. Sparse stretching is designed to limit the amount of fill within the stretched normal matrix and hence within the subsequent Cholesky factorization. While preliminary results demonstrated that sparse stretching performs significantly better than standard stretching, it has a number of limitations. In this paper, we discuss and illustrate these limitations and propose new strategies that are designed to overcome them. Numerical experiments on problems arising from practical applications are used to demonstrate the effectiveness of these new ideas. We consider both direct and preconditioned iterative solvers.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
ID Code:91971
Publisher:ACM

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation