All possible subset regressions using the QR decomposition

DOI10.1016/0167-9473(89)90023-6zbMATH Open0726.62115OpenAlexW2075090283MaRDI QIDQ804185FDOQ804185

Authors: N. E. Zubov 

Publication date: 1989

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(89)90023-6

zbMATH Keywords

algorithmslinear regressionQR decompositionGivens' rotationssubset regressions

Mathematics Subject Classification ID

General nonlinear regression (62J02) Linear regression; mixed models (62J05) Probabilistic methods, stochastic differential equations (65C99)

Cites Work

• Title not available (Why is that?)
• Algorithm AS 164: Least Squares Subject to Linear Constraints
• Title not available (Why is that?)
• Regressions by Leaps and Bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Tutorial on the SWEEP Operator
• Title not available (Why is that?)
• Selection of Subsets of Regression Variables
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• A fast algorithm for non-negativity model selection
• Applied regression analysis bibliography update 1988-89
• Efficient algorithms for computing the best subset regression models for large-scale problems
• Complete subset regressions
• All possible subset regressions using the triangular decomposition
• A graph approach to generate all possible regression submodels

Uses Software

• AS 38
• LINPACK
• AS 164
• AS 183
• AS 46

This page was built for publication: All possible subset regressions using the QR decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804185)