Analysis of the Self Projected Matching Pursuit Algorithm


The convergence and numerical analysis of a low memory implementation of the Orthogonal Matching Pursuit greedy strategy, which is termed Self Projected Matching Pursuit, is presented. This approach renders an iterative way of solving the least squares problem with much less storage requirement than direct linear algebra techniques. Hence, it is appropriate for solving large linear systems. The analysis highlights its suitability within the class of well posed problems.

Publication DOI:
Divisions: College of Engineering & Physical Sciences > School of Informatics and Digital Engineering > Mathematics
Additional Information: © 2020, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Uncontrolled Keywords: Control and Systems Engineering,Signal Processing,Computer Networks and Communications,Applied Mathematics
Full Text Link:
Related URLs: https://www.sci ... 016003220304257 (Publisher URL)
http://www.scop ... tnerID=8YFLogxK (Scopus URL)
PURE Output Type: Article
Published Date: 2020-09
Published Online Date: 2020-06-13
Accepted Date: 2020-06-08
Authors: Rebollo-Neira, Laura (ORCID Profile 0000-0002-7420-8977)
Rozlovznik, Miroslav
Sasmal, Pradip

Export / Share Citation


Additional statistics for this record