检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南农业大学工程基础教学与训练中心,广东广州510642 [2]广东技术师范学院机电学院,广东广州510635
出 处:《广州城市职业学院学报》2015年第2期54-57,共4页Journal Of Guangzhou City Polytechnic
摘 要:COOK算例没有理论解,文献中常用的参考解与大量优秀单元的计算解有较明显差别,影响了对单元性能的客观公正评价。为获得更准确、更可靠的计算解,分别用4-40次高次元和Q8、T6、QM6低次元进行逼近,考察算例的有限元渐进收敛解。结果表明,在5位有效数字下该问题的解为vC=23.967,σAmax=0.23687,σBmax=-0.20352。With no theoretical solution found with Cook' s problem, numerical solution is used for it, but the commonly used one often shows obvious difference with those of large number of outstanding elements, which affects objective and fair evaluation to the element performance. In order to obtain more accurate and reliable numerical solution, high-order elements of 4-40 order and low-order elements of QS, T6, Qm6 are used to investigate this problem' s progressive convergence solution respectively. Results show that the problem' s solution in five significant digits is vC = 23.967, sAmax = 0.23687, sBmin = -0.203 52.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30