• Title/Summary/Keyword: $l_2$ Norm

Search Result 219, Processing Time 0.026 seconds

QUADRATURE BASED FINITE ELEMENT METHODS FOR LINEAR PARABOLIC INTERFACE PROBLEMS

  • Deka, Bhupen;Deka, Ram Charan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.3
    • /
    • pp.717-737
    • /
    • 2014
  • We study the effect of numerical quadrature in space on semidiscrete and fully discrete piecewise linear finite element methods for parabolic interface problems. Optimal $L^2(L^2)$ and $L^2(H^1)$ error estimates are shown to hold for semidiscrete problem under suitable regularity of the true solution in whole domain. Further, fully discrete scheme based on backward Euler method has also analyzed and optimal $L^2(L^2)$ norm error estimate is established. The error estimates are obtained for fitted finite element discretization based on straight interface triangles.

Low-complexity Joint Transmit/Receive Antenna Selection Algorithm for Multi-Antenna Systems (다중 안테나 시스템을 위한 낮은 복잡도의 송/수신안테나 선택 알고리즘)

  • Son, Jun-Ho;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10A
    • /
    • pp.943-951
    • /
    • 2006
  • Multi-input-multi-output (MIMO) systems are considered to improve the capacity and reliability of next generation mobile communication. However, the multiple RF chains associated with multiple antennas are costly in terms of size, power and hardware. Antenna selection is a low-cost low-complexity alternative to capture many of the advantages of MIMO systems. We proposed new joint Tx/Rx antenna selection algorithm with low complexity. The proposed algorithm is a method selects $L_R{\times}L_T$ channel matrix out of $L_R{\times}L_T$ entire channel gain matrix where $L_R{\times}L_T$ matrix selects alternate Tx antenna with Rx antenna which have the largest channel gain to maximize Frobenius norm. The feature of this algorithm is very low complexity compare with Exhaustive search which have optimum capacity. In case of $4{\times}4$ antennas selection out of $8{\times}8$ antennas, the capacity decreases $0.5{\sim}2dB$ but the complexity also decreases about 1/10,000 than optimum exhaustive search.

THE TRANSFORMATION THEOREM ON ANALOGUE OF WIENER SPACE

  • Im, Man-Kyu
    • The Pure and Applied Mathematics
    • /
    • v.14 no.4
    • /
    • pp.317-333
    • /
    • 2007
  • In 2002, the author and professor Ryu introduced the concept of analogue of Wiener measure. In this paper, we prove the existence theorem of Fourier-Feynman transform on analogue of Wiener measure in $L_2-norm$ sense.

  • PDF

How to Smooth Data in Two Way Tables with the Order Restriction

  • Chung, Seiyoung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.2 no.1
    • /
    • pp.65-73
    • /
    • 1989
  • To smooth a given data in two-way tables with the order restriction, we propose the dual problem and construct an algorithm utilizing the network flows which ends up with the minimum L1-norm after a finite number of iterations.

  • PDF

RIGIDITY OF COMPLETE RIEMANNIAN MANIFOLDS WITH VANISHING BACH TENSOR

  • Huang, Guangyue;Ma, Bingqing
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1341-1353
    • /
    • 2019
  • For complete Riemannian manifolds with vanishing Bach tensor and positive constant scalar curvature, we provide a rigidity theorem characterized by some pointwise inequalities. Furthermore, we prove some rigidity results under an inequality involving $L^{\frac{n}{2}}$-norm of the Weyl curvature, the traceless Ricci curvature and the Sobolev constant.

GENERALIZED MYERS THEOREM FOR FINSLER MANIFOLDS WITH INTEGRAL RICCI CURVATURE BOUND

  • Wu, Bing-Ye
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.4
    • /
    • pp.841-852
    • /
    • 2019
  • We establish the generalized Myers theorem for Finsler manifolds under integral Ricci curvature bound. More precisely, we show that the forward complete Finsler n-manifold whose part of Ricci curvature less than a positive constant is small in $L^p$-norm (for p > n/2) have bounded diameter and finite fundamental group.

Extreme Points, Exposed Points and Smooth Points of the Space 𝓛s(2𝑙3)

  • Kim, Sung Guen
    • Kyungpook Mathematical Journal
    • /
    • v.60 no.3
    • /
    • pp.485-505
    • /
    • 2020
  • We present a complete description of all the extreme points of the unit ball of 𝓛s(2𝑙3) which leads to a complete formula for ║f║ for every f ∈ 𝓛s(2𝑙3). We also show that $extB_{{\mathcal{L}}_s(^2l^3_{\infty})}{\subset}extB_{{\mathcal{L}}_s(^2l^n_{\infty})}$ for every n ≥ 4. Using the formula for ║f║ for every f ∈ 𝓛s(2𝑙3), we show that every extreme point of the unit ball of 𝓛s(2𝑙3) is exposed. We also characterize all the smooth points of the unit ball of 𝓛s(2𝑙3).

Feature Selection via Embedded Learning Based on Tangent Space Alignment for Microarray Data

  • Ye, Xiucai;Sakurai, Tetsuya
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.4
    • /
    • pp.121-129
    • /
    • 2017
  • Feature selection has been widely established as an efficient technique for microarray data analysis. Feature selection aims to search for the most important feature/gene subset of a given dataset according to its relevance to the current target. Unsupervised feature selection is considered to be challenging due to the lack of label information. In this paper, we propose a novel method for unsupervised feature selection, which incorporates embedded learning and $l_{2,1}-norm$ sparse regression into a framework to select genes in microarray data analysis. Local tangent space alignment is applied during embedded learning to preserve the local data structure. The $l_{2,1}-norm$ sparse regression acts as a constraint to aid in learning the gene weights correlatively, by which the proposed method optimizes for selecting the informative genes which better capture the interesting natural classes of samples. We provide an effective algorithm to solve the optimization problem in our method. Finally, to validate the efficacy of the proposed method, we evaluate the proposed method on real microarray gene expression datasets. The experimental results demonstrate that the proposed method obtains quite promising performance.

System Realization of Whale Sound Reconstruction (고래 사운드 재생 시스템 구현)

  • Chong, Ui-Pil;Jeon, Seo-Yun;Hong, Jeong-Pil
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.3
    • /
    • pp.145-150
    • /
    • 2019
  • We develop the system realization of whale sound reconstruction by inverse MFCC algorithm with the weighted L2-norm minimization techniques. The output products from this research will contribute to the whale tourism and multimedia content industry by combining whale sound contents with the prototype of 3D printing. First of all, we develop the softwares for generating whale sounds and install them into Raspberry Pi hardware and fasten them inside a 3D printed whale. The languages used in the development of this system are the C++ for whale-sounding classification, MATLAB and Python for whale-sounding playback algorithm, and Rhino 6 for 3D printing.