• Title/Summary/Keyword: Lanczos방법

Search Result 21, Processing Time 0.018 seconds

Eigensolution Method for Structures Using Accelerated Lanczos Algorithm (가속화된 Lanczos 알고리즘을 이용한 구조물의 고유치 해법)

  • Kim, Byoung-Wan;Oh, Ju-Won;Lee, In-Won
    • Proceedings of the Earthquake Engineering Society of Korea Conference
    • /
    • 2002.09a
    • /
    • pp.364-370
    • /
    • 2002
  • 본 논문에서는 양자물리학 분야에서 Lanczos 방법의 수렴을 가속화하기 위해 개발된 바 있는 행렬의 거듭제곱 기법을 동역학 분야의 Lanczos 순환식에 도입함으로써 구조물의 고유치 해석의 효율성을 향상시켰다 행렬의 거듭제곱 기법을 도입한 Lanczos 방법이 기존의 방법보다 수렴성이 더욱 우수하다. 수치예제를 통해 행렬의 거듭제곱 기법을 도입한 Lanczos 방법의 효율성을 검증하였으며 제안방법을 통한 고유치 해석에 있어서 가장 적합한 거듭제곱값을 제시하였다.

  • PDF

Efficient Vector Superposition Method for Dynamic Analysis of Structures (구조물의 동적해석을 위한 효율적인 벡터중첩법)

  • 김병완;정형조;김운학;이인원
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.7 no.3
    • /
    • pp.39-45
    • /
    • 2003
  • Modified Lanczos vector superposition method is proposed for efficient dynamic analysis of structures, The proposed method is based on the modified Lanczos algorithm that generates stiffness-orthonormal Lanczos vectors. The proposed Lanczos vector superposition method has the same accuracy and efficiency as the conventional Lonczos vector superposition method in the analysis of structures under single input loads. On the other hand, the proposed method is more efficient than the conventional method in the analysis of structures under multi-input loads. The effectiveness of the proposed method is verified by analyzing two numerical examples.

Efficient Scientific Computation on WP Parallel Computer (MP 병렬컴퓨터에서 효과적인 과학계산의 수행)

  • 김선경
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.4
    • /
    • pp.26-30
    • /
    • 2003
  • The Lanczos algorithm is the most commonly used in approximating a small number of extreme eigenvalues for symmetric large sparse matrices. Global communications in MP(Message Passing) parallel computer decrease the computation speed. In this paper, we introduce the s-step Lanczos method, and s-step method generates reduction matrices which are similar to reduction matrices generated by the standard Lanczos method. One iteration of the s-step Lanczos algorithm corresponds to s iterations of the standard Lanczos algorithm. The s-step method has the minimized global communication and has the superior parallel properties to the standard method. These algorithms are implemented on Cray T3E and performance results are presented.

  • PDF

Improved Lanczos Method for the Eigenvalue Analysis of Structures (구조물의 고유치 해석을 위한 개선된 Lanczos 방법)

  • 김병완;김운학;이인원
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.133-140
    • /
    • 2002
  • This paper investigates the applicability of the modified Lanczos method using the power technique, which was developed in the field of quantum physics, to the eigenproblem in the field of engineering mechanics by introducing matrix-powered Lanczos recursion and numerically evaluating the suitable power value. The matrix-powered Lanczos method has better convergence and less operation count than the conventional Lanczos method. By analyzing four numerical examples, the effectiveness of the matrix-powered Lanczos method is verified and the appropriate matrix power is also recommended.

  • PDF

Efficient Implementation of an Extreme Eigenvalue Problem on Cray T3E (Cray T3E에서 극한 고유치문제의 효과적인 수행)

  • 김선경
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.480-483
    • /
    • 2000
  • 공학의 많은 응용분야에서 큰 회소 행렬(Large Sparse Matrices)에 대한 가장 작거나 또는 가장 큰 고유치(Eigenvalues)들을 요구하게 되는데, 이때 많이 이용되는 것은 Krylov Subspace로의 Projection방법이다. 대칭 행렬에 대해서는 Lanczos방법을, 비대칭 행렬에 대해서는 Biorhtogonal Lanczos방법을 이용할 수 있다. 이러한 기존의 알고리즘들은 새롭게 제안되는 병렬처리 시스템에서 효과적이지 못하다. 많은 프로세서를 가지는 병렬처리 컴퓨터 중에서도 분산 기억장치 시스템(Distributed Memory System)에서는 프로세서들 사이의 Data Communication에 필요한 시간을 줄이도록 해야한다. 본 논문에서는 기존의 Lanczos 알고리즘을 수정함으로써, 알고리즘의 동기점(Synchronization Point)을 줄이고 병렬화를 위한 입상(Granularity)을 증가시켜서 MPP인 Cray T3E에서 Data Communication에 필요한 시간을 줄인다. 많은 프로세서를 사용하는 경우 수정된 알고리즘이 기존의 알고리즘에 비해 더 나은 speedup을 보여준다.

  • PDF

