• 대한수학회논문집
• /
• 제17권1호
• /
• pp.53-56
• /
• 2002

Suppose { $X_{n}$}$_{n=1}$$^{\infty}$ sequence of finite dimensional Banach spaces and suppose that X is either a closed subspace of (equation omitted) or a closed subspace of (equation omitted) with p>2. We show that every bounded linear operator from X to a Banach space Y of cotype q(2$\leq$q〈p) is compact.t.t.

• 디지털융복합연구
• /
• 제20권2호
• /
• pp.217-223
• /
• 2022

온라인 데이터 스트림에 대한 부분 공간 클러스터링은 데이터 공간 차원의 모든 부분 집합을 검사해야 하므로 많은 양의 메모리 자원을 필요로 한다. 유한한 메모리 공간에서 데이터 스트림에 대한 클러스터들의 지속적인 변화를 추적하기 위해 본 논문에서는 메모리 자원을 효과적으로 사용하는 격자기반 부분 공간 클러스터링 알고리즘을 제안한다. n차원 데이터 스트림이 주어지면 각 차원 데이터 공간에 있는 데이터 항목의 분포 정보를 격자셀 리스트에 의해 모니터링 된다. 첫번째 레벨의 격자셀 목록에서 데이터 항목의 빈도가 높아 단위 격자셀이 되면 해당 격자셀로부터 모든 가능한 부분 공간의 클러스터를 찾기 위해 다음 레벨의 격자셀 리스트를 자식 노드로 생성한다. 이와 같이 최대 다차원 n레벨의 격자셀 부분 공간 트리가 구성되고, k차원의 부분 공간 클러스터는 부분 공간 격자셀 트리의 k레벨에서 찾을 수 있다. 실험을 통해서 제안하는 방법이 기존 방법만큼 정확도를 유지하면서, 밀집 공간만 확장하여 컴퓨팅 자원을 보다 효율적으로 사용하는 것을 확인하였다.

• Steel and Composite Structures
• /
• 제18권2호
• /
• pp.289-303
• /
• 2015

This study presents a strategy so-called Subspace Search Mechanism (SSM) for reducing the computational time for convergence of population based metaheusristic algorithms. The selected metaheuristic for this study is the Cuckoo Search algorithm (CS) dealing with size optimization of trusses. The complexity of structural optimization problems can be partially due to the presence of high-dimensional design variables. SSM approach aims to reduce dimension of the problem. Design variables are categorized to predefined groups (subspaces). SSM focuses on the multiple use of the metaheuristic at hand for each subspace. Optimizer updates the design variables for each subspace independently. Updating rules require candidate designs evaluation. Each candidate design is the assemblage of responsible set of design variables that define the subspace of interest. SSM is incorporated to the Cuckoo Search algorithm for size optimizing of three small, moderate and large space trusses. Optimization results indicate that SSM enables the CS to work with less number of population (42%), as a result reducing the time of convergence, in exchange for some accuracy (1.5%). It is shown that the loss of accuracy can be lessened with increasing the order of complexity. This suggests its applicability to other algorithms and other complex finite element-based engineering design problems.

• 호남수학학술지
• /
• 제27권1호
• /
• pp.69-76
• /
• 2005

The aim of this work is to generalize $L_1$-approximation in order to apply them to a discrete approximation. In $L_1$-approximation, we use the norm given by $${\parallel}f{\parallel}_1={\int}{\mid}f{\mid}d{\mu}$$ where ${\mu}$ a non-atomic positive measure. In this paper, we go to the other extreme and consider measure ${\mu}$ which is purely atomic. In fact we shall assume that ${\mu}$ has exactly m atoms. For any ${\ell}$-tuple $b^1,\;{\cdots},\;b^{\ell}{\in}{\mathbb{R}}^m$, we defined the ${\ell}^m_1{w}$-norn, and consider $s^*{\in}S$ such that, for any $b^1,\;{\cdots},\;b^{\ell}{\in}{\mathbb{R}}^m$, $$\array{min&max\\{s{\in}S}&{1{\leq}i{\leq}{\ell}}}\;{\parallel}b^i-s{\parallel}_w$$, where S is a n-dimensional subspace of ${\mathbb{R}}^m$. The $s^*$ is called the Chebyshev center or a discrete simultaneous ${\ell}^m_1$-approximation from the finite dimensional subspace.

• 대한수학회보
• /
• 제59권2호
• /
• pp.285-301
• /
• 2022

In this paper, we mainly study the random sampling and reconstruction of signals living in the subspace V^p(𝚽, 𝚲) of L^p(ℝ^d), which is generated by a family of molecules 𝚽 located on a relatively separated subset 𝚲 ⊂ ℝ^d. The space V^p(𝚽, 𝚲) is used to model signals with finite rate of innovation, such as stream of pulses in GPS applications, cellular radio and ultra wide-band communication. The sampling set is independently and randomly drawn from a general probability distribution over ℝ^d. Under some proper conditions for the generators 𝚽 = {𝜙_λ : λ ∈ 𝚲} and the probability density function 𝜌, we first approximate V^p(𝚽, 𝚲) by a finite dimensional subspace V^p_N (𝚽, 𝚲) on any bounded domains. Then, we prove that the random sampling stability holds with high probability for all signals in V^p(𝚽, 𝚲) whose energy concentrate on a cube when the sampling size is large enough. Finally, a reconstruction algorithm based on random samples is given for signals in V^p_N (𝚽, 𝚲).

