Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns

Authors:
Petko Yanev;Paolo Foschi;Erricos John Kontoghiorghes and aff2
Affiliations:
Institut d’Informatique, Université de Neuchâtel, CH-2007 Neuchatel, Switzerland;Institut d’Informatique, Université de Neuchâtel, CH-2007 Neuchatel, Switzerland;Institut d’Informatique, Université de Neuchâtel, CH-2007 Neuchatel, Switzerland and Compu. Sci. and Info. Sys., Birkbeck College, Univ. of London, Bloomsbury, London England ...
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 6

Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM

Parallel Computing
Computationally efficient methods for estimating the updated-observations SUR models

Applied Numerical Mathematics
A graph approach to generate all possible regression submodels

Computational Statistics & Data Analysis
Message-passing two steps least square algorithms for simultaneous equations models

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Two-stage least squares and indirect least squares algorithms for simultaneous equations models

Journal of Computational and Applied Mathematics
Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.