ALGORITHMS FOR THE RATIONAL APPROXIMATION OF MATRIX-VALUED FUNCTIONS\ast

被引:16
|
作者
Gosea, Ion Victor [1 ]
Guttel, Stefan [2 ]
机构
[1] Max Planck Inst Dynam Complex Tech Syst Magdeburg, Data Driven Syst Reduct & Identificat Grp, D-39106 Magdeburg, Germany
[2] Univ Manchester, Dept Math, Manchester M13 9PL, Lancs, England
来源
SIAM JOURNAL ON SCIENTIFIC COMPUTING | 2021年 / 43卷 / 05期
基金
英国工程与自然科学研究理事会;
关键词
rational approximation; block rational function; Loewner matrix; MODEL-REDUCTION; SYSTEMS;
D O I
10.1137/20M1324727
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A selection of algorithms for the rational approximation of matrix-valued functions are discussed, including variants of the interpolatory adaptive Antoulas-Anderson (AAA) method, the rational Krylov fitting (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.
引用
收藏
页码:A3033 / A3054
页数:22
相关论文
共 50 条