• Title/Summary/Keyword: Singular Vector

Search Result 85, Processing Time 0.068 seconds

ON SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR VECTOR OPTIMIZATION PROBLEMS

  • Lee, Gue-Myung;Kim, Moon-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.2
    • /
    • pp.287-305
    • /
    • 2003
  • Second order necessary optimality condition for properly efficient solutions of a twice differentiable vector optimization problem is given. We obtain a nonsmooth version of the second order necessary optimality condition for properly efficient solutions of a nondifferentiable vector optimization problem. Furthermore, we prove a second order necessary optimality condition for weakly efficient solutions of a nondifferentiable vector optimization problem.

ILL-VERSUS WELL-POSED SINGULAR LINEAR SYSTEMS: SCOPE OF RANDOMIZED ALGORITHMS

  • Sen, S.K.;Agarwal, Ravi P.;Shaykhian, Gholam Ali
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.621-638
    • /
    • 2009
  • The linear system Ax = b will have (i) no solution, (ii) only one non-trivial (trivial) solution, or (iii) infinity of solutions. Our focus will be on cases (ii) and (iii). The mathematical models of many real-world problems give rise to (a) ill-conditioned linear systems, (b) singular linear systems (A is singular with all its linearly independent rows are sufficiently linearly independent), or (c) ill-conditioned singular linear systems (A is singular with some or all of its strictly linearly independent rows are near-linearly dependent). This article highlights the scope and need of a randomized algorithm for ill-conditioned/singular systems when a reasonably narrow domain of a solution vector is specified. Further, it stresses that with the increasing computing power, the importance of randomized algorithms is also increasing. It also points out that, for many optimization linear/nonlinear problems, randomized algorithms are increasingly dominating the deterministic approaches and, for some problems such as the traveling salesman problem, randomized algorithms are the only alternatives.

  • PDF

Power Efficient Precoding by Reducing the Effect of the Largest Singular Value of channel Inverse Matrix (채널 역변환 매트릭스의 가장 큰 싱귤러 값 영향을 줄이는 다중 사용자 프리코딩)

  • Ro, Se Yong;Yang, Hyun Wook;Chong, Jong Wha
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.115-120
    • /
    • 2012
  • In multi-user multi-input multi-output (MU-MIMO) system, zero forcing beamforming (ZFB) is regarded as a realistic solution for transmitting scheme due to its low complexity and simple structure. However, ZFB shows a significant performance degradation when channel matrix has large condition number. In this case, the largest singular value of the channel inversion matrix has a dominant effect on transmit power. In this paper, we propose a perturbation method for reducing an effect of the dominant singular value. In the proposed algorithm, channel inverse matrix is first decomposed by SVD for the transmit signal to be expressed as a combination of singular vectors. Then, the transmit signal is perturbed to reduce the coefficient of the singular vector corresponding to the largest singular value. When a number of transmit antennas is 4, the simulation results of this paper shows that the proposed method shows 8dB performance enhancement at 10-3 uncoded bit error rate (BER) compared with conventional ZFB. Also, the simulation results show that the proposed method provides a comparable performance to Tomlinson-Harashima Precoding (THP) with much lower complexity.

Analysis of Electromagnetic Scattering from an Arbitrarily-Shaped Conductor using Duffy한s Method (Duffy 방법을 이용한 임의 형상 도체의 전자파 산란 해석)

  • 이승학;김채영;이창원
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.8
    • /
    • pp.834-842
    • /
    • 2002
  • The method of moment is applied to the analysis of electromagnetic scattering from an arbitrarily-shaped conductor. The conducting surface is discretized into triangular patches using a GID tool. Surface currents on a conductor are expanded with a vector triangle basis function. By using the Duffy's method, the singular integration appeared in a triangle patch can be transformed into the non-singular integral form suitable for one dimensional Gaussian quadrature integration method. Mutual and self integration extracted singular terms are evaluated by two dimensional Gaussian quadrature techniques.

EVENTUAL SHADOWING FOR CHAIN TRANSITIVE SETS OF C1 GENERIC DYNAMICAL SYSTEMS

  • Lee, Manseob
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1059-1079
    • /
    • 2021
  • We show that given any chain transitive set of a C1 generic diffeomorphism f, if a diffeomorphism f has the eventual shadowing property on the locally maximal chain transitive set, then it is hyperbolic. Moreover, given any chain transitive set of a C1 generic vector field X, if a vector field X has the eventual shadowing property on the locally maximal chain transitive set, then the chain transitive set does not contain a singular point and it is hyperbolic. We apply our results to conservative systems (volume-preserving diffeomorphisms and divergence-free vector fields).

