• Title/Summary/Keyword: reducing subspace

Search Result 12, Processing Time 0.019 seconds

Subspace search mechanism and cuckoo search algorithm for size optimization of space trusses

  • Kaveh, A.;Bakhshpoori, T.
    • Steel and Composite Structures
    • /
    • v.18 no.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.

REDUCING SUBSPACES OF A CLASS OF MULTIPLICATION OPERATORS

  • Liu, Bin;Shi, Yanyue
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1443-1455
    • /
    • 2017
  • Let $M_{z^N}(N{\in}{\mathbb{Z}}^d_+)$ be a bounded multiplication operator on a class of Hilbert spaces with orthogonal basis $\{z^n:n{\in}{\mathbb{Z}}^d_+\}$. In this paper, we prove that each reducing subspace of $M_{z^N}$ is the direct sum of some minimal reducing subspaces. For the case that d = 2, we find all the minimal reducing subspaces of $M_{z^N}$ ($N=(N_1,N_2)$, $N_1{\neq}N_2$) on weighted Bergman space $A^2_{\alpha}({\mathbb{B}}_2)$(${\alpha}$ > -1) and Hardy space $H^2({\mathbb{B}}_2)$, and characterize the structure of ${\mathcal{V}}^{\ast}(z^N)$, the commutant algebra of the von Neumann algebra generated by $M_{z^N}$.

Subspace Speech Enhancement Using Subband Whitening Filter (서브밴드 백색화 필터를 이용한 부공간 잡음 제거)

  • 김종욱;유창동
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.3
    • /
    • pp.169-174
    • /
    • 2003
  • A novel subspace speech enhancement using subband whitening filter is proposed. Previous subspace speech enhancement method either assumes additive white noise or uses whitening filter as a pre-processing for colored noise. The proposed method tries to minimize the signal distortion while reducing residual noise by processing the signal using subband whitening filter. By incorporating the notion of subband whitening filter, spectral resolution in Karhunen-Loeve(KL) domain is improved with the negligible additional computational load. The proposed method outperforms both the subspace method suggested by Ephraim and the spectral subtraction suggested by Boll in terms of segmental signal-to-noise ratio (SNRseg) and perceptual evaluation of speech quality (PESQ).

MAXIMUM SUBSPACES RELATED TO A-CONTRACTIONS AND QUASINORMAL OPERATORS

  • Suciu, Laurian
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.1
    • /
    • pp.205-219
    • /
    • 2008
  • It is shown that if $A{\geq}0$ and T are two bounded linear operators on a complex Hilbert space H satisfying the inequality $T^*\;AT{\leq}A$ and the condition $AT=A^{1/2}TA^{1/2}$, then there exists the maximum reducing subspace for A and $A^{1/2}T$ on which the equality $T^*\;AT=A$ is satisfied. We concretely express this subspace in two ways, and as applications, we derive certain decompositions for quasinormal contractions. Also, some facts concerning the quasi-isometries are obtained.

REDUCING SUBSPACES FOR TOEPLITZ OPERATORS ON THE POLYDISK

  • Shi, Yanyue;Lu, Yufeng
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.2
    • /
    • pp.687-696
    • /
    • 2013
  • In this note, we completely characterize the reducing subspaces of $T_{{z^N_1}{z^M_2}}$ on $A^2_{\alpha}(D^2)$ where ${\alpha}$ > -1 and N, M are positive integers with $N{\neq}M$, and show that the minimal reducing subspaces of $T_{{z^N_1}{z^M_2}}$ on the unweighted Bergman space and on the weighted Bergman space are different.

A Realization of Reduced-Order Detection Filters

  • Kim, Yong-Min;Park, Jae-Hong
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.1
    • /
    • pp.142-148
    • /
    • 2008
  • In this paper, we deal with the problem of reducing the order of the detection filter for the linear time-invariant system. Even if the detection filter is generally designed in the form of full order linear observer, we show that it is possible to reduce its order when the response of fault signals is limited to a subspace of the estimation state space. We propose a method to extract the subspace using the observer canonical form considering the dynamics related to the remaining subspace acts as a disturbance. We designed a reduced order detection filter to reject the disturbance as well as to guarantee fault detection and isolation. A simulation result for a 5th order system is presented as an illustrative example of the proposed design method.

A Study on an Improved MVE for Estimating the Direction of Arrival of Multiple Sources (다중 신호원의 도래방향 추정을 위한 개선된 MVE에 관한 연구)

  • 정용민;신준호;김용득
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.687-690
    • /
    • 1999
  • Many high-resolution algorithms based on the eigen-decomposition analysis of observed covariance matrix, such as MVE, MUSIC, and EVM, have been proposed. However, the resolution of spectral estimates for these algorithms is severely degraded when Signal-to-Noise Ratio (SNR) is low and arrival angles of signal are close to each other. And EVM and MUSIC is powerful for the characteristic of SNR. But have the limitation that the number of signals presented is known. While MVE is bad the characteristic of SNR. In this study, we propose a modified MVE to enhance the resolution for Direction-Of-Arrival (DOA) estimation of underwater acoustic signal. This is to remove the limitation that existing algorithms should know the information for the number of signals. Because the algorithms founded on the eigen value estimate DOA with only the noise subspace, they have the high-resolution characteristic. And then, with the method reducing the effect of the signal subspace, we are to reduce the degradation because of complementary relationship between the signal subspace and the noise subspace. This paper, with using the simulation data, we have estimated the proposed algorithms, compared it with other high-resolution algorithms. The simulation results show that the modified MVE proposed is accurate and has a better resolution even though SNR is low, under the same condition.

  • PDF

MULTIPLICATION OPERATORS ON BERGMAN SPACES OVER POLYDISKS ASSOCIATED WITH INTEGER MATRIX

  • Dan, Hui;Huang, Hansong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.1
    • /
    • pp.41-50
    • /
    • 2018
  • This paper mainly considers a tuple of multiplication operators on Bergman spaces over polydisks which essentially arise from a matrix, their joint reducing subspaces and associated von Neumann algebras. It is shown that there is an interesting link of the non-triviality for such von Neumann algebras with the determinant of the matrix. A complete characterization of their abelian property is given under a more general setting.

Efficient Performance Enhancement Scheme for Adaptive Antenna Arrays in a Rayleigh Fading and Multicell Environments

  • Kim Kyung-Seok;Ahn Bierng-Chearl;Choi Ik-Gueu
    • Journal of electromagnetic engineering and science
    • /
    • v.5 no.2
    • /
    • pp.49-60
    • /
    • 2005
  • In this paper, an efficient performance enhancement scheme for an adaptive antenna array under the flat and the frequency-selective Rayleigh fadings is proposed. The proposed signal enhancement scheme is the modified linear signal estimator which combines the rank N approximation by reducing noise eigenvalues(RANE) and Toeplitz matrix approximation(TMA) methods into the linear signal estimator. The proposed performance enhancement scheme is performed by not only reducing the noise component from the signal-plus-noise subspace using RANE but also having the theoretical property of noise-free signal using TMA. Consequently, the key idea of the proposed performance enhancement scheme is to greatly enhance the performance of an adaptive antenna array by removing all undesired noise effects from the post-correlation received signal. The proposed performance enhancement scheme applies at the Wiener maximal ratio combining(MRC) method which has been widely used as the conventional adaptive antenna array. It is shown through several simulation results that the performance of an adaptive antenna array using the proposed signal enhancement scheme is much superior to that of a system using the conventional method under several environments, i.e., a flat Rayleigh fading, a fast frequency-selective Rayleigh fading, a perfect/imperfect power control, a single cell, and a multicell.