检索结果-内蒙古大学图书馆

parallel construction of Hamiltonian paths for conforming tetrahedral meshes

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2013年第7期90卷 1366-1372页

作者： Liu, Hui Chen, Zhangxin Zhang, Linbo Univ Calgary Dept Chem & Petr Engn Calgary AB T2N 1N4 Canada Xi An Jiao Tong Univ Coll Math & Stat Ctr Computat Geosci Xian 710049 Peoples R China Acad Math & Syst Sci Beijing 100190 Peoples R China

In this paper, we address the construction of a Hamiltonian path for conforming tetrahedral meshes on distributed memory machines. The path is constrained to pass from one element to the next one through a vertex. For a conforming tetrahedral mesh whose dual graph is connected, if it can be split into many submeshes and the dual graphs of these submeshes are connected, then we can construct partial Hamiltonian paths for all submeshes independently and a Hamiltonian path for the mesh can be obtained by connecting these partial Hamiltonian paths.

关键词： adaptive finite element method tetrahedral meshes Hamiltonian path distributed memory machine parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel MULTILEVEL FAST MULTIPOLE algorithm FOR ANALYSIS OF TARGETS ABOVE GROUND

PARALLEL MULTILEVEL FAST MULTIPOLE ALGORITHM FOR ANALYSIS OF...

引用

IET International Radar Conference

作者： Xun-Wang Zhao Sio-Weng Ting Ji-Rong Zhou Yu Zhang Daniel Garcia Donoro School of Electronic Engineering Xidian University Xi'an Shaanxi 710071 China Department of Electrical and Computer Engineering University of Macau Macau SAR China Universidade Carlos III of Madrid Madrid Spain

ISBN: (纸本)9781629931340

parallel multilevel fast multipole algorithm for scattering analysis of conducting targets situated in a half-space environment is presented. Due to the introducing of image sources to deal with the effects of the far interface interactions, the communication traffic among processes is nearly doubled compared with the free space case, which is a great challenge for designing the parallel algorithm. To achieve high parallel efficiency when using hundreds of CPU cores, the adaptive direction partition strategy is improved in this paper. The correctness is demonstrated by using a conducting sphere above ground. In addition, a real-life vehicle above ground is simulated using the proposed method and the parallel efficiency is tested.

关键词： half-space MLFMA parallel algorithm real sources image sources

来源：评论

学校读者我要写书评

暂无评论

A parallel subgrid stabilized finite element method based on fully overlapping domain decomposition for the Navier-Stokes equations

引用

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 2013年第2期403卷 667-679页

作者： Shang, Yueqiang Guizhou Normal Univ Sch Math & Comp Sci Guiyang 550001 Peoples R China

Based on a fully overlapping domain decomposition technique and finite element discretization, a parallel subgrid stabilized method for the incompressible Navier Stokes equations is proposed and analyzed. In this method, each processor computes a local stabilized solution in its own subdomain by solving a global problem on a mesh that is fine around its own subdomain and coarse elsewhere, where the stabilization term is based on an elliptic operator defined on the same mesh. This method has low communication complexity. It only requires the application of an existing sequential solver on the global meshes associated with each subdomain, and hence can reuse the existing sequential software. Convergence theory of the method is developed. algorithmic parameter scalings are derived. Numerical results are also given to verify the theoretical predictions and demonstrate the effectiveness of the method. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Navier-Stokes equations Finite element Subgrid-scale model parallel algorithm Domain decomposition

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection

引用

Numerical Mathematics(Theory,Methods and Applications) 2009年第1期2卷 65-89页

作者： Lin-Bo Zhang State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100080 China.

Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.

关键词： Adaptive refinement bisection tetrahedral mesh parallel algorithm MPI.

来源：评论

学校读者我要写书评

暂无评论

The Research on parallel algorithm of A-order in Binary Tree Based on PRAM Model

The Research on Parallel Algorithm of A-order in Binary Tree...

引用

1st International Workshop on Education Technology and Computer Science

作者： Sun Yuqiang Gu Yuwan Su Bing Wang Xiaolong Jiangsu Polytech Univ Sch Informat Sci & Engn Changzhou Peoples R China

ISBN: (纸本)9780769535579

In this paper, the problem of A-order of binary tree is studied with the PRAM (parallel Random Access Machine) model of parallel computation and a parallel algorithm for A-order of binary tree is proposed. The process of the parallel algorithm is proceed with detailed description and verified analysis with an application instance. The parallel algorithm of A-order of binary tree provides using and reference for applying it to binary tree traverse sequence and solving the parallelism problem of application program.

关键词： A-order Sequence Binary Tree parallel algorithm PRAM Model

来源：评论

学校读者我要写书评

暂无评论

The Comparison of Red-Black Ordering and Natural Ordering Application in Special Linear System

The Comparison of Red-Black Ordering and Natural Ordering Ap...

引用

The Sixth International Conference of Matrices and Operators

作者： Yan-jun Du Quan-yi Lv Xiu-min Liu Department of Mathematics Northwestern Polytechnical University

The comparison of red-black ordering and natural ordering in solving linear system in parallel is presented in this *** is proved that red-black ordering can keep the convergence of linear system and improve the parallelism through theoretical *** reach the load balancing and reduce communication, the data is stored by blocks and the communication is proceeded between the adjacent *** this way, it is avoided that the time increases too much with the number of processors increasing,which improve the computation efficiency.

