Numerical evaluation of singular integrals on non-disjoint self-similar fractal sets

Numerical evaluation of singular integrals on non-disjoint self-similar fractal sets
复制标题

非不相交自相似分形集奇异积分的数值计算

DOI:
10.1007/s11075-023-01705-8
复制
发表时间:
2023
影响因子:
2.1
通讯作者:
Gibbs A
Gibbs A
中科院分区:
数学3区
文献类型:
--
作者:
Gibbs A

文献摘要

参考文献

被引文献

相似文献

我们考虑了一类关于自相似分形集(迭代函数系的吸引子)上的一对自相似测度的重积分的数值计算,该集具有对数或代数型的弱奇异被积。在最近的一篇论文中(Gibbs等人诺默。算法92,2071-21242023),证明了当分形集是一定意义上的“不相交”时(例如Cantor集),可以利用被积函数的自相似性,结合被积函数的齐性性质,将奇异积分精确地表示为正则积分,便于数值逼近。在这篇文章中,我们提出了一种方法,将这些结果推广到分形图不相交但不重叠的情况(在开集条件成立的意义下)。我们的方法适用于许多著名的例子,包括Sierpinski三角形、Vicsek分形图、Sierpinski地毯和科赫雪花。
We consider the numerical evaluation of a class of double integrals with respect to a pair of self-similar measures over a self-similar fractal set (the attractor of an iterated function system), with a weakly singular integrand of logarithmic or algebraic type. In a recent paper (Gibbs et al. Numer. Algorithms92, 2071–2124 2023), it was shown that when the fractal set is “disjoint” in a certain sense (an example being the Cantor set), the self-similarity of the measures, combined with the homogeneity properties of the integrand, can be exploited to express the singular integral exactly in terms of regular integrals, which can be readily approximated numerically. In this paper, we present a methodology for extending these results to cases where the fractal is non-disjoint but non-overlapping (in the sense that the open set condition holds). Our approach applies to many well-known examples including the Sierpinski triangle, the Vicsek fractal, the Sierpinski carpet, and the Koch snowflake.
DOI: 10.1007/s00211-021-01182-y
发表时间: 2021
影响因子: 2.1
作者:
Chandler-Wilde S
通讯作者: Chandler-Wilde S
使用自相似性评估积分
DOI: --
发表时间: 2000
期刊: The American mathematical monthly
影响因子: --
作者:
R. Strichartz
通讯作者: R. Strichartz
DOI: --
发表时间: 2010
期刊: J. Num. Math.
影响因子: --
作者:
P. Meszmer
通讯作者: P. Meszmer
DOI: 10.1007/s11075-022-01378-9
发表时间: 2022
影响因子: 2.1
作者:
Gibbs A
通讯作者: Gibbs A
DOI: --
发表时间: 2009
期刊:
影响因子: --
作者:
F. Calabrò;A. Esposito
通讯作者: A. Esposito