• 제목/요약/키워드: matrix method

검색결과 7,437건 처리시간 0.034초

Natural frequencies and mode shapes of thin-walled members with shell type cross section

  • Ohga, M.;Shigematsu, T.;Hara, T.
    • Steel and Composite Structures
    • /
    • 제2권3호
    • /
    • pp.223-236
    • /
    • 2002
  • An analytical procedure based on the transfer matrix method to estimate not only the natural frequencies but also vibration mode shapes of the thin-walled members composed of interconnected cylindrical shell panels is presented. The transfer matrix is derived from the differential equations for the cylindrical shell panels. The point matrix relating the state vectors between consecutive shell panels are used to allow the transfer procedures over the cross section of the members. As a result, the interactions between the shell panels of the cross sections of the members can be considered. Although the transfer matrix method is naturally a solution procedure for the one-dimensional problems, this method is well applied to thin-walled members by introducing the trigonometric series into the governing equations of the problem. The natural frequencies and vibration mode shapes of the thin-walled members composed of number of interconnected cylindrical shell panels are observed in this analysis. In addition, the effects of the number of shell panels on the natural frequencies and vibration mode shapes are also examined.

An efficient method for structural damage localization based on the concepts of flexibility matrix and strain energy of a structure

  • Nobahari, Mehdi;Seyedpoor, Seyed Mohammad
    • Structural Engineering and Mechanics
    • /
    • 제46권2호
    • /
    • pp.231-244
    • /
    • 2013
  • An efficient method is proposed here to identify multiple damage cases in structural systems using the concepts of flexibility matrix and strain energy of a structure. The flexibility matrix of the structure is accurately estimated from the first few mode shapes and natural frequencies. Then, the change of strain energy of a structural element, due to damage, evaluated by the columnar coefficients of the flexibility matrix is used to construct a damage indicator. This new indicator is named here as flexibility strain energy based index (FSEBI). In order to assess the performance of the proposed method for structural damage detection, two benchmark structures having a number of damage scenarios are considered. Numerical results demonstrate that the method can accurately locate the structural damage induced. It is also revealed that the magnitudes of the FSEBI depend on the damage severity.

ON CONVERGENCE OF THE MODIFIED GAUSS-SEIDEL ITERATIVE METHOD FOR H-MATRIX LINEAR SYSTEM

  • Miao, Shu-Xin;Zheng, Bing
    • 대한수학회논문집
    • /
    • 제28권3호
    • /
    • pp.603-613
    • /
    • 2013
  • In 2009, Zheng and Miao [B. Zheng and S.-X. Miao, Two new modified Gauss-Seidel methods for linear system with M-matrices, J. Comput. Appl. Math. 233 (2009), 922-930] considered the modified Gauss-Seidel method for solving M-matrix linear system with the preconditioner $P_{max}$. In this paper, we consider the modified Gauss-Seidel method for solving the linear system with the generalized preconditioner $P_{max}({\alpha})$, and study its convergent properties when the coefficient matrix is an H-matrix. Numerical experiments are performed with different examples, and the numerical results verify our theoretical analysis.

원형어레이에서의 새로운 어레이 공분산 행렬 추정 방법 (A new metchod for estimating array covariance matrix in circular array)

  • 김영수;김영수;김창주;박한규;최상삼
    • 한국통신학회논문지
    • /
    • 제22권7호
    • /
    • pp.1534-1542
    • /
    • 1997
  • In this paper, we present a performance improvement method for the direction-of-arrival (DOA) estimation algorithm of the narrowband signals incident on a uniform circular array. It is very important to estimate the covariance matrix effectively because the performance of DOA algorithm mainly depends on the exactness of the sampel coveriance matrix which is computed from the received samples of signals. In case of uniform circular array with the even number sensors, the structure of the arrray has a useful geometrical property. Therefore we present the method which can estimate covariance matrix more effectively using this property. The simulation results are shown to demonstrate the superior perfodrmance obtained by the proposed covariance matrix estimation method relative to that of the conventional estimation method.

  • PDF

GPU와 지역성을 이용한 행렬 곱셈 가속 (Matrix Multiplication Acceleration with GPU and Locality)

  • 권오영;이창묵
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 추계학술대회
    • /
    • pp.902-903
    • /
    • 2009
  • 행렬 곱셈은 과학 및 공학분야에 다양하게 응용되고 있다. 행렬 곱셈의 경우 지역성을 활용하면 수행 성능을 크게 개선할 수 있다. GPU가 장착된 PC에서 CPU의 컴퓨팅 능력과 GPU의 컴퓨팅 능력을 같이 활용하여 행렬 곱셈을 가속하는 방법을 제시하였다. 제안된 방법이 GPU만을 사용하는 것보다 약 15%~30%의 성능을 향상시켰다.

  • PDF

