• Kyungpook Mathematical Journal
• /
• 제51권4호
• /
• pp.411-417
• /
• 2011

In the present paper, we are concerned with subordination problems related to ${\lambda}$-Robertson function. The radii of ${\lambda}$-spirallikeness and starlikeness of ${\lambda}$-Robert function are also determined.

• 대한수학회지
• /
• 제57권4호
• /
• pp.1031-1052
• /
• 2020

In this paper our aim is to find various radii problems of the generalized Mittag-Leffler function for three different kinds of normalization by using their Hadamard factorization in such a way that the resulting functions are analytic. The basic tool of this study is the Mittag-Leffler function in series. Also we have shown that the obtained radii are the smallest positive roots of some functional equations.

• 대한수학회보
• /
• 제57권6호
• /
• pp.1409-1426
• /
• 2020

Let 𝒜_n be the class of analytic functions f(z) of the form f(z) = z + ∑^∞_k=n+1 α_kz^k, n ∈ ℕ defined on the open unit disk 𝔻, and let $${\Omega}_n:=\{f{\in}{\mathcal{A}}_n:\|zf^{\prime}(z)-f(z)\|<{\frac{1}{2}},\;z{\in}{\mathbb{D}}\}$$. In this paper, we make use of differential subordination technique to obtain sufficient conditions for the class Ω_n. Writing Ω := Ω₁, we obtain inclusion properties of Ω with respect to functions which map 𝔻 onto certain parabolic regions and as a consequence, establish a relation connecting the parabolic starlike class 𝒮_P and the uniformly starlike UST. Various radius problems for the class Ω are considered and the sharpness of the radii estimates is obtained analytically besides graphical illustrations.

• Kyungpook Mathematical Journal
• /
• 제55권2호
• /
• pp.395-410
• /
• 2015

For functions $f(z)=z+a_2z^2+a_3z^3+{\cdots}$ with ${\mid}a_2{\mid}=2b$, $b{\geq}0$, sharp radii of starlikeness of order ${\alpha}(0{\leq}{\alpha}<1)$, convexity of order ${\alpha}(0{\leq}{\alpha}<1)$, parabolic starlikeness and uniform convexity are derived when ${\mid}a_n{\mid}{\leq}M/n^2$ or ${\mid}a_n{\mid}{\leq}Mn^2$ (M>0). Radii constants in other instances are also obtained.

• 호남수학학술지
• /
• 제37권3호
• /
• pp.317-323
• /
• 2015

The purpose of the present paper is to study certain radii problems for the function $$f(z)=\[{\frac{z^{1-{\gamma}}}{{\gamma}+{\beta}}}\(z^{\gamma}[D^nF(z)]^{\beta}\)^{\prime}\]^{1/{\beta}}$$, where ${\beta}$ is a positive real number, ${\gamma}$ is a complex number such that ${\gamma}+{\beta}{\neq}0$ and the function F(z) varies various subclasses of analytic functions with fixed second coefficients. Relevant connections of the results presented herewith various well-known results are briefly indicated.

• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.229-242
• /
• 2022

In this paper, we introduce a new subclass of k-uniformly close-to-convex functions with respect to conjugate points. We study characterization, coefficient estimates, distortion bounds, extreme points and radii problems for this class. We also discuss integral means inequality with the extremal functions. Our findings may be related with the previously known results.

• Korean Journal of Mathematics
• /
• 제31권4호
• /
• pp.433-444
• /
• 2023

Given a function f analytic in open disk centred at origin of radius unity and satisfying the condition |f(z)/g(z) - 1| < 1 for a analytic function g with certain prescribed conditions in the unit disk, radii constants R are determined for the values of Rzf'(Rz)/f(Rz) to lie inside the domain enclosed by the curve |w² - 1| = 1 (lemniscate of Bernoulli). This, in turn, provides a partial solution to the conjectures and problems for determination of sharp bounds R for such functions f.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.193-201
• /
• 2015

In this paper, we present preconditioned generalized accelerated overrelaxation (GAOR) methods for solving weighted linear least square problems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GAOR methods converge faster than the GAOR method whenever the GAOR method is convergent. Finally, we give a numerical example to confirm our theoretical results.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제4권2호
• /
• pp.137-144
• /
• 1997

In this paper we consider covering problems in spherical geometry. Let $cov_q{S_1}^n$ be the smallest radius of q equal metric balls that cover n-dimensional unit sphere ${S_1}^n$. We show that $cov_q{S_1}^n\;=\;\frac{\pi}{2}\;for\;2\leq\;q\leq\;n+1$ and $\pi-arccos(\frac{-1}{n+1})$ for q = n ＋ 2. The configuration of centers of balls realizing $cov_q{S_1}^n$ are established, simultaneously. Moreover, some properties of $cov_{q}$X for the compact metric space X, in general, are proved.

• Nuclear Engineering and Technology
• /
• 제52권3호
• /
• pp.485-498
• /
• 2020

A diffusion synthetic acceleration (DSA) technique for the S_N transport equation discretized with the linear discontinuous expansion method with subcell balance (LDEM-SCB) on unstructured tetrahedral meshes is presented. The LDEM-SCB scheme solves the transport equation with the discrete ordinates method by using the subcell balances and linear discontinuous expansion of the flux. Discretized DSA equations are derived by consistently discretizing the continuous diffusion equation with the LDEM-SCB method, however, the discretized diffusion equations are not fully consistent with the discretized transport equations. In addition, a fine mesh rebalance (FMR) method is devised to accelerate the discretized diffusion equation coupled with the preconditioned conjugate gradient (CG) method. The DSA method is applied to various test problems to show its effectiveness in speeding up the iterative convergence of the transport equation. The results show that the DSA method gives small spectral radii for the tetrahedral meshes having various minimum aspect ratios even in highly scattering dominant mediums for the homogeneous test problems. The numerical tests for the homogeneous and heterogeneous problems show that DSA with FMR (with preconditioned CG) gives significantly higher speedups and robustness than the one with the Gauss-Seidel-like iteration.