Rebollo-Neira, Laura, Rozlovznik, Miroslav and Sasmal, Pradip (2020). Analysis of the Self Projected Matching Pursuit Algorithm. Journal of The Franklin Institute, 357 (13), pp. 8980-8994.
Abstract
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: | https://doi.org/10.1016/j.jfranklin.2020.06.006 |
|---|---|
| Divisions: | Aston University (General) |
| Additional Information: | © 2020, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Uncontrolled Keywords: | Control and Systems Engineering,Signal Processing,Computer Networks and Communications,Applied Mathematics |
| Last Modified: | 01 Nov 2024 08:18 |
| Date Deposited: | 09 Jun 2020 10:02 |
| 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
(
0000-0002-7420-8977)
Rozlovznik, Miroslav Sasmal, Pradip |
Download
Version: Accepted Version
License: Creative Commons Attribution Non-commercial No Derivatives
| Preview
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)