On the representation of multi-input systems: Computational properties of polynomial algorithms
- 1 January 1980
- journal article
- research article
- Published by Springer Nature in Biological Cybernetics
- Vol. 37 (3) , 167-186
- https://doi.org/10.1007/bf00355455
Abstract
This paper introduces a theoretical framework for characterizing and classifying simple parallel algorithms and systems with many inputs, for example an array of photoreceptors. The polynomial representation (Taylor series development) of a large class of operators is introduced and its range of validity discussed. The problems involved in the polynomial approximation of systems are also briefly reviewed. Symmetry properties of the input-output map and their implications for the system structure (i.e. its kernels) are studied. Finally, the computational properties of polynomial mappings are characterized.This publication has 30 references indexed in Scilit:
- Towards a theory of local and global in computationTheoretical Computer Science, 1978
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- A synaptic mechanism possibly underlying directional selectivity to motionProceedings of the Royal Society of London. B. Biological Sciences, 1978
- Visual control of orientation behaviour in the fly: Part II. Towards the underlying neural interactionsQuarterly Reviews of Biophysics, 1976
- Experiments in the Visual Perception of TextureScientific American, 1975
- On the analysis of feedback systems with a polynomic plant†International Journal of Control, 1975
- Generalized polynomial operators for nonlinear systems analysisIEEE Transactions on Automatic Control, 1972
- Polynomial operators in non-linear systems theoryInternational Journal of Systems Science, 1971
- A Weierstrass theorem for real, separable Hilbert spacesJournal of Approximation Theory, 1970
- The Use of Functionals in the Analysis of Non-linear Physical Systems†Journal of Electronics and Control, 1963