首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5篇
  免费   1篇
综合类   1篇
数学   1篇
物理学   4篇
  2021年   1篇
  2020年   1篇
  2017年   1篇
  2010年   1篇
  2004年   2篇
排序方式: 共有6条查询结果,搜索用时 46 毫秒
1
1.
用耦合波法分析平面镀膜分频光栅的特性   总被引:3,自引:1,他引:2  
使用严格的耦合波理论分析了ICF系统的色分离光栅(CSG)特性,特别针对平面镀膜减反后的情况进行了详细的讨论.模拟计算结果表明,与未镀膜的裸光栅相比,采用文中所述方法设计的镀膜光栅有很好的减反增透效果,具有良好的应用前景.  相似文献   
2.
色分离光栅镀膜减反技术研究   总被引:1,自引:0,他引:1       下载免费PDF全文
 根据惯性约束聚变系统技术要求,提出一种镀膜减反方案,以解决现有光栅由于元件表面反射影响衍射效率的问题。对色分离光栅镀膜减反技术进行了详细的分析,根据标量理论给出了镀膜光栅的各项技术要求,优化了光栅结构参数。模拟计算结果发现,光栅表面反射几乎完全消除,表明可以通过色分离光栅镀膜减反提高衍射效率的目的。该镀膜光栅刻槽深度的优化值为2.84μm,膜厚为等效1/4波长,即71.2nm。  相似文献   
3.
边界表示(boundary representation,B-Rep)法和构造实体几何(construction solid geometry,CSG)法是目前应用最广泛的两种实体表示法,B-Rep→CSG转换也备受关注。B-Rep→CSG转换算法为一种半空间分割法,完全依赖三维造型引擎中的布尔运算,计算量大且不稳定。实际应用中已有大量具有拉伸特征的B-Rep模型:可将整个模型或模型的一部分看作由二维图形沿一定方向拉伸而成。通过将三维模型的B-Rep→CSG转换问题变为二维图形的B-Rep→CSG转换问题,从而避免对布尔运算的依赖,为此,提出基于拉伸特征的B-Rep→CSG转换算法。首先,得到拉伸边具有相互平行性、首尾相连性、方向相反性、唯一连接性4个拉伸特征,然后,基于这些特征提出基于平行边连接图的拉伸特征识别算法,最后,结合拉伸特征识别算法、基于环收缩的模型分割算法和基于顶点可见的多边形分割算法,提出具有拉伸特征的三维模型的B-Rep→CSG转换整体解决方案。将本文算法集成至自主研发的粒子输运可视建模(COSINE visual modelling of particle transport,cosVMPT)软件,并基于cosVMPT对3个专门构造的例题和1个实际应用实例进行了测试,测试结果证明了本文算法的有效性和优越性。  相似文献   
4.
This paper studies and analyzes a preconditioned Krylov solver for Helmholtz problems that are formulated with absorbing boundary layers based on complex coordinate stretching. The preconditioner problem is a Helmholtz problem where not only the coordinates in the absorbing layer have an imaginary part, but also the coordinates in the interior region. This results into a preconditioner problem that is invertible with a multigrid cycle. We give a numerical analysis based on the eigenvalues and evaluate the performance with several numerical experiments. The method is an alternative to the complex shifted Laplacian and it gives a comparable performance for the studied model problems.  相似文献   
5.
R-function is a widely used tool when considering objects obtained through the Boolean operations start from simple base primitives. However, there is square root operation in the representation. Considering that the use of splines will facilitate the calculations within the CAD system, in this paper, we propose a system of R-functions represented in spline form called Spline R-function (SR). After transforming the function ranges of two base primitives to a new coordinate system, a series of sign constraints following a specific Boolean operation are derived and the spline R-function can be formulated as a piecewise function. Representation of SR in both Bézier form and B-spline form have been given. Among which the Bézier ordinates are determined with the help of the B-net method through setting up a series of relations according to the sign constraints and properties of R-functions. The construction processes for both Boolean intersection and union operations with different smoothness are discussed in detail. Numerical experiments are conducted to show the potential of the proposed spline R-function.  相似文献   
6.
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号