• 제목/요약/키워드: Maximum norm

검색결과 74건 처리시간 0.025초

MAX-NORM ERROR ESTIMATES FOR FINITE ELEMENT METHODS FOR NONLINEAR SOBOLEV EQUATIONS

  • CHOU, SO-HSIANG;LI, QIAN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제5권2호
    • /
    • pp.25-37
    • /
    • 2001
  • We consider the finite element method applied to nonlinear Sobolev equation with smooth data and demonstrate for arbitrary order ($k{\geq}2$) finite element spaces the optimal rate of convergence in $L_{\infty}\;W^{1,{\infty}}({\Omega})$ and $L_{\infty}(L_{\infty}({\Omega}))$ (quasi-optimal for k = 1). In other words, the nonlinear Sobolev equation can be approximated equally well as its linear counterpart. Furthermore, we also obtain superconvergence results in $L_{\infty}(W^{1,{\infty}}({\Omega}))$ for the difference between the approximate solution and the generalized elliptic projection of the exact solution.

  • PDF

Link Adaptation for Full Duplex Systems

  • Kim, Sangchoon
    • International journal of advanced smart convergence
    • /
    • 제7권4호
    • /
    • pp.92-100
    • /
    • 2018
  • This paper presents a link adaptation scheme for adaptive full duplex (AFD) systems. The signal modulation levels and communication link patterns are adaptively selected according to the changing channel conditions. The link pattern selection process consists of two successive steps such as a transmit-receive antenna pair selection based on maximum sum rate or minimum maximum symbol error rate, and an adaptive modulation based on maximum minimum norm. In AFD systems, the antennas of both nodes are jointly determined with modulation levels depending on the channel conditions. An adaptive algorithm with relatively low complexity is also proposed to select the link parameters. Simulation results show that the proposed AFD system offers significant bit error rate (BER) performance improvement compared with conventional full duplex systems with perfect or imperfect self-interference cancellation under the same fixed sum rate.

최소 Disturbance 기법을 적용한 향상된 CMA 적응 등화 알고리즘 (Adaptive Equalization Algorithm of Enhanced CMA using Minimum Disturbance Technique)

  • 강대수
    • 한국인터넷방송통신학회논문지
    • /
    • 제14권6호
    • /
    • pp.55-61
    • /
    • 2014
  • 본 논문은 CMA 적응등화기에서 최소 disturbance 기법을 적용하여 진폭과 위상의 동시 보상이 가능한 ECMA (Enchanced CMA) 알고리즘의 성능에 관한 것이다. ECMA는 적응등화기 탭 계수의 변화량을 squared euclidean norm 관점에서 최소화하는 최소 disturbance 기법과 decision directed mode에 의한 gradient noise amplification 문제와 안정도 및 roburstness 성능을 알고리즘 연산량의 큰 증가없이 개선할 수 있고, 수신신호에서 진폭과 위상의 동시 보상이 가능하도록 새로운 비용함수를 제안하였다. 논문에서는 ECMA 알고리즘의 성능을 MCMA와 비교하기 위하여 컴퓨터 시뮬레이션을 수행하였다. 이를 위하여 수신측에서의 등화기 출력신호인 복원된 신호 성상도, 수렴 성능을 나타내는 성능지수인 잔류 isi 및 MD (Maximum Distortion), MSE 특성곡선과 채널과 등화기의 종합 주파수 특성을 성능 비교 지수로 사용하였다. 시뮬레이션 결과 ECMA가 복원성상도에서 진폭과 위상보상 능력 및 적응등화를 위한 수렴시간에서 MCMA보다 우월함을 알 수 있었다.

여유구동 3RRR 병렬로봇의 힘분배 제어에 관한 연구 (Torque Distribution Control of 3RRR Redundant Parallel Robot)

  • 이상문;이재원;심호석
    • 한국정밀공학회지
    • /
    • 제25권2호
    • /
    • pp.72-79
    • /
    • 2008
  • In the redundant actuation system which has more actuators than a system's mobility, there are various method to determine actuated torques because those are not determined uniquely. This paper presents a torque distribution method using weighted-pseudoinverse to optimize the maximum torque of various actuated inputs of the redundant system. The various weighting factor of weighted-pseudoinverse is studied to reduce maximum actuated torque. This method is experimentally applied to 3RRR parallel robot, which shows that presented method can efficiently reduce the maximum actuated torque.

