首页> 外文会议>International conference on large-scale scientific computing >On the Differences of the Discrete Weak and Strong Maximum Principles for Elliptic Operators
【24h】

On the Differences of the Discrete Weak and Strong Maximum Principles for Elliptic Operators

机译:椭圆算子的离散弱和最大原理的区别

获取原文

摘要

When choosing a numerical method to approximate the solution of a continuous mathematical problem, we need to consider which method results in an approximation that is not only close to the solution of the original problem, but possesses the important qualitative properties of the original problem, too. For linear elliptic problems the main qualitative properties are the various maximum principles. The preservation of the weak maximum principle was extensively investigated in the last decades, but not the strong maximum principle preservation. In this paper we focus on the latter property by giving its necessary and sufficient conditions, investigating the relation of the preservation of the strong and weak maximum principles and illustrating the differences between them with numerous examples.
机译:在选择数值方法来逼近连续数学问题的解时,我们需要考虑哪种方法产生的逼近不仅接近于原始问题的解,而且​​还具有原始问题的重要定性性质。 。对于线性椭圆问题,主要的定性性质是各种最大原理。在过去的几十年中,对弱最大原理的保存进行了广泛的研究,但对强最大原理的保存却没有进行广泛的研究。在本文中,我们通过提供后者的必要条件和充分条件,着重研究后者的性质,研究强和弱最大原则的保存关系,并通过大量示例说明它们之间的差异。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号