• 제목/요약/키워드: Singular Vector

검색결과 85건 처리시간 0.024초

ON SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR VECTOR OPTIMIZATION PROBLEMS

  • Lee, Gue-Myung;Kim, Moon-Hee
    • 대한수학회지
    • /
    • 제40권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
    • /
    • 제27권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)

  • 노세용;양현욱;정정화
    • 디지털산업정보학회논문지
    • /
    • 제8권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.

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

  • 이승학;김채영;이창원
    • 한국전자파학회논문지
    • /
    • 제13권8호
    • /
    • pp.834-842
    • /
    • 2002
  • 임의 모양의 완전도체의 전자파 산란을 해석하기 위하여 모멘트 방법을 이용하였다. GID(Graphic Interface Design)툴을 이용하여 설계된 금속 도체의 표면은 서로 다른 모양의 삼각패치로 모델링 되었다. 도체 표면전류는 삼각패치의 벡터 기저함수로 확장되었다. 관측점과 전원점이 동일 삼각패치에 위치할 때, 삼각패치의 특이점 적분은 Duffy 방법을 이용하여 특이점이 없는 적분으로 변환이 가능하였고, 변환된 특이점 항들은 1차원의 가우시안 구적법을 이용하여 간단하게 계산되어질 수 있었다. 특이점을 제외한 적분들은 2차원 가우시안 구적법으로 계산되었다.

EVENTUAL SHADOWING FOR CHAIN TRANSITIVE SETS OF C1 GENERIC DYNAMICAL SYSTEMS

  • Lee, Manseob
    • 대한수학회지
    • /
    • 제58권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).

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

  • 이상권;노경래
    • 한국음향학회지
    • /
    • 제20권8호
    • /
    • pp.3-11
    • /
    • 2001
  • 본 연구에서는 SVD (Singular Value Decomposition)를 이용하여 다중입력과 다중출력을 가지는 시스템에서의 입력을 알아내기 위해 역변환 필터를 구현하였다. SISO (Single-Input and Single-Output)시스템의 입력과 출력의 관계에 대한 행렬공식화 작업을 확장하여 MIMO (Multi-Input and Multi-Output)시스템에 적용하였다. 그리고 시간영역과 주파수영역에서 최소위상 (Minimum phase)시스템과 비최소위상 (Non-minimum phase)시스템에 대한 그 역벽환에 대해 알아보았으며 비최소 위상요소에 대한 효과적인 역변환을 위해 SVD를 도입하였다. 먼저 전체시스템 행렬의 특이값 (singular value)을 계산하고 시스템의 위상에 대해 알아본다. 전체시스템이 비최소 위상인 경우 하나 이상의 매우 작은 특이값을 가지며 이는 시스템의 최소 위상/비최소 위상에 대한 정보를 가짐을 알 수 있다. 이를 이용하여 전체시스템에 대한 근사적인 역변환 필터를 구할 수 있으며 보다 근사적인 역변환 필터를 얻기 위하여 특이벡터를 이용하여 근사적인 역변환 필터를 얻었다. 수치적 예는 이러한 역변환 필터 행렬의 이용에 대한 잠재성을 보여준다.

  • PDF

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

  • Jin, Dae Ho
    • East Asian mathematical journal
    • /
    • 제30권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
    • 대한수학회지
    • /
    • 제55권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
    • /
    • 제26권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.

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

  • 융 녹 투이 덩;손원
    • 방송공학회논문지
    • /
    • 제21권2호
    • /
    • pp.149-156
    • /
    • 2016
  • 우리는 컨텐츠 복제방지를 위하여 기존의 SVD와 DWT/RDWT를 결합한 워터마킹 시스템에 특이벡터를 추가로 사용하는 방안을 제안하였다. 우리는 SVD를 사용하는 워터마킹 시스템에 존재하는 오류긍정문제(false-positive problem)를 극복하기 위하여 기존의 SVD기반 알고리즘과 같이 특이값에 워트마크를 임베딩할 뿐만 아니라, 커버이미지의 첫 번째 좌/우 특이벡터를 워터마크 이미지의 첫번째 좌/우 특이벡터와 교체하였다. 제안 방안은 오류긍정문제 (false-positive problem)가 발생하지 않는 워터마킹 시스템을 구현할 수 있었으며, 기존의 오류긍정문제가 없는 시스템과 비교하여 우수한 충실성과 강인성을 보여 주었을 뿐만 아니라, 오류긍정문제가 발생하는 시스템에 비해서도 크게 성능차이가 나지 않음을 보여 주었다.