Garside, 1965 - Google Patents
The best sub‐set in multiple regression analysisGarside, 1965
- Document ID
- 15055485857805573931
- Author
- Garside M
- Publication year
- Publication venue
- Journal of the Royal Statistical Society: Series C (Applied Statistics)
External Links
Snippet
In this article, Mr Garside gives a procedure for comparing all sub‐sets in multiple regression analysis and thereby obtaining the best sub‐set of a given size in the sense of the minimum residual sum of squares. The author also points out that this is a special case of a more …
- 238000000611 regression analysis 0 title abstract description 8
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/535—Dividing only
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/544—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/64—Digital differential analysers, i.e. computing devices for differentiation, integration or solving differential or integral equations, using pulses representing increments; Other incremental computing devices for solving difference equations
- G06F7/66—Digital differential analysers, i.e. computing devices for differentiation, integration or solving differential or integral equations, using pulses representing increments; Other incremental computing devices for solving difference equations wherein pulses represent unitary increments only
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Garside | The best sub‐set in multiple regression analysis | |
Fischer et al. | On Fourier-Toeplitz methods for separable elliptic problems | |
Collins et al. | Interval arithmetic in cylindrical algebraic decomposition | |
Johansson | Rigorous high-precision computation of the Hurwitz zeta function and its derivatives | |
US9424232B2 (en) | Processing of linear systems of equations | |
US11681497B2 (en) | Concurrent multi-bit adder | |
KR20030045021A (en) | A parallel counter and a logic circuit for performing multiplication | |
CN113448537B (en) | Method for minimum-maximum calculation in associative memory | |
CN113592094B (en) | Quantum state preparation circuit generation method and superconducting quantum chip | |
EP3803718A1 (en) | Evaluating quantum computing circuits in view of the resource costs of a quantum algorithm | |
Forrest et al. | Vector processing in simplex and interior methods for linear programming | |
CN110235099A (en) | Device and method for handling input operand value | |
CN113741858B (en) | Memory multiply-add computing method, memory multiply-add computing device, chip and computing equipment | |
US10977000B2 (en) | Partially and fully parallel normaliser | |
US3596258A (en) | Expanded search method and system in trained processors | |
Mohideen et al. | On recursive calculation of the generalized inverse of a matrix | |
Kawashima et al. | Algorithms for Monte Carlo Simulations of the Ising Models on a Simple Cubic Lattice | |
Curtis Jr et al. | An algorithm for the determination of the polynomial of best minimax approximation to a function defined on a finite point set | |
CN107977314B (en) | Method for acquiring process task block dependency relationship based on matrix | |
Palacios et al. | Birth and death chains on finite trees: Computing their stationary distribution and hitting times | |
CN117573069B (en) | CORDIC algorithm chip | |
Krishnamurthy et al. | A parallel Wilf algorithm for complex zeros of a polynomial | |
Belyaev et al. | Parametric maximum likelihood estimators and resampling | |
Zhu et al. | iMAT: Energy-Efficient In-Memory Acceleration for Ternary Neural Networks With Sparse Dot Product | |
Hartmann | A numerical analysis of Quicksort: How many cases are bad cases? |