UNIQUENESS OF SOLUTIONS FOR A DEGENERATE PARABOLIC EQUATION WITH ABSORPTION

  • Lee, Jin Ho;Jang, Seong Hee
    • Korean Journal of Mathematics
    • /
    • 제5권2호
    • /
    • pp.151-167
    • /
    • 1997
  • We estimate the interior Lipschitz norm and maximum of the solution for degenerate parabolic equations with absorption. Also obtain the growth rate of the solution $u$ in terms of time $t$. From this we show the uniqueness of solution with respect to the initial trace.

  • PDF

FINITE DIFFERENCE SCHEME FOR SINGULARLY PERTURBED SYSTEM OF DELAY DIFFERENTIAL EQUATIONS WITH INTEGRAL BOUNDARY CONDITIONS

  • SEKAR, E.;TAMILSELVAN, A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제22권3호
    • /
    • pp.201-215
    • /
    • 2018
  • In this paper we consider a class of singularly perturbed system of delay differential equations of convection diffusion type with integral boundary conditions. A finite difference scheme on an appropriate piecewise Shishkin type mesh is suggested to solve the problem. We prove that the method is of almost first order convergent. An error estimate is derived in the discrete maximum norm. Numerical experiments support our theoretical results.

NUMERICAL METHOD FOR A SYSTEM OF SINGULARLY PERTURBED CONVECTION DIFFUSION EQUATIONS WITH INTEGRAL BOUNDARY CONDITIONS

  • Raja, Velusamy;Tamilselvan, Ayyadurai
    • 대한수학회논문집
    • /
    • 제34권3호
    • /
    • pp.1015-1027
    • /
    • 2019
  • A class of systems of singularly perturbed convection diffusion type equations with integral boundary conditions is considered. A numerical method based on a finite difference scheme on a Shishkin mesh is presented. The suggested method is of almost first order convergence. An error estimate is derived in the discrete maximum norm. Numerical examples are presented to validate the theoretical estimates.

NUMERICAL METHOD FOR A SYSTEM OF CAPUTO FRACTIONAL DIFFERENTIAL EQUATIONS WITH NON-LOCAL BOUNDARY CONDITIONS

  • S. Joe Christin Mary;Ayyadurai Tamilselvan
    • 대한수학회논문집
    • /
    • 제38권1호
    • /
    • pp.281-298
    • /
    • 2023
  • A class of systems of Caputo fractional differential equations with integral boundary conditions is considered. A numerical method based on a finite difference scheme on a uniform mesh is proposed. Supremum norm is used to derive an error estimate which is of order κ − 1, 1 < κ < 2. Numerical examples are given which validate our theoretical results.

A Study on the Relations between Wooden Toy and Development of Infant and Young Children

  • Yang, Seung-Hee;Lee, Mi-Hye
    • 한국가구학회지
    • /
    • 제21권3호
    • /
    • pp.261-272
    • /
    • 2010
  • The aim of the present study was to investigate the relations between wooden toy and development of infant and young children by taking only the commercialized wooden furniture which would be suitable for the developmental area for infant and young children, among the physical environment influencing the balanced development and development for them. The recommended standard for them was the commercialized good and the only advanced toys for the development of infant and young children was primary selected, in case of different furniture for same purpose with regardless of manufacturer, country of origin and price. The selected wooden toys for development of infant and young children covered the following test conditions. They keep the soft and clean surfaces and the corners are the round-finished so safe. The dyeing and coloring are so clear like the rainbow-colored in compliance with the international safety norm, and the paint material used are harmless to the people, because they have already passed the European Safety Norm EN 71 which is the most authoritative and strict standard in the world and contained accordingly little heavy metals, toxic substances and also allergy pigment under the maximum permissible standard. The size of wooden toys are not small enough for infant and young children to be able to swallow and this is important check point, because infants tend to feel the object in their own touching and therefore to have everything to the lip. The paint used was the toys-oriented goods and proved by the test regarding saliva and sweat.

  • PDF

ANALYSIS OF THE UPPER BOUND ON THE COMPLEXITY OF LLL ALGORITHM

  • PARK, YUNJU;PARK, JAEHYUN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제20권2호
    • /
    • pp.107-121
    • /
    • 2016
  • We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.