• 대한수학회보
• /
• 제54권3호
• /
• pp.935-952
• /
• 2017

It is natural to try to find a kernel such that its convolution of integrable functions converges faster than that of the $Fej{\acute{e}}r$ kernel. In this paper, we introduce a weighted Fourier partial sums which are written as the convolution of signed good kernels and prove that the weighted Fourier partial sum converges in $L^2$ much faster than that of the $Ces{\grave{a}}ro$ means. In addition, we present two numerical experiments.

• 대한수학회보
• /
• 제45권2호
• /
• pp.277-283
• /
• 2008

The paper deals with the values at the negative integers of a certain Dirichlet series related to the Riemann zeta function and with the expression of these values in terms of Bernoulli numbers.

• Journal of applied mathematics & informatics
• /
• 제40권5_6호
• /
• pp.813-830
• /
• 2022

The generating functions of the divisor function σ_s(n) = Σ_0<d|n d^s are quasimodular forms. In this paper, we find the basis of the space of quasimodular forms of weight 6 on Γ₀(10) consisting of Eisenstein series and η-quotients. Then we evaluate the convolution sum Σ_ak+bl+cm=n σ(k)σ(l)σ(m) with lcm(a, b, c) = 10 and Σ_al+bm=n lσ(l)σ(m) and Σ_al+bm=n σ₃(l)σ(m) with lcm(a, b) = 10.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 춘계 학술대회 학술발표 논문집
• /
• pp.18-21
• /
• 2003

We propose some properties of fuzzy conditional expectation of hybrid number the addition of fuzzy number and random variable using Cartesian product distance for ${\alpha}$-level sets.

• Kyungpook Mathematical Journal
• /
• 제58권4호
• /
• pp.599-613
• /
• 2018

We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums. We also derive new identities for Bell polynomials.

• Kyungpook Mathematical Journal
• /
• 제48권3호
• /
• pp.359-366
• /
• 2008

Let A(p) be the class of functions $f\;:\;z^p\;+\;\sum\limits_{j=1}^{\infty}a_jz^{p+j}$ analytic in the open unit disc E. Let, for any integer n > -p, $f_{n+p-1}(z)\;=\;z^p+\sum\limits_{j=1}^{\infty}(p+j)^{n+p-1}z^{p+j}$. We define $f_{n+p-1}^{(-1)}(z)$ by using convolution * as $f_{n+p-1}\;*\;f_{n+p-1}^{-1}=\frac{z^p}{(1-z)^{n+p}$. A function p, analytic in E with p(0) = 1, is in the class $P_k(\rho)$ if ${\int}_0^{2\pi}\|\frac{Re\;p(z)-\rho}{p-\rho}\|\;d\theta\;\leq\;k{\pi}$, where $z=re^{i\theta}$, $k\;\geq\;2$ and $0\;{\leq}\;\rho\;{\leq}\;p$. We use the class $P_k(\rho)$ to introduce a new class of multivalent analytic functions and define an integral operator $L_{n+p-1}(f)\;\;=\;f_{n+p-1}^{-1}\;*\;f$ for f(z) belonging to this class. We derive some interesting properties of this generalized integral operator which include inclusion results and radius problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.240-240
• /
• 2000

This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

• 대한수학회보
• /
• 제43권1호
• /
• pp.179-188
• /
• 2006

For a given p-valent analytic function g with positive coefficients in the open unit disk $\Delta$, we study a class of functions $f(z) = z^p - \sum\limits{_{n=m}}{^\infty} a_nz^n(a_n{\geq}0)$ satisfying $$\frac 1 {p}{\Re}\;(\frac {z(f*g)'(z)} {(f*g)(z)})\;>\;\alpha\;(0{\leq}\;\alpha\;<\;1;z{\in}{\Delta})$$ Coefficient inequalities, distortion and covering theorems, as well as closure theorems are determined. The results obtained extend several known results as special cases.

• 대한수학회지
• /
• 제58권5호
• /
• pp.1147-1180
• /
• 2021

By considering the polynomial function 𝜙_car(z) = 1 + z + z²/2, we define the class 𝓢^*_car consisting of normalized analytic functions f such that zf'/f is subordinate to 𝜙_car in the unit disk. The inclusion relations and various radii constants associated with the class 𝓢^*_car and its connection with several well-known subclasses of starlike functions is established. As an application, the obtained results are applied to derive the properties of the partial sums and convolution.

• 한국컴퓨터그래픽스학회논문지
• /
• 제16권2호
• /
• pp.9-17
• /
• 2010

기하학에서 민코스키합은 두 집합에 들어 있는 모든 점들간의 합으로 이루어지는 집합을 구하는 연산으로 정의되는데, 로보틱스, NC 가공, 솔리드 모델링 등의 다양한 분야의 기하학적 문제를 다루는 매우 유용한 이론적 도구로 사용되고 있다. 하지만, 단순한 정의에도 불구하고 수치연산의 반올림 오차로 인하여 다면체간의 민코스키합을 정밀하고 강건하게 계산하는 것은 매우 어렵다. 본 논문에서는 컨볼루션 계산방법을 이용하여 다면체간의 민코스키합 경계를 계산하는 알고리즘을 제안한다. 알고리즘의 강건성을 보장하기 위한 방법으로 CLP(controlled linear perturbation) 기법을 처음으로 적용하였다. CLP는 인위적 교란방법의 하나로 알고리즘의 강건성을 해치는 반올림 오차에 의한 논리적 오류발생을 막는다. 본 논문의 알고리즘은 실험 예제들에서 민코스키합의 경계면을 구성하는 완전한 2차원 다양체 구조메시를 $10^{-14}$의 정밀도로 출력하고, 이때 입력 다면체의 꼭지점 좌표는 $10^{-10}$까지 교란되는 결과를 얻었다.