naa a22 4500 510809065 CHVBK 20180411083433.0 cr unu---uuuuu 180411e20130901xx s 000 0 eng 10.1007/s12532-013-0056-5 doi (NATIONALLICENCE)springer-10.1007/s12532-013-0056-5 GPU accelerated greedy algorithms for compressed sensing [Elektronische Daten] [Jeffrey Blanchard, Jared Tanner] For appropriate matrix ensembles, greedy algorithms have proven to be an efficient means of solving the combinatorial optimization problem associated with compressed sensing. This paper describes an implementation for graphics processing units (GPU) of hard thresholding, iterative hard thresholding, normalized iterative hard thresholding, hard thresholding pursuit, and a two-stage thresholding algorithm based on compressive sampling matching pursuit and subspace pursuit. The GPU acceleration of the former bottleneck, namely the matrix-vector multiplications, transfers a significant portion of the computational burden to the identification of the support set. The software solves high-dimensional problems in fractions of a second which permits large-scale testing at dimensions currently unavailable in the literature. The GPU implementations exhibit up to 70 $$\times $$ × acceleration over standard Matlab central processing unit implementations using automatic multi-threading. Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society, 2013 Combinatorial optimization nationallicence Compressed sensing nationallicence Sparse approximation nationallicence Greedy algorithms nationallicence Graphics processing units nationallicence Parallel computing nationallicence IHT nationallicence NIHT nationallicence HTP nationallicence CoSaMP nationallicence Subspace pursuit nationallicence Blanchard Jeffrey Department of Mathematics and Statistics, Grinnell College, 50112, Grinnell, IA, USA aut Tanner Jared Mathematics Institute, University of Oxford, OX1 3LB, Oxford, UK aut Mathematical Programming Computation Springer Berlin Heidelberg 5/3(2013-09-01), 267-304 1867-2949 5:3<267 2013 5 12532 https://doi.org/10.1007/s12532-013-0056-5 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s12532-013-0056-5 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Blanchard Jeffrey Department of Mathematics and Statistics, Grinnell College, 50112, Grinnell, IA, USA aut NATIONALLICENCE 700 1- Tanner Jared Mathematics Institute, University of Oxford, OX1 3LB, Oxford, UK aut NATIONALLICENCE 773 0- Mathematical Programming Computation Springer Berlin Heidelberg 5/3(2013-09-01), 267-304 1867-2949 5:3<267 2013 5 12532 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer