On the public citation graph
Algorithm AS 163: A Givens Algorithm for Moving from One Linear Model to Another Without Going Back to the Data
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1111/j.1467-9876.1978.tb01085.xopenalex-snapshot
A Remark on Algorithm AS 6: Triangular Decomposition of a Symmetric Matrix
inferredcites →https://doi.org/10.2307/2346374openalex-snapshot
Correction: Algorithm AS 164: Least Squares Subject to Linear Constraints
inferredcites →https://doi.org/10.2307/2346399openalex-snapshot
Algorithm AS 164: Least Squares Subject to Linear Constraints
inferredcites →https://doi.org/10.2307/2346626openalex-snapshot
Some Computational Procedures for the Best Subset Problem
inferredcites →https://doi.org/10.2307/2347147openalex-snapshot
Algorithm AS 75: Basic Procedures for Large, Sparse or Weighted Linear Least Problems
inferredcites →https://doi.org/10.2307/2347151openalex-snapshot
Algorithm AS 79: Gram-Schmidt Regression
inferredcites →https://doi.org/10.2307/2347152openalex-snapshot
Remark AS R12: A Remark on Algorithm AS 6: Triangular Decomposition of a Symmetric Matrix
inferredcites →https://doi.org/10.2307/2985687openalex-snapshot
Algorithm AS 6: Triangular Decomposition of a Symmetric Matrix
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-3680-1_3openalex-snapshot
GLIM4 - structure and development
inferred← citeshttps://doi.org/10.1007/978-1-4612-5771-4_3openalex-snapshot
GLIM4 — The New Facilities
inferred← citeshttps://doi.org/10.1007/978-1-4615-7070-7_1openalex-snapshot
Introduction: GLIM and Generalized Linear Models
inferred← citeshttps://doi.org/10.1007/978-3-642-46890-2_50openalex-snapshot
Recursive Techniques in Statistical Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46900-8_40openalex-snapshot
Further Recursive Algorithms for Multidimensional Table Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-50096-1_49openalex-snapshot
GLIM4 — Developments in Model Fitting
inferred← citeshttps://doi.org/10.1007/978-3-642-51461-6_52openalex-snapshot
New Computing Tools and New Statistical Packages
inferred← citeshttps://doi.org/10.1007/978-3-7908-2084-3_29openalex-snapshot
A Regression Subset-Selection Strategy for Fat-Structure Data
inferred← citeshttps://doi.org/10.1007/978-94-009-4105-2_11openalex-snapshot
Choosing a regression model
inferred← citeshttps://doi.org/10.1007/bf01096290openalex-snapshot
Probabilistic-statistical programs from ?applied statistics?
inferred← citeshttps://doi.org/10.1007/s10287-004-0021-xopenalex-snapshot
Efficient strategies for deriving the subset VAR models
inferred← citeshttps://doi.org/10.1016/0167-9473(89)90023-6openalex-snapshot
All possible subset regressions using the QR decomposition
inferred← citeshttps://doi.org/10.1016/0167-9473(92)90176-gopenalex-snapshot
A comparison of algorithms for forming the QR decomposition for use in regression
inferred← citeshttps://doi.org/10.1016/b978-0-12-656460-0.50008-2openalex-snapshot
Linear Lp Regression
inferred← citeshttps://doi.org/10.1016/j.csda.2007.02.018openalex-snapshot
A graph approach to generate all possible regression submodels
inferred← citeshttps://doi.org/10.1016/j.csda.2007.03.017openalex-snapshot
Efficient algorithms for computing the best subset regression models for large-scale problems
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00019-xopenalex-snapshot
Parallel algorithms for computing all possible subset regression models using the QR decomposition
inferred← citeshttps://doi.org/10.1016/s0169-2046(97)00016-9openalex-snapshot
Rural and suburban forest edges: effect on egg predators and nest predation rates
inferred← citeshttps://doi.org/10.1017/cbo9780511812231openalex-snapshot
Numerical Methods of Statistics
inferred← citeshttps://doi.org/10.1080/00949650008811991openalex-snapshot
All possible subset regressions using the triangular decomposition
inferred← citeshttps://doi.org/10.1080/03610918408812419openalex-snapshot
Non-negative regression by givens rotations
inferred← citeshttps://doi.org/10.1198/004017008000000280openalex-snapshot
Practical Design of Generalized Likelihood Ratio Control Charts for Autocorrelated Data
inferred← citeshttps://doi.org/10.1198/106186006x100290openalex-snapshot
Branch-and-Bound Algorithms for Computing the Best-Subset Regression Models
inferred← citeshttps://doi.org/10.1201/9780203748923-7openalex-snapshot
Updating the QU Decomposition
inferred← citeshttps://doi.org/10.18637/jss.v016.i08openalex-snapshot
Some Algorithms for the Conditional Mean Vector and Covariance Matrix
inferred← citeshttps://doi.org/10.18637/jss.v093.i03openalex-snapshot
lmSubsets: Exact Variable-Subset Selection in Linear Regression for R
inferred← citeshttps://doi.org/10.2118/198018-msopenalex-snapshot
Data Driven Predictive Modelling Assists in Proactive Water Cut Management in a North Kuwait Heavy Oilfield
inferred← citeshttps://doi.org/10.2307/2347539openalex-snapshot
Algorithm AS 268: All Possible Subset Regressions Using the QR Decomposition
inferred← citeshttps://doi.org/10.2307/2347582openalex-snapshot
Algorithm AS 273: Comparing Subsets of Regressor Variables
inferred← citeshttps://doi.org/10.2307/2347583openalex-snapshot
Algorithm AS 274: Least Squares Routines to Supplement Those of Gentleman
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07643openalex-snapshot
Solving All Regression Models For Learning Gaussian Networks Using Givens Rotations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.