首页> 外文期刊>SIAM Journal on Scientific Computing >FAST STRUCTURED DIRECT SPECTRAL METHODS FOR DIFFERENTIAL EQUATIONS WITH VARIABLE COEFFICIENTS, I. THE ONE-DIMENSIONAL CASE
【24h】

FAST STRUCTURED DIRECT SPECTRAL METHODS FOR DIFFERENTIAL EQUATIONS WITH VARIABLE COEFFICIENTS, I. THE ONE-DIMENSIONAL CASE

机译:具有可变系数的微分方程的快速结构直接谱方法,I。一维情况

获取原文
获取原文并翻译 | 示例
           

摘要

We study the rank structures of the matrices in Fourier-and Chebyshev-spectral methods for differential equations with variable coefficients in one dimension. We show analytically that these matrices have a so-called low-rank property, not only for constant or smooth variable coefficients, but also for coefficients with steep gradients and/or high variations (large ratios in their maximum-minimum function values). We develop a matrix-free direct spectral solver, which uses only a small number of matrix-vector products to construct a structured approximation to the original discretized matrix A, without the need to explicitly form A. This is followed by fast structured matrix factorizations and solutions. The overall direct spectral solver has O(N log(2) N) complexity and O(N) memory requirement. Numerical tests for several important but notoriously difficult problems show the superior efficiency and accuracy of our direct spectral solver, especially when iterative methods have severe difficulties in the convergence.
机译:我们研究了一维变系数微分方程的傅里叶和Chebyshev谱方法的矩阵的秩结构。我们从分析上证明,这些矩阵具有所谓的低秩属性,不仅对于恒定或平滑的可变系数,而且对于具有陡峭梯度和/或高变化(其最大-最小函数值的比例较大)的系数也是如此。我们开发了一种无矩阵直接光谱求解器,该求解器仅使用少量矩阵向量乘积即可构建原始离散矩阵A的结构化近似,而无需显式地形成A。解决方案。整体直接光谱求解器具有O(N log(2)N)复杂度和O(N)内存需求。对几个重要但众所周知的困难问题的数值测试表明,我们的直接频谱求解器具有出色的效率和准确性,尤其是在迭代方法在收敛时遇到严重困难的情况下。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号