检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邓衍亚 李伟伟 林继[1] 陈文[1] DENG Yanya;LI Weiwei;LIN Ji;CHEN Wen(Department of Engineering Mechanics, Hohai University, Nanjing 211100, Jiangsu, China)
机构地区:[1]河海大学力学与材料学院,江苏南京211100
出 处:《力学季刊》2019年第1期32-38,共7页Chinese Quarterly of Mechanics
基 金:国家自然科学基金(11702083;11572111)
摘 要:本文采用边界节点法(Boundary Knot Method, BKM)求解三维高频声场.由于高频赫姆霍兹方程的解是振荡的,极大影响了数值求解的精确度,需要在计算区域增加离散点,这会增加计算量.同时对于大规模声学问题,依靠边界节点法形成的插值矩阵为满秩,导致计算量过高和存储量过大.所以本文采用矩阵压缩技术(Matrix Compression, MC),在有效继承边界节点法高精确度的基础上减少计算内存需求和时间,从而提高计算效率.数值实验表明,MC-BKM求解精度高、收敛速度快、计算时间少,在高频大规模声波问题中应用前景广泛.In this paper, the boundary knot method is used to solve three-dimensional high frequency sound field. Because the solution of high frequency Helmholtz equation is oscillatory, which greatly affects the accuracy of numerical solution, it is necessary to add discrete points in the computational region, leading to the increase of calculation cost. At the same time, for large-scale acoustic problems, the interpolation matrix formed by the boundary knot method is full rank, resulting in excessive computation and excessive storage. The introduction of matrix compression technology can effectively reduce the memory requirement and time while at the same time effectively inherits the high accuracy of the boundary node method, leading to a significant improvement of the computational efficiency. Numerical experiments show that MC-BKM has high accuracy, fast convergence speed and less computation time, and has a wide application prospect in high frequency large scale acoustic wave problems.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3