Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Matrix computations (3rd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Introduction to Algorithms
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Theoretical Computer Science - Algebraic and numerical algorithm
Handbook of Computational Economics, Volume 2: Agent-Based Computational Economics (Handbook of Computational Economics)
A New Algorithm for Inner Product
IEEE Transactions on Computers
SIMUL 3.2: An Econometric Tool for Multidimensional Modelling
Computational Economics
| Hi-index | 0.00 |
The aggregation procedure is an important theoretical and empirical topic of economics. It appears in the Microeconomics and Macroeconomics, in Panel and Cross-Sectional Data Analysis, in Data Mining Analysis, in Input---Output and Agent-based Computational Economics Modelling. The question of the choice of algorithm is became important since the size of the sample data has became more important, and despite of the speed of the computers. In this paper we present the "classical" algorithm (the "matrix algebraic" one) of aggregation of the two-dimensional sample data, and compare it to the alternative algorithms (the "vectorial" one) we developed. Then we present some extensions to the multidimensional aggregation.