| dc.contributor.author | Erbay, H. | |
| dc.contributor.author | Aba, K. | |
| dc.date.accessioned | 2020-06-25T17:48:49Z | |
| dc.date.available | 2020-06-25T17:48:49Z | |
| dc.date.issued | 2009 | |
| dc.identifier.issn | 0020-7160 | |
| dc.identifier.issn | 1029-0265 | |
| dc.identifier.uri | https://doi.org/10.1080/00207160701798756 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12587/4570 | |
| dc.description | Erbay, Hasan/0000-0002-7555-541X | en_US |
| dc.description | WOS: 000273521400010 | en_US |
| dc.description.abstract | This article presents an URV-based matrix decomposition, the truncated URV decomposition, and an updating algorithm for it. The complexity of the updating is [image omitted] for an m-by- n matrix of rank r. The theoretical and numerical results presented shows that the decomposition can be a good alternative to the singular value decomposition. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Taylor & Francis Ltd | en_US |
| dc.relation.isversionof | 10.1080/00207160701798756 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | URV decomposition | en_US |
| dc.subject | numerical rank | en_US |
| dc.subject | subspace estimation | en_US |
| dc.subject | refinement | en_US |
| dc.title | An algorithm for rank estimation and subspace tracking | en_US |
| dc.type | article | en_US |
| dc.contributor.department | Kırıkkale Üniversitesi | en_US |
| dc.identifier.volume | 86 | en_US |
| dc.identifier.issue | 7 | en_US |
| dc.identifier.startpage | 1194 | en_US |
| dc.identifier.endpage | 1203 | en_US |
| dc.relation.journal | International Journal Of Computer Mathematics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
