• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.291-294
• /
• 1995

In this paper, two algorithms for computing multiple or clustered eigenvalues are proposed. The algorithm can be applied to all kinds of Hermitian matrix unlike the existing algorithm. Characteristics of the proposed algorithms is examined by MATLAB simulations.

• The Pure and Applied Mathematics
• /
• v.12 no.3 s.29
• /
• pp.179-191
• /
• 2005

In this paper we consider a Dirichlet problem in the unit disk. We show that the equation has a unique or multiple solutions according to the range of the parameter. Moreover, we prove that the equation admits a nonradial bifurcation at each branch of radial solutions.

• Korean Journal of Mathematics
• /
• v.17 no.2
• /
• pp.197-210
• /
• 2009

We prove the existence of multiple solutions (${\xi},{\eta}$) for perturbations of the elliptic system with Dirichlet boundary condition $$(0.1)\;\begin{array}{lcr}A{\xi}+g_1({\xi}+ 2{\eta})=s{\phi}_1+h\;in\;{\Omega},\\A{\xi}+g_2({\xi}+ 2{\eta})=s{\phi}_1+h\;in\;{\Omega},\end{array}$$ where $lim_{u{\rightarrow}{\infty}}\frac{gj(u)}{u}={\beta}_j$, $lim_{u{\rightarrow}-{\infty}}\frac{gj(u)}{u}={\alpha}_j$ are finite and the nonlinearity $g_1+2g_2$ crosses eigenvalues of A.

• Proceedings of the KSR Conference
• /
• 2002.10a
• /
• pp.125-130
• /
• 2002

This paper investigates the dynamic characteristics of a beam axially moving over multiple elastic supports. The spectral element matrix is derived first for the axially moving beam element and then it is used to formulate the spectral element matrix for the moving beam element with an interim elastic support. The moving speed dependance of the eigenvalues is numerically investigated by varying the applied axial tension and the stiffness of the elastic supports. Numerical results show that the fundamental eigenvalue vanishes first at the critical moving speed to generate the static instability.

• Structural Engineering and Mechanics
• /
• v.9 no.5
• /
• pp.449-467
• /
• 2000

The natural frequencies and the corresponding mode shapes of a non-uniform beam carrying multiple point masses are determined by using the analytical-and-numerical-combined method. To confirm the reliability of the last approach, all the presented results are compared with those obtained from the existing literature or the conventional finite element method and close agreement is achieved. For a "uniform" beam, the natural frequencies and mode shapes of the "clamped-hinged" beam are exactly equal to those of the "hinged-clamped" beam so that one eigenvalue equation is available for two boundary conditions, but this is not true for a "non-uniform" beam. To improve this drawback, a simple transformation function ${\varphi}({\xi})=(e+{\xi}{\alpha})^2$ is presented. Where ${\xi}=x/L$ is the ratio of the axial coordinate x to the beam length L, ${\alpha}$ is a taper constant for the non-uniform beam, e=1.0 for "positive" taper and e=1.0+$|{\alpha}|$ for "negative" taper (where $|{\alpha}|$ is the absolute value of ${\alpha}$). Based on the last function, the eigenvalue equation for a non-uniform beam with "positive" taper (with increasingly varying stiffness) is also available for that with "negative" taper (with decreasingly varying stiffness) so that half of the effort may be saved. For the purpose of comparison, the eigenvalue equations for a positively-tapered beam with five types of boundary conditions are derived. Besides, a general expression for the "normal" mode shapes of the non-uniform beam is also presented.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.515-522
• /
• 2001

A simplified method is presented for the computation of eigenvalue and eigenvector derivatives associated with repeated eigenvalues. In the proposed method, adjacent eigenvectors and orthonormal conditions are used to compose an algebraic equation whose order is (n+m)x(n+m), where n is the number of coordinates and m is the number of multiplicity of the repeated eigenvalue. One algebraic equation developed can be computed eigenvalue and eigenvector derivatives simultaneously. Since the coefficient matrix of the proposed equation is symmetric and based on N-space, this method is very efficient compared to previous methods. Moreover the numerical stability of the method is guaranteed because the coefficient matrix of the proposed equation is non-singular, This method can be consistently applied to both structural systems with structural design parameters and mechanical systems with lumped design parameters. To verify the effectiveness of the proposed method, the finite element model of the cantilever beam and a 5-DOF mechanical system in the case of a non-proportionally damped system are considered as numerical examples. The design parameter of the cantilever beam is its width, and that of the 5-DOF mechanical system is a spring.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.3
• /
• pp.371-383
• /
• 1999

An efficient and numerically stable eigensolution method for structures with multiple natural frequencies is presented. The proposed method is developed by improving the well-known subspace iteration method with shift. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. In this paper, the above singularity problem has been solved by introducing side conditions without sacrifice of convergence. The proposed method is always nonsingular even if a shift is on a distinct eigenvalue or multiple ones. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.10a
• /
• pp.225-233
• /
• 1995

This paper presents an efficient numerical method for computation of eigenpair derivatives for the real symmetric eigenvalue problem with distinct and multiple eigenvalues. The method has very simple algorithm and gives an exact solution. Furthermore, it saves computer storage and CPU time. The algorithm preserves the symmetry and band of the matrices, allowing efficient computer storage and solution techniques. Thus, the algorithm of the proposed method will be inserted easily in the commercial FEM codes. Results of the proposed method for calculating the eigenpair derivatives are compared with those of Rudisill and Chu's method and Nelson's method which is efficient one in the case of distinct natural frequencies. As an example to demonstrate the efficiency of the proposed method in the case of distinct eigenvalues, a cantilever plate is considered. The design parameter of the cantilever plate is its thickness. For the eigenvalue problem with multiple natural frequencies, the adjacent eigenvectors are used in the algebraic equation as side conditions, they lie adjacent to the m (multiplicity of multiple natural frequency) distinct eigenvalues, which appear when design parameter varies. As an example to demonstrate the efficiency of the proposed method in the case of multiple natural frequencies, a cantilever beam is considered. Results of the proposed method fDr calculating the eigenpair derivatives are compared with those of Bailey's method (an amendation of Ojalvo's work) which finds the exact eigenvector derivatives. The design parameter of the cantilever beam is its height. Data is persented showing the amount of CPU time used to compute the first ten eigenpair derivatives by each method. It is important to note that the numerical stability of the proposed method is proved.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.11
• /
• pp.1852-1861
• /
• 1997

An enhanced subspace iteration algorithm has been developed to solve eigenvalue problems reliably and efficiently. Basic subspace iteration algorithm has been improved by eliminating recalculation of converged eigenvectors, using Krylov sequence as initial vectors and incorporating with shifting techniques. The number of iterations and computational time have been considerably reduced when compared with the original one, and reliability for catching copies of the multiple roots has been retained successfully. Further research would be required for mathematical justification of the present method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.1
• /
• pp.13-20
• /
• 2009

The IPSAP which is a finite element analysis program has been developed for high parallel performance computing. This program consists of various analysis modules - stress, vibration and thermal analysis module, etc. The M orthogonal block Lanczos algorithm with shiftinvert transformation is used for solving eigenvalue problems in the vibration module. And the multifrontal algorithm which is one of the most efficient direct linear equation solvers is applied to factorization and triangular system solving phases in this block Lanczos iteration routine. In this study, the performance enhancement procedures of the IPSAP are composed of the following stages: 1) communication volume minimization of the factorization phase by modifying parallel matrix subroutines. 2) idling time minimization in triangular system solving phase by partial inverse of the frontal matrix and the LCM (least common multiple) concept.