Time-varying system theory for computational networks

Many computational schemes in Linear Algebra can be studied from the point of view of TimeVarying Linear Systems theory. This approach not only puts a variety of results in a unified framework, but also generates new and unexpected results such as strong approximations of operators or matrices by computational networks of low complexity, and the embedding of contractive operations in orthogonal computations. In the present paper we develop the required Time-Varying System Theory in a systematic way, and derive a Kronecker or HoKalman type realization method.