Algorithms for computing the QR decomposition of a set of matrices with common columns

DOI10.1007/s00453-003-1080-zzbMath1055.65042OpenAlexW2053534813MaRDI QIDQ1879361

Paolo Foschi, Petko I. Yanev, Erricos John Kontoghiorghes

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/321272/files/453_2003_Article_1080.pdf

zbMATH Keywords

algorithmcomputational complexitynumerical resultsdirected graphQR decompositionminimum spanning treegivens rotations

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Related Items

An efficient branch-and-bound strategy for subset vector autoregressive model selection, Computationally efficient methods for estimating the updated-observations SUR models, Two-stage least squares and indirect least squares algorithms for simultaneous equations models, Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree, A graph approach to generate all possible regression submodels