检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨峰 罗世杰 杨江鸿 王英俊 YANG Feng;LUO Shijie;YANG Jianghong;WANG Yingjun(National Engineering Research Center of Novel Equipment for Polymer Processing,School of Mechanical and Automotive Engineering,South China University of Technology,Guangzhou,510641;State Key Laboratory of Digital Manufacturing Equipment and Technology,Huazhong University of Science and Technology,Wuhan,430074)
机构地区:[1]华南理工大学机械与汽车工程学院聚合物新型成型装备国家工程研究中心,广州510641 [2]华中科技大学数字制造装备与技术国家重点实验室,武汉430074
出 处:《中国机械工程》2024年第4期602-613,共12页China Mechanical Engineering
基 金:国家自然科学基金(52075184);数字制造装备与技术国家重点实验室开放基金(DMETKF2021020)。
摘 要:针对大规模等几何拓扑优化(ITO)计算量巨大、传统求解方法效率低的问题,提出了一种基于样条h细化的高效多重网格方程求解方法。该方法利用h细化插值得到粗细网格之间的权重信息,然后构造多重网格方法的插值矩阵,获得更准确的粗细网格映射信息,从而提高求解速度。此外,对多重网格求解过程进行分析,构建其高效GPU并行算法。数值算例表明,所提出的求解方法与线性插值的多重网格共轭梯度法、代数多重网格共轭梯度法和预处理共轭梯度法相比分别取得了最高1.47、11.12和17.02的加速比。GPU并行求解相对于CPU串行求解的加速比高达33.86,显著提高了大规模线性方程组的求解效率。An efficient multi-grid equation solving method was proposed based on the h-refinement of splines to address the challenges posed by large-scale ITO computation and low efficiency of traditional solving methods.By the proposed method,the weight information obtained through h-refinement interpolation between coarse and fine grids was used to construct the interpolation matrix of the multi-grid method,thereby enhancing the accuracy of mapping information for both coarse and fine grids and improving computational efficiency.Additionally,a comprehensive analysis of the multi-grid solving process was conducted,culminating in the development of an efficient GPU parallel algorithm.Numerical examples illustrate that the proposed method outperforms existing methods,demonstrating speedup ratios of 1.47,11.12,and 17.02 in comparison to the linear interpolation multi-grid conjugate gradient method algebraic multi-grid conjugate gradient method,and pre-processing conjugate gradient method respectively.Furthermore,the acceleration rate of GPU parallel solution surpasses that of CPU serial solution by 33.86 times,which significantly enhances the efficiency of solving large-scale linear equations.
关 键 词:等几何拓扑优化 方程组求解 h细化 多重网格法 GPU并行计算
分 类 号:TH122[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15