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

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.

Efficient strategies for deriving the subset VAR models

“…The latter factorization is a re-triangularization of a triangular factor after deleting columns [10,11,14,29]. Furthermore,Q in…”

An efficient branch-and-bound strategy for subset vector autoregressive model selection

“…The QRD (17) can be also seen as to re-triangularizing the upper-triangular matrix R after deleting a single column (Gatu and Kontoghiorghes, 2003;Yanev et al, 2004). Let…”

Bounded Adaptive Function Activated Recurrent Neural Network for Solving the Dynamic QR Factorization

“…The QRF has numerous practical applications [13,14]. An algorithm was proposed by [15] to calculate the QRF using a derivation diagram, but it could not adapt to the later common dynamic QRF (DQRF) problem. In their paper, Chen et al [16] proposed the calculation of DQRF, which decomposes the original time-varying system into subsystems and provides algorithms to detect quality and subsystem connection information.…”