Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο: https://hdl.handle.net/20.500.14279/2128
Πεδίο DCΤιμήΓλώσσα
dc.contributor.authorYanev, Petko I.-
dc.contributor.authorFoschi, Paolo-
dc.contributor.authorKontoghiorghes, Erricos John-
dc.contributor.otherΚοντογιώργης, Έρρικος Γιάννης-
dc.date.accessioned2013-01-30T12:53:41Zen
dc.date.accessioned2013-05-16T08:21:57Z-
dc.date.accessioned2015-12-02T09:26:31Z-
dc.date.available2013-01-30T12:53:41Zen
dc.date.available2013-05-16T08:21:57Z-
dc.date.available2015-12-02T09:26:31Z-
dc.date.issued2004-01-28-
dc.identifier.citationAlgorithmica (New York), 2004, vol. 39, no. 1, pp. 83-93en_US
dc.identifier.issn14320541-
dc.identifier.urihttps://hdl.handle.net/20.500.14279/2128-
dc.description.abstractThe 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.formatpdfen_US
dc.language.isoenen_US
dc.relation.ispartofAlgorithmica (New York)en_US
dc.rights© Springer Natureen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectComputational complexityen_US
dc.subjectMathematical modelsen_US
dc.subjectAlgorithmsen_US
dc.titleAlgorithms for computing the qr decomposition of a set of matrices with common columnsen_US
dc.typeArticleen_US
dc.collaborationUniversité de Neuchâtelen_US
dc.subject.categoryComputer and Information Sciencesen_US
dc.journalsSubscriptionen_US
dc.countryGreeceen_US
dc.subject.fieldNatural Sciencesen_US
dc.publicationPeer Revieweden_US
dc.identifier.doi10.1007/s00453-003-1080-zen_US
dc.dept.handle123456789/54en
dc.relation.issue1en_US
dc.relation.volume39en_US
cut.common.academicyear2003-2004en_US
dc.identifier.spage83en_US
dc.identifier.epage93en_US
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
item.openairetypearticle-
crisitem.journal.journalissn0178-4617-
crisitem.journal.publisherSpringer Nature-
crisitem.author.deptDepartment of Finance, Accounting and Management Science-
crisitem.author.facultyFaculty of Tourism Management, Hospitality and Entrepreneurship-
crisitem.author.orcid0000-0001-9704-9510-
crisitem.author.parentorgFaculty of Management and Economics-
Εμφανίζεται στις συλλογές:Άρθρα/Articles
CORE Recommender
Δείξε τη σύντομη περιγραφή του τεκμηρίου

SCOPUSTM   
Citations

11
checked on 9 Νοε 2023

WEB OF SCIENCETM
Citations 50

11
Last Week
0
Last month
0
checked on 29 Οκτ 2023

Page view(s)

726
Last Week
1
Last month
27
checked on 13 Μαρ 2025

Google ScholarTM

Check

Altmetric


Αυτό το τεκμήριο προστατεύεται από άδεια Άδεια Creative Commons Creative Commons