西尔平斯基地毯上随机场的插值问题

Viktoriia Boichenko, Nataly Shchestyuk, Anastasiia Florenko
{"title":"西尔平斯基地毯上随机场的插值问题","authors":"Viktoriia Boichenko, Nataly Shchestyuk, Anastasiia Florenko","doi":"10.18523/2617-70806202328-34","DOIUrl":null,"url":null,"abstract":"The prediction of stochastic processes and the estimation of random fields of different natures is becoming an increasingly common field of research among scientists of various specialties. However, an analysis of papers across different estimating problems shows that a dynamic approach over an iterative and recursive interpolation of random fields on fractal is still an open area of investigation. There are many papers related to the interpolation problems of stationary sequences, estimation of random fields, even on the perforated planes, but all of this still provides a place for an investigation of a more complicated structure like a fractal, which might be more beneficial in appliances of certain industry fields. For example, there has been a development of mobile phone and WiFi fractal antennas based on a first few iterations of the Sierpinski carpet. In this paper, we introduce an estimation for random fields on the Sierpinski carpet, based on the usage of the known spectral density, and calculation of the spectral characteristic that allows an estimation of the optimal linear functional of the omitted points in the field. We give coverage of an idea of stationary sequence estimating that is necessary to provide a basic understanding of the approach of the interpolation of one or a set of omitted values. After that, the expansion to random fields allows us to deduce a dynamic approach on the iteration steps of the Sierpinski carpet. We describe the numerical results of the initial iteration steps and demonstrate a recurring pattern in both the matrix of Fourier series coefficients of the spectral density and the result of the optimal linear functional estimation. So that it provides a dependency between formulas of the different initial sizes of the field as well as a possible generalizing of the solution for N-steps in the Sierpinski carpet. We expect that further evaluation of the mean squared error of this estimation can be used to identify the possible iteration step when further estimation becomes irrelevant, hence allowing us to reduce the cost of calculations and make the process viable.","PeriodicalId":404986,"journal":{"name":"Mohyla Mathematical Journal","volume":" 9","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interpolation problems for random fields on Sierpinski’s carpet\",\"authors\":\"Viktoriia Boichenko, Nataly Shchestyuk, Anastasiia Florenko\",\"doi\":\"10.18523/2617-70806202328-34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prediction of stochastic processes and the estimation of random fields of different natures is becoming an increasingly common field of research among scientists of various specialties. However, an analysis of papers across different estimating problems shows that a dynamic approach over an iterative and recursive interpolation of random fields on fractal is still an open area of investigation. There are many papers related to the interpolation problems of stationary sequences, estimation of random fields, even on the perforated planes, but all of this still provides a place for an investigation of a more complicated structure like a fractal, which might be more beneficial in appliances of certain industry fields. For example, there has been a development of mobile phone and WiFi fractal antennas based on a first few iterations of the Sierpinski carpet. In this paper, we introduce an estimation for random fields on the Sierpinski carpet, based on the usage of the known spectral density, and calculation of the spectral characteristic that allows an estimation of the optimal linear functional of the omitted points in the field. We give coverage of an idea of stationary sequence estimating that is necessary to provide a basic understanding of the approach of the interpolation of one or a set of omitted values. After that, the expansion to random fields allows us to deduce a dynamic approach on the iteration steps of the Sierpinski carpet. We describe the numerical results of the initial iteration steps and demonstrate a recurring pattern in both the matrix of Fourier series coefficients of the spectral density and the result of the optimal linear functional estimation. So that it provides a dependency between formulas of the different initial sizes of the field as well as a possible generalizing of the solution for N-steps in the Sierpinski carpet. We expect that further evaluation of the mean squared error of this estimation can be used to identify the possible iteration step when further estimation becomes irrelevant, hence allowing us to reduce the cost of calculations and make the process viable.\",\"PeriodicalId\":404986,\"journal\":{\"name\":\"Mohyla Mathematical Journal\",\"volume\":\" 9\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mohyla Mathematical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18523/2617-70806202328-34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mohyla Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18523/2617-70806202328-34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随机过程的预测和不同性质随机场的估算正日益成为各专业科学家的研究领域。然而,对不同估计问题的论文分析表明,对分形上的随机场进行迭代和递归插值的动态方法仍然是一个有待研究的领域。有许多论文涉及静态序列的插值问题、随机场的估计问题,甚至是穿孔平面上的插值问题,但所有这些仍然为研究分形这种更复杂的结构提供了空间,这可能对某些行业领域的应用更有益处。例如,在西尔平斯基地毯最初几次迭代的基础上,已经开发出了手机和 WiFi 分形天线。在本文中,我们介绍了一种基于已知谱密度的西尔平斯基地毯随机场估算方法,通过计算谱特征,可以估算出场中省略点的最优线性函数。我们介绍了静态序列估计的概念,这对于提供对一个或一组省略值的插值方法的基本理解是必要的。之后,通过对随机场的扩展,我们可以推导出西尔平斯基地毯迭代步骤的动态方法。我们描述了初始迭代步骤的数值结果,并展示了频谱密度傅里叶级数系数矩阵和最优线性函数估计结果中的重复模式。因此,它提供了场的不同初始大小的公式之间的依赖关系,以及在 Sierpinski 地毯中对 N 步求解的可能概括。我们希望通过进一步评估这种估计的均方误差,来确定在进一步估计变得无关紧要时可能的迭代步骤,从而降低计算成本,使这一过程可行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interpolation problems for random fields on Sierpinski’s carpet
The prediction of stochastic processes and the estimation of random fields of different natures is becoming an increasingly common field of research among scientists of various specialties. However, an analysis of papers across different estimating problems shows that a dynamic approach over an iterative and recursive interpolation of random fields on fractal is still an open area of investigation. There are many papers related to the interpolation problems of stationary sequences, estimation of random fields, even on the perforated planes, but all of this still provides a place for an investigation of a more complicated structure like a fractal, which might be more beneficial in appliances of certain industry fields. For example, there has been a development of mobile phone and WiFi fractal antennas based on a first few iterations of the Sierpinski carpet. In this paper, we introduce an estimation for random fields on the Sierpinski carpet, based on the usage of the known spectral density, and calculation of the spectral characteristic that allows an estimation of the optimal linear functional of the omitted points in the field. We give coverage of an idea of stationary sequence estimating that is necessary to provide a basic understanding of the approach of the interpolation of one or a set of omitted values. After that, the expansion to random fields allows us to deduce a dynamic approach on the iteration steps of the Sierpinski carpet. We describe the numerical results of the initial iteration steps and demonstrate a recurring pattern in both the matrix of Fourier series coefficients of the spectral density and the result of the optimal linear functional estimation. So that it provides a dependency between formulas of the different initial sizes of the field as well as a possible generalizing of the solution for N-steps in the Sierpinski carpet. We expect that further evaluation of the mean squared error of this estimation can be used to identify the possible iteration step when further estimation becomes irrelevant, hence allowing us to reduce the cost of calculations and make the process viable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信