• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.535-539
• /
• 2007

Given operators X and Y acting on a separable complex Hilbert space $\mathcal{H}$, an interpolating operator is a bounded operator A such that AX=Y. In this article, we show the following: Let $Alg\mathcal{L}$ be a tridiagonal algebra on a separable complex Hilbert space $\mathcal{H}$ and let $X=(x_{ij})\;and\;Y=(y_{ij})$ be operators in $\mathcal{H}$. Then the following are equivalent: (1) There exists a normal operator $A=(a_{ij})\;in\;Alg\mathcal{L}$ such that AX=Y. (2) There is a bounded sequence $\{\alpha_n\}\;in\;\mathbb{C}$ such that $y_{ij}=\alpha_jx_{ij}\;for\;i,\;j\;{\in}\;\mathbb{N}$. Given vectors x and y in a separable complex Hilbert space $\mathcal{H}$, an interpolating operator is a bounded operator A such that Ax=y. We show the following: Let $Alg\mathcal{L}$ be a tridiagonal algebra on a separable complex Hilbert space $\mathcal{H}$ and let $x=(x_i)\;and\;y=(y_i)$ be vectors in $\mathcal{H}$. Then the following are equivalent: (1) There exists a normal operator $A=(a_{ij})\;in\;Alg\mathcal{L}$ such that Ax=y. (2) There is a bounded sequence $\{\alpha_n\}$ in $\mathbb{C}$ such that $y_i=\alpha_ix_i\;for\;i{\in}\mathbb{N}$.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.437-448
• /
• 2007

Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let $T_1,\;T_2\;and\;T_3\;:\;K{\rightarrow}E$ be nonexpansive mappings with nonempty common fixed points set. Let $\{\alpha_n\},\;\{\beta_n\},\;\{\gamma_n\},\;\{\alpha'_n\},\;\{\beta'_n\},\;\{\gamma'_n\},\;\{\alpha'_n\},\;\{\beta'_n\}\;and\;\{\gamma'_n\}$ be real sequences in [0, 1] such that ${\alpha}_n+{\beta}_n+{\gamma}_n={\alpha}'_n+{\beta'_n+\gamma}'_n={\alpha}'_n+{\beta}'_n+{\gamma}'_n=1$, starting from arbitrary $x_1{\in}K$, define the sequence $\{x_n\}$ by $$\{zn=P({\alpha}'_nT_1x_n+{\beta}'_nx_n+{\gamma}'_nw_n)\;yn=P({\alpha}'_nT_2z_n+{\beta}'_nx_n+{\gamma}'_nv_n)\;x_{n+1}=P({\alpha}_nT_3y_n+{\beta}_nx_n+{\gamma}_nu_n)$$ with the restrictions $\sum^\infty_{n=1}{\gamma}_n<\infty,\;\sum^\infty_{n=1}{\gamma}'_n<\infty,\; \sum^\infty_{n=1}{\gamma}'_n<\infty$. (i) If the dual $E^*$ of E has the Kadec-Klee property, then weak convergence of a $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is proved; (ii) If $T_1,\;T_2\;and\;T_3$ satisfy condition(A'), then strong convergence of $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is obtained.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.829-842
• /
• 2009

Let {$X_{ni}|1\;{\le}\;i\;{\le}\;n$, $n\;{\ge}\;1$} be an array of rowwise negatively associated random variables and let $\alpha$ > 1/2, 0 < p < 2 ${\alpha}p\;{\ge}\;1$. In this paper we discuss $n^{{\alpha}p-2}h(n)$ max $_{1\;{\le}\;k{\le}n}\;|\;{\sum}^k_{i=1}\;X_{ni}|/n^{\alpha}\;{\to}\;0$ completely as $n\;{\to}\;{\infty}$ under not necessarily identically distributed with a suitable conditions and h(x) > 0 is a slowly varying function as $x\;{\to}\;{\infty}$. In addition, we obtained that $n^{{\alpha}p-2}h(n)$ max $_{1\;{\le}\;k{\le}n}\;|\;{\sum}^k_{i=1}\;X_{ni}|/n^{\alpha}\;{\to}\;0$ completely as $n\;{\to}\;{\infty}$ if and only if $E|X_{11}|^ph(|X_{11}|^{1/\alpha})\;<\;{\infty}$ and $EX_{11}\;=\;0$ under identically distributed case and some corollaries are obtained.

• 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.

• 한국수학사학회지
• /
• 제17권4호
• /
• pp.27-36
• /
• 2004

이 논문에서는 튜링의 기계주의에 대한 괴델의 비평을 다룬다. 여기에서 튜링의 기계주의란 튜링기계의 기호배열이 인간의 마음의 각 상태에 대응된다는 것을 의미한다. 첫째 부분에서는 계산으로서의 인지과정에 대한 튜링의 분석을 검토한다. 두 번째 부분에서는 튜링기계의 개념을 살펴보고, 세 번째 부분에서는 인지적 체계로서의 튜링기계가 갖는 계산적 한계를 설명한다. 네 번째 부분에서는 괴델이 튜링의 기계주의에 동의하지 않았음을 보이고, 마지막으로 오라클 튜링기계과 그 함의에 대하여 논의한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제18권2호
• /
• pp.193-207
• /
• 2014

In this paper we explore the emergence of the notion of compactness within its historical beginning through rigor versus intuition modes in the treatment of Dirichlet's principle. We emphasize on the intuition in Riemann's statement on the principle criticized by Weierstrass' requirement of rigor followed by Hilbert's restatement again criticized by Hadamard, which pushed the ascension of the notion of compactness in the analysis of PDEs. A brief overview of some techniques and problems involving compactness is presented illustrating the importance of this notion. Compactness is discussed here to raise educational issues regarding rigor vs intuition in mathematical studies. The concept of compactness advanced rapidly after Weierstrass's famous criticism of Riemann's use of the Dirichlet principle. The rigor of Weierstrass contributed to establishment of the concept of compactness, but such a focus on rigor blinded mathematicians to big pictures. Fortunately, Poincar$\acute{e}$ and Hilbert defended Riemann's use of the Dirichlet principle and found a balance between rigor and intuition. There is no theorem without rigor, but we should not be a slave of rigor. Rigor (highly detailed examination with toy models) and intuition (broader view with real models) are essentially complementary to each other.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제18권2호
• /
• pp.181-192
• /
• 2014

In this paper, we propose a robust real-time myocardial border tracking algorithm for echocardiography. Commonly, after an initial contour of LV border is traced at one or two frame from the entire cardiac cycle, LV contour tracking is performed over the remaining frames. Among a variety of tracking techniques, optical flow method is the most widely used for motion estimation of moving objects. However, when echocardiography data is heavily corrupted in some local regions, the errors bring the tracking point out of the endocardial border, resulting in distorted LV contours. This shape distortion often occurs in practice since the data acquisition is affected by ultrasound artifacts, dropout or shadowing phenomena of cardiac walls. The proposed method deals with this shape distortion problem and reflects the motion realistic LV shape by applying global deformation modeled as affine transform partitively to the contour. We partition the tracking points on the contour into a few groups and determine each affine transform governing the motion of the partitioned contour points. To compute the coefficients of each affine transform, we use the least squares method with equality constraints that are given by the relationship between the coefficients and a few contour points showing good tracking results. Many real experiments show that the proposed method supports better performance than existing methods.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.215-241
• /
• 2003

In this paper, solute transport in heterogeneous aquifers using a modified Fokker-Planck equation (MFPE) is investigated. This newly developed mathematical model is characterised with a time-, scale-dependent dispersivity. A two-dimensional finite volume quadrilateral mesh method (FVQMM) based on a quadrilateral background interpolation mesh is developed for analysing the model. The FVQMM transforms the coupled non-linear partial differential equations into a system of differential equations, which is solved using backward differentiation formulae of order one through five in order to advance the solution in time. Three examples are presented to demonstrate the model verification and utility. Henry's classic benchmark problem is used to show that the MFPE captures significant features of transport phenomena in heterogeneous porous media including enhanced transport of salt in the upper layer due to its parameters that represent the dependence of transport processes on scale and time. The time and scale effects are investigated. Numerical results are compared with published results on the some problems.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.431-436
• /
• 2003

Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx = y. An interpolating operator for n vectors satisfies the equation $Tx_i\;:\;y_i,\;for\;i\;=\;1,\;2,\;{\cdots},\;n$. In this article, we obtained the following : $Let\;x\;=\;\{x_i\}\;and\;y=\{y_\}$ be two vectors in a separable complex Hilbert space H such that $x_i\;\neq\;0$ for all $i\;=\;1,\;2;\cdots$. Let L be a commutative subspace lattice on H. Then the following statements are equivalent. (1) $sup\;\{\frac{\$\mid${\sum_{k=1}}^l\;\alpha_{\kappa}E_{\kappa}y\$\mid$}{\$\mid${\sum_{k=1}}^l\;\alpha_{\kappa}E_{\kappa}x\$\mid$}\;:\;l\;\in\;\mathbb{N},\;\alpha_{\kappa}\;\in\;\mathbb{C}\;and\;E_{\kappa}\;\in\;L\}\;<\;\infty\;and\;$\mid$y_n\$\mid$x_n$\mid$^{-1}\;=\;1\;for\;all\;n\;=\;1,\;2,\;\cdots$. (2) There exists an operator A in AlgL such that Ax = y, A is a unitary operator and every E in L reduces, A, where AlgL is a tridiagonal algebra.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1055-1071
• /
• 2010

Recently, a number of algorithms have been proposed for numerical evaluation of Hankel transforms as these transforms arise naturally in many areas of science and technology. All these algorithms depend on separating the integrand $rf(r)J_{\upsilon}(pr)$ into two components; the slowly varying component rf(r) and the rapidly oscillating component $J_{\upsilon}(pr)$. Then the slowly varying component rf(r) is expanded either into a Fourier Bessel series or various wavelet series using different orthonormal bases like Haar wavelets, rationalized Haar wavelets, linear Legendre multiwavelets, Legendre wavelets and truncating the series at an optimal level; or approximating rf(r) by a quadratic over the subinterval using the Filon quadrature philosophy. The purpose of this communication is to take a different approach and replace rapidly oscillating component $J_{\upsilon}(pr)$ in the integrand by its Bernstein series approximation, thus avoiding the complexity of evaluating integrals involving Bessel functions. This leads to a very simple efficient and stable algorithm for numerical evaluation of Hankel transform.