Zolotarev符号与比例问题的有理逼近
Rational approximation for Zolotarev sign and ratio problems
AI总结:
该研究针对Zolotarev第三、第四问题,提出用Loewner框架快速逼近,对比了其与其他方法的特性,验证了该框架的鲁棒性、准确性及无需用户干预的优势。
摘要:
我们研究Zolotarev第三和第四问题的有理逼近算法。首先,证明Loewner框架(LF)适合通过压缩大量插值条件,快速且无需迭代地逼近Zolotarev问题。其次,比较LF与标准AAA、AAA-sign及其AAA-Lawson变体的逼近特性,如系数和极点。研究聚焦于对称双圆这一典型示例,其最优解已有充分记录,针对该案例,突出LF的数值鲁棒性及恢复最优解结构的能力。还报告了其他非平凡几何情况,强调LF快速、可靠,无需用户干预即可生成准确逼近式。
英文摘要:
We study algorithms for Zolotarev (3rd and 4th) problems rational approximation. First, we show that the Loewner framework (LF) is appropriate to rapidly and with no iterations, approximate the Zolotarev problems by compressing the (numerous) interpolation conditions. Second, we compare the approximation properties (e.g. coefficients and poles) of LF with the standard AAA, AAA-sign and its AAA-Lawson variants. We concentrate the study on a canonical example, namely the symmetric two-circles one, for which the optimal solution is well documented. For this case, we highlight the numerical robustness of LF and its ability to recover the structure of the optimal solution. Additional non-trivial geometries are also reported, emphasizing that LF is fast, reliable, and yields accurate approximants with no user intervention.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。