| Summary: | 碩士 === 中原大學 === 土木工程研究所 === 92 === The main feature of Element <a href="http://www.ntsearch.com/search.php?q=free&v=56">free</a> Galerkin method (EFGM) is that the <a href="http://www.ntsearch.com/search.php?q=construction&v=56">construction</a> of shape functions is based on the <a href="http://www.ntsearch.com/search.php?q=moving&v=56">moving</a> least-square (MLS) interpolation technique, which requires only nodal data and not any connectivity requirement among these nodes. The nodal shape function of the EFGM is constructed through some searching algorithms and the MLS technique and it may varies at each node. Previous experience shows that for the same problem to be solved, the computation <a href="http://www.ntsearch.com/search.php?q=time&v=56">time</a> required by the EFGM is more than it required by the finite element method. Hence, how to improve the computational efficiency becomes an important issue in the further development of the EFGM.
The study is mainly based on using Pc Clusters. There are several possible solutions to improve the computational efficiency of EFGM. Firstly, Parallel computation of searching for finding corresponding nodal points when constructing shape function. Secondly, Parallel computation of constructing shape function. Thirdly, Parallel computation of solving the system governing equations. The skyline solution technique and parallel computation of conjugate gradient method is adopted to solve the system equations with large sparse coefficient <a href="http://www.ntsearch.com/search.php?q=matrix&v=56">matrix</a> typically obtained in the EFGM. Then, Numerical simulations of 2D elastostatic and elastodynamic problems demonstrate that the <a href="http://www.ntsearch.com/search.php?q=adoption&v=56">adoption</a> of that three solutions technique into the EFGM can largely reduce the computation <a href="http://www.ntsearch.com/search.php?q=time&v=56">time</a> than the one using conventional solving technique.
|
|---|
