GPU上求解Eikonal方程的并行多尺度FIM方法

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Jingqi Zhang , Zihao Zhou , Lixin Ren , Junyuan Liu , Ying Li , Xiaowei He
{"title":"GPU上求解Eikonal方程的并行多尺度FIM方法","authors":"Jingqi Zhang ,&nbsp;Zihao Zhou ,&nbsp;Lixin Ren ,&nbsp;Junyuan Liu ,&nbsp;Ying Li ,&nbsp;Xiaowei He","doi":"10.1016/j.cad.2025.103949","DOIUrl":null,"url":null,"abstract":"<div><div>Signed Distance Fields (SDFs) are essential in various applications, particularly in level set problems, where computing the SDF is equivalent to solving the Eikonal equation. Common approaches to solving these equations include the Fast Marching Method (FMM), the Fast Sweeping Method (FSM), and the Fast Iterative Method (FIM). However, FMM and FSM face significant challenges in parallelization, increasing interest in developing FIM for GPU architectures. In this paper, we extend the innovative FIM algorithm (Huang, 2021), which is GPU-friendly but relies on a single uniform grid, by incorporating multiscale techniques to accelerate wavefront propagation from source points to infinity. Unlike the traditional Fast Iterative Method, which operates on a single uniform grid and propagates the wavefront at a constant speed of one grid spacing per iteration, our multiscale approach applies a hierarchy of varying propagation speeds to accelerate the convergence. Once all source and infinite points are properly initialized, only a few FIM iterations are required to refine the values of points near the source. A coarser-grained scale, with twice the spacing of the finer grid, is then used to propagate values from accepted and tentative points to the outer regions. This process is repeated until the top-level scale is reached. Subsequently, we reverse this process by performing FIM calculations from the coarsest scale until reaching the finest grid, thereby completing a V-cycle. With multiscale V-cycles, the solution progressively converges across the entire computational domain. Comparative experimental results show that our algorithm improves computational efficiency by approximately 128% over the GPU-based Fast Marching Method and by a factor of 23 compared to the improved FIM algorithm (Huang, 2021) at scale of <span><math><mrow><mi>N</mi><mo>=</mo><mn>2</mn><mi>E</mi><mn>8</mn></mrow></math></span>. This optimized approach applies to numerical simulations of multi-body systems, including fluid–structure interactions, as well as numerical analyses of flooding and earthquake scenarios.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"189 ","pages":"Article 103949"},"PeriodicalIF":3.1000,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A parallel multiscale FIM approach in solving the Eikonal equation on GPU\",\"authors\":\"Jingqi Zhang ,&nbsp;Zihao Zhou ,&nbsp;Lixin Ren ,&nbsp;Junyuan Liu ,&nbsp;Ying Li ,&nbsp;Xiaowei He\",\"doi\":\"10.1016/j.cad.2025.103949\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Signed Distance Fields (SDFs) are essential in various applications, particularly in level set problems, where computing the SDF is equivalent to solving the Eikonal equation. Common approaches to solving these equations include the Fast Marching Method (FMM), the Fast Sweeping Method (FSM), and the Fast Iterative Method (FIM). However, FMM and FSM face significant challenges in parallelization, increasing interest in developing FIM for GPU architectures. In this paper, we extend the innovative FIM algorithm (Huang, 2021), which is GPU-friendly but relies on a single uniform grid, by incorporating multiscale techniques to accelerate wavefront propagation from source points to infinity. Unlike the traditional Fast Iterative Method, which operates on a single uniform grid and propagates the wavefront at a constant speed of one grid spacing per iteration, our multiscale approach applies a hierarchy of varying propagation speeds to accelerate the convergence. Once all source and infinite points are properly initialized, only a few FIM iterations are required to refine the values of points near the source. A coarser-grained scale, with twice the spacing of the finer grid, is then used to propagate values from accepted and tentative points to the outer regions. This process is repeated until the top-level scale is reached. Subsequently, we reverse this process by performing FIM calculations from the coarsest scale until reaching the finest grid, thereby completing a V-cycle. With multiscale V-cycles, the solution progressively converges across the entire computational domain. Comparative experimental results show that our algorithm improves computational efficiency by approximately 128% over the GPU-based Fast Marching Method and by a factor of 23 compared to the improved FIM algorithm (Huang, 2021) at scale of <span><math><mrow><mi>N</mi><mo>=</mo><mn>2</mn><mi>E</mi><mn>8</mn></mrow></math></span>. This optimized approach applies to numerical simulations of multi-body systems, including fluid–structure interactions, as well as numerical analyses of flooding and earthquake scenarios.</div></div>\",\"PeriodicalId\":50632,\"journal\":{\"name\":\"Computer-Aided Design\",\"volume\":\"189 \",\"pages\":\"Article 103949\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2025-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer-Aided Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0010448525001101\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448525001101","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

符号距离场(SDF)在各种应用中都是必不可少的,特别是在水平集问题中,计算SDF相当于求解Eikonal方程。求解这些方程的常用方法包括快速推进法(FMM)、快速清扫法(FSM)和快速迭代法(FIM)。然而,FMM和FSM在并行化方面面临重大挑战,这增加了开发GPU架构的FMM的兴趣。在本文中,我们扩展了创新的FIM算法(Huang, 2021),该算法对gpu友好,但依赖于单一均匀网格,通过结合多尺度技术来加速波前从源点到无穷远的传播。与传统的快速迭代方法不同,该方法在单个均匀网格上运行,每次迭代以一个网格间距的恒定速度传播波前,我们的多尺度方法采用不同传播速度的层次结构来加速收敛。一旦所有的源点和无限点都被正确初始化,只需要几个FIM迭代来细化源附近的点的值。然后使用粗粒度尺度(其间距是细网格的两倍)将值从可接受的和暂定的点传播到外部区域。这个过程不断重复,直到达到最高等级。随后,我们通过从最粗的尺度执行FIM计算,直到达到最细的网格,从而完成一个v循环,从而逆转这一过程。在多尺度v循环下,解逐步收敛于整个计算域。对比实验结果表明,在N=2E8的尺度下,我们的算法比基于gpu的快速行进方法提高了约128%的计算效率,比改进的FIM算法(Huang, 2021)提高了23倍。这种优化方法适用于多体系统的数值模拟,包括流固相互作用,以及洪水和地震情景的数值分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A parallel multiscale FIM approach in solving the Eikonal equation on GPU
Signed Distance Fields (SDFs) are essential in various applications, particularly in level set problems, where computing the SDF is equivalent to solving the Eikonal equation. Common approaches to solving these equations include the Fast Marching Method (FMM), the Fast Sweeping Method (FSM), and the Fast Iterative Method (FIM). However, FMM and FSM face significant challenges in parallelization, increasing interest in developing FIM for GPU architectures. In this paper, we extend the innovative FIM algorithm (Huang, 2021), which is GPU-friendly but relies on a single uniform grid, by incorporating multiscale techniques to accelerate wavefront propagation from source points to infinity. Unlike the traditional Fast Iterative Method, which operates on a single uniform grid and propagates the wavefront at a constant speed of one grid spacing per iteration, our multiscale approach applies a hierarchy of varying propagation speeds to accelerate the convergence. Once all source and infinite points are properly initialized, only a few FIM iterations are required to refine the values of points near the source. A coarser-grained scale, with twice the spacing of the finer grid, is then used to propagate values from accepted and tentative points to the outer regions. This process is repeated until the top-level scale is reached. Subsequently, we reverse this process by performing FIM calculations from the coarsest scale until reaching the finest grid, thereby completing a V-cycle. With multiscale V-cycles, the solution progressively converges across the entire computational domain. Comparative experimental results show that our algorithm improves computational efficiency by approximately 128% over the GPU-based Fast Marching Method and by a factor of 23 compared to the improved FIM algorithm (Huang, 2021) at scale of N=2E8. This optimized approach applies to numerical simulations of multi-body systems, including fluid–structure interactions, as well as numerical analyses of flooding and earthquake scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer-Aided Design
Computer-Aided Design 工程技术-计算机:软件工程
CiteScore
5.50
自引率
4.70%
发文量
117
审稿时长
4.2 months
期刊介绍: Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design. Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.
×
引用
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学术官方微信