• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.165-182
• /
• 2003

Toeplitz matrix method and the product Nystrom method are described for mixed Fredholm-Volterra singular integral equation of the second kind with Carleman Kernel and logarithmic kernel. The results are compared with the exact solution of the integral equation. The error of each method is calculated.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.207-220
• /
• 2004

Necessary and sufficient conditions are given for the regularity of block triangular fuzzy matrices. This leads to characterization of idem-potency of a class of triangular Toeplitz matrices. As an application, the existence of group inverse of a block triangular fuzzy matrix is discussed. Equivalent conditions for a regular block triangular fuzzy matrix to be expressed as a sum of regular block fuzzy matrices is derived. Further, fuzzy relational equations consistency is studied.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1263-1270
• /
• 2010

Sixty patients were divided into three groups. Each group of twenty persons had fed on different diet foods over 5 weeks. Cholesterol had been measured repeatedly five times at an interval of a week during 5 weeks. It resulted from mixed model analysis of repeated measurements data that homogeneous toeplitz covariance matrix pattern was selected as the optimal covariance pattern. The correlations between measurements of different times for the covariance matrix are somewhat highly correlated as 0.64-0.78. Based upon the homogeneous toeplitz covariance pattern model, the time effect was found to be highly significant, but the treatment effect and treatment-time interaction effect were found to be insignificant.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.959-966
• /
• 1998

We present fast QR factorization algorithms $m{\times}n\;(m{\geq}n)$ Toeplitz matrix. These QR factorization algortihms are determined from the shift-invariance properties of underlying matrices. The major transformation tool is a stabilized/hyperbolic Householder transformation. The algortihms require O(mn) operations, and can be easily implemented on distributed-memory multiprocessors.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1275-1283
• /
• 2010

If the Wiener-Hopf $C^*$-algebra W(G,M) for a discrete group G with a semigroup M has the uniqueness property, then the structure of it is to some extent independent of the choice of isometries on a Hilbert space. In this paper we show that if the Wiener-Hopf $C^*$-algebra W(G,M) of a partially ordered group G with the positive cone M has the uniqueness property, then (G,M) is weakly unperforated. We also prove that the Wiener-Hopf $C^*$-algebra W($\mathbb{Z}$, M) of subsemigroup generating the integer group $\mathbb{Z}$ is isomorphic to the Toeplitz algebra, but W($\mathbb{Z}$, M) does not have the uniqueness property except the case M = $\mathbb{N}$.

• Kyungpook Mathematical Journal
• /
• v.58 no.1
• /
• pp.91-103
• /
• 2018

In this paper, we generalize the concept of deferred density to that of deferred f-density, where f is an unbounded modulus and introduce a new non-matrix convergence method, namely deferred f-statistical convergence or $S^f_{p,q}$-convergence. Apart from studying the $K{\ddot{o}}the$-Toeplitz duals of $S^f_{p,q}$, the space of deferred f-statistically convergent sequences, a decomposition theorem is also established. We also introduce a notion of strongly deferred $Ces{\grave{a}}ro$ summable sequences defined by modulus f and investigate the relationship between deferred f-statistical convergence and strongly deferred $Ces{\grave{a}}ro$ summable sequences defined by f.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.151-164
• /
• 2005

The regularized structured total least norm (RSTLN) method finds an approximate solution x and error matrix E to the overdetermined linear system (H + E)x $\approx$ b, preserving structure of H. A new separation scheme by parts of variables for the regularized structured total least norm on blind deconvolution problem is suggested. A method combining the regularized structured total least norm method with a separation by parts of variables can be obtain a better approximated solution and a smaller residual. Computational results for the practical problem with Block Toeplitz with Toeplitz Block structure show the new method ensures more efficiency on image restoration.

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.481-494
• /
• 2008

Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.429-438
• /
• 2015

The objective of this paper is to obtain sharp upper bound for the second Hankel functional associated with the $k^{th}$ root transform $[f(z^k)]^{\frac{1}{k}}$ of normalized analytic function f(z) when it belongs to the class of starlike and convex functions with respect to symmetric points, defined on the open unit disc in the complex plane, using Toeplitz determinants.

• Journal of Industrial Technology
• /
• v.14
• /
• pp.19-28
• /
• 1994

We can get a tridiagonal block Toeplitz linear system by the finite difference approximation of 2-D Poisson equation. To exploit the nice property of this linear equation, we transform the equation into a Lyapunov equation and apply DST (discrete sine transform) to get diagonal matrix based Lyapunov equation. DST can be performed using FFT, which enables high-speed computaion. All the computations are performed on an SIMD parallel computer, the MasPar MP-2 with 4,096 processing elements. In this paper, parallel algorithm, mapping method of the algorithm onto the MP-2, and timing results are presented.