by using the trigonometric uniform splines of order 3 with a real tension factor, a numericalmethod is developed for solving a linear second order boundary value problems (2vbp) withdirichlet, neumann and cauchy types boundary conditions. the moment at the knots isapproximated by central finite-difference method. the order of convergence of the methodand the theory is illustrated by solving tes...

In this article, we will show the complex inversion formula for the inversion of the L2-transform and also some applications of the L2, and Post Widder transforms for solving singular integral equation with trigonometric kernel. Finally, we obtained analytic solution for a partial differential equation with non-constant coefficients.

this paper presents an efficient modification of the variational iteration method for solvingboundary value problems using the chebyshev polynomials. the proposed method can be applied to linearand nonlinear models. the scheme is tested for some examples and the obtained results demonstrate thereliability and efficiency of the proposed method.

in this paper, we use modified laplace decomposition method to solving initial value problems (ivp) of the second order ordinary differential equations. theproposed method can be applied to linear and nonlinearproblems

The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...

M -ary pulse position modulation (M -ary PPM) has been widely considered as an attractive solution for increasing the bit rates in free-space optical (FSO) communications. Besides increasing the bit rate, M -ary PPM increases the power efficiency of FSO systems. Hence, better performance can be achieved at lower Eb/N0 values when compared to on-off keying (OOK). M -ary PPM systems can be implem...

The vertex boundary-width problem (for short VBWP) is to determine the value of vbw(G)=max1 |V |minS⊆V,|S|= |N(S)| for a given graph G= (V ,E), where N(S)= {v / ∈ S|v is a neighbor of u for some u ∈ S}. In this paper, we give a lower bound for vertex boundary-width of complete k-ary trees. © 2007 Elsevier B.V. All rights reserved.