Dictionary-based model reduction for state estimation

IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED Advances in Computational Mathematics Pub Date : 2024-04-24 DOI:10.1007/s10444-024-10129-4
Anthony Nouy, Alexandre Pasco
{"title":"Dictionary-based model reduction for state estimation","authors":"Anthony Nouy, Alexandre Pasco","doi":"10.1007/s10444-024-10129-4","DOIUrl":null,"url":null,"abstract":"<p>We consider the problem of state estimation from a few linear measurements, where the state to recover is an element of the manifold <span>\\(\\mathcal {M}\\)</span> of solutions of a parameter-dependent equation. The state is estimated using prior knowledge on <span>\\(\\mathcal {M}\\)</span> coming from model order reduction. Variational approaches based on linear approximation of <span>\\(\\mathcal {M}\\)</span>, such as PBDW, yield a recovery error limited by the Kolmogorov width of <span>\\(\\mathcal {M}\\)</span>. To overcome this issue, piecewise-affine approximations of <span>\\(\\mathcal {M}\\)</span> have also been considered, that consist in using a library of linear spaces among which one is selected by minimizing some distance to <span>\\(\\mathcal {M}\\)</span>. In this paper, we propose a state estimation method relying on dictionary-based model reduction, where space is selected from a library generated by a dictionary of snapshots, using a distance to the manifold. The selection is performed among a set of candidate spaces obtained from a set of <span>\\(\\ell _1\\)</span>-regularized least-squares problems. Then, in the framework of parameter-dependent operator equations (or PDEs) with affine parametrizations, we provide an efficient offline-online decomposition based on randomized linear algebra, that ensures efficient and stable computations while preserving theoretical guarantees.</p>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10444-024-10129-4","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the problem of state estimation from a few linear measurements, where the state to recover is an element of the manifold \(\mathcal {M}\) of solutions of a parameter-dependent equation. The state is estimated using prior knowledge on \(\mathcal {M}\) coming from model order reduction. Variational approaches based on linear approximation of \(\mathcal {M}\), such as PBDW, yield a recovery error limited by the Kolmogorov width of \(\mathcal {M}\). To overcome this issue, piecewise-affine approximations of \(\mathcal {M}\) have also been considered, that consist in using a library of linear spaces among which one is selected by minimizing some distance to \(\mathcal {M}\). In this paper, we propose a state estimation method relying on dictionary-based model reduction, where space is selected from a library generated by a dictionary of snapshots, using a distance to the manifold. The selection is performed among a set of candidate spaces obtained from a set of \(\ell _1\)-regularized least-squares problems. Then, in the framework of parameter-dependent operator equations (or PDEs) with affine parametrizations, we provide an efficient offline-online decomposition based on randomized linear algebra, that ensures efficient and stable computations while preserving theoretical guarantees.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于字典的状态估计模型还原
我们考虑的是通过少量线性测量进行状态估计的问题,其中需要恢复的状态是一个参数相关方程的流形(\mathcal {M}\)解的一个元素。状态的估计使用的是( (mathcal {M}\)上的先验知识,这些先验知识来自于模型阶次缩减。基于 \(\mathcal {M}\) 线性近似的变量方法,如 PBDW,产生的恢复误差受限于 \(\mathcal {M}\) 的 Kolmogorov 宽度。为了克服这个问题,也有人考虑过对\(\mathcal {M}\)进行片断近似,即使用一个线性空间库,通过最小化与\(\mathcal {M}\)的距离来选择其中一个。在本文中,我们提出了一种依赖于基于字典的模型还原的状态估计方法,即利用与流形的距离,从由快照字典生成的库中选择空间。这种选择是在从一组 \(\ell _1\)-regularized least-squares 问题中得到的一组候选空间中进行的。然后,在具有仿射参数的参数相关算子方程(或 PDEs)的框架内,我们提供了一种基于随机线性代数的高效离线-在线分解方法,它能确保高效稳定的计算,同时保留理论保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
3.00
自引率
5.90%
发文量
68
审稿时长
3 months
期刊介绍: Advances in Computational Mathematics publishes high quality, accessible and original articles at the forefront of computational and applied mathematics, with a clear potential for impact across the sciences. The journal emphasizes three core areas: approximation theory and computational geometry; numerical analysis, modelling and simulation; imaging, signal processing and data analysis. This journal welcomes papers that are accessible to a broad audience in the mathematical sciences and that show either an advance in computational methodology or a novel scientific application area, or both. Methods papers should rely on rigorous analysis and/or convincing numerical studies.
期刊最新文献
Maximal volume matrix cross approximation for image compression and least squares solution Multilevel approximation of Gaussian random fields: Covariance compression, estimation, and spatial prediction Improved a posteriori error bounds for reduced port-Hamiltonian systems Interpolating refinable functions and $$n_s$$ -step interpolatory subdivision schemes SVD-based algorithms for tensor wheel decomposition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1