One-and two-page crossing numbers for some types of graphs
The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles on k half planes (pages). Such drawings are called k-page book drawings and the minimal number of edge crossings in such ...
Algorithms for (0, 1, d)-graphs with d constrains
Let G be a graph with vertex set V(G). Let n, k, d be non-negative integers such that n+2k+d≤|V(G)|-2 and |V(G)|-n-d are even. A matching which saturates exactly |V(G)|-d vertices is called a defect-d matching of G. If when deleting any n vertices the ...
Disjoint paths in hypercubes with prescribed origins and lengths
Given (i) any k vertices u1, u2,..., uk (1≤k ˘stovani Matematiky, 109 (1984), pp. 135-152.] and Nebesky, [L. Nebesky Embedding m-quasistars into n-cubes, Czech. Math. J. 38 (1988), pp. 705-712].
A ternary three-point scheme for curve designing
In this paper, a stationary ternary three-point approximating subdivision scheme is presented, which generates C2 limiting curve and its limiting function has a support on [-3, 2]. The analysis of the scheme is shown using the Laurent polynomial method. ...
An improved (G'/G)-expansion method for solving nonlinear evolution equations
An improved (G'/G)-expansion method is proposed to seek more general travelling wave solutions of nonlinear evolution equations. We choose the Zakharov-Kuznetsov-BBM (Benjamin-Bona-Mahony) equation and the (2+1)-dimensional dispersive long wave ...
On the improved Newton-like methods for the inclusion of polynomial zeros
The aim of this paper is to present some modifications of Newton's type method for the simultaneous inclusion of all simple complex zeros of a polynomial. Using the concept of the R-order of convergence of mutually dependent sequences, the convergence ...
Vectorizing outlines of generic shapes by cubic spline using simulated annealing
A global optimization technique is proposed for the outline capture of generic shapes. This is inspired by a global optimization algorithm based on simulated annealing (SA) by Kirkpatrick et al. [S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, ...
A note on the variational approach to the Benjamin-Bona-Mahony equation using He's semi-inverse method
He's semi-inverse method is used to obtain variational formulation of the Benjamin-Bona-Mahony (BBM) equation. Using the Ritz method, the solitary solutions can be easily obtained.
The Hilber-Hughes-Taylor-α (HHT-α) method compared with an implicit Runge-Kutta for second-order systems
We will consider the Hilber-Hughes-Taylor-α (HHT-α ) method to solve periodic second-order initial value problems arising in, e.g. mechanics. We will consider the analysis of the method when applied to such problems. Second-order convergence is ...
Numerical studies on Boussinesq-type equations via a split-step Fourier method
Boussinesq-type nonlinear wave equations with dispersive terms are solved via split-step Fourier methods. We decompose the equations into linear and nonlinear parts, then solve them orderly. The linear part can be projected into phase space by a Fourier ...
The SOR-k method for linear systems with p-cyclic matrices
Let the system matrix of a linear system be p-cyclic and consistently ordered. Under the assumption that the pth power of the associated Jacobi matrix has only non-positive eigenvalues, it is known that the optimal spectral radius of the SOR-k iteration ...
High-order compact scheme for boundary points
In this paper, we introduce a new high-order scheme for boundary points when calculating the derivative of smooth functions by compact scheme. The primitive function reconstruction method of ENO schemes is applied to obtain the conservative form of the ...
A matrix LSQR iterative method to solve matrix equation AXB=C
This paper is a matrix iterative method presented to compute the solutions of the matrix equation, AXB=C, with unknown matrix X∈S, where S is the constrained matrices set like symmetric, symmetric-R-symmetric and (R, S)-symmetric. By this iterative ...
On the initialization methods of an exterior point algorithm for the assignment problem
In this paper, we present a theoretical investigation and an extensive computational study of exterior point simplex algorithm (EPSA) initialization methods for the assignment problem (AP). We describe the exterior point algorithm using three different ...
Combination of non-classical pseudospectral and direct methods for the solution of brachistochrone problem
In this paper, we propose a combination of non-classical pseudospectral and direct methods to find the solution of brachistochrone problem. The method converts the optimal control problem of brachistochrone, into a sequence of quadratic programming ...
Stabilization theory of iterative operator-splitting methods
In this paper we present a stabilization theory of iterative operator-splitting methods for linear and nonlinear differential equations. Continuous formulation is described and also the stability for linear and nonlinear cases. We apply linearization ...
Application of He's homotopy perturbation and He's variational iteration methods for solution of Benney-Lin equation
In this paper, we study the Benney-Lin equation using He's homotopy perturbation method (HPM) and He's variational iteration method (VIM). We compare HPM and VIM methods and show that the results of the HPM method are in excellent agreement with the ...
B-spline method for solving Bratu's problem
In this paper, we propose a B-spline method for solving the one-dimensional Bratu's problem. The numerical approximations to the exact solution are computed and then compared with other existing methods. The effectiveness and accuracy of the B-spline ...
A modified predictor-corrector scheme for the Klein-Gordon equation
A numerical method based on a three-time level finite-difference scheme has been proposed for the solution of the two forms of the Klein-Gordon equation. The method, which is analysed for local truncation error and stability, leads to the solution of a ...