• Title/Summary/Keyword: Bounded domain

Search Result 190, Processing Time 0.028 seconds

On Some Spaces Isomorphic to the Space of Absolutely q-summable Double Sequences

  • Capan, Husamettin;Basar, Feyzi
    • Kyungpook Mathematical Journal
    • /
    • v.58 no.2
    • /
    • pp.271-289
    • /
    • 2018
  • Let 0 < q < ${\infty}$. In this study, we introduce the spaces ${\mathcal{BV}}_q$ and ${\mathcal{LS}}_q$ of q-bounded variation double sequences and q-summable double series as the domain of four-dimensional backward difference matrix ${\Delta}$ and summation matrix S in the space ${\mathcal{L}}_q$ of absolutely q-summable double sequences, respectively. Also, we determine their ${\alpha}$- and ${\beta}-duals$ and give the characterizations of some classes of four-dimensional matrix transformations in the case 0 < q ${\leq}$ 1.

CONVERGENCE ANALYSIS ON GIBOU-MIN METHOD FOR THE SCALAR FIELD IN HODGE-HELMHOLTZ DECOMPOSITION

  • Min, Chohong;Yoon, Gangjoon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.18 no.4
    • /
    • pp.305-316
    • /
    • 2014
  • The Hodge-Helmholtz decomposition splits a vector field into the unique sum of a divergence-free vector field (solenoidal part) and a gradient field (irrotational part). In a bounded domain, a boundary condition needs to be supplied to the decomposition. The decomposition with the non-penetration boundary condition is equivalent to solving the Poisson equation with the Neumann boundary condition. The Gibou-Min method is an application of the Poisson solver by Purvis and Burkhalter to the decomposition. Using the $L^2$-orthogonality between the error vector and the consistency, the convergence for approximating the divergence-free vector field was recently proved to be $O(h^{1.5})$ with step size h. In this work, we analyze the convergence of the irrotattional in the decomposition. To the end, we introduce a discrete version of the Poincare inequality, which leads to a proof of the O(h) convergence for the scalar variable of the gradient field in a domain with general intersection property.

An Immersed-Boundary Method for Simulation of Density-Stratified Flows (밀도 성층 유동 해석을 위한 가상경계법)

  • Yoon, Dong-Hyeog;Yang, Kyung-Soo;Hwang, Jong-Yeon;Lee, Sung-Su
    • Proceedings of the KSME Conference
    • /
    • 2004.04a
    • /
    • pp.1909-1914
    • /
    • 2004
  • An immersed boundary method for simulation of density-stratified flows is developed and applied to computation of viscous flows over two-dimensional obstacles in a bounded domain under stable density stratification. Density sources/sinks are introduced on the body surface. Two obstacle shapes are used, a vertical barrier and a smooth cosine-shaped hill; weak stratification, defined by $K=ND/{\pi}U{\leq}1$, where U, N, and D are the upstream velocity, buoyancy frequency, and domain height, respectively, is considered. The results are consistent with other authors' calculations, and shed light on computation of density-stratified flows in complex geometries.

  • PDF

Regional Identifiability of Spatially-Varying Parameters in Distributed Parameter Systems of Hyperbolic Type

  • Nakagiri, Shin-ichi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.423-428
    • /
    • 1998
  • This paper studies the regional identifiability of spatially-varying parameters in distributed parameter systems of hyperbolic type. Let Ω be a bounded domain of R$^n$and let Ωo be a subregion of the closed domain Ω. The distributed parameter systems having unknown parameters defined on Ω are described by the second order evolution equations in the filbert space L$^2$(Ω) and the observations are made on the subregion Ωo ⊂ Ω. The regional identifiability is formulated as the uniqueness of parameters by the identity of solutions on the subregion. Several regional identifiability results of the spatially-varying parameters of hyperbolic distributed parameter systems are established by means of the Riesz spectral representations.

  • PDF

Parametric roll of container ships in head waves

  • Moideen, Hisham;Falzarano, Jeffrey M.;Sharma, S.Abhilash
    • Ocean Systems Engineering
    • /
    • v.2 no.4
    • /
    • pp.239-255
    • /
    • 2012
  • Analysis of ship parametric roll has generally been restricted to simple analytical models and sophisticated time domain simulations. Simple analytical models do not capture all the critical dynamics while time-domain simulations are often time consuming to implement. The model presented in this paper captures the essential dynamics of the system without over simplification. This work incorporates various important aspects of the system and assesses the significance of including or ignoring these aspects. Special consideration is given to the fact that a hull form asymmetric about the design waterline would not lead to a perfectly harmonic variation in metacentric height. Many of the previous works on parametric roll make the assumption of linearized and harmonic behaviour of the time-varying restoring arm or metacentric height. This assumption enables modelling the roll motion as a Mathieu equation. This paper provides a critical assessment of this assumption and suggests modelling the roll motion as a Hills equation. Also the effects of non-linear damping are included to evaluate its effect on the bounded parametric roll amplitude in a simplified manner.

