An algorithm for rank estimation and subspace tracking

dc.contributor.authorErbay, Hasan
dc.contributor.authorAba, K.
dc.date.accessioned2020-06-25T17:48:49Z
dc.date.available2020-06-25T17:48:49Z
dc.date.issued2009
dc.departmentKırıkkale Üniversitesi
dc.descriptionErbay, Hasan/0000-0002-7555-541X
dc.description.abstractThis 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.identifier.citationclosedAccessen_US
dc.identifier.doi10.1080/00207160701798756
dc.identifier.endpage1203en_US
dc.identifier.issn0020-7160
dc.identifier.issn1029-0265
dc.identifier.issue7en_US
dc.identifier.scopus2-s2.0-70449592329
dc.identifier.scopusqualityQ2
dc.identifier.startpage1194en_US
dc.identifier.urihttps://doi.org/10.1080/00207160701798756
dc.identifier.urihttps://hdl.handle.net/20.500.12587/4570
dc.identifier.volume86en_US
dc.identifier.wosWOS:000273521400010
dc.identifier.wosqualityQ4
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofInternational Journal Of Computer Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectURV decompositionen_US
dc.subjectnumerical ranken_US
dc.subjectsubspace estimationen_US
dc.subjectrefinementen_US
dc.titleAn algorithm for rank estimation and subspace trackingen_US
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
An algorithm for rank estimation and subspace tracking.pdf
Boyut:
318.34 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin/Full Text