Efficient parallel nonnegative least squares on multicore architectures

SIAM Journal on Scientific Computing

Volumn 33, Issue 5, 2011, Pages 2848-2863

  Luo, Yuancheng ^a   Duraiswami, Ramani ^a  

^a University of Maryland ^*  (United States)

Author keywords

Active set; Deconvolution; Graphics processing unit; Multicore; Nonnegative least squares; Parallelism; QR updating

Indexed keywords

COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; ITERATIVE METHODS; MATRIX ALGEBRA; MEMORY ARCHITECTURE; PROGRAM PROCESSORS; SOFTWARE ARCHITECTURE;

ACTIVE SETS; DECONVOLUTIONS; ITERATIVE ALGORITHM; LEAST SQUARE PROBLEMS; MATRIX; MULTI-CORES; MULTICORE ARCHITECTURES; NONNEGATIVE LEAST SQUARES; PARALLELISM; QR UPDATING;

GRAPHICS PROCESSING UNIT;

EID: 81555213056     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/100799083     Document Type: Conference Paper

References (23)

1. S. Bellavia, M. Macconi, and B. Morini, An interior point Newton-like method for nonnegative least squares problems with degenerate solution, Numer. Linear Algebra Appl., 13 (2006), pp. 825-846. (Pubitemid 44951700)
2. M. H. van Benthem and M. R. Keenan, Fast algorithm for the solution of large-scale nonnegativity-constrained least squares problems, J. Chemometrics, 18 (2004), pp. 441-450. (Pubitemid 41327531)
3. A. Björck, Stability analysis of the method of semi-normal equations for least squares problems, Linear Algebra Appl., 88/89 (1987), pp. 31-48.
4. G. E. Blelloch, Prefix Sums and Their Applications, Technical report CMU-CS-90-190, Carnegie Mellon University, Pittsburgh, PA, 1990.
5. A. W. Bojanczyk, R. P. Brent, and F. R. de Hoog, QR factorization of Toeplitz matrices, Numer. Math., 49 (1986), pp. 81-94.
6. R. Bro and S. D. Jong, A fast non-negativity-constrained least squares algorithm, J. Chemometrics, 11 (1997), pp. 393-401. (Pubitemid 127478570)
7. M. Catral, L. Han, M. Neumann, and R. Plemmons, On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices, Linear Algebra Appl., 393 (2004), pp. 107-126.
8. R. H. Chan, J. G. Nagy, and R. J. Plemmons, FFT-based preconditioners for Toeplitz-block least squares problems, SIAM J. Numer. Anal., 30 (1993), pp. 1740-1768.
9. D. Chen and R. J. Plemmons, Nonnegativity constraints in numerical analysis, in Proceedings of the Symposium on the Birth of Numerical Analysis, A. Bultheel and R. Cools, eds., Leuven, Belgium, 2007, World Scientific Press, 2009.
10. V. Franc, V. Hlavc, and M. Navara, Sequential Coordinate-wise Algorithm for Non-negative Least Squares Problem, Research report CTU-CMP-2005-06, Center for Machine Perception, Czech Technical University, Prague, Czech Republic, 2005.
11. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996, pp. 223-236.
12. S. Hammarling and C. Lucas, Updating the QR factorization and the least squares problem, MIMS EPrint, Manchester Institute for Mathematical Sciences, University of Manchester, Manchester, UK, 2008.
13. M. Harris, Optimizing Parallel Reduction in CUDA, 2007.
14. Intel, Math Kernel Library Reference Manual, 2010.
15. A. Kerr, D. Campbell, and M. Richards, QR decomposition on GPUs, in GPGPU-2: Proceedings of the 2nd Workshop on General Purpose Processing on Graphics Processing Units, New York, ACM, 2009, pp. 71-78.
16. S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, An interior-point method for large-Scale l1-regularized least squares, IEEE J. Selected Topics Signal Process., 1 (2007), 606617.
17. D. Kim, S. Sra, and I. S. Dhillon, A New Projected Quasi-Newton Approach for the Nonnegative Least Squares Problem, Technical report TR-06-54, Computer Sciences, The University of Texas at Austin, TX, 2006.
18. H. W. Kuhn and A. W. Tucker, Nonlinear programming, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, 1951, pp. 481-492.
19. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
20. NVIDIA, CUDA Programming Guide 3.2, 2011.
21. NVIDIA, OpenCL Programming Guide for CUDA Architectures 3.1, 2010.
22. Sun Microsystems, Inc, OpenMP API User Guide, 2003.
23. V. Volkov and J. W. Demmel, Benchmarking GPUs to tune dense linear algebra, in Proceedings of the ACM/IEEE Conference on Spercomputing, 2008.