首页> 外文学位 >Solution techniques for sparse systems of equations arising in the finite element method.
【24h】

Solution techniques for sparse systems of equations arising in the finite element method.

机译:有限元方法中产生的稀疏方程组的求解技术。

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

摘要

Today, finite element method has become an integral part of many engineering designs, and the solution of sparse systems of equations is generally the most computationally intensive step in the solution of finite element problems. The direct solution of sparse linear systems of equations on vector and parallel architectures is the topic of this thesis. Several topics are described here which are all aimed at the solution of very large systems of equations using the multifrontal method, and are all intended to improve the efficiency of the solution step in terms of computation time, and other resources such as memory and secondary storage requirements.; Some background information is first presented on the finite element method and the solution techniques used to solve the sparse systems of equations arising in this field. An efficient method for solving very large systems of equations with very small memory requirements is described next. The results presented show that it is possible to implement an efficient out-of-core multifrontal solver. This will enable users to solve much larger problems on a given machine and to increase throughput in multiuser environments.; An ordering method suitable for indefinite matrices is presented next which is a variation on the minimum degree method. This method is found to be superior to the basic minimum degree ordering when applied to indefinite systems of equations which include Lagrange multipliers representing constraint equations.; A memory efficient method which enhances parallelism is described next. This method which is based on the Jess and Kees algorithm takes advantage of the finite element grid connectivity information to reduce the CPU time and memory requirements of the Jess and Kees algorithm.; An efficient method of solving systems of equations with many right hand side vectors is also presented. This method shows particular advantages in systems which consist of several smaller decoupled systems or systems whose inverse is also sparse. Finally, Concluding remarks and some recommendations on future work in the area is given.
机译:如今,有限元方法已成为许多工程设计的组成部分,而稀疏方程组的求解通常是求解有限元问题中计算量最大的步骤。在矢量和并行结构上,稀疏线性方程组的直接求解是本文的主题。这里描述了几个主题,这些主题都旨在使用多前沿方法求解非常大的方程组,并且都旨在提高求解步骤在计算时间以及其他资源(例如内存和二级存储)方面的效率。要求。;首先介绍一些有关有限元方法的背景信息以及用于解决该领域中稀疏方程组的求解技术。接下来描述解决具有非常小的存储需求的非常大的方程组的有效方法。给出的结果表明,可以实现高效的核心外多正面求解器。这将使用户能够解决给定计算机上更大的问题,并提高多用户环境中的吞吐量。接下来介绍一种适用于不确定矩阵的排序方法,它是最小度方法的一种变体。当应用于包括表示约束方程的拉格朗日乘子的不定方程组时,该方法优于基本的最小次数排序。接下来描述增强并行性的存储器有效方法。这种基于Jess and Kees算法的方法利用有限元网格连通性信息来减少Jess and Kees算法的CPU时间和内存需求。还提出了一种求解具有许多右侧向量的方程组的有效方法。这种方法在由几个较小的解耦系统或逆系统也很稀疏的系统组成的系统中显示出特别的优势。最后,给出了结语和有关该领域未来工作的一些建议。

著录项

  • 作者

    Shamsian, Shahriar.;

  • 作者单位

    University of California, Los Angeles.;

  • 授予单位 University of California, Los Angeles.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 1996
  • 页码 87 p.
  • 总页数 87
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号