首页> 美国卫生研究院文献>other >A conservative algorithm for parabolic problems in domains withmoving boundaries
【2h】

A conservative algorithm for parabolic problems in domains withmoving boundaries

机译:具有时域抛物型问题的保守算法。移动边界

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We describe a novel conservative algorithm for parabolic problems in domains with moving boundaries developed for modeling in cell biology. The spatial discretization is accomplished by applying Voronoi decomposition to a fixed rectangular grid. In the vicinity of the boundary, the procedure generates irregular Voronoi cells that conform to the domain shape and merge seamlessly with regular control volumes in the domain interior. Consequently, our algorithm is free of the CFL stability issue due to moving interfaces and does not involve cell-merging or mass redistribution. Local mass conservation is ensured by finite-volume discretization and natural-neighbor interpolation. Numerical experiments with two-dimensional geometries demonstrate exact mass conservation and indicate an order of convergence in space between one and two. The use of standard meshing techniques makes extension of the method to three dimensions conceptually straightforward.
机译:我们描述了一种新颖的保守算法,该算法针对具有移动边界的领域中的抛物线问题开发了用于细胞生物学建模的方法。通过将Voronoi分解应用于固定的矩形网格,可以实现空间离散化。在边界附近,该过程生成不规则的Voronoi单元,这些单元符合域的形状并与域内部的常规控制量无缝合并。因此,由于接口移动,我们的算法没有CFL稳定性问题,并且不涉及单元合并或质量重新分配。通过有限体积离散化和自然邻域插值可确保局部质量守恒。具有二维几何形状的数值实验证明了精确的质量守恒,并指出了一到两个空间的收敛顺序。标准网格划分技术的使用使方法在概念上可以扩展到三个维度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号