• 대한수학회보
• /
• 제35권1호
• /
• pp.127-140
• /
• 1998

In this paper, we discuss the characterizations and uniqueness of a one-sided best simultaneous approximation for a compact subset from a convex subset of a finite-dimensional subspace of a normed linear space $C_1(X)$. The motivation is furnished by the characterizations of the one-sided best simultaneous approximations for a finite subset ${f_1, \ldots, f_\ell}$ for any $\ell \in N$.

• Computers and Concrete
• /
• 제12권6호
• /
• pp.803-818
• /
• 2013

In this study, analytical and experimental modal analyses of a scaled bridge model are carried out to extract the dynamic characteristics such as natural frequency, mode shapes and damping ratios. For this purpose, a scaled bridge model is constructed in laboratory conditions. Three dimensional finite element model of the bridge is constituted and dynamic characteristics are determined, analytically. To identify the dynamic characteristics experimentally; Experimental Modal Analyses (ambient and forced vibration tests) are conducted to the bridge model. In the ambient vibration tests, natural excitations are provided and the response of the bridge model is measured. Sensitivity accelerometers are placed to collect signals from the measurements. The signals collected from the tests are processed by Operational Modal Analysis; and the dynamic characteristics of the bridge model are estimated using Enhanced Frequency Domain Decomposition and Stochastic Subspace Identification methods. In the forced vibration tests, excitation of the bridge model is induced by an impact hammer and the frequency response functions are obtained. From the finite element analyses, a total of 8 natural frequencies are attained between 28.33 and 313.5 Hz. Considering the first eight mode shapes, these modes can be classified into longitudinal, transverse and vertical modes. It is seen that the dynamic characteristics obtained from the ambient and forced vibration tests are close to each other. It can be stated that the both of Enhanced Frequency Domain Decomposition and Stochastic Subspace Identification methods are very useful to identify the dynamic characteristics of the bridge model. The first eight natural frequencies are obtained from experimental measurements between 25.00-299.5 Hz. In addition, the dynamic characteristics obtained from the finite element analyses have a good correlation with experimental frequencies and mode shapes. The MAC values obtained between 90-100% and 80-100% using experimental results and experimental-analytical results, respectively.

• Structural Engineering and Mechanics
• /
• 제81권4호
• /
• pp.411-428
• /
• 2022

This paper presents the Campbell diagram analysis of the rotordynamic system using the full order model (FOM) and the reduced order model (ROM) techniques to determine the critical speeds, identify the stability and reduce the computational time. Due to the spin-speed-dependent matrices (e.g., centrifugal stiffening matrix), several model order reduction (MOR) techniques may be considered, such as the modal superposition (MS) method and the Krylov subspace-based MOR techniques (e.g., Ritz vector (RV), quasi-static Ritz vector (QSRV), multifrequency quasi-static Ritz vector (MQSRV), multifrequency/ multi-spin-speed quasi-static Ritz vector (MMQSRV) and the combined Ritz vector & modal superposition (RV+MS) methods). The proposed MMQSRV method in this study is extended from the MQSRV method by incorporating the rotational-speed-dependent stiffness matrices into the Krylov subspace during the MOR process. Thus, the objective of this note is to respond to the question of whether to use the MS method or the Krylov subspace-based MOR technique in establishing the Campbell diagram of the shaft-disc-blade assembly systems in three-dimensional (3D) finite element analysis (FEA). The Campbell diagrams produced by the FOM and various MOR methods are presented and discussed thoroughly by computing the norm of relative errors (ER). It is found that the RV and the MS methods are dominant at low and high rotating speeds, respectively. More precisely, as the spinning velocity becomes large, the calculated ER produced by the RV method is significantly increased; in contrast, the ER produced by the MS method is smaller and more consistent. From a computational point of view, the MORs have substantially reduced the time computing considerably compared to the FOM. Additionally, the verification of the 3D FE rotordynamic model is also provided and found to be in close agreement with the existing solutions.

• 한국컴퓨터정보학회논문지
• /
• 제18권3호
• /
• pp.91-96
• /
• 2013

r-fold Wiener process는 실질적으로 infinite dimension이고, 컴퓨터는 finitely dimensional subspace만 취급할 수 있기 때문에 f-fold Wiener process는 컴퓨터로 구현될 수 없다. 따라서 본 논문에서는 r-fold Wiener process의 m-dimensional approximation 함수의 특성에 대해 연구한다.

• 대한수학회지
• /
• 제41권1호
• /
• pp.21-38
• /
• 2004

We prove that a Banach space that is convex-transitive and such that for some element u in the unit sphere, and for every subspace Μ containing u, it happens that the subset of norm attaining functionals on Μ is second Baire category in $M^{*}$ is, in fact, almost-transitive and superreflexive. We also obtain a characterization of finite-dimensional spaces in terms of functions that attain their supremum: a Banach space is finite-dimensional if, for every equivalent norm, every rank-one operator attains its numerical radius. Finally, we describe the subset of norm attaining functionals on a space isomorphic to $\ell$$_1$, where the norm is the restriction of a Luxembourg norm on $L_1$. In fact, the subset of norm attaining functionals for this norm coincides with the subset of norm attaining functionals for the usual norm.m.