首页> 外文学位 >Spacetime meshing for discontinuous Galerkin methods.
【24h】

Spacetime meshing for discontinuous Galerkin methods.

机译:时空网格用于不连续的Galerkin方法。

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

摘要

Important applications in science and engineering, such as modeling traffic flow, seismic waves, electromagnetics, and the simulation of mechanical stresses in materials, require the high-fidelity numerical solution of hyperbolic partial differential equations (PDEs) in space and time variables. Spacetime discontinuous Galerkin (SDG) finite element methods are used to solve such PDEs arising from wave propagation phenomena.; To support an accurate and efficient solution procedure using SDG methods and to exploit the flexibility of these methods, we give a meshing algorithm to construct an unstructured simplicial spacetime mesh over an arbitrary simplicial space domain. Our algorithm is the first adaptive spacetime meshing algorithm suitable for efficient solution of nonlinear phenomena using spacetime discontinuous Galerkin finite element methods. Given a triangulated d-dimensional Euclidean space domain M (a simplicial complex) corresponding to time t = 0 and initial conditions of the underlying hyperbolic spacetime PDE, we construct an unstructured simplicial mesh of the ( d + 1)-dimensional spacetime domain O. Our algorithm uses a near-optimal number of spacetime elements, each with bounded temporal aspect ratio for any finite prefix of O. When d ≤ 2, our algorithm varies the size of spacetime elements to an a posteriori numerical estimate. Certain facets of our mesh satisfy gradient constraints that allow interleaving mesh generation with the SDG salver. Our meshing algorithm thus supports an efficient parallelizable solution strategy by SDG methods.
机译:科学和工程学中的重要应用,例如对交通流,地震波,电磁学进行建模以及材料中的机械应力的模拟,都要求在时空变量中使用双精度偏微分方程(PDE)的高保真数值解。时空不连续伽勒金(SDG)有限元方法用于解决由波传播现象引起的PDE。为了支持使用SDG方法的准确而有效的求解过程并利用这些方法的灵活性,我们给出了一种网格划分算法,可以在任意简单的空间域上构造非结构化的简单时空网格。我们的算法是第一个适用于使用时空不连续Galerkin有限元方法有效解决非线性现象的自适应时空网格划分算法。给定与时间t = 0对应的三角d维欧氏空间域M(一个单纯形复数)以及底层双曲线时空PDE的初始条件,我们构造了一个(d +1)维时空域O的非结构化简单网格。我们的算法使用接近最佳数量的时空元素,每个时空元素的O的任何有限前缀都具有有限的时间长宽比。当d≤2时,我们的算法会将时空元素的大小更改为后验数值估计。我们网格的某些面满足梯度约束,可以与SDG托盘交错生成网格。因此,我们的网格划分算法通过SDG方法支持有效的可并行化求解策略。

著录项

  • 作者

    Thite, Shripad Vidyadhar.;

  • 作者单位

    University of Illinois at Urbana-Champaign.;

  • 授予单位 University of Illinois at Urbana-Champaign.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 123 p.
  • 总页数 123
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号