Algorithms for Dimension and Complexity Reduction

Mathematical advances that reduce the complexity of models are complemented by algorithms that achieve the desired reduction in computational effort. This workshop focuses on the synthesis and development of algorithmic approaches to model order reduction. These methods tackle fundamental problems in structure- and topology-preserving reductions, low-rank models and dimension reduction, multi-level approaches, and empirical interpolation and approximations, etc. Complementary approaches that target computational efficiency include strategies with offline and online phases and divide-and-conquer algorithms.