arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.2704math.NAcs.NA
收藏

高阶边界条件的快速变换

Fast transforms for high order boundary conditions

Università dell’Insubria(因苏布里亚大学)

Marco Donatelli

AI总结:

通过选择合适的功能基,在保持与快速傅里叶变换相同复杂度的前提下,提高模糊模型的精度,并扩展到非对称情况下的高阶多项式保持和快速计算。

摘要:

我们研究通过保持相关数值线性代数过程(矩阵-向量乘积、线性系统求解、特征值计算等)的复杂度与著名的快速傅里叶变换相同阶数,来提高模糊模型精度的策略。关键思想是选择合适的功能基来表示信号和图像。从分析[S. Serra Capizzano, SIAM J. Sci. Comput. 25-3 pp. 1307--1325]中引入的反反射边界条件相关的模糊矩阵的谱分解出发,我们扩展了模型,以在非对称情况下也能保持高阶多项式和快速计算。我们将所提出的模型应用于带有平滑范数的Tikhonov正则化和用于选择正则化参数的广义交叉验证。一系列数值实验表明了所提出技术的有效性。

英文摘要:

We study strategies for increasing the precision in the blurring models by maintaining a complexity in the related numerical linear algebra procedures (matrix-vector product, linear system solution, computation of eigenvalues etc.) of the same order of the celebrated Fast Fourier Transform. The key idea is the choice of a suitable functional basis for representing signals and images. Starting from an analysis of the spectral decomposition of blurring matrices associated to the antireflective boundary conditions introduced in [S. Serra Capizzano, SIAM J. Sci. Comput. 25-3 pp. 1307--1325], we extend the model for preserving polynomials of higher degree and fast computations also in the nonsymmetric case. We apply the proposed model to Tikhonov regularization with smoothing norms and the generalized cross validation for choosing the regularization parameter. A selection of numerical experiments shows the effectiveness of the proposed techniques.

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

↑