A selection of algorithms for the rational approximation of matrix-valued functions are discussed, including variants of the interpolatory AAA method, the RKFIT method based on approximate least squares fitting, vector fitting, and a method based on low-rank approximation of a block Loewner matrix. A new method, called the block-AAA algorithm, based on a generalized barycentric formula with matrix-valued weights is proposed. All algorithms are compared in terms of obtained approximation accuracy and runtime on a set of problems from model order reduction and nonlinear eigenvalue problems, including examples with noisy data. It is found that interpolation-based methods are typically cheaper to run, but they may suffer in the presence of noise for which approximation-based methods perform better.
翻译:讨论了选择合理近似矩阵价值函数的算法,包括各种变式的内推性AAA方法、基于基本最不平方搭配的RKFIT方法、矢量装配和基于区块 Loewner 矩阵低排序近似的方法。提出了一种称为区块-AAA算法的新方法,其依据是带有矩阵价值加权数的普遍的巴里中心公式。所有算法都比较了从一系列问题上取得的近似精确度和运行时间,这些问题包括减少定购模型和非线性二元值问题,包括吵闹数据的例子。人们发现,基于内推方法的运行一般比较便宜,但是在出现噪音的情况下,它们可能会受到影响,而以近似为基础的方法在噪音方面效果更好。