期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A MESHLESS LOCAL PETROV-GALERKIN METHOD FOR GEOMETRICALLY NONLINEAR PROBLEMS 被引量:9
1
作者 Xiong Yuanbo Long Shuyao +1 位作者 Hu De'an Li Guangyao 《Acta Mechanica Solida Sinica》 SCIE EI 2005年第4期348-356,共9页
Nonlinear formulations of the meshless local Petrov-Galerkin (MLPG) method are presented for geometrically nonlinear problems. The method requires no mesh in computation and therefore avoids mesh distortion difficul... Nonlinear formulations of the meshless local Petrov-Galerkin (MLPG) method are presented for geometrically nonlinear problems. The method requires no mesh in computation and therefore avoids mesh distortion difficulties in the large deformation analysis. The essential boundary conditions in the present formulation axe imposed by a penalty method. An incremental and iterative solution procedure is used to solve geometrically nonlinear problems. Several examples are presented to demonstrate the effectiveness of the method in geometrically nonlinear problems analysis. Numerical results show that the MLPG method is an effective one and that the values of the unknown variable are quite accurate. 展开更多
关键词 local Petrov-Galerkin method moving least square approximation total Lagranian method geometrically nonlinear problems
在线阅读 下载PDF
An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case 被引量:3
2
作者 José C.Pereira Fernando G.Lobo 《Journal of Computer Science & Technology》 SCIE EI CSCD 2012年第4期891-896,共6页
We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwi... We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwise comparisons are required in the combine step, for each point that lies in the 25-wide vertical slab. The correctness of the algorithm is shown for all Minkowski distances with p ≥ 1. We also show empirically that, although the time complexity of the algorithm is still O(n lgn), the reduction in the total number of comparisons leads to a significant reduction in the total execution time, for inputs with size sufficiently large. 展开更多
关键词 geometrical problem and computation closest-pair problem Basic-2 algorithm
原文传递
Figure of the Earth(Summary)
3
作者 J.T.FANG 《地理学报》 1935年第1期179-181,共3页
1)Figure of the earth as a geometrical problem.In anoient times,people thought that the surface of the earth is essentially flat.This notion hadbeen kept in the minds of the primitive peoples until the beginning of th... 1)Figure of the earth as a geometrical problem.In anoient times,people thought that the surface of the earth is essentially flat.This notion hadbeen kept in the minds of the primitive peoples until the beginning of the sixthcentury before Ohrist.The first clear and unequivocal statement of the sphericity of the earth was due to the Greek philosopher Pythogoras(died 582 B.C.). 展开更多
关键词 PYTHAGORAS geometrical problem figure earth sphericity earth geometrical problemin ancient times SPHERICITY
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部