• Title/Summary/Keyword: Monotone matrix

Search Result 15, Processing Time 0.032 seconds

An Application of Absolute Matrix Summability using Almost Increasing and δ-quasi-monotone Sequences

  • Ozarslan, Hikmet Seyhan
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.2
    • /
    • pp.233-240
    • /
    • 2019
  • In the present paper, absolute matrix summability of infinite series is studied. A new theorem concerning absolute matrix summability factors, which generalizes a known theorem dealing with absolute Riesz summability factors of infinite series, is proved using almost increasing and ${\delta}$-quasi-monotone sequences. Also, a result dealing with absolute $Ces{\grave{a}}ro$ summability is given.

CONVERGENCE OF THE GENERALIZED MULTISPLITTING AND TWO-STAGE MULTISPLITTING METHODS

  • Oh, Se-Young;Yun, Jae-Heon;Han, Yu-Du
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.501-510
    • /
    • 2008
  • In this paper, we first provide a convergence result of the generalized two-stage splitting method for solving a linear system whose coefficient matrix is an H-matrix, and then we provide convergence results of the generalized multisplitting and two-stage multisplitting methods for both a monotone matrix and an H-matrix.

  • PDF

INVARIANCE OF KNEADING MATRIX UNDER CONJUGACY

  • Gopalakrishna, Chaitanya;Veerapazham, Murugan
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.2
    • /
    • pp.265-281
    • /
    • 2021
  • In the kneading theory developed by Milnor and Thurston, it is proved that the kneading matrix and the kneading determinant associated with a continuous piecewise monotone map are invariant under orientation-preserving conjugacy. This paper considers the problem for orientation-reversing conjugacy and proves that the former is not an invariant while the latter is. It also presents applications of the result towards the computational complexity of kneading matrices and the classification of maps up to topological conjugacy.

FURTHER RESULTS ON MULTISPLITTING AND TWO-STAGE MULTISPLITTING METHODS

  • Kim, Sang-Wook;Han, Yu-Du;Yun, Jae-Heon
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.25-35
    • /
    • 2009
  • In this paper, we study the regularity of induced splittings from multisplitting and two-stage multisplitting methods of monotone matrices under the assumption that splittings are weak regular, and we also study some comparison theorems for two-stage multisplitting methods of monotone matrices.

  • PDF

Likelihood Ratio Criterion for Testing Sphericity from a Multivariate Normal Sample with 2-step Monotone Missing Data Pattern

  • Choi, Byung-Jin
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.2
    • /
    • pp.473-481
    • /
    • 2005
  • The testing problem for sphericity structure of the covariance matrix in a multivariate normal distribution is introduced when there is a sample with 2-step monotone missing data pattern. The maximum likelihood method is described to estimate the parameters on the basis of the sample. Using these estimates, the likelihood ratio criterion for testing sphericity is derived.

RELATION BETWEEN KNEADING MATRICES OF A MAP AND ITS ITERATES

  • Gopalakrishna, Chaitanya;Veerapazham, Murugan
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.571-589
    • /
    • 2020
  • It is known that the kneading matrix associated with a continuous piecewise monotone self-map of an interval contains crucial combinatorial information of the map and all its iterates, however for every iterate of such a map we can associate its kneading matrix. In this paper, we describe the relation between kneading matrices of maps and their iterates for a family of chaotic maps. We also give a new definition for the kneading matrix and describe the relationship between the corresponding determinant and the usual kneading determinant of such maps.

Minimum Mean Squared Error Invariant Designs for Polynomial Approximation

  • Joong-Yang Park
    • Communications for Statistical Applications and Methods
    • /
    • v.2 no.2
    • /
    • pp.376-386
    • /
    • 1995
  • Designs for polynomial approximation to the unknown response function are considered. Optimality criteria are monotone functions of the mean squared error matrix of the least squares estimator. They correspond to the classical A-, D-, G- and Q-optimalities. Optimal first order designs are chosen from the invariant designs and then compared with optimal second order designs.

  • PDF

CONVERGENCE OF NEWTON'S METHOD FOR SOLVING A NONLINEAR MATRIX EQUATION

  • Meng, Jie;Lee, Hyun-Jung;Kim, Hyun-Min
    • East Asian mathematical journal
    • /
    • v.32 no.1
    • /
    • pp.13-25
    • /
    • 2016
  • We consider the nonlinear matrix equation $X^p+AX^qB+CXD+E=0$, where p and q are positive integers, A, B and E are $n{\times}n$ nonnegative matrices, C and D are arbitrary $n{\times}n$ real matrices. A sufficient condition for the existence of the elementwise minimal nonnegative solution is derived. The monotone convergence of Newton's method for solving the equation is considered. Several numerical examples to show the efficiency of the proposed Newton's method are presented.

Computing Symmetric Angle Restricted Nearest Neighbors using Monotone Matrix Search (단조 행렬 탐색을 이용한 양방향 각도제한 근접점 계산방법)

  • Wi, Yeong-Cheol
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.1_2
    • /
    • pp.64-72
    • /
    • 2001
  • 이 논문은 행렬 탐색 방법을 이용하여 평면상의 η개의 점에 대한 모든 L$_{p}$, 1$\leq$P$\leq$$\infty$ 거리의 양방향 각도제한 근접 점 문제를 0(nlogn) 시간에 계산하는 알고리즘을 고안한다. 이 방법은 최적의 시간 복잡도를 가지며 궤적추적 법을 쓰지 않기 때문에 수치오차가 적으며 구현이 용이하고 실용적이다.

  • PDF