Matrix solvers for flow simulation by the finite element method

Nacer E. El Kadri E., A. Chillali
{"title":"Matrix solvers for flow simulation by the finite element method","authors":"Nacer E. El Kadri E., A. Chillali","doi":"10.1109/ISACS48493.2019.9068924","DOIUrl":null,"url":null,"abstract":"Following the finite element discretization of the Navier-Stokes equations we obtain a nonlinear matrix system. The resolution of this system by the iterative method of Newton-Raphson requires at each iteration the factorization of a matrix of the same size and the same structure as the matrix of the system. The storage space required for storage and the machine time required for their factorization become excessive. For industrial problems (3D problems or even in 2D), It is practically impossible to work with matrices, the memory space to store them is out of reach of current computers. To overcome this problem, the linear systems resulting from the Newton-Raphson algorithm are solved by the GMRES (Generalized Minimal RESidual) algorithm. The structure of the GMRES algorithm makes that we never have matrices to evaluate, but only the action of a matrix on a vector. Convergence is accelerated using a pre-conditioning technique. The diagonal pre-conditioning that we have developed is simple and effective.","PeriodicalId":312521,"journal":{"name":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACS48493.2019.9068924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Following the finite element discretization of the Navier-Stokes equations we obtain a nonlinear matrix system. The resolution of this system by the iterative method of Newton-Raphson requires at each iteration the factorization of a matrix of the same size and the same structure as the matrix of the system. The storage space required for storage and the machine time required for their factorization become excessive. For industrial problems (3D problems or even in 2D), It is practically impossible to work with matrices, the memory space to store them is out of reach of current computers. To overcome this problem, the linear systems resulting from the Newton-Raphson algorithm are solved by the GMRES (Generalized Minimal RESidual) algorithm. The structure of the GMRES algorithm makes that we never have matrices to evaluate, but only the action of a matrix on a vector. Convergence is accelerated using a pre-conditioning technique. The diagonal pre-conditioning that we have developed is simple and effective.
流动有限元模拟的矩阵求解方法
对Navier-Stokes方程进行有限元离散,得到一个非线性矩阵系统。用Newton-Raphson迭代法求解该系统需要在每次迭代中分解一个与系统的矩阵具有相同大小和相同结构的矩阵。存储所需的存储空间和分解所需的机器时间变得过多。对于工业问题(3D问题甚至2D问题),使用矩阵实际上是不可能的,存储它们的存储空间超出了当前计算机的范围。为了克服这一问题,采用广义最小残差(GMRES)算法对Newton-Raphson算法得到的线性系统进行求解。GMRES算法的结构使得我们从来不需要计算矩阵,而只需要计算矩阵对向量的作用。使用预处理技术加速收敛。我们开发的对角线预处理方法简单有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信