Name
Abstract | ||
|---|---|---|
We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane. |
Year | Venue | Keywords |
|---|---|---|
2012 | Signal Processing Conference | error analysis,matrix decomposition,signal sampling,Cholesky matrix decomposition,QR matrix decomposition,computational performance,matrix inversion lemma,numerical error accumulation,numerical performance,orthogonal matching pursuit implementations,phase plane,Orthogonal matching pursuit,algorithms |
Field | DocType | ISSN |
Matching pursuit,Singular value decomposition,Mathematical optimization,Matrix decomposition,Algorithm,Woodbury matrix identity,Sparse matrix,Mathematics,LU decomposition,QR decomposition,Cholesky decomposition | Conference | 2219-5491 |
ISBN | Citations | PageRank |
978-1-4673-1068-0 | 23 | 0.95 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bob L. Sturm | 1 | 241 | 29.88 |
| Mads Graesboll Christensen | 2 | 159 | 13.36 |