期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
用莫顿序对BH算法的改进
1
作者 赖国明 杨圣云 袁德辉 《韩山师范学院学报》 2006年第6期19-23,共5页
详细分析Barnes-Hut算法的基本原理,介绍BH空间的分割和BH树的创建,并用伪码方式描述了BH算法,同时介绍了Z序的生成方法.利用莫顿映射得到粒子的键值对粒子进行排序,由于N-Body仿真粒子的位移很小,有序的粒子经过一步仿真后基本保持有序... 详细分析Barnes-Hut算法的基本原理,介绍BH空间的分割和BH树的创建,并用伪码方式描述了BH算法,同时介绍了Z序的生成方法.利用莫顿映射得到粒子的键值对粒子进行排序,由于N-Body仿真粒子的位移很小,有序的粒子经过一步仿真后基本保持有序.因为对有序粒子的排序和用有序粒子来建BH树的时间复杂度都为O(n),文章提出了对BH算法进行改进的一种方法,使得其时间复杂度从O(nlogn)降为O(n)。 展开更多
关键词 N—Body仿真 Barnes—Hut算法 莫顿 希尔伯特序
下载PDF
Weak(quasi-)affine bi-frames for reducing subspaces of L^2(R^d) 被引量:8
2
作者 JIA HuiFang LI YunZhang 《Science China Mathematics》 SCIE CSCD 2015年第5期1005-1022,共18页
Since a frame for a Hilbert space must be a Bessel sequence, many results on(quasi-)affine bi-frame are established under the premise that the corresponding(quasi-)affine systems are Bessel sequences. However,it is ve... Since a frame for a Hilbert space must be a Bessel sequence, many results on(quasi-)affine bi-frame are established under the premise that the corresponding(quasi-)affine systems are Bessel sequences. However,it is very technical to construct a(quasi-)affine Bessel sequence. Motivated by this observation, in this paper we introduce the notion of weak(quasi-)affine bi-frame(W(Q)ABF) in a general reducing subspace for which the Bessel sequence hypothesis is not needed. We obtain a characterization of WABF, and prove the equivalence between WABF and WQABF under a mild condition. This characterization is used to recover some related known results in the literature. 展开更多
关键词 FRAME bi-frame weak affine bi-frame weak quasi-affine bi-frame
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部