...
首页> 外文期刊>SIAM Journal on Numerical Analysis >Wavelet discretizations of parabolic integrodifferential equations
【24h】

Wavelet discretizations of parabolic integrodifferential equations

机译:抛物线积分微分方程的小波离散化

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

获取外文期刊封面封底 >>

       

摘要

We consider parabolic problems. (u) over dot + Au = f in (0, T) x Omega, T < &INFIN;, where &UOmega; &SUB; R-d is a bounded domain and A is a strongly elliptic classical pseudodifferential operator of order ρ &ISIN; [0, 2] in <(H)over tilde>(rho/2)(Omega). We use theta-scheme for time discretization and a Galerkin method with N degrees of freedom for space discretization. The full Galerkin matrix for A can be replaced with a sparse matrix using a wavelet basis, and the linear systems for each time step are solved approximatively with GMRES. We prove that the total cost of the algorithm for M time steps is bounded by O(M N(log N)(beta)) operations and O(N(log N)(beta)) memory. We show that the algorithm gives optimal convergence rates ( up to logarithmic terms) for the computed solution with respect to L-2 in time and the energy norm in space. [References: 18]
机译:我们考虑抛物线问题。 (u)点+ Au = f在(0,T)x Omega,T <&INFIN;中,其中&UOmega; &SUB; R-d是有界域,A是阶ρ&ISIN的强椭圆经典伪微分算子。 <(H)over tilde>(rho / 2)(Omega)中的[0,2]。我们使用theta方案进行时间离散化,并使用具有N个自由度的Galerkin方法进行空间离散化。可以使用小波将稀疏矩阵替换为A的完整Galerkin矩阵,并使用GMRES近似求解每个时间步长的线性系统。我们证明了M个时间步长算法的总成本受O(MN(log N)β)操作和O(N(log N)β)内存限制。我们表明,该算法针对时间L-2和空间能量范数给出了计算解的最优收敛速度(最高达对数项)。 [参考:18]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号