关键词： red-black ordering natural ordering parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel computing 2D Voronoi diagrams using untransformed sweepcircles

引用

COMPUTER-AIDED DESIGN 2013年第2期45卷 483-493页

作者： Xin, Shi-Qing Wang, Xiaoning Xia, Jiazhi Mueller-Wittig, Wolfgang Wang, Guo-Jin He, Ying Ningbo Univ Ningbo Peoples R China Nanyang Technol Univ Sch Comp Engn Singapore Singapore Nanyang Technol Univ BeingThere Ctr Inst Media Innovat Singapore Singapore Nanyang Technol Univ Fraunhofer IDM NTU Singapore Singapore Cent S Univ Sch Informat Sci & Engn Changsha Peoples R China Zhejiang Univ State Key Lab CAD & CG Hangzhou Zhejiang Peoples R China

Voronoi diagrams are among the most important data structures in geometric modeling. Among many efficient algorithms for computing 2D Voronoi diagrams, Fortune's sweepline algorithm (Fortune, 1986 [5]) is popular due to its elegance and simplicity. Dehne and Klein (1987) [8] extended sweepline to sweepcircle and suggested computing a type of transformed Voronoi diagram, which is parallel in nature. However, there is no practical implementation of the sweepcircle algorithm due to the difficulty in representing the transformed edges. This paper presents a new algorithm, called untransformed sweepcircle, for constructing Voronoi diagram in R-2. Starting with a degenerate circle (of zero radius) centered at an arbitrary location, as the name suggests, our algorithm sweeps the circle by increasing its radius across the plane. At any time during the sweeping process, each site inside the sweep circle defines an ellipse composing of points equidistant from that point and from the sweep circle. The union of all ellipses forms the beach curve-a star shape inside the sweep circle which divides the portion of the plane within which the Voronoi diagram can be completely determined, regardless of what other points might be outside of the sweep circle. As the sweep circle progresses, the intersection of expanding ellipses defines the Voronoi edges. We show that the sweep line algorithm is the degenerate form of the proposed sweep circle algorithm when the circle center is at infinity, and our algorithm has the same time and space complexity as the sweep line algorithm. Our untransformed sweepcircle algorithm is flexible in allowing multiple circles at arbitrary locations to sweep the domain simultaneously. The parallelized implementation is pretty easy without complicated numerical computation;the most complicated case is nothing but an arc-cosine operation. Furthermore, our algorithm supports the additively weighted Voronoi diagrams of which the Voronoi edges are hyperbolic and

关键词： Voronoi diagram GPU Sweep line Sweep circle parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A REAL-TIME TOP-K QUERY algorithm AND PARAL LELIZED IMPLEMENTATION

A REAL-TIME TOP-K QUERY ALGORITHM AND PARAL LELIZED IMPLEMEN...

引用

2014 IEEE 3rd International Conference on Cloud Computing and Intelligence Systems

作者： Yao Lu Jun Liu Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications

The analysis of data streams is of great value in many fields such as network monitoring and sensor *** a common operation,top-k query over data stream is the basis and core of other problems in data stream *** this paper,we introduce a parallel algorithm based on Frequent algorithm and implement it by utilizing Apache ***,we evaluate the algorithm by estimated error under various situations and show that the algorithm can effectively improve the precision of top-k query by adjusting the parallel *** parallelized implementation is of significance in network traffic monitoring.

关键词： parallel algorithm Top-k query Apache Storm

来源：评论

学校读者我要写书评

暂无评论

The new democratic revolution in music during the play experience of ideological and political education function

The new democratic revolution in music during the play exper...

引用

The International Conference on Biotechnology,Agriculture,Environment and Energy(ICBAEE 2014)

作者： Cheng Dan Yunyang Teachers' College

After a deep investigation on the maximum terms space of the clause set,the concept of the partial maximum terms space of the clause set,which the maximum terms of the clause set decomposed,is brought *** investigating the extension rule,this paper introduces the concept of the satisfiability and the unsatisfiability of the partial maximum terms space,and gives an algorithm determining the satisfiability of a partial space of the maximum terms—algorithm PSER(Partial Semi-Extension Rule).Then,the TP problem is decomposed into several sub-problems independent of each other,which can be solved by the given parallel computing method PPSER(parallel Partial Semi-Extension Rule).

关键词： theorem proving parallel algorithm extension rule

来源：评论

学校读者我要写书评

暂无评论

A Preconditioned Two Stage Iterative parallel algorithm for Block-Tridiagonal Linear Equations

A Preconditioned Two Stage Iterative Parallel Algorithm for ...

引用

2nd International Conference on Modelling and Simulation

作者： Duan, Liu Gang Lv, Quan Yi Nie, Yu Feng NW Polytech Univ Dept Appl Math Xian Peoples R China

ISBN: (纸本)9781846260612

In the paper, the preconditioner of linear systems is directly extented to the solutions of block-tridiagonal equations. And by corresponding parallel processing, a parallel algorithm of two stage iterative method for solving block-tridiagonal linear equations is presented. According to theoretical analysis, a sufficient condition of the new algorithm convergence is given. Finally, the results of numerical experiments on HP rx2600 cluster indicate that the algorithm is feasible and effective.

关键词： Block-tridiagonal linear equations parallel algorithm HP rx2600 cluster Preconditioned Optimal parameter

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：