• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种用于模拟中风患者脑动脉血流的并行非嵌套两级区域分解方法。

A parallel non-nested two-level domain decomposition method for simulating blood flows in cerebral artery of stroke patient.

作者信息

Chen Rongliang, Wu Bokai, Cheng Zaiheng, Shiu Wen-Shin, Liu Jia, Liu Liping, Wang Yongjun, Wang Xinhong, Cai Xiao-Chuan

机构信息

Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.

Shenzhen Key Laboratory for Exascale Engineering and Scientific Computing, Shenzhen, China.

出版信息

Int J Numer Method Biomed Eng. 2020 Nov;36(11):e3392. doi: 10.1002/cnm.3392. Epub 2020 Aug 28.

DOI:10.1002/cnm.3392
PMID:32783371
Abstract

Numerical simulation of blood flows in patient-specific arteries can be useful for the understanding of vascular diseases, as well as for surgery planning. In this paper, we simulate blood flows in the full cerebral artery of stroke patients. To accurately resolve the flow in this rather complex geometry with stenosis is challenging and it is also important to obtain the results in a short amount of computing time so that the simulation can be used in pre- and/or post-surgery planning. For this purpose, we introduce a highly scalable, parallel non-nested two-level domain decomposition method for the three-dimensional unsteady incompressible Navier-Stokes equations with an impedance outlet boundary condition. The problem is discretized with a stabilized finite element method on unstructured meshes in space and a fully implicit method in time, and the large nonlinear systems are solved by a preconditioned parallel Newton-Krylov method with a two-level Schwarz method. The key component of the method is a non-nested coarse problem solved using a subset of processor cores and its solution is interpolated to the fine space using radial basis functions. To validate and verify the proposed algorithm and its highly parallel implementation, we consider a case with available clinical data and show that the computed result matches with the measured data. Further numerical experiments indicate that the proposed method works well for realistic geometry and parameters of a full size cerebral artery of an adult stroke patient on a supercomputers with thousands of processor cores.

摘要

针对特定患者动脉内血液流动的数值模拟,对于理解血管疾病以及手术规划都可能是有用的。在本文中,我们模拟了中风患者全脑动脉内的血液流动。要在这种具有狭窄的相当复杂的几何形状中精确求解流动是具有挑战性的,并且在短计算时间内获得结果也很重要,以便该模拟可用于手术前和/或手术后的规划。为此,我们针对具有阻抗出口边界条件的三维非定常不可压缩纳维 - 斯托克斯方程,引入了一种高度可扩展的并行非嵌套两级区域分解方法。该问题在空间上用非结构化网格上的稳定有限元方法离散,在时间上用全隐式方法离散,并且通过具有两级施瓦茨方法的预处理并行牛顿 - 克里洛夫方法求解大型非线性系统。该方法的关键组件是使用一部分处理器核心求解的非嵌套粗问题,其解使用径向基函数插值到细网格空间。为了验证和检验所提出的算法及其高度并行实现,我们考虑一个具有可用临床数据的案例,并表明计算结果与测量数据相匹配。进一步的数值实验表明,所提出的方法在具有数千个处理器核心的超级计算机上,对于成年中风患者全尺寸脑动脉的实际几何形状和参数能很好地工作。

相似文献

1
A parallel non-nested two-level domain decomposition method for simulating blood flows in cerebral artery of stroke patient.一种用于模拟中风患者脑动脉血流的并行非嵌套两级区域分解方法。
Int J Numer Method Biomed Eng. 2020 Nov;36(11):e3392. doi: 10.1002/cnm.3392. Epub 2020 Aug 28.
2
An aneurysm-specific preconditioning technique for the acceleration of Newton-Krylov method with application in the simulation of blood flows.一种用于加速牛顿-克里洛夫方法的动脉瘤特异性预处理技术及其在血流模拟中的应用。
Int J Numer Method Biomed Eng. 2023 Dec;39(12):e3771. doi: 10.1002/cnm.3771. Epub 2023 Sep 9.
3
High-resolution cerebral blood flow simulation with a domain decomposition method and verified by the TCD measurement.采用区域分解方法进行高分辨率脑血流模拟,并通过 TCD 测量进行验证。
Comput Methods Programs Biomed. 2022 Sep;224:107004. doi: 10.1016/j.cmpb.2022.107004. Epub 2022 Jul 8.
4
Simulation of unsteady blood flows in a patient-specific compliant pulmonary artery with a highly parallel monolithically coupled fluid-structure interaction algorithm.采用高度并行的整体耦合流固耦合算法模拟具有特定顺应性的肺动脉内的非定常血流。
Int J Numer Method Biomed Eng. 2019 Jul;35(7):e3208. doi: 10.1002/cnm.3208. Epub 2019 May 20.
5
Simulation of branching blood flows on parallel computers.在并行计算机上模拟分支血流。
Biomed Sci Instrum. 2004;40:325-30.
6
A highly parallel simulation of patient-specific hepatic flows.一种高度并行的患者特异性肝血流模拟。
Int J Numer Method Biomed Eng. 2021 Jun;37(6):e3451. doi: 10.1002/cnm.3451. Epub 2021 Mar 3.
7
Efficient parallel simulation of hemodynamics in patient-specific abdominal aorta with aneurysm.在具有动脉瘤的患者特定腹主动脉中进行高效的血流动力学并行模拟。
Comput Biol Med. 2021 Sep;136:104652. doi: 10.1016/j.compbiomed.2021.104652. Epub 2021 Jul 24.
8
An efficient parallel simulation of unsteady blood flows in patient-specific pulmonary artery.在特定患者肺动脉中不稳定血流的高效并行模拟
Int J Numer Method Biomed Eng. 2018 Apr;34(4):e2952. doi: 10.1002/cnm.2952. Epub 2018 Feb 2.
9
Numerical simulation of local blood flow in the carotid and cerebral arteries under altered gravity.重力改变条件下颈动脉和脑动脉局部血流的数值模拟
J Biomech Eng. 2006 Apr;128(2):194-202. doi: 10.1115/1.2165691.
10
A Numerical Method for Solving the 3D Unsteady Incompressible Navier-Stokes Equations in Curvilinear Domains with Complex Immersed Boundaries.一种用于求解具有复杂浸入边界的曲线域中三维非定常不可压缩纳维-斯托克斯方程的数值方法。
J Comput Phys. 2007 Aug;225(2):1782-1809. doi: 10.1016/j.jcp.2007.02.017.

引用本文的文献

1
CT-FFR by expanding coronary tree with Newton-Krylov-Schwarz method to solve the governing equations of CFD.通过牛顿-克里洛夫-施瓦茨方法扩展冠状动脉树以求解计算流体动力学控制方程的CT-FFR。
Eur Heart J Imaging Methods Pract. 2024 Oct 24;2(3):qyae106. doi: 10.1093/ehjimp/qyae106. eCollection 2024 Jul.
2
A clinical trial for computed tomography myocardial perfusion based non-invasive index of microcirculatory resistance (MPBIMR): rationale and trial design.基于计算机断层扫描心肌灌注的微循环阻力无创指数(MPBIMR)的临床试验:原理与试验设计
Am J Transl Res. 2022 Aug 15;14(8):5552-5562. eCollection 2022.
3
Expanding the coronary tree reconstruction to smaller arteries improves the accuracy of FFR.
将冠状动脉树重建扩展到较小的动脉可以提高 FFR 的准确性。
Eur Radiol. 2021 Dec;31(12):8967-8974. doi: 10.1007/s00330-021-08012-7. Epub 2021 May 25.