권호 표지

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

제33권1_2호

  1. Rao, A. Kameswara 1
    https://doi.org/10.14317/jami.2015.001 PDF KSCI KPUBS HTML
    This paper is concerned with boundary value problems for systems of n-th order dynamic equations on time scales. Under the suitable conditions, the existence and multiplicity of positive solutions are established by using abstract fixed-point theorems.
  2. Pei, Yonggang;Liu, Fujun;Gao, Qinghui 13
    https://doi.org/10.14317/jami.2015.013 PDF KSCI KPUBS HTML
    In this paper, we introduce a general iterative algorithm for finding a common element of the common fixed point set of an infinite family of ${\lambda}_i$-strict pseudo-contractions and the solution set of a general system of variational inclusions for two inverse strongly accretive operators in q-uniformly smooth Banach spaces. Then, we analyze the strong convergence of the iterative sequence generated by the proposed iterative algorithm under mild conditions.
  3. Kim, Sang-Bae 33
    https://doi.org/10.14317/jami.2015.033 PDF KSCI KPUBS HTML
    The convergence rate of a numerical procedure based on Schwarz Alternating Method(SAM) for solving elliptic boundary value problems depends on the selection of the interface conditions applied on the interior boundaries of the overlapping subdomains. It has been observed that the Robin condition (mixed interface condition), controlled by a parameter, can optimize SAM's convergence rate. In [7], one formulated the multi-parameterized SAM and determined the optimal values of the multi-parameters to produce the best convergence rate for one-dimensional elliptic boundary value problems. Two-dimensional implementation was presented in [8]. In this paper, we present an implementation for three-dimensional problem.
  4. Chandrasekaran, S.;Karunanithi, S. 45
    https://doi.org/10.14317/jami.2015.045 PDF KSCI KPUBS HTML
    This paper is concerned with the existence of mild solutions for partial neutral functional integrodifferential equations with infinite delay in Banach spaces. The results are obtained by using resolvent operators and Krasnoselski-Schaefer type fixed point theorem. An example is provided to illustrate the results.
  5. Singh, Sukhjit;Gupta, D.K. 61
    https://doi.org/10.14317/jami.2015.061 PDF KSCI KPUBS HTML
    In this paper, a fifth order extension of Potra's third order iterative method is proposed for solving nonlinear equations. A convergence theorem along with the error bounds is established. The method takes three functions and one derivative evaluations giving its efficiency index equals to 1.495. Some numerical examples are also solved and the results obtained are compared with some other existing fifth order methods. Next, the interval extension of both third and fifth order Potra's method are developed by using the concepts of interval analysis. Convergence analysis of these methods are discussed to establish their third and fifth orders respectively. A number of numerical examples are worked out using INTLAB in order to demonstrate the efficacy of the methods. The results of the proposed methods are compared with the results of the interval Newton method.
  6. Shin, Yang Woo;Moon, Dug Hee 77
    https://doi.org/10.14317/jami.2015.077 PDF KSCI KPUBS HTML
    Parallel lines are often used to increase production rate in many manufacturing systems where the main line splits into several lines in parallel, and after some operations, they merge into a main line again. Queueing networks with finite buffers have been widely used for modeling and analyzing manufacturing systems. This paper provides an approximation technique for multi-server two-stage networks with merge configuration and blocking which will be a building block for analysis of general manufacturing systems with parallel lines and merge configuration. The main idea of the method is to decompose the original system into subsystems that have two service stations with multiple servers, two buffers and external arrivals to the second stage are allowed. The subsystems are modeled by level dependent quasi-birth-and-death (LDQBD) process.
  7. Pattabiraman, K. 89
    https://doi.org/10.14317/jami.2015.089 PDF KSCI KPUBS HTML
    In this paper, we present exact formulae for the multiplicatively weighted Harary indices of join, tensor product and strong product of graphs in terms of other graph invariants including the Harary index, Zagreb indices and Zagreb coindices. Finally, We apply our result to compute the multiplicatively weighted Harary indices of fan graph, wheel graph and closed fence graph.
  8. Ponraj, R.;Narayanan, S. Sathish 101
    https://doi.org/10.14317/jami.2015.101 PDF KSCI KPUBS HTML
    A Total Mean Cordial labeling of a graph G = (V, E) is a function $f:V(G){\rightarrow}\{0,1,2\}$ such that $f(xy)={\Large\lceil}\frac{f(x)+f(y)}{2}{\Large\rceil}$ where $x,y{\in}V(G)$, $xy{\in}E(G)$, and the total number of 0, 1 and 2 are balanced. That is ${\mid}ev_f(i)-ev_f(j){\mid}{\leq}1$, $i,j{\in}\{0,1,2\}$ where $ev_f(x)$ denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). If there is a total mean cordial labeling on a graph G, then we will call G is Total Mean Cordial. Here, We investigate the Total Mean Cordial labeling behaviour of prism, gear, helms.
  9. Oh, Seyoung;Yun, Jae Heon;Kim, Kyoum Sun 111
    https://doi.org/10.14317/jami.2015.111 PDF KSCI KPUBS HTML
    In this paper, we propose an extended SOR (ESOR) method with diagonal preconditioners for solving symmetric positive definite linear systems, and then we provide convergence results of the ESOR method. Lastly, we provide numerical experiments to evaluate the performance of the ESOR method with diagonal preconditioners.
  10. Xiang, Ruiyin 119
    https://doi.org/10.14317/jami.2015.119 PDF KSCI KPUBS HTML
    In this note, two new mappings associated with convexity are propoesd, by which we obtain some new Hermite-Hadamard type inequalities for convex functions via Riemann-Liouville fractional integrals. We conclude that the results obtained in this work are the refinements of the earlier results.
  11. Huang, Pengzhan;Abduwali, Abdurishit 127
    https://doi.org/10.14317/jami.2015.127 PDF KSCI KPUBS HTML
    In this paper, we consider a modified inexact Newton method for solving a nonlinear system F(x) = 0 where $F(x):R^n{\rightarrow}R^n$. The basic idea is to accelerate convergence. A semi-local convergence theorem for the modified inexact Newton method is established and an affine invariant version is also given. Moreover, we test three numerical examples which show that the modified inexact scheme is more efficient than the classical inexact Newton strategy.
  12. Sohn, Gyoyong 145
    https://doi.org/10.14317/jami.2015.145 PDF KSCI KPUBS HTML
    In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.
  13. Kazakovtsev, Lev A.;Stanimirovic, Predrag S. 157
    https://doi.org/10.14317/jami.2015.157 PDF KSCI KPUBS HTML
    We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.
  14. Nazeer, Saima;Kousar, Imrana;Nazeer, Waqas 173
    https://doi.org/10.14317/jami.2015.173 PDF KSCI KPUBS HTML
    A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).
  15. Kim, Jeongsim 185
    https://doi.org/10.14317/jami.2015.185 PDF KSCI KPUBS HTML
    This paper considers a discrete-time buffer system with session-based arrivals, an infinite storage capacity and one unreliable output line. There are multiple different types of sessions and the output line is governed by a finite state Markov chain. Based on a generating functions approach, we obtain an exact expression for the mean buffer content.
  16. Wang, Guangbin;Sun, Deyu 193
    https://doi.org/10.14317/jami.2015.193 PDF KSCI KPUBS HTML
    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.
  17. Kim, Joo-Mok;Kim, Yun-Kyong 203
    https://doi.org/10.14317/jami.2015.203 PDF KSCI KPUBS HTML
    We consider fractional Brownian motion and FARIMA process with Gaussian innovations and show that the suitably scaled distributions of the FARIMA processes converge to fractional Brownian motion in the sense of finite dimensional distributions. We figure out ACF function and estimate the self-similarity parameter H of FARIMA(0, d, 0) by using R/S method. Finally, we display power spectrum density of FARIMA process.
  18. Lee, Yutae 211
    https://doi.org/10.14317/jami.2015.211 PDF KSCI KPUBS HTML
    A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.
  19. Choi, Sang Il;Goo, Yoon Hoe 219
    https://doi.org/10.14317/jami.2015.219 PDF KSCI KPUBS HTML
    In this paper, we investigate Lipschitz and asymptotic stability for perturbed functional differential systems.
  20. Song, Yoon J. 229
    https://doi.org/10.14317/jami.2015.229 PDF KSCI KPUBS HTML
    In the setting of semidefinite linear complementarity problems on $S^n$, we focus on the Stein Transformation $S_A(X):=X-AXA^T$ for $A{\in}R^{n{\times}n}$ that is positive semidefinite preserving (i.e., $S_A(S^n_+){\subseteq}S^n_+$) and show that such transformation is strictly monotone if and only if it is nondegenerate. We also show that a positive semidefinite preserving $S_A$ has the Ultra-GUS property if and only if $1{\not\in}{\sigma}(A){\sigma}(A)$.