권호 표지

Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)

  • 연3회간
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)

과학기술표준분류

  • 수학 ＞ 응용수학

Aim & Scope

This is a broad based journal covering all branches of computational or applied mathematics with special encouragement to researchers in theoretical computer science and mathematical Informatics. Thus, the major areas, such as Numerical Analysis, Discrete Optimization, Linear and Nonlinear Programming, Theory of Computation(Computational Complexity, Automata and Formal Languages), Control Theory, Theory of Algorithms, Computational Logic, Applied Combinatorics (including graphs, codes, and designs), Coding Theory, Cryptographics, Big data, AI, Fuzzy Theory with applications, Differential Equations with applications, etc., are all included. A large variety of scientific problems also necessarily involve Algebra, Analysis, Geometry, Probability and Statistics, and so on. The journal welcomes research papers in all branches of mathematics which have some bearing on the application to scientific problems, including papers in the areas of Actuarial Science, Mathematical Biology, Mathematical Economics and Finance.

KSCI KCI SCOPUS

제38권3_4호

  1. SUBRAMANIAN, N.;ESI, A.;DEBNATH, S. 201
    https://doi.org/10.14317/jami.2020.201 PDF KSCI
    We introduce and study some basic properties of rough I-convergent of triple sequence spaces and also study the set of all rough I-limits of a triple sequence spaces.
  2. GOUBI, MOULOUD 211
    https://doi.org/10.14317/jami.2020.211 PDF KSCI
    In this paper, we introduce and investigate a new class of generalized polynomials associated with Hermite-Bernoulli polynomials of higher order. This generalization is a unification formula of Bernoulli numbers, Bernoulli polynomials, Hermite-Bernoulli polynomials of Dattoli, generalized Hermite-Bernoulli polynomials for two variables of order α and new other families of polynomials depending on any generating function f.
  3. LOURDUSAMY, A.;WENCY, S. JENIFER;PATRICK, F. 221
    https://doi.org/10.14317/jami.2020.221 PDF KSCI
    Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S3 cordial remainder labeling.
  4. LI, CHUNJI;YAO, HAN 239
    https://doi.org/10.14317/jami.2020.239 PDF KSCI
    In this paper, we consider the target control problem for the linear systems by using the solution of the Hausdorff moment problem.
  5. KOO, KI-SHIK 249
    https://doi.org/10.14317/jami.2020.249 PDF KSCI
    Here, assume that X is a compact space. we show that if f is a locally nonexpansive map then f : X → X has the limit shadowing property if and only if f : CR(f) → CR(f) has the limit shadowing property. Also we prove that if f is a local expansion then f has the limit shadowing property.
  6. KIM, SANG-BAE 255
    https://doi.org/10.14317/jami.2020.255 PDF KSCI
    Today most students have a smartphone. Students learning numerical analysis can practice coding using their smartphone in the classroom without going to the computer lab. The tool NAPHP[1] makes it easy to practice coding using PHP in an internet web browser without installing a coding app on your smartphone. This paper introduces a debugging tool for the NAPHP.
  7. YOO, JONG-KWANG 261
    https://doi.org/10.14317/jami.2020.261 PDF KSCI
    For any Banach spaces X and Y, let L(X, Y) denote the set of all bounded linear operators from X to Y. Let A ∈ L(X, Y) and B, C ∈ L(Y, X) satisfying operator equation ABA = ACA. In this paper, we prove that AC and BA share the local spectral properties such as a finite ascent, a finite descent, property (K), localizable spectrum and invariant subspace.
  8. PARK, MIN JI;LIM, JUNG WOOK 271
    https://doi.org/10.14317/jami.2020.271 PDF KSCI
    Let R be a commutative ring with identity, R[X] the polynomial ring over R, ∗ a radical operation on R and ⋆ a radical operation of finite character on R[X]. In this paper, we give Hilbert basis theorem for rings with ∗-Noetherian spectrum. More precisely, we show that if (I∗R[X])⋆ = (IR[X])⋆ and (I∗R[X])⋆ ∩ R = I∗ for all ideals I of R, then R has ∗-Noetherian spectrum if and only if R[X] has ⋆-Noetherian spectrum. This is a generalization of a well-known fact that R has Noetherian spectrum if and only if R[X] has Noetherian spectrum.
  9. PARK, HYUN IL;PAHADIA, SAURAV;HWANG, CHRISTINE;HWANG, CHI-OK 277
    https://doi.org/10.14317/jami.2020.277 PDF KSCI
    We propose and analyze a chord summation algorithm, which combines the ideas of Viète and Archimedes to calculate the value of π. The error of the algorithm decreases exponentially per iteration and becomes pinched at a critical iteration, depending on the accuracy of the first input value, ${\sqrt{2}}$. The critical iteration is also analyzed.
  10. LEE, Hui Young 291
    https://doi.org/10.14317/jami.2020.291 PDF KSCI
    This type of polynomial is a generating function that substitutes eλt for et in the denominator of the generating function for the Bernoulli polynomial, but polynomials by using this generating function has interesting properties involving the location of the roots. We define these generation functions and observe the properties of the generation functions.
  11. KURT, BURAK 301
    https://doi.org/10.14317/jami.2020.301 PDF KSCI
    Recently, M. Masjed-Jamai et al. in ([6]-[7]) and Srivastava et al. in ([15]-[16]) considered the parametric type of the Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi polynomials. They proved some theorems and gave some identities and relations for these polynomials. In this work, we define the parametric poly-tangent numbers and polynomials. We give some relations and identities for the parametric poly-tangent polynomials.
  12. KUMAR, N. KISHORE;BISWAS, PANKAJ;REDDY, B. SESHADRI 311
    https://doi.org/10.14317/jami.2020.311 PDF KSCI
    The solution of the elliptic partial differential equation has interface singularity at the points which are either the intersections of interfaces or the intersections of interfaces with the boundary of the domain. The singularities that arises in the elliptic interface problems are very complex. In this article we propose an exponentially accurate nonconforming spectral element method for these problems based on [7, 18]. A geometric mesh is used in the neighbourhood of the singularities and the auxiliary map of the form z = ln ξ is introduced to remove the singularities. The method is essentially a least-squares method and the solution can be obtained by solving the normal equations using the preconditioned conjugate gradient method (PCGM) without computing the mass and stiffness matrices. Numerical examples are presented to show the exponential accuracy of the method.
  13. DEMIRTAS, NAIME;HUSSAIN, SABIR;DALKILIC, ORHAN 335
    https://doi.org/10.14317/jami.2020.335 PDF KSCI
    We present inverse soft rough sets by using inverse soft sets and soft rough sets. We study different approaches for inverse soft rough set and examine the relationships between them. We also discuss and explore the basic properties for these approaches. Moreover we develop an algorithm following these concepts and apply it to a decision-making problem to demonstrate the applicability of the proposed methods.
  14. CHAKRAVARTHY, SRINIVAS R. 351
    https://doi.org/10.14317/jami.2020.351 PDF KSCI
    There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.