• 제목/요약/키워드: Matrix Solver

검색결과 88건 처리시간 0.029초

MATLAB을 이용한 유연 다물체 시스템의 해석 및 제어 (Analysis and Control of the Flexible Multibody System Using MATLAB)

  • 정성필;박태원
    • 대한기계학회논문집A
    • /
    • 제32권5호
    • /
    • pp.437-443
    • /
    • 2008
  • In this paper, analysis and control of the flexible multibody system using MATLAB is presented. The equations of motion of a flexible body are derived in terms of the modal coordinate. The rigid-flexible multibody dynamic solver is developed. Finite element information required to analyze motion of flexible bodies is imported from ANSYS. The modified finite element data, such as modal mass matrix, modal stiffness matrix and constraint mode shapes, is calculated in the solver. Since the solver is developed using MATLAB, it is very easy to connect with SIMULINK which is widely used to control motion of the multibody system. Several simulations are implemented to verify the developed solver. A control example is carried out and the usefulness of the developed solver is demonstrated.

Newton-Krylov Method for Compressible Euler Equations on Unstructured Grids

  • Kim Sungho;Kwon Jang Hyuk
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1998년도 추계 학술대회논문집
    • /
    • pp.153-159
    • /
    • 1998
  • The Newton-Krylov method on the unstructured grid flow solver using the cell-centered spatial discretization oi compressible Euler equations is presented. This flow solver uses the reconstructed primitive variables to get the higher order solutions. To get the quadratic convergence of Newton method with this solver, the careful linearization of face flux is performed with the reconstructed flow variables. The GMRES method is used to solve large sparse matrix and to improve the performance ILU preconditioner is adopted and vectorized with level scheduling algorithm. To get the quadratic convergence with the higher order schemes and to reduce the memory storage. the matrix-free implementation and Barth's matrix-vector method are implemented and compared with the traditional matrix-vector method. The convergence and computing times are compared with each other.

  • PDF

A Fast Poisson Solver of Second-Order Accuracy for Isolated Systems in Three-Dimensional Cartesian and Cylindrical Coordinates

  • Moon, Sanghyuk;Kim, Woong-Tae;Ostriker, Eve C.
    • 천문학회보
    • /
    • 제44권1호
    • /
    • pp.46.1-46.1
    • /
    • 2019
  • We present an accurate and efficient method to calculate the gravitational potential of an isolated system in three-dimensional Cartesian and cylindrical coordinates subject to vacuum (open) boundary conditions. Our method consists of two parts: an interior solver and a boundary solver. The interior solver adopts an eigenfunction expansion method together with a tridiagonal matrix solver to solve the Poisson equation subject to the zero boundary condition. The boundary solver employs James's method to calculate the boundary potential due to the screening charges required to keep the zero boundary condition for the interior solver. A full computation of gravitational potential requires running the interior solver twice and the boundary solver once. We develop a method to compute the discrete Green's function in cylindrical coordinates, which is an integral part of the James algorithm to maintain second-order accuracy. We implement our method in the {\tt Athena++} magnetohydrodynamics code, and perform various tests to check that our solver is second-order accurate and exhibits good parallel performance.

  • PDF

On the Development of 3D Finite Element Method Package for CEMTool

  • Park, Jung-Hun;Ahn, Choon-Ki;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.2410-2413
    • /
    • 2005
  • Finite element method (FEM) has been widely used as a useful numerical method that can analyze complex engineering problems in electro-magnetics, mechanics, and others. CEMTool, which is similar to MATLAB, is a command style design and analyzing package for scientific and technological algorithm and a matrix based computation language. In this paper, we present new 3D FEM package in CEMTool environment. In contrast to the existing CEMTool 2D FEM package and MATLAB PDE (Partial Differential Equation) Toolbox, our proposed 3D FEM package can deal with complex 3D models, not a cross-section of 3D models. In the pre-processor of 3D FEM package, a new 3D mesh generating algorithm can make information on 3D Delaunay tetrahedral mesh elements for analyses of 3D FEM problems. The solver of the 3D FEM package offers three methods for solving the linear algebraic matrix equation, i.e., Gauss-Jordan elimination solver, Band solver, and Skyline solver. The post-processor visualizes the results for 3D FEM problems such as the deformed position and the stress. Consequently, with our new 3D FEM toolbox, we can analyze more diverse engineering problems which the existing CEMTool 2D FEM package or MATLAB PDE Toolbox can not solve.

  • PDF

