• Title/Summary/Keyword: uniform convergence

Search Result 439, Processing Time 0.022 seconds

BLOCK DIAGONAL PRECONDITIONERS FOR THE GALERKIN LEAST SQUARES METHOD IN LINEAR ELASTICITY

  • Yoo, Jae-Chil
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.143-153
    • /
    • 2000
  • In [8], Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we propose the block diagonal preconditioners. The preconditioned conjugate residual method is robust in that the convergence is uniform as the parameter, v, goes to $\sfrac{1}{2}$. Computational experiments are included.

  • PDF

BARRELLEDNESS OF SOME SPACES OF VECTOR MEASURES AND BOUNDED LINEAR OPERATORS

  • FERRANDO, JUAN CARLOS
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.5
    • /
    • pp.1579-1586
    • /
    • 2015
  • In this paper we investigate the barrellednes of some spaces of X-valued measures, X being a barrelled normed space, and provide examples of non barrelled spaces of bounded linear operators from a Banach space X into a barrelled normed space Y, equipped with the uniform convergence topology.

ON ENERGY ESTIMATES FOR A LANDAU-LIFSCHITZ TYPE FUNCTIONAL IN HIGHER DIMENSIONS

  • Qi, Longxing;Lei, Yutian
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.6
    • /
    • pp.1207-1218
    • /
    • 2009
  • The authors study the asymptotic behavior of radial minimizers of an energy functional associated with ferromagnets and antiferromagnets in higher dimensions. The location of the zeros of the radial minimizer is discussed. Moreover, several uniform estimates for the radial minimizer are presented. Based on these estimates, the authors establish global convergence of radial minimizers.

On Stability of Discrete Time Nonlinear Systems with Slow-in-the-average Time Varying Inputs

  • Oh, Jun-Ho;Lim, Myo-Taeg
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.172.1-172
    • /
    • 2001
  • In this paper we show the stability analysis of the discrete nonlinear system with average bounded variation of the input. This is the discrete counterpart of that continuous one. We use the Lyapunov stability to prove the boundedness of the steady-state error. Also the allowable maximum variation bounds and the region of attraction are given as the function of the system parameters. Moreover, we prove the uniform convergence for the constant input.

  • PDF

A STUDY ON KERNEL ESTIMATION OF A SMOOTH DISTRIBUTION FUNCTION ON CENSORED DATA

  • Jee, Eun Sook
    • The Mathematical Education
    • /
    • v.31 no.2
    • /
    • pp.133-140
    • /
    • 1992
  • The problem of estimating a smooth distribution function F at a point $\tau$ based on randomly right censored data is treated under certain smoothness conditions on F . The asymptotic performance of a certain class of kernel estimators is compared to that of the Kap lan-Meier estimator of F($\tau$). It is shown that the .elative deficiency of the Kaplan-Meier estimate. of F($\tau$) with respect to the appropriately chosen kernel type estimate. tends to infinity as the sample size n increases to infinity. Strong uniform consistency and the weak convergence of the normalized process are also proved.

  • PDF

EXPERIMENTAL RESULTS OF W-CYCLE MULTIGRID FOR PLANAR LINEAR ELASTICITY

  • Yoo, Jae-Chil
    • East Asian mathematical journal
    • /
    • v.14 no.2
    • /
    • pp.399-410
    • /
    • 1998
  • In [3], Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated-linear systems. In this work, we present computational experiments of W-cycle multigrid method. Computational experiments show that the convergence is uniform as the parameter, $\nu$, goes to 1/2.

  • PDF

Renewal Reward Processes with Fuzzy Rewards and Fuzzy Inter-arrival Times

  • Hong, Dug-Hun;Do, Hae-Young;Park, Jin-Myeong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.1
    • /
    • pp.195-204
    • /
    • 2006
  • In this paper, we consider a renewal process in which both the inter-arrival times and rewards are fuzzy random variables. We prove the uniform levelwise convergence of fuzzy renewal and fuzzy renewal rewards. These results improve the result of Popova and Wu[European J. Oper. Research 117(1999), 606-617] and the main result of Hwang [Fuzzy Sets and Systems 116 (2000), 237-244].

  • PDF

A Note on Renewal Reward Process with Fuzzy Rewards

  • Hong, Dug-Hun;Kim, Jeong-Jin;Do, Hae-Young
    • Journal of the Korean Data and Information Science Society
    • /
    • v.16 no.1
    • /
    • pp.165-172
    • /
    • 2005
  • In recently, Popova and Wu(1999) proved a theorem which presents the long-run average fuzzy reward per unit time. In this note, we improve this result. Indeed we will show uniform convergence of a renewal reward processes with respect to the level ${\alpha}$ modeled as a fuzzy random variables.

  • PDF

The DOA Estimation of Wide Band Moving Sources

  • Cho, Mun-Hyeong
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.12-16
    • /
    • 2007
  • In this paper, a new method is proposed for tracking the direction-of-arrival (DOA) of the wideband moving source incident on uniform linear array sensors. DOA is estimated by focusing transformation matrices. To update focusing matrices along with new data snap shots, we use the FAST (Fast Approximate Subspace Tracking) method. Present focusing matrices are constructed by previous signal and its orthogonal basis vectors as well as present signal and its orthogonal basis vectors, which are the left and right singular vectors of the inner product of two approximated matrices. Simulation results are shown to illustrate the performance of the proposed method.