arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.07053math.NAcs.NA
收藏

细分方案的级别和参数依赖性的极限:一种矩阵方法

Limits of level and parameter dependent subdivision schemes: a matrix approach

Universität Wien(维也纳大学);University of Firenze(佛罗伦萨大学);University of L’Aquila(拉奎拉大学);Moscow State University(莫斯科国立大学)

Maria Charina, Costanza Conti, Nicola Guglielmi, Vladimir Protasov

AI总结:

本文提出一种矩阵方法分析依赖参数的细分方案收敛性及Hölder正则性,通过联合谱半径方法高效判断,并通过实例展示参数依赖的重要性及方案的限制。

摘要:

本文提出了一种新的矩阵方法,用于分析那些非站性源于参数线性依赖的细分方案。我们展示了如何通过联合谱半径方法高效检查在$C^{\ell}(\RR^s)$中的收敛性并确定此类级别和参数依赖的细分方案的Hölder正则性。该方法的效率及参数依赖的重要性通过多个改进相应站性方案性质的细分方案实例得到验证。此外,我们推导出函数由某些级别依赖方案生成的必要条件,从而揭示此类方案的限制。

英文摘要:

In this paper, we present a new matrix approach for the analysis of subdivision schemes whose non-stationarity is due to linear dependency on parameters whose values vary in a compact set. Indeed, we show how to check the convergence in $C^{\ell}(\RR^s)$ and determine the Hölder regularity of such level and parameter dependent schemes efficiently via the joint spectral radius approach. The efficiency of this method and the important role of the parameter dependency are demonstrated on several examples of subdivision schemes whose properties improve the properties of the corresponding stationary schemes. Moreover, we derive necessary criteria for a function to be generated by some level dependent scheme and, thus, expose the limitations of such schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