Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2128| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Yanev, Petko I. | - |
| dc.contributor.author | Foschi, Paolo | - |
| dc.contributor.author | Kontoghiorghes, Erricos John | - |
| dc.contributor.other | Κοντογιώργης, Έρρικος Γιάννης | - |
| dc.date.accessioned | 2013-01-30T12:53:41Z | en |
| dc.date.accessioned | 2013-05-16T08:21:57Z | - |
| dc.date.accessioned | 2015-12-02T09:26:31Z | - |
| dc.date.available | 2013-01-30T12:53:41Z | en |
| dc.date.available | 2013-05-16T08:21:57Z | - |
| dc.date.available | 2015-12-02T09:26:31Z | - |
| dc.date.issued | 2004-01-28 | - |
| dc.identifier.citation | Algorithmica (New York), 2004, vol. 39, no. 1, pp. 83-93 | en_US |
| dc.identifier.issn | 14320541 | - |
| dc.identifier.uri | https://hdl.handle.net/20.500.14279/2128 | - |
| dc.description.abstract | The QR decomposition of a set of matrices which have common columns is investigated. The triangular factors of the QR decompositions are represented as nodes of a weighted directed graph. An edge between two nodes exists if and only if the columns of one of the matrices is a subset of the columns of the other. The weight of an edge denotes the computational complexity of deriving the triangular factor of the destination node from that of the source node. The problem is equivalent to constructing the graph and finding the minimum cost for visiting all the nodes. An algorithm which computes the QR decompositions by deriving the minimum spanning tree of the graph is proposed. Theoretical measures of complexity are derived and numerical results from the implementation of this and alternative heuristic algorithms are given. | en_US |
| dc.format | en_US | |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Algorithmica (New York) | en_US |
| dc.rights | © Springer Nature | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject | Computational complexity | en_US |
| dc.subject | Mathematical models | en_US |
| dc.subject | Algorithms | en_US |
| dc.title | Algorithms for computing the qr decomposition of a set of matrices with common columns | en_US |
| dc.type | Article | en_US |
| dc.collaboration | Université de Neuchâtel | en_US |
| dc.subject.category | Computer and Information Sciences | en_US |
| dc.journals | Subscription | en_US |
| dc.country | Greece | en_US |
| dc.subject.field | Natural Sciences | en_US |
| dc.publication | Peer Reviewed | en_US |
| dc.identifier.doi | 10.1007/s00453-003-1080-z | en_US |
| dc.dept.handle | 123456789/54 | en |
| dc.relation.issue | 1 | en_US |
| dc.relation.volume | 39 | en_US |
| cut.common.academicyear | 2003-2004 | en_US |
| dc.identifier.spage | 83 | en_US |
| dc.identifier.epage | 93 | en_US |
| item.grantfulltext | none | - |
| item.languageiso639-1 | en | - |
| item.cerifentitytype | Publications | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
| item.openairetype | article | - |
| item.fulltext | No Fulltext | - |
| crisitem.journal.journalissn | 0178-4617 | - |
| crisitem.journal.publisher | Springer Nature | - |
| crisitem.author.dept | Department of Finance, Accounting and Management Science | - |
| crisitem.author.faculty | Faculty of Tourism Management, Hospitality and Entrepreneurship | - |
| crisitem.author.orcid | 0000-0001-9704-9510 | - |
| crisitem.author.parentorg | Faculty of Management and Economics | - |
| Appears in Collections: | Άρθρα/Articles | |
CORE Recommender
SCOPUSTM
Citations
11
checked on Nov 9, 2023
WEB OF SCIENCETM
Citations
50
11
Last Week
0
0
Last month
0
0
checked on Oct 29, 2023
Page view(s) 5
687
Last Week
0
0
Last month
1
1
checked on Nov 8, 2024
Google ScholarTM
Check
Altmetric
This item is licensed under a Creative Commons License
