arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv 1507.00596math.NAcs.NA
收藏

一种快速且条件良好的谱方法用于奇异积分方程

A fast and well-conditioned spectral method for singular integral equations

University of Manitoba(曼尼托巴大学);The University of Sydney(悉尼大学)

Richard Mikael Slevinsky, Sheehan Olver

AI总结:

本文提出一种利用切比雪夫和超球面多项式将单变量奇异积分方程转化为近带状无限维系统的方法,通过低秩近似稀疏表示双变量核,实现O(m²n)复杂度的求解,且在多次右端侧时可降至O(mn)。

摘要:

我们开发了一种谱方法,用于求解单变量奇异积分方程,通过利用切比雪夫和超球面多项式将方程转换为近带状无限维系统。这通过利用低秩近似来稀疏表示双变量核实现。所得到的系统可通过适应性QR分解在O(m²n)操作中求解,其中m是带宽,n是解决真实解所需的最优未知数数量。通过预缓存QR分解,当相同算子用于多个右端侧时,复杂度可降至O(mn)。通过证明所得线性算子可以对角预条件化为身份算子的紧扰动,证明了稳定性。考虑的应用包括法拉第笼、声散射的亥姆霍兹和重力亥姆霍兹方程,包括谱准确的远场和近场解的数值评估。Julia软件包SingularIntegralEquations.jl实现了我们的方法,具有方便、用户友好的接口。

英文摘要:

We develop a spectral method for solving univariate singular integral equations over unions of intervals by utilizing Chebyshev and ultraspherical polynomials to reformulate the equations as almost-banded infinite-dimensional systems. This is accomplished by utilizing low rank approximations for sparse representations of the bivariate kernels. The resulting system can be solved in ${\cal O}(m^2n)$ operations using an adaptive QR factorization, where $m$ is the bandwidth and $n$ is the optimal number of unknowns needed to resolve the true solution. The complexity is reduced to ${\cal O}(m n)$ operations by pre-caching the QR factorization when the same operator is used for multiple right-hand sides. Stability is proved by showing that the resulting linear operator can be diagonally preconditioned to be a compact perturbation of the identity. Applications considered include the Faraday cage, and acoustic scattering for the Helmholtz and gravity Helmholtz equations, including spectrally accurate numerical evaluation of the far- and near-field solution. The Julia software package SingularIntegralEquations.jl implements our method with a convenient, user-friendly interface.

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

↑