- M. Arioli and I S. Duff. 2015. Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix. SIAM J. Scientific Computing 37, 5 (2015), S544--S561.Google ScholarDigital Library
- M. Benzi and M. Tuma. 2003. A robust incomplete factorization preconditioner for positive definite matrices. Numerical Linear Algebra with Applications 10 (2003), 385--400.Google ScholarCross Ref
- Å. Björck. 1996. Numerical Methods for Least Squares Problems. SIAM, Philadelphia.Google Scholar
- A. Björck and I. S. Duff. 1980. A direct method for the solution of sparse linear least squares problems. Linear Algebra Appl. 34 (1980), 43--67.Google ScholarCross Ref
- A. Björck and J.Y. Yuan. 1999. Preconditioners for Least Squares Problems by LU Factorization. Electronic Transactions on Numerical Analysis 8 (1999), 26--35.Google Scholar
- T. Davis. 2006. Direct Methods for Sparse Linear Systems. SIAM, Philadelphia. Google ScholarDigital Library
- T. A. Davis. 2016. UMFPACK User Guide. http://www.suitesparse.com. (2016). Version 5.7.6.Google Scholar
- A. George and E. Ng. 1983. On Row and Column Orderings for Sparse Least Squares Problems. SIAM, J. Numer. Anal. 20 (1983), 326--344.Google ScholarDigital Library
- J.R. Gilbert. 1994. Predicting Structure in Sparse Matrix Computations. SIAM, J. Matrix Anal. Appl. 15 (1994), 62--79. Google ScholarDigital Library
- J.R Gilbert and E.G. Ng. 1993. Predicting structure in nonsymmetric sparse matrix factorizatons. In Graph Theory and Sparse Matrix Computations, IMA Vol. Math. Appl. Sringer Verlag, New York, 107--139.Google Scholar
- G. H. Golub and C. F. Van Loan. 1996. Matrix Computations. The Johns Hopkins University Press, Baltimore. Third edition.Google ScholarDigital Library
- N. Gould and J. Scott. 2017. The state-of-the-art of preconditioners for sparse linear least-squares problems. ACM Trans. Math. Software 43, 4 (2017), 36:1--36:35. Google ScholarDigital Library
- P. C. Hansen, V. Pereyra, and G. Scherer. 2013. Least Squares Data Fitting with Applications. The Johns Hopkins University Press, Baltimore.Google Scholar
- G. W. Howell and M. Baboulin. 2015. LU Preconditioning for Overdetermined Sparse Least Squares Problems. In Parallel Processing and Applied Mathematics -11th International Conference, PPAM 2015, Krakow, Poland, September 6-9, 2015. Revised Selected Papers, Part I. Springer, Heidelberg, 128--137.Google Scholar
- S. Karpinski J. Bezanson, A. Edelman and V. B. Shah. 2017. Julia: A Fresh Approach to Numerical Computing. SIAM Rev. 59 (2017), 65--98.Google ScholarDigital Library
- X. S. Li. 2005. An overview of SuperLU: Algorithms, implementation, and user interface. ACM Trans. Math. Software 31, 3 (2005), 302--325. Google ScholarDigital Library
- X. S. Li and J. W. Demmel. 2003. SuperLU_DIST: a Scalable Distributed-Memory Sparse Direct Solver for Unsymmetric Linear Systems. ACM Trans. Math. Software 29, 9 (2003), 110--140. Google ScholarDigital Library
- D. Orban. 2017. Private communication. (2017).Google Scholar
- J.-Y. L'Excellent P. R. Amestoy, A. Guermouche and S. Pralet. 2006. Hybrid scheduling for the parallel solution of linear systems. Parallel Comput. 32, 2 (2006), 136--156. Google ScholarDigital Library
- C. Paige and M. Saunders. 1982. An Algorithm for Sparse Linear Equations and Sparse Least Squares. ACM Trans. on Math. Software 8, 1 (1982), 43--71. Google ScholarDigital Library
- G. Peters and J. H. Wilkinson. 1970. The least squares problem and pseudo-inverses. Computing J. 13 (1970), 309--316.Google ScholarCross Ref
- O. Schenk and K. Gärtner. 2014. PARDISO User Guide. http://www.pardiso-project.org/manual/manual.pdf. (2014).Google Scholar
- J. Scott and M. Tuma. 2016. Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations. SIAM J. Scientific Computing 38, 6 (2016), C603--C623.Google ScholarDigital Library
- G. W. Stewart. 1998. Matrix Algorithms - Volume I: Basic Decompositions. SIAM, Philadelphia.Google Scholar
Index Terms
- Iterative Solution of Sparse Linear Least Squares using LU Factorization
Recommendations
Hierarchical Orthogonal Factorization: Sparse Least Squares Problems
AbstractIn this work, we develop a fast hierarchical solver for solving large, sparse least squares problems. We build upon the algorithm, spaQR (sparsified QR Gnanasekaran and Darve in SIAM J Matrix Anal Appl 43(1):94–123, 2022), that was developed by ...
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
† Special Section: 2010 Copper Mountain ConferenceAn iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problems $\min \|Ax-b\|_2$, with $A$ being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically ...
Comments