MODULUS-BASED SUCCESSIVE OVERRELAXATION METHOD FOR PRICING AMERICAN OPTIONS

  • Zheng, Ning;Yin, Jun-Feng
    • Journal of applied mathematics & informatics
    • /
    • 제31권5_6호
    • /
    • pp.769-784
    • /
    • 2013
  • We consider the modulus-based successive overrelaxation method for the linear complementarity problems from the discretization of Black-Scholes American options model. The $H_+$-matrix property of the system matrix discretized from American option pricing which guarantees the convergence of the proposed method for the linear complementarity problem is analyzed. Numerical experiments confirm the theoretical analysis, and further show that the modulus-based successive overrelaxation method is superior to the classical projected successive overrelaxation method with optimal parameter.

CONVERGENCE OF PARALLEL MULTISPLITTING METHODS USING ILU FACTORIZATIONS

  • Yun, Jae-Heon;Oh, Se-Young;Kim, Eun-Heui
    • Journal of applied mathematics & informatics
    • /
    • 제15권1_2호
    • /
    • pp.77-90
    • /
    • 2004
  • In this paper, we study the convergence of both relaxed multisplitting method and nonstationary two-stage multisplitting method associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is an H-matrix. Also, parallel performance results of nonstaionary two-stage multisplitting method using ILU factorizations as inner splittings on the IBM p690 supercomputer are provided to analyze theoretical results.

CONVERGENCE OF SSOR MULTISPLITTING METHOD FOR AN M-MATRIX

  • Yun, Jae-Heon;Han, Yu-Du;Oh, Se-Young
    • Journal of applied mathematics & informatics
    • /
    • 제24권1_2호
    • /
    • pp.273-282
    • /
    • 2007
  • In this paper, we study the convergence of both the multisplitting method and the relaxed multisplitting method associated with SOR or SSOR multisplittings for solving a linear system whose coefficient matrix is an M-matrix.

A SYMMETRIC-DEFINITE PENCIL APPROACH TO SOURCE SEPARATION

  • Park, Seungjin
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1827-1830
    • /
    • 2002
  • A matrix pencil method for source separation 〔3〕was shown to be an unbiased signal extractor in the presence of temporally white noise. Its efficiency and robustness lies in the fact that the method in 〔3〕 employs only time-delayed correlation matrices of the observation data, In this paper we stress out that the matrix pencil method might suffer from a numerical instability problem, be- cause the symmetric-definite pencil was not exploited. Moreover we present a simple method of constructing a symmetric-definite pencil so that the matrix pencil method is numerically stable.

  • PDF

Efficient Solving Methods Exploiting Sparsity of Matrix in Real-Time Multibody Dynamic Simulation with Relative Coordinate Formulation

  • Choi, Gyoojae;Yoo, Yungmyun;Im, Jongsoon
    • Journal of Mechanical Science and Technology
    • /
    • 제15권8호
    • /
    • pp.1090-1096
    • /
    • 2001
  • In this paper, new methods for efficiently solving linear acceleration equations of multibody dynamic simulation exploiting sparsity for real-time simulation are presented. The coefficient matrix of the equations tends to have a large number of zero entries according to the relative joint coordinate numbering. By adequate joint coordinate numbering, the matrix has minimum off-diagonal terms and a block pattern of non-zero entries and can be solved efficiently. The proposed methods, using sparse Cholesky method and recursive block mass matrix method, take advantages of both the special structure and the sparsity of the coefficient matrix to reduce computation time. The first method solves the η$\times$η sparse coefficient matrix for the accelerations, where η denotes the number of relative coordinates. In the second method, for vehicle dynamic simulation, simple manipulations bring the original problem of dimension η$\times$η to an equivalent problem of dimension 6$\times$6 to be solved for the accelerations of a vehicle chassis. For vehicle dynamic simulation, the proposed solution methods are proved to be more efficient than the classical approaches using reduced Lagrangian multiplier method. With the methods computation time for real-time vehicle dynamic simulation can be reduced up to 14 per cent compared to the classical approach.

  • PDF