고성능 병렬 유한요소 솔버를 이용한 3차원 주시와 진폭계산 (3-D Traveltime and Amplitude Calculation using High-performance Parallel Finite-element Solver)

  • 양동우;김정호
    • 지구물리와물리탐사
    • /
    • 제7권4호
    • /
    • pp.234-244
    • /
    • 2004
  • 주파수 영역 유한요소 파동방정식의 3차원 모델링은 거대한 크기의 산재행렬(sparse matrix)인 임피던스 행렬을 풀어야 한다. 이러한 이유 때문에 파동방정식의 3차원 모델링은 주로 시간 영역에서 이루어지고 있다. 이 연구는 주파수 영역 파동방정식의 유한요소 3차원 모델링 연구의 일환으로 라플라스 영역에서 1개 주파수에 대한 파동방정식 해를 이용하여 주시와 진폭을 계산할 수 있는 SWEET(Suppressed Wave Equation Estimation of Traveltime) 알고리즘과 병렬 유한요소 솔버를 결합하여 주파수 영역 3차원 모델링을 시도 하였다. 이렇게 계산된 주시와 진폭은 파선이론에 기반하여 계산된 주시와 진폭과 달리 급경사 구조 또는 수평 속도의 비가 큰 곳에서도 정확하게 계산되며, Kirchhoff 구조보정에 유용하게 사용될 수 있다. 연구의 결과를 검증하기 위하여 SEG/EAGE 3D 암염 모델의 주시와 진폭 계산에 적용하여 이를 검증하였다.

병렬 컴퓨터를 이용한 형상 압연공정 유한요소 해석의 분산병렬처리에 관한 연구 (Finite Element Analysis of Shape Rolling Process using Destributive Parallel Algorithms on Cray T3E)

  • 권기찬;윤성기
    • 대한기계학회논문집A
    • /
    • 제24권5호
    • /
    • pp.1215-1230
    • /
    • 2000
  • Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

가상 메모리 데이타베이스를 이용한 대규모 구조해석용 코어 외 방정식 해석기법의 개발 (Development of Out-of-Core Equation Solver with Virtual Memory Database for Large-Scale Structural Analysis)

  • 이성우;송윤환;이동근
    • 전산구조공학
    • /
    • 제4권2호
    • /
    • pp.103-110
    • /
    • 1991
  • 컴퓨터의 제한된 코어메모리로 대형문제를 해결하기 위하여 디스크를 마치 메모리처럼 사용할 수 있는 가상 메모리 데이타베이스 기법을 개발하였다. 이 기법과 아울러 최대 가용코어메모리를 작동시키는 방식을 사용하여 유한요소 해석시 흔히 발생하는 스카이라인 형태로 저장된 대칭통산행예(Sparse Symmetric Matrix)에 대한 매우 효과적인 코어 내 및 코어 외 직립방정식의 해법을 개발하였다. 제안된 방법은 다른 코어 외 해법에 비해 알고리즘 및 코딩이 매우 간단하여 계산효율을 상당히 향상시켰다. 해석예에서는 제안된 방법을 사용하여 대규모 구조해석 문제를 메모리 용량이 작은 소형컴퓨터에서 대단히 효율적으로 해결하였음을 보여주었다.

  • PDF

AN ASYNCHRONOUS PARALLEL SOLVER FOR SOME MATRIX PROBLEMS

  • Park, Pil-Seong
    • Journal of applied mathematics & informatics
    • /
    • 제7권3호
    • /
    • pp.1045-1058
    • /
    • 2000
  • In usual synchronous parallel computing, workload balance is a crucial factor to reduce idle times of some processors that have finished their jobs earlier than others. However, it is difficult to achieve on a heterogeneous workstation clusters where the available computing power of each processor is unpredictable. As a way to overcome such a problem, the idea of asynchronous methods has grown out and is being increasingly used and studied, but there is none for eigenvalue problems yet. In this paper, we suggest a new asynchronous method to solve some singular matrix problems, that can also be used for finding a certain eigenvector of some matrices.

Approach to BMI Problems Using Evolution Strategy

  • Chung, Tae-Jin;Chung, Chan-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.224-224
    • /
    • 2000
  • Biaffine Matrix Inequalities(BIs) are known to give more general and flexible frameworks in control designs than Linear Matrix Inequalities(LMIs). However, BMIs are nonconvex constraints and very difficult to solve. In this paper, BMI problems are solved using Evolution Strategy(ES). Numerous BMI problems are solved to verify performances of ES solver for BMI problems and compared with those of Genetic Algorithms and Branch-and-Cut algorithm.

  • PDF

3차원 정상상태의 드리프트-확산 방정식의 해석 프로그램 개발 (A development of the 3-dimensional stationary drift-diffusion equation solver)

  • 윤현민;김태한;김대영;김철성
    • 전자공학회논문지D
    • /
    • 제34D권8호
    • /
    • pp.41-51
    • /
    • 1997
  • The device simulator (BANDIS) which can analyze efficiently the electrical characteristics of the semiconductor devices under the three dimensional stationary conditions on the IBM PC was developed. Poisson, electon and hole continuity equations are discretized y te galerkin method using a tetrahedron as af finite element. The frontal solver which has exquisite data structures and advanced input/output functions is dused for the matrix solver which needs the highest cost in the three dimensional device simulation. The discretization method of the continuity equations used in BANDIS are compared with that of the scharfetter-gummel method used in the commercial three-dimensional device. To verify an accuracy and the efficiency of the discretization method, the simulation results of the PN junction diode and the BJT from BANDIS are compared with those of the commercial three-dimensiional device simulator such as DAVINCI. The maximum relative error within 2% and the average number of iterations needed for the convergence is decreased by more than 20%. The total simulation time of the BJT with 25542 nodes is decreased to about 60% compared with that of DAVINCI.

  • PDF