基于rbf的张量分解及其在酿酒学中的应用

E. Perracchione
{"title":"基于rbf的张量分解及其在酿酒学中的应用","authors":"E. Perracchione","doi":"10.14658/PUPJ-DRNA-2020-1-5","DOIUrl":null,"url":null,"abstract":"As usually claimed, meshless methods work in any dimension and are easy to implement. However in practice, to preserve the convergence order when the dimension grows, they need a huge number of sampling points and both computational costs and memory turn out to be prohibitive. Moreover, when a large number of points is involved, the usual instability of the Radial Basis Function (RBF) approximants becomes evident. To partially overcome this drawback, we propose to apply tensor decomposition methods. This, together with rational RBFs, allows us to obtain efficient interpolation schemes for high dimensions. The effectiveness of our approach is also verified by an application to oenology.","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"RBF-based tensor decomposition with applications to oenology\",\"authors\":\"E. Perracchione\",\"doi\":\"10.14658/PUPJ-DRNA-2020-1-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As usually claimed, meshless methods work in any dimension and are easy to implement. However in practice, to preserve the convergence order when the dimension grows, they need a huge number of sampling points and both computational costs and memory turn out to be prohibitive. Moreover, when a large number of points is involved, the usual instability of the Radial Basis Function (RBF) approximants becomes evident. To partially overcome this drawback, we propose to apply tensor decomposition methods. This, together with rational RBFs, allows us to obtain efficient interpolation schemes for high dimensions. The effectiveness of our approach is also verified by an application to oenology.\",\"PeriodicalId\":51943,\"journal\":{\"name\":\"Dolomites Research Notes on Approximation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dolomites Research Notes on Approximation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14658/PUPJ-DRNA-2020-1-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dolomites Research Notes on Approximation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14658/PUPJ-DRNA-2020-1-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

正如通常所说的那样,无网格方法可以在任何维度上工作,并且易于实现。然而,在实际应用中,为了在维数增加时保持收敛顺序,它们需要大量的采样点,计算成本和内存都令人望而却步。此外,当涉及大量点时,径向基函数(RBF)近似的通常不稳定性变得明显。为了部分克服这一缺点,我们建议应用张量分解方法。这与理性rbf一起,使我们能够获得高维的有效插值方案。我们的方法的有效性也通过酿酒学的应用得到了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RBF-based tensor decomposition with applications to oenology
As usually claimed, meshless methods work in any dimension and are easy to implement. However in practice, to preserve the convergence order when the dimension grows, they need a huge number of sampling points and both computational costs and memory turn out to be prohibitive. Moreover, when a large number of points is involved, the usual instability of the Radial Basis Function (RBF) approximants becomes evident. To partially overcome this drawback, we propose to apply tensor decomposition methods. This, together with rational RBFs, allows us to obtain efficient interpolation schemes for high dimensions. The effectiveness of our approach is also verified by an application to oenology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.70
自引率
7.70%
发文量
0
审稿时长
8 weeks
期刊介绍: Dolomites Research Notes on Approximation is an open access journal that publishes peer-reviewed papers. It also publishes lecture notes and slides of the tutorials presented at the annual Dolomites Research Weeks and Workshops, which have been organized regularly since 2006 by the Padova-Verona Research Group on Constructive Approximation and Applications (CAA) in Alba di Canazei (Trento, Italy). The journal publishes, on invitation, survey papers and summaries of Ph.D. theses on approximation theory, algorithms, and applications.
期刊最新文献
Positivity-preserving and elementary stable nonstandard method for a COVID-19 SIR model Computation of the Bell-Laplace transforms Bernstein and Markov-type inequalities for polynomials on Lp(μ) spaces RBF-based tensor decomposition with applications to oenology Hopf bifurcation analysis of the fast subsystem of a polynomial phantom burster model
×
引用
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