ON THE RATIO OF BIOMASS TO TOTAL CARRYING CAPACITY IN HIGH DIMENSIONS

  • Heo, Junyoung;Kim, Yeonho
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1227-1237
    • /
    • 2021
  • This paper is concerned with a reaction-diffusion logistic model. In [17], Lou observed that a heterogeneous environment with diffusion makes the total biomass greater than the total carrying capacity. Regarding the ratio of biomass to carrying capacity, Ni [10] raised a conjecture that the ratio has a upper bound depending only on the spatial dimension. For the one-dimensional case, Bai, He, and Li [1] proved that the optimal upper bound is 3. Recently, Inoue and Kuto [13] showed that the supremum of the ratio is infinity when the domain is a multi-dimensional ball. In this paper, we generalized the result of [13] to an arbitrary smooth bounded domain in ℝn, n ≥ 2. We use the sub-solution and super-solution method. The idea of the proof is essentially the same as the proof of [13] but we have improved the construction of sub-solutions. This is the complete answer to the conjecture of Ni.

REAL-VARIABLE CHARACTERIZATIONS OF VARIABLE HARDY SPACES ON LIPSCHITZ DOMAINS OF ℝn

  • Liu, Xiong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.745-765
    • /
    • 2021
  • Let Ω be a proper open subset of ℝn and p(·) : Ω → (0, ∞) be a variable exponent function satisfying the globally log-Hölder continuous condition. In this article, the author introduces the "geometrical" variable Hardy spaces Hp(·)r (Ω) and Hp(·)z (Ω) on Ω, and then obtains the grand maximal function characterizations of Hp(·)r (Ω) and Hp(·)z (Ω) when Ω is a strongly Lipschitz domain of ℝn. Moreover, the author further introduces the "geometrical" variable local Hardy spaces hp(·)r (Ω), and then establishes the atomic characterization of hp(·)r (Ω) when Ω is a bounded Lipschitz domain of ℝn.

Performance Analysis of GNSS Residual Error Bounding for QZSS CLAS

  • Yebin Lee;Cheolsoon Lim;Yunho Cha;Byungwoon Park;Sul Gee Park;Sang Hyun Park
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.3
    • /
    • pp.215-228
    • /
    • 2023
  • The State Space Representation (SSR) method provides individual corrections for each Global Navigation Satellite System (GNSS) error components. This method can lead to less bandwidth for transmission and allows selective use of each correction. Precise Point Positioning (PPP) - Real-Time Kinematic (RTK) is one of the carrier-based precise positioning techniques using SSR correction. This technique enables high-precision positioning with a fast convergence time by providing atmospheric correction as well as satellite orbit and clock correction. Currently, the positioning service that supports PPP-RTK technology is the Quazi-Zenith Satellite System Centimeter Level Augmentation System (QZSS CLAS) in Japan. A system that provides correction for each GNSS error component, such as QZSS CLAS, requires monitoring of each error component to provide reliable correction and integrity information to the user. In this study, we conducted an analysis of the performance of residual error bounding for each error component. To assess this performance, we utilized the correction and quality indicators provided by QZSS CLAS. Performance analyses included the range domain, dispersive part, non-dispersive part, and satellite orbit/clock part. The residual root mean square (RMS) of CLAS correction for the range domain approximated 0.0369 m, and the residual RMS for both dispersive and non-dispersive components is around 0.0363 m. It has also been confirmed that the residual errors are properly bounded by the integrity parameters. However, the satellite orbit and clock part have a larger residual of about 0.6508 m, and it was confirmed that this residual was not bounded by the integrity parameters. Users who rely solely on satellite orbit and clock correction, particularly maritime users, thus should exercise caution when utilizing QZSS CLAS.

New Time-Domain Decoder for Correcting both Errors and Erasures of Reed-Solomon Codes

  • Lu, Erl-Huei;Chen, Tso-Cho;Shih, Chih-Wen
    • ETRI Journal
    • /
    • v.38 no.4
    • /
    • pp.612-621
    • /
    • 2016
  • A new time-domain decoder for Reed-Solomon (RS) codes is proposed. Because this decoder can correct both errors and erasures without computing the erasure locator, errata locator, or errata evaluator polynomials, the computational complexity can be substantially reduced. Herein, to demonstrate this benefit, complexity comparisons between the proposed decoder and the Truong-Jeng-Hung and Lin-Costello decoders are presented. These comparisons show that the proposed decoder consistently has lower computational requirements when correcting all combinations of ${\nu}$ errors and ${\mu}$ erasures than both of the related decoders under the condition of $2{\nu}+{\mu}{\leq}d_{\min}-1$, where $d_{min}$ denotes the minimum distance of the RS code. Finally, the (255, 223) and (63, 39) RS codes are used as examples for complexity comparisons under the upper bounded condition of min $2{\nu}+{\mu}=d_{\min}-1$. To decode the two RS codes, the new decoder can save about 40% additions and multiplications when min ${\mu}=d_{min}-1$ as compared with the two related decoders. Furthermore, it can also save 50% of the required inverses for min $0{\leq}{\mu}{\leq}d_{\min}-1$.