• Title/Summary/Keyword: Positive sequence

Search Result 871, Processing Time 0.035 seconds

ON THE RECURSIVE SEQUENCE X_{n+1} = $\alpha$ - (X_n/X_n-1)

  • YAN XING XUE;LI WAN TONG;ZHAO ZHU
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.269-282
    • /
    • 2005
  • We study the global asymptotic stability, global attractivity, boundedness character, and periodic nature of all positive solutions and all negative solutions of the difference equation $$x_{n+1}\;=\;{\alpha}-{\frac{x_{n-1}}{x_{n}},\;n=0,1,\;{\cdots}$$, where ${\alpha}\;\in\; R$ is a real number, and the initial conditions $x_{-1},\;x_0$ are arbitrary real numbers.

A FUNCTIONAL CENTRAL LIMIT THEOREM FOR POSITIVELY DEPENDENT SEQUENCES

  • KIM, TAE-SUNG;KIM, HYUN-CHULL
    • Honam Mathematical Journal
    • /
    • v.16 no.1
    • /
    • pp.111-117
    • /
    • 1994
  • In this note we prove a functional central. limit theorem for LPQD sequences, statisfying some moment conditions. No stationarity is required. Our results imply an extension of Birkel's functional central limit theorem for associated processt'S to an LPQD sequence and an improvement of Birkel's functional central limit theorem for LPQD sequences.

  • PDF

A SELF SCALING MULTI-STEP RANK ONE PATTERN SEARCH ALGORITHM

  • Moghrabi, Issam A.R.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.15 no.4
    • /
    • pp.267-275
    • /
    • 2011
  • This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.

PN Sequence Generation from 2-D Array of Shift Registers

  • Kim, Hyun-Jung;Lee, In-Kyu;Kim, Woon-Kyung M.
    • ETRI Journal
    • /
    • v.27 no.3
    • /
    • pp.273-279
    • /
    • 2005
  • Toward code division multiple access (CDMA) communications and data protection, we propose and analyze pseudorandom noise (PN) sequences generated from a 2-dimensional array structure of shift-registers. For any positive integers m and n, we construct PN sequences of period $2^{mm}-1$ using an $m{\times}n$ array of registers and show that we can generate all shifted PN sequences as required by IS-95x with the proper linear combination of available sequences.

  • PDF

HYPERCYCLIC OPERATOR WEIGHTED SHIFTS

  • Hazarika, Munmun;Arora, S.C.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.4
    • /
    • pp.589-598
    • /
    • 2004
  • We consider bilateral operator weighted shift T on $L^2$(K) with weight sequence ${[A_{n}]_{n=-{\infty}}}^{\infty}$ of positive invertible diagonal operators on K. We give a characterization for T to be hypercyclic, and show that the conditions are far simplified in case T is invertible.

Algorithmic Properties of Isotone Complementarity Problems

  • Ahn, Byong-Hun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.12 no.1
    • /
    • pp.10-18
    • /
    • 1987
  • This paper discusses algorithmic properties of a class of complementarity programs involving strictly diagonally isotone and off-diagonally isotone functions, i. e., functions whose Jacobian matrices have positive diagonal elements and nonnegative off-diagonal elements, A typical traffic equilibrium under elastic demands is cast into this class. Algorithmic properties of these complementarity problems, when a Jacobi-type iteration is applied, are investigated. It is shown that with a properly chosen starting point the generated sequence are decomposed into two converging monotonic subsequences. This and related will be useful in developing solution procedures for this class of complementarity problems.

  • PDF

The influence of trapping on printed color (다색인쇄에서의 Trapping의 영향)

  • JongWonKim
    • Journal of the Korean Graphic Arts Communication Society
    • /
    • v.3 no.1
    • /
    • pp.1-10
    • /
    • 1985
  • In Graphic art reproduction process it is important to realize that which set of inks and their densities (film thickness) and which set of halftone positive should be aimed at. in order to meet the demand for good color reproduction. There have been various studies to calculation the color reproduction of the graphic arts. however. these study were based on the assumed characteristics of the materials. In this study the relationship between wet-trapping (wet on wet-printing) and increases of ink layer and printing sequence are examined.

  • PDF

STATISTICAL A-SUMMABILITY OF DOUBLE SEQUENCES AND A KOROVKIN TYPE APPROXIMATION THEOREM

  • Belen, Cemal;Mursaleen, Mohammad;Yildirim, Mustafa
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.4
    • /
    • pp.851-861
    • /
    • 2012
  • In this paper, we define the notion of statistical A-summability for double sequences and find its relation with A-statistical convergence. We apply our new method of summability to prove a Korovkin-type approximation theorem for a function of two variables. Furthermore, through an example, it is shown that our theorem is stronger than classical and statistical cases.

ON A SEQUENCE OF KANTOROVICH TYPE OPERATORS VIA RIEMANN TYPE q-INTEGRAL

  • Bascanbaz-Tunca, Gulen;Erencin, Aysegul;Tasdelen, Fatma
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.2
    • /
    • pp.303-315
    • /
    • 2014
  • In this work, we construct Kantorovich type generalization of a class of linear positive operators via Riemann type q-integral. We obtain estimations for the rate of convergence by means of modulus of continuity and the elements of Lipschitz class and also investigate weighted approximation properties.