In Section , we go over a set of preliminary notions and introduce the concept of NRF pairs, while also showcasing their defining characteristics on a number of practical examples. In Section , we discuss the means of enforcing sparsity patterns upon an NRF pair and we offer guarantees of closed-loop stability when implementing controllers via this formalism. Moreover, we present the means to obtain distributed state-space implementations for our controllers' NRF pairs and we show that norm-based optimal design in the NRF paradigm reduces to an affine model matching problem with stability constraints. In Section , we discuss alternative representations for our distributed control laws, akin to the ones in [1]} and [2]}, which employ closed-loop maps to compute the command signals. We show that, unlike the architecture presented in Section , these alternative representations cannot ensure closed-loop stability if the plant does not satisfy certain stability assumptions. Section  showcases the full potential of the NRF formalism through an illustrative numerical example, while Section  contains a set of conclusions. Finally, the proofs of our main results are given in an Appendix.
