On the respresentation of multi-input systems: computational properties of polynomial algorithms
Related Experiment Video
Updated: Aug 13, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Abstract:
This paper introduces a theoretical frame-work 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.
Related Concept Videos
Convolution Properties I
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
Multi-input and Multi-variable systems
In the absence of...
Introduction to Polynomial Functions
Real Zeros of Polynomials
Fundamental Theorem of Algebra
Synthetic Disvision of Polynomials