• 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.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.04a
• /
• pp.11-18
• /
• 2003

This paper proposes modified Lanczos vector superposition method for efficient dynamic analysis of structures. Proposed method is based on the modified Lanczos algorithm that generates stiffness-orthonormal Lanczos vectors. Proposed method has better computing efficiency than the conventional Lanczos vector superposition method in the analysis of multi-input-loaded structures. The efficiency of proposed method is verified through numerical examples. Comparison with other vector superposition methods is also presented through numerical examples.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.5-16
• /
• 1999

We introduce a new projector for accelerating convergence of a symmetric eigenvalue problem Ax = x, and devise a power/Lanczos hybrid algorithm. Acceleration can be achieved by removing the hard-to-annihilate nonsolution eigencomponents corresponding to the widespread eigenvalues with modulus close to 1, by estimating them accurately using the Lanczos method. However, the additional Lanczos results can be obtained without expensive matrix-vector multiplications but a very small amount of extra work, by utilizing simple power-Lanczos interconversion algorithms suggested. Numerical experiments are given at the end.

• 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.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1997.10a
• /
• pp.151-158
• /
• 1997

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 degrss 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 prove the effectiveness of component mode method, Lanczos algorithm are introduced. To prove the effectiveness of this method, example structures areanalyzed and the results are compared with SAP90.

• 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.

• Structural Engineering and Mechanics
• /
• v.14 no.6
• /
• pp.679-698
• /
• 2002

In this paper some techniques for the dynamic analysis of non-classically damped linear systems are reviewed and compared. All these methods are based on a transformation of the governing equations using a basis of complex or real vectors. Complex and real vector bases are presented and compared. The complex vector basis is represented by the eigenvectors of the complex eigenproblem obtained considering the non-classical damping matrix of the system. The real vector basis is a set of Ritz vectors derived either as the undamped normal modes of vibration of the system, or by the load dependent vector algorithm (Lanczos vectors). In this latter case the vector basis includes the static correction concept. The rate of convergence of these bases, with reference to a parametric structural system subjected to a fixed spatial distribution of forces, is evaluated. To this aim two error norms are considered, the first based on the spatial distribution of the load and the second on the shear force at the base due to impulsive loading. It is shown that both error norms point out that the rate of convergence is strongly influenced by the spatial distribution of the applied forces.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.13-16
• /
• 2005

It would be desirable to have methods for specific problems, which have low communication costs compared to the computation costs, and in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming m simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications compared to the standard methods.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.5
• /
• pp.163-169
• /
• 2006

In order to use parallel computers in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming in simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications and main memory access compared to the standard methods.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.