33 research outputs found

    Solving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices

    Get PDF
    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

    Get PDF
    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

    The Lanczos Method for Parameterized Symmetric Linear Systems with Multiple Right-Hand Sides

    Full text link

    Distributed solution of Laplacian eigenvalue problems

    Full text link
    The purpose of this article is to approximately compute the eigenvalues of the symmetric Dirichlet Laplacian within an interval (0,ฮ›)(0,\Lambda). 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

    ๊ฐœ์„ ๋œ ๋‹ค๋‹จ๊ณ„ ๋ถ€๊ตฌ์กฐํ™” ๊ธฐ๋ฒ•์„ ์ด์šฉํ•œ ๋Œ€ํ˜•๊ตฌ์กฐ๋ฌผ์˜ ์žฌํ•ด์„ ๋ฐฉ๋ฒ•

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (์„์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ธฐ๊ณ„ํ•ญ๊ณต๊ณตํ•™๋ถ€(๋ฉ€ํ‹ฐ์Šค์ผ€์ผ ๊ธฐ๊ณ„์„ค๊ณ„์ „๊ณต), 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

    Full text link
    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
    corecore