论Loewner框架、Kolmogorov叠加定理和维数诅咒

IF 6.1 1区 数学 Q1 MATHEMATICS, APPLIED
SIAM Review Pub Date : 2025-11-06 DOI:10.1137/24m1656657
Athanasios C. Antoulas, Ion Victor Gosea, Charles Poussot-Vassal
{"title":"论Loewner框架、Kolmogorov叠加定理和维数诅咒","authors":"Athanasios C. Antoulas, Ion Victor Gosea, Charles Poussot-Vassal","doi":"10.1137/24m1656657","DOIUrl":null,"url":null,"abstract":"SIAM Review, Volume 67, Issue 4, Page 737-770, December 2025. <br/> Abstract.The Loewner framework is an interpolatory approach for the approximation of linear and nonlinear systems. The purpose here is to extend this framework to linear parametric systems with an arbitrary number [math] of parameters. To achieve this, a new generalized multivariate rational function realization is proposed. We then introduce the [math]-dimensional multivariate Loewner matrices and show that they can be computed by solving a set of coupled Sylvester equations. The null space of these Loewner matrices allows the construction of multivariate rational functions in barycentric form. The principal result of this work is to show how the null space of [math]-dimensional Loewner matrices can be computed using a sequence of one-dimensional Loewner matrices. Thus, a decoupling of the variables is achieved, which leads to a drastic reduction of the computational burden. Equally importantly, this burden is alleviated by avoiding the explicit construction of large-scale [math]-dimensional Loewner matrices of size [math]. The proposed methodology achieves the decoupling of variables, leading (i) to a reduction in complexity from [math] to below [math] when [math] and (ii) to memory storage bounded by the largest variable dimension rather than their product, thus taming the curse of dimensionality and making the solution scalable to very large data sets. This decoupling of the variables leads to a result similar to the Kolmogorov superposition theorem for rational functions. Thus, making use of barycentric representations, every multivariate rational function can be computed using the composition and superposition of single-variable functions. Finally, we suggest two algorithms (one direct and one iterative) to construct, directly from data, multivariate (or parametric) realizations ensuring (approximate) interpolation. Numerical examples highlight the effectiveness and scalability of the method.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"135 1","pages":""},"PeriodicalIF":6.1000,"publicationDate":"2025-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Loewner Framework, the Kolmogorov Superposition Theorem, and the Curse of Dimensionality\",\"authors\":\"Athanasios C. Antoulas, Ion Victor Gosea, Charles Poussot-Vassal\",\"doi\":\"10.1137/24m1656657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Review, Volume 67, Issue 4, Page 737-770, December 2025. <br/> Abstract.The Loewner framework is an interpolatory approach for the approximation of linear and nonlinear systems. The purpose here is to extend this framework to linear parametric systems with an arbitrary number [math] of parameters. To achieve this, a new generalized multivariate rational function realization is proposed. We then introduce the [math]-dimensional multivariate Loewner matrices and show that they can be computed by solving a set of coupled Sylvester equations. The null space of these Loewner matrices allows the construction of multivariate rational functions in barycentric form. The principal result of this work is to show how the null space of [math]-dimensional Loewner matrices can be computed using a sequence of one-dimensional Loewner matrices. Thus, a decoupling of the variables is achieved, which leads to a drastic reduction of the computational burden. Equally importantly, this burden is alleviated by avoiding the explicit construction of large-scale [math]-dimensional Loewner matrices of size [math]. The proposed methodology achieves the decoupling of variables, leading (i) to a reduction in complexity from [math] to below [math] when [math] and (ii) to memory storage bounded by the largest variable dimension rather than their product, thus taming the curse of dimensionality and making the solution scalable to very large data sets. This decoupling of the variables leads to a result similar to the Kolmogorov superposition theorem for rational functions. Thus, making use of barycentric representations, every multivariate rational function can be computed using the composition and superposition of single-variable functions. Finally, we suggest two algorithms (one direct and one iterative) to construct, directly from data, multivariate (or parametric) realizations ensuring (approximate) interpolation. Numerical examples highlight the effectiveness and scalability of the method.\",\"PeriodicalId\":49525,\"journal\":{\"name\":\"SIAM Review\",\"volume\":\"135 1\",\"pages\":\"\"},\"PeriodicalIF\":6.1000,\"publicationDate\":\"2025-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Review\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/24m1656657\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Review","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/24m1656657","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

SIAM评论,第67卷,第4期,737-770页,2025年12月。摘要。洛厄纳框架是线性和非线性系统逼近的一种插值方法。这里的目的是将这个框架扩展到具有任意数量参数的线性参数系统。为此,提出了一种新的广义多元有理函数实现方法。然后,我们引入了[数学]维多元Loewner矩阵,并证明它们可以通过求解一组耦合Sylvester方程来计算。这些Loewner矩阵的零空间允许以质心形式构造多元有理函数。这项工作的主要结果是展示了如何使用一维洛厄纳矩阵序列来计算[数学]维洛厄纳矩阵的零空间。因此,实现了变量的解耦,从而大大减少了计算负担。同样重要的是,通过避免显式构建大小为[math]的大规模[math]维lower - ner矩阵,可以减轻这种负担。所提出的方法实现了变量的解耦,导致(i)当[math]时,从[math]到[math]以下的复杂性降低;(ii)由最大变量维度而不是它们的乘积限制的内存存储,从而驯服了维度的诅咒,使解决方案可扩展到非常大的数据集。这种变量的解耦导致类似于有理函数的柯尔莫哥洛夫叠加定理的结果。因此,利用重心表示,每个多元有理函数都可以使用单变量函数的组合和叠加来计算。最后,我们建议两种算法(一种直接算法和一种迭代算法)直接从数据中构建多元(或参数)实现,确保(近似)插值。数值算例表明了该方法的有效性和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Loewner Framework, the Kolmogorov Superposition Theorem, and the Curse of Dimensionality
SIAM Review, Volume 67, Issue 4, Page 737-770, December 2025.
Abstract.The Loewner framework is an interpolatory approach for the approximation of linear and nonlinear systems. The purpose here is to extend this framework to linear parametric systems with an arbitrary number [math] of parameters. To achieve this, a new generalized multivariate rational function realization is proposed. We then introduce the [math]-dimensional multivariate Loewner matrices and show that they can be computed by solving a set of coupled Sylvester equations. The null space of these Loewner matrices allows the construction of multivariate rational functions in barycentric form. The principal result of this work is to show how the null space of [math]-dimensional Loewner matrices can be computed using a sequence of one-dimensional Loewner matrices. Thus, a decoupling of the variables is achieved, which leads to a drastic reduction of the computational burden. Equally importantly, this burden is alleviated by avoiding the explicit construction of large-scale [math]-dimensional Loewner matrices of size [math]. The proposed methodology achieves the decoupling of variables, leading (i) to a reduction in complexity from [math] to below [math] when [math] and (ii) to memory storage bounded by the largest variable dimension rather than their product, thus taming the curse of dimensionality and making the solution scalable to very large data sets. This decoupling of the variables leads to a result similar to the Kolmogorov superposition theorem for rational functions. Thus, making use of barycentric representations, every multivariate rational function can be computed using the composition and superposition of single-variable functions. Finally, we suggest two algorithms (one direct and one iterative) to construct, directly from data, multivariate (or parametric) realizations ensuring (approximate) interpolation. Numerical examples highlight the effectiveness and scalability of the method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
SIAM Review
SIAM Review 数学-应用数学
CiteScore
16.90
自引率
0.00%
发文量
50
期刊介绍: Survey and Review feature papers that provide an integrative and current viewpoint on important topics in applied or computational mathematics and scientific computing. These papers aim to offer a comprehensive perspective on the subject matter. Research Spotlights publish concise research papers in applied and computational mathematics that are of interest to a wide range of readers in SIAM Review. The papers in this section present innovative ideas that are clearly explained and motivated. They stand out from regular publications in specific SIAM journals due to their accessibility and potential for widespread and long-lasting influence.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书