• 전산구조공학
• /
• 제11권1호
• /
• pp.217-226
• /
• 1998

본 논문은 변위제약모드를 갖는 트러스구조물의 형태해석을 목적으로 하였으며, 이를 위하여 해의 존재조건과 무어-펜로즈(Moore-Penrose) 일반역행렬을 이용하였다. 또한, 수치해석과정에서의 변위제약모드로는 호몰로지변형(homologous deformation)을 고려하여 해석하였고, 다음으로 다양한 변위제약모드와 절점에 작용하는 하중비를 만족하는 구조물의 형태를 구하였다. 본 논문에서의 형태해석문제는 지정된 변위를 만족하는 구조물의 형태를 찾는 일종의 역문제(inverse problem)로서 일반적인 구조해석과정과는 반대되는 입장에서 접근하였다. 또한, 본 논문에서는 수치해석과정에서 근사해의 정도를 향상시키기 위하여 뉴튼-랩슨법을 사용하였고, 수치해석예제로서 부재의 배열형태에 따라 3가지모델을 선택하였으며, 이들 모델을 통하여 적용한 해석기법의 정확성과 효율성을 검증하였다.

• 한국공간구조학회논문집
• /
• 제3권2호
• /
• pp.101-107
• /
• 2003

There exists a structural problem for link structures in the unstable state. The primary characteristics of this problem are in the existence of rigid body displacements without strain, and in the possibility of the introduction of prestressing to change an unstable state into a stable state. When we make local linearized incremental equations in order to obtain knowledge about these unstable structures, the determinant of the coefficient matrices is zero, so that we face a numerically unstable situation. This is similar to the situation in the stability problem. To avoid such a difficult situation, in this paper a simple and straightforward method was presented by means of the generalized inverse for the numerical analysis of stability problem.

• Architectural research
• /
• 제8권2호
• /
• pp.37-42
• /
• 2006

Starting from the quadratic optimal control algorithm, this study obtains the relation of the performance index for constrained systems and Gauss's principle. And minimizing a function of the variation in kinetic energy at constrained and unconstrained states with respect to the velocity variation, the dynamic equation is derived and it is shown that the result compares with the generalized inverse method proposed by Udwadia and Kalaba. It is investigated that the responses of a 10-story building are constrained by the installation of a two-bar structure as an application to utilize the derived equations. The structural responses are affected by various factors like the length of each bar, damping, stiffness of the bar structure, and the junction positions of two structures. Under an assumption that the bars have the same mass density, this study determines the junction positions to minimize the total dynamic responses of the structure.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.729-732
• /
• 1995

This paper presents a Generalized Iteration (GI) which includes power method, inverse power method, shifted inverse power method, and Rayleigh quotient iteration (RQI), and modified RQI (MRQI). Furthermore, we propose a GI-based algorithm to find arbitrary eigenpairs for Hermitian matrices. The proposed algorithm appears to be much faster and more accurate than the valuable generalized MRQI of Hu (GMRQI-Hu). The idea of GI is also employed to speed up the GMRQI-Hu and we propose a modified version of Hu's GMRQI (GMRQI-Hu-mod) which is improved in the convergence rate. Some numerical simulation results are presented to confirm our contributions

• Journal of applied mathematics & informatics
• /
• 제32권1_2호
• /
• pp.61-74
• /
• 2014

This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.

• International Journal of Computer Science & Network Security
• /
• 제24권9호
• /
• pp.21-29
• /
• 2024

Precoding of the orthogonal frequency division multiplexing (OFDM) with Walsh Hadamard transform (WHT) is known in the literature. Instead of performing WHT precoding and inverse discrete Fourier transform separately, a product of two matrix can yield a new matrix that can be applied with lower complexity. This resultant transform, T-transform, results in T-OFDM. This paper extends the limited existing work on T-OFDM significantly by presenting detailed account of its computational complexity, a lower complexity receiver design, an expression for PAPR and its cumulative distribution function (cdf), sensitivity of T-OFDM to timing synchronization errors, and novel analytical expressions signal to noise ratio (SNR) for multiple equalization techniques. Simulation results are presented to show significant improvements in PAPR performance, as well improvement in bit error rate (BER) in Rayleigh fading channel. This paper is Part II of a three-paper series on alternative transforms and many of the concepts and result refer to and stem from results in generalized multicarrier communication (GMC) system presented in Part I of this series.

• 대한수학회지
• /
• 제47권4호
• /
• pp.831-843
• /
• 2010

Let $\cal{H}$ and $\cal{K}$ be Hilbert spaces and let T, $\tilde{T}$ = T + ${\delta}T$ be bounded operators from $\cal{H}$ into $\cal{K}$. In this article, two facts related to the perturbation bounds are studied. The first one is to find the upper bound of $\parallel\tilde{T}^+\;-\;T^+\parallel$ which extends the results obtained by the second author and enriches the perturbation theory for the Moore-Penrose inverse. The other one is to develop explicit representations of projectors $\parallel\tilde{T}\tilde{T}^+\;-\;TT^+\parallel$ and $\parallel\tilde{T}^+\tilde{T}\;-\;T^+T\parallel$. In addition, some spectral cases related to these results are analyzed.

• Journal of electromagnetic engineering and science
• /
• 제7권1호
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.

• Journal of Mechanical Science and Technology
• /
• 제18권11호
• /
• pp.1891-1899
• /
• 2004

The characteristics of dynamic systems subjected to multiple linear constraints are determined by considering the constrained effects. Although there have been many researches to investigate the dynamic characteristics of constrained systems, most of them depend on numerical analysis like Lagrange multipliers method. In 1992, Udwadia and Kalaba presented an explicit form to describe the motion for constrained discrete systems. Starting from the method, this study determines the dynamic characteristics of the systems to have positive semidefinite mass matrix and the continuous systems. And this study presents a closed form to calculate frequency response matrix for constrained systems subjected to harmonic forces. The proposed methods that do not depend on any numerical schemes take more generalized forms than other research results.

• 충청수학회지
• /
• 제29권2호
• /
• pp.267-281
• /
• 2016

In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.