Adaptive Interpolatory MOR by Learning the Error Estimator in the Parameter Domain
share
Interpolatory methods offer a powerful framework for generating reduced-order models (ROMs) for non-parametric or parametric systems with time-varying inputs. Choosing the interpolation points adaptively remains an area of active interest. A greedy framework has been introduced in Feng et al. [ESAIM: Math. Model. Numer. Anal. 51(6), 2017] and in Feng and Benner [IEEE Trans. Microw. Theory Techn. 67(12), 2019] to choose interpolation points automatically using a posteriori error estimators. Nevertheless, when the parameter range is large or if the parameter space dimension is larger than two, the greedy algorithm may take considerable time, since the training set needs to include a considerable number of parameters. As a remedy, we introduce an adaptive training technique by learning an efficient a posteriori error estimator over the parameter domain. A fast learning process is created by interpolating the error estimator using radial basis functions (RBF) over a fine parameter training set, representing the whole parameter domain. The error estimator is evaluated only on a coarse training set including a few parameter samples. The algorithm is an extension of the work in Chellappa et al. [arXiv e-prints 1910.00298] to interpolatory model order reduction (MOR) in frequency domain. Beyond this work, we use a newly proposed inf-sup-constant-free error estimator in the frequency domain, which is often much tighter than the error estimator using the inf-sup constant.
READ FULL TEXT