Dynamic Analysis of Large Structures by Component Mode Method using Lanczos Algorithm and Ritz Vector (Lanczos알고리즘과 Ritz Vector를 이용한 Component Mode Method에 의한 거대구조물의 동적해석)

  • 심재수;황의승;박태현
    • Computational Structural Engineering
    • /
    • v.9 no.2
    • /
    • pp.115-120
    • /
    • 1996
  • The main concern of numerical dynamic analysis of large structures is to find an acceptable solution with fewer mode shapes and less computational efforts. Component mode method utilizes substructure technique to reduce the degree of freedom but have a disadvantage to not consider the dynamic characteristics of loads. Ritz Vector method consider the load characteristics but requires many integrations and errors are accumulated. In this study, to improve the effectiveness of component mode method, Lanczos algorithm is introduced. To prove the effectiveness of this method, example structure are analyzed and the results are compared with SAP90.

  • PDF

Structural Dynamic Analysis by Ritz Vector Method Modified with Lanczos Algorithm (Lanczos 알고리즘을 도입한 Ritz Vector법에 의한 구조물의 동적해석)

  • 심재수;황의승;박주경
    • Computational Structural Engineering
    • /
    • v.8 no.4
    • /
    • pp.181-187
    • /
    • 1995
  • Recent researches in dynamics are focused on finding effective methods to analyze the dynamic behavior of structures by fewer mode shapes their number of dgrees of freedom. Ritz algorithm and mode acceleration method were developed to improved the mode superposition. Ritz algorithm can include distribution of external loads but be apt to lose the orthogonality condition, which is useful properties in the analysis. Also mode acceleration method should consider a large number of mode shapes to get a satisfactory results. Another method, combining previous two method, was developed but too much computational efforts and times were required. The purpose of this study is to develop and evaluate the Ritz algorithm modified with the lanczos algorithm to improve the efficiency and accuracy. As a result of !this study, dynamic analysis using modified Ritz algorithm was proved to be the rational analysis method.

  • PDF

A study on modified biorthogonalization method for decreasing a breakdown condition

  • Kim, Sung-Kyung
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.5
    • /
    • pp.59-66
    • /
    • 2002
  • Many important scientific and engineering problems require the computation of a small number of eigenvalues for large nonsymmetric matrices. The biorthogonal Lanczos method is one of the methods to solve that problem, but it faces serious breakdown problems. In this paper, we introduce a modified biorthogonal Lanczos method to find a few eigenvalues of a large sparse nonsymmetric matrix. The proposed method generates reduction matrices that are similar to those generated by the standard biorthogonal Lanczos method. We prove that the breakdown conditions of our method are less stringent than the standard method. We then implement the modified biorthogonal Lanczos method on the CRAY machine and discuss the decreased breakdown conditions.

  • PDF

Solution of Eigenproblems for Non-proportional Damping Systems by Lanczos Method (Lanczos 방법에 의한 비비례 감쇠 시스템의 고유치 해석)

  • 김만철;정형조;오주원;이인원
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.04a
    • /
    • pp.283-290
    • /
    • 1998
  • A solution method is presented to solve the eigenproblem arising in tile dynamic analysis of non-proportional damping systems with symmetric matrices. The method is based on tile use of Lanczos method to generate a Krylov subspace of trial vectors, witch is then used to reduce a large eigenvalue problem to a much smaller one. The method retains the η order quadratic eigenproblem, without the need to the method of matrix augmentation traditionally used to cast the problem as a linear eigenproblem of order 2n. In the process, the method preserves tile sparseness and symmetry of the system matrices and does not invoke complex arithmetics, therefore, making it very economical for use in solving large problems. Numerical results are presented to demonstrate the efficiency and accuracy of the method.

  • PDF

Solution of Eigenvalue Problems for Nonclassically Damped Systems with Multiple Frequencies (중복근을 갖는 비비례 감쇠시스템의 고유치 해석)

  • 김만철;정형조;오주원;이인원
    • Computational Structural Engineering
    • /
    • v.11 no.1
    • /
    • pp.205-216
    • /
    • 1998
  • A solution method is presented to solve the eigenvalue problem arising in the dynamic analysis of nonclassicary damped structural systems with multiple eigenvalues. The proposed method is obtained by applying the modified Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linear eigenproblem through matrix augmentation of the quadratic eigenvalue problem. In the iteration methods such as the inverse iteration method and the subspace iteration method, singularity may be occurred during the factorizing process when the shift value is close to an eigenvalue of the system. However, even though the shift value is an eigenvalue of the system, the proposed method provides nonsingularity, and that is analytically proved. Since the modified Newton-Raphson technique is adopted to the proposed method, initial values are need. Because the Lanczos method effectively produces better initial values than other methods, the results of the Lanczos method are taken as the initial values of the proposed method. Two numerical examples are presented to demonstrate the effectiveness of the proposed method and the results are compared with those of the well-known subspace iteration method and the Lanczos method.

  • PDF