An Implementation of Inverse Filter Using SVD for Multi-channel Sound Reproduction (SVD를 이용한 다중 채널상에서의 음재생을 위한 역변환 필터의 구현)

  • 이상권;노경래
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.8
    • /
    • pp.3-11
    • /
    • 2001
  • This paper describes an implementation of inverse filter using SVD in order to recover the input in multi-channel system. The matrix formulation in SISO system is extended to MIMO system. In time and frequency domain we investigates the inversion of minimum phase system and non-minimum phase system. To execute an effective inversion of non-minimum phase system, SVD is introduced. First of all we computes singular values of system matrix and then investigates the phase property of system. In case of overall system is non-minimum phase, system matrix has one (or more) very small singular value (s). The very small singular value (s) carries information about phase properties of system. Using this property, approximate inverse filter of overall system is founded. The numerical simulation shows potentials in use of the inverse filter.

  • PDF

SINGULAR THEOREMS FOR LIGHTLIKE SUBMANIFOLDS IN A SEMI-RIEMANNIAN SPACE FORM

  • Jin, Dae Ho
    • East Asian mathematical journal
    • /
    • v.30 no.3
    • /
    • pp.371-383
    • /
    • 2014
  • We study the geometry of lightlike submanifolds of a semi-Riemannian manifold. The purpose of this paper is to prove two singular theorems for irrotational lightlike submanifolds M of a semi-Riemannian space form $\bar{M}(c)$ admitting a semi-symmetric non-metric connection such that the structure vector field of $\bar{M}(c)$ is tangent to M.

EQUIVALENT DEFINITIONS OF RESCALED EXPANSIVENESS

  • Wen, Xiao;Yu, Yining
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.593-604
    • /
    • 2018
  • Recently, a new version of expansiveness which is closely attached to some certain weak version of hyperbolicity was given for $C^1$ vector fields as following: a $C^1$ vector field X will be called rescaling expansive on a compact invariant set ${\Lambda}$ of X if for any ${\epsilon}$ > 0 there is ${\delta}$ > 0 such that, for any $x,\;y{\in}{\Lambda}$ and any time reparametrization ${\theta}:{\mathbb{R}}{\rightarrow}{\mathbb{R}}$, if $d({\varphi}_t(x),\,{\varphi}_{{\theta}(t)}(y)){\leq}{\delta}{\parallel}X({\varphi}_t(x)){\parallel}$ for all $t{\in}{\mathbb{R}}$, then ${\varphi}_{{\theta}(t)}(y){\in}{\varphi}_{(-{\epsilon},{\epsilon})}({\varphi}_t(x))$ for all $t{\in}{\mathbb{R}}$. In this paper, some equivalent definitions for rescaled expansiveness are given.

DEFECT INSPECTION IN SEMICONDUCTOR IMAGES USING HISTOGRAM FITTING AND NEURAL NETWORKS

  • JINKYU, YU;SONGHEE, HAN;CHANG-OCK, LEE
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.26 no.4
    • /
    • pp.263-279
    • /
    • 2022
  • This paper presents an automatic inspection of defects in semiconductor images. We devise a statistical method to find defects on homogeneous background from the observation that it has a log-normal distribution. If computer aided design (CAD) data is available, we use it to construct a signed distance function (SDF) and change the pixel values so that the average of pixel values along the level curve of the SDF is zero, so that the image has a homogeneous background. In the absence of CAD data, we devise a hybrid method consisting of a model-based algorithm and two neural networks. The model-based algorithm uses the first right singular vector to determine whether the image has a linear or complex structure. For an image with a linear structure, we remove the structure using the rank 1 approximation so that it has a homogeneous background. An image with a complex structure is inspected by two neural networks. We provide results of numerical experiments for the proposed methods.

A Blind Watermarking Scheme Using Singular Vector Based On DWT/RDWT/SVD (DWT/RDWT/SVD에 기반한 특이벡터를 사용한 블라인드 워터마킹 방안)

  • Luong, Ngoc Thuy Dung;Sohn, Won
    • Journal of Broadcast Engineering
    • /
    • v.21 no.2
    • /
    • pp.149-156
    • /
    • 2016
  • We proposed a blind watermarking scheme using singular vectors based on Discrete Wavelet Transform (DWT) and Redundant Discrete Wavelet Transform (RDWT) combined with Singular Value Decomposition (SVD) for copyright protection application. We replaced the 1st left and right singular vectors decomposed from cover image with the corresponding ones from watermark image to overcome the false-positive problem in current watermark systems using SVD. The proposed scheme realized the watermarking system without a false positive problem, and shows high fidelity and robustness.