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

一种利用连续线性泛函的自适应算法

An Adaptive Algorithm Employing Continuous Linear Functionals

Misericordia University(密西里科大学);Illinois Institute of Technology(伊利诺伊理工学院)

Yuhan Ding, Fred J. Hickernell, Lluís Antoni Jiménez Rugama

AI总结:

本文提出了一种自适应算法,用于在Hilbert空间上近似一般的线性问题,利用输入函数的连续线性泛函(具体为傅里叶系数)来保证误差容忍度,且不需事先知道被近似函数的范数。

摘要:

自动算法试图提供近似解,其与精确解的差异不超过用户指定的误差容忍度。本文描述了一种自动、自适应的算法,用于近似一般线性问题在Hilbert空间中的解。该算法采用输入函数的连续线性泛函,特别是傅里叶系数。我们假设解的傅里叶系数衰减足够快,但不需要事先知道衰减率。我们还假设傅里叶系数衰减平稳,尽管不一定是单调的。在这些假设下,我们的自适应算法被证明能够产生满足所需误差容忍度的近似解,而无需事先知道被近似函数的范数。此外,我们的算法的计算成本被证明基本上不比最优算法更差。我们提供了一个数值实验来说明我们的算法。

英文摘要:

Automatic algorithms attempt to provide approximate solutions that differ from exact solutions by no more than a user-specified error tolerance. This paper describes an automatic, adaptive algorithm for approximating the solution to a general linear problem on Hilbert spaces. The algorithm employs continuous linear functionals of the input function, specifically Fourier coefficients. We assume that the Fourier coefficients of the solution decay sufficiently fast, but do not require the decay rate to be known a priori. We also assume that the Fourier coefficients decay steadily, although not necessarily monotonically. Under these assumptions, our adaptive algorithm is shown to produce an approximate solution satisfying the desired error tolerance, without prior knowledge of the norm of the function to be approximated. Moreover, the computational cost of our algorithm is shown to be essentially no worse than that of the optimal algorithm. We provide a numerical experiment to illustrate our algorithm.

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

↑