This paper provides a new quasi-finite-rank approximation (QFRA) of infinite-rank compression operators defined on the Banach space L∞[0,H), which are associated with tractable representations of infinite-dimensional systems such as time-delay and sampled-data systems. We first formulate the QFRA by an optimization problem with a matrix-valued parameter X to minimize the associated error in terms of the L∞[0,H)-induced norm. To facilitate solving the optimization problem, we next employ the piecewise linear kernel approximation (PLKA) technique, by which the optimization problem is then converted to a linear programming (LP) problem. The solution of the LP problem is shown to converge to the optimal solution of the original QFRA with the order of 1/M, where M is the PLKA parameter. The PLKA-based QFRA is shown to lead to practical methods of the stability analysis for time-delay systems and the L1 optimal controller synthesis for sampled-data systems. Finally, the overall arguments developed in this paper are demonstrated through some numerical and experimental studies.
Read full abstract