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

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.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.15-26
• /
• 2012

Some oscillation results are presented for the second-order neutral dynamic equation of mixed type on a time scale unbounded above $$\(r(t)[x(t)+p_1(t)x(t-{\tau}_1)+p_2(t)x(t+{\tau}_2)]^{\Delta}\)^{\Delta}+q_1(t)x(t-{\tau}_3)+q_2(t)x(t+{\tau}_4)=0.$$ These criteria can be applied when $\mathbb{T}=\mathbb{R}$, $\mathbb{T}=h{\mathbb{Z}}$ and $\mathbb{T}=\mathbb{P}_{a,b}$. Two examples are also provided to illustrate the main results.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.327-336
• /
• 2012

Let {$X_{ni}$, $i{\geq}1$, $n{\geq}1$} be an array of rowwise and pairwise negatively quadrant dependent random variables with mean zero, {$a_{ni}$, $i{\geq}1$, $n{\geq}1$} an array of weights and {$b_n$, $n{\geq}1$} an increasing sequence of positive integers. In this paper we consider some results concerning complete convergence of ${\sum}_{i=1}^{bn}a_{ni}X_{ni}$.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.101-109
• /
• 2012

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of one-dimensional family of genus 3 nonhyperelliptic curves over finite fields. We also provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of $C:y^3=x^4+{\alpha}$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ (mod 3) and $p{\neq}1$ (mod 4). Moreover, we give some implementation results using Gaudry-Schost method. A 162-bit order is computed in 97 s on a Pentium IV 2.13 GHz computer using our algorithm.

• Journal of applied mathematics & informatics
• /
• 제36권3_4호
• /
• pp.237-244
• /
• 2018

Let ${\mathcal{H}}$ be an infinite dimensional separable Hilbert space with a fixed orthonormal base $\{e_1,e_2,{\cdots}\}$. Let L be the subspace lattice generated by the subspaces $\{[e_1],[e_1,e_2],[e_1,e_2,e_3],{\cdots}\}$ and let $Alg{\mathcal{L}}$ be the algebra of bounded operators which leave invariant all projections in ${\mathcal{L}}$. Let p and q be natural numbers (p < q). Let ${\mathcal{A}}$ be a linear manifold in $Alg{\mathcal{L}}$ such that $T_{(p,q)}=0$ for all T in ${\mathcal{A}}$. If ${\mathcal{A}}$ is a Lie ideal, then $T_{(p,p)}=T_{(p+1,p+1)}={\cdots}=T_{(q,q)}$ and $T_{(i,j)}=0$, $p{\eqslantless}i{\eqslantless}q$ and i < $j{\eqslantless}q$ for all T in ${\mathcal{A}}$.

• Interaction and multiscale mechanics
• /
• 제2권3호
• /
• pp.295-319
• /
• 2009

In this work, we discuss a reproducing kernel collocation method (RKCM) for solving $2^{nd}$ order PDE based on strong formulation, where the reproducing kernel shape functions with compact support are used as approximation functions. The method based on strong form collocation avoids the domain integration, and leads to well-conditioned discrete system of equations. We investigate the convergence and the computational complexity for this proposed method. An important result obtained from the analysis is that the degree of basis in the reproducing kernel approximation has to be greater than one for the method to converge. Some numerical experiments are provided to validate the error analysis. The complexity of RKCM is also analyzed, and the complexity comparison with the weak formulation using reproducing kernel approximation is presented.

• Advances in Computational Design
• /
• 제5권3호
• /
• pp.277-289
• /
• 2020

This article describes the technology for constructing of a multiply-connected three-dimensional area's finite element representation. Representation of finite-element configuration of an area is described by a discrete set that consist of the number of nodes and elements of the finite-element grid, that are orderly set of nodes' coordinates and numbers of finite elements. Corresponding theorems are given, to prove the correctness of the solution method. The adequacy of multiply-connected area topology's finite element model is shown. The merging of subareas is based on the criterion of boundary nodes' coincidence by establishing a simple hierarchy of volumes, surfaces, lines and points. Renumbering nodes is carried out by the frontal method, where nodes located on the outer edges of the structure are used as the initial front.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.89-97
• /
• 2006

This paper presents a novel approach for non-iterative surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved by a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple and fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권4호
• /
• pp.238-266
• /
• 2013

The Interaction Picture (IP) method is a valuable alternative to Split-step methods for solving certain types of partial differential equations such as the nonlinear Schr$\ddot{o}$dinger equation or the Gross-Pitaevskii equation. Although very similar to the Symmetric Split-step (SS) method in its inner computational structure, the IP method results from a change of unknown and therefore do not involve approximation such as the one resulting from the use of a splitting formula. In its standard form the IP method such as the SS method is used in conjunction with the classical 4th order Runge-Kutta (RK) scheme. However it appears to be relevant to look for RK scheme of higher order so as to improve the accuracy of the IP method. In this paper we investigate 5th order Embedded Runge-Kutta schemes suited to be used in conjunction with the IP method and designed to deliver a local error estimation for adaptive step size control.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권4호
• /
• pp.279-294
• /
• 2013

We are interested in an adaptive grid method for hyperbolic equations. A multiresolution analysis, based on a biorthogonal family of interpolating scaling functions and lifted interpolating wavelets, is used to dynamically adapt grid points according to the physical field profile in each time step. Traditional finite-difference schemes with fixed stencils produce high oscillations around sharp discontinuities. In this paper, we hybridize high-resolution schemes, which are suitable for capturing singularities, and apply a finite-difference approach to the scaling functions at non-singular points. We use a total variation diminishing Runge-Kutta method for the time integration. The computational cost is proportional to the number of points present after compression. We provide several numerical examples to verify our approach.