33 research outputs found
Solving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices
We propose a new method for the solution of discretised elliptic PDE eigenvalue problems. The new method combines ideas of domain decomposition, as in the automated multi-level substructuring (short AMLS), with the concept of hierarchical matrices (short H-matrices) in order to obtain a solver that scales almost optimal in the size of the discrete space. Whereas the AMLS method is very effective for PDEs posed in two dimensions, it is getting very expensive in the three-dimensional case, due to the fact that the interface coupling in the domain decomposition requires dense matrix operations. We resolve this problem by use of data-sparse hierarchical matrices. In addition to the discretisation error our new approach involves a projection error due to AMLS and an arithmetic error due to H-matrix approximation. A suitable choice of parameters to balance these errors is investigated in examples. Mathematics Subject Classification (2000) 65F15, 65F30, 65F50, 65H17, 65N25, 65N5
Periodic steady state response of large scale mechanical models with local nonlinearities
AbstractLong term dynamics of a class of mechanical systems is investigated in a computationally efficient way. Due to geometric complexity, each structural component is first discretized by applying the finite element method. Frequently, this leads to models with a quite large number of degrees of freedom. In addition, the composite system may also possess nonlinear properties. The method applied overcomes these difficulties by imposing a multi-level substructuring procedure, based on the sparsity pattern of the stiffness matrix. This is necessary, since the number of the resulting equations of motion can be so high that the classical coordinate reduction methods become inefficient to apply. As a result, the original dimension of the complete system is substantially reduced. Subsequently, this allows the application of numerical methods which are efficient for predicting response of small scale systems. In particular, a systematic method is applied next, leading to direct determination of periodic steady state response of nonlinear models subjected to periodic excitation. An appropriate continuation scheme is also applied, leading to evaluation of complete branches of periodic solutions. In addition, the stability properties of the located motions are also determined. Finally, respresentative sets of numerical results are presented for an internal combustion car engine and a complete city bus model. Where possible, the accuracy and validity of the applied methodology is verified by comparison with results obtained for the original models. Moreover, emphasis is placed in comparing results obtained by employing the nonlinear or the corresponding linearized models
Distributed solution of Laplacian eigenvalue problems
The purpose of this article is to approximately compute the eigenvalues of
the symmetric Dirichlet Laplacian within an interval . A novel
domain decomposition Ritz method, partition of unity condensed pole
interpolation method, is proposed. This method can be used in distributed
computing environments where communication is expensive, e.g., in clusters
running on cloud computing services or networked workstations. The Ritz space
is obtained from local subspaces consistent with a decomposition of the domain
into subdomains. These local subspaces are constructed independently of each
other, using data only related to the corresponding subdomain. Relative
eigenvalue error is analysed. Numerical examples on a cluster of workstations
validate the error analysis and the performance of the method.Comment: 28 page
๊ฐ์ ๋ ๋ค๋จ๊ณ ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ์ ์ด์ฉํ ๋ํ๊ตฌ์กฐ๋ฌผ์ ์ฌํด์ ๋ฐฉ๋ฒ
ํ์๋
ผ๋ฌธ (์์ฌ)-- ์์ธ๋ํ๊ต ๋ํ์ : ๊ธฐ๊ณํญ๊ณต๊ณตํ๋ถ(๋ฉํฐ์ค์ผ์ผ ๊ธฐ๊ณ์ค๊ณ์ ๊ณต), 2013. 8. ์กฐ๋งนํจ.์ ํ์์๋ฒ(FE)์์ ๋ํ ๋ชจ๋ธ์ ๋์ ํด์ ์ ๊ณ์ฐ ํจ์จ ํฅ์์ ์ํด ๋ถ๋ถ๊ตฌ์กฐํฉ์ฑ๋ฒ(Component Mode Synthesis, CMS)์ด ์ฌ์ฉ๋ ์ ์๋ค. ์ต๊ทผ ์๋ก์ด ๋ถ๋ถ๊ตฌ์กฐํฉ์ฑ๋ฒ์ผ๋ก ๊ฐ์ ๋ ๋ค๋จ๊ณ ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ(Enhanced Multi-Level Substructuring Scheme, EMLS)์ด ์ ์๋์๋ค. ์ด ๋ฐฉ๋ฒ์ ๊ธฐ์กด ๊ณ ์ ๊ฒฝ๊ณ ๊ธฐ๋ฐ ๋ถ๋ถ๊ตฌ์กฐํฉ์ฑ๋ฒ์ธ Craig-Bampton ๋ฐฉ๋ฒ๋ณด๋ค ์์คํ
ํฌ๊ธฐ๋ฅผ ๋ ์๊ฒ ์ถ์ํ ์ ์๋ ๋์์ ๋ ๋์ ์ฃผํ์ ๋์ญ์์ ์ ํํ ํด๋ฅผ ๊ตฌํ ์ ์๋ค. ๋ณธ ์ฐ๊ตฌ์์๋ ๊ฐ์ ๋ ๋ค๋จ๊ณ ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ์ ์์คํ
๋ณํ์ ๋ฐ๋ฅธ ๋ฐ๋ณต์ ํด์ ๊ณผ์ ์ ์ฌ์ฉํ์๊ณ ๊ณ์ฐ ํจ์จ์ ๊ทน๋ํํ๊ธฐ ์ํด ์ฌํด์ ๋ฐฉ๋ฒ์ ๋์
ํ์๋ค. ์ด๋ฌํ ๊ฐ์ ๋ ๋ค๋จ๊ณ ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ์ ์ด์ฉํ ์ฌํด์ ๋ฐฉ๋ฒ์ ์ ์ ์ฑ๊ณผ ๊ณ์ฐ ํจ์จ์ ํ์ธํ๊ธฐ ์ํด ๋นํ๊ธฐ ๋ ๊ฐ ๊ตฌ์กฐ ๋ชจ๋ธ์ ์ด์ฉํ์ฌ ํฌ๊ธฐ ์ต์ ํ ๋ฌธ์ ๋ฅผ ํด๊ฒฐํ์๋ค.FEM has still challenge in dynamic analysis of large-scale model when it comes to computational costs. For it, Component Mode Synthesis (CMS) can be solution. New CMS based fixed interface normal mode presented. It is Enhanced Multi-Level Sub-structuring Scheme(EMLS). EMLS has higher accuracy than traditional method such as Craig-Bampton method through using dynamic constraint mode and sub-structuring from hierarchical. For the repeated calculation with EMLS, reanalysis method was adapted. It makes reduction basis from static analysis instead of dynamic analysis. To prove its robustness and effectiveness, sizing optimization for wing box model was solved.์ด๋ก
1. ์๋ก
2. ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ
2.1. ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ
2.2. ๊ฐ์ ๋ ๋ค๋จ๊ณ ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ
3. ์ฌํด์ ๋ฐฉ๋ฒ
3.1. ์ฌํด์ ๋ฐฉ๋ฒ
3.2. ์ฌํด์ ๋ฐฉ๋ฒ์ ๊ฐ์ ๋ ๋ค๋จ๊ณ ๋ถ๊ตฌ์กฐํ ๊ธฐ๋ฒ ์ ์ฉ
4. ์์น ์์
5. ๊ฒฐ๋ก
์ฐธ๊ณ ๋ฌธํ
๋ถ๋ก
AbstractMaste
High-Performance Solvers for Dense Hermitian Eigenproblems
We introduce a new collection of solvers - subsequently called EleMRRR - for
large-scale dense Hermitian eigenproblems. EleMRRR solves various types of
problems: generalized, standard, and tridiagonal eigenproblems. Among these,
the last is of particular importance as it is a solver on its own right, as
well as the computational kernel for the first two; we present a fast and
scalable tridiagonal solver based on the Algorithm of Multiple Relatively
Robust Representations - referred to as PMRRR. Like the other EleMRRR solvers,
PMRRR is part of the freely available Elemental library, and is designed to
fully support both message-passing (MPI) and multithreading parallelism (SMP).
As a result, the solvers can equally be used in pure MPI or in hybrid MPI-SMP
fashion. We conducted a thorough performance study of EleMRRR and ScaLAPACK's
solvers on two supercomputers. Such a study, performed with up to 8,192 cores,
provides precise guidelines to assemble the fastest solver within the ScaLAPACK
framework; it also indicates that EleMRRR outperforms even the fastest solvers
built from ScaLAPACK's components