A class of difference scheme for solving telegraph equation by new non-polynomial spline methods

In this paper, by using a new non-polynomial parameters cubic spline in space direction and compact finite difference in time direction, we get a class of new high accuracy scheme of O(τ⁴ + h²) and O(τ⁴ + h⁴) for solving telegraph equation if we suitably choose the cubic spline parameters. Meanwhile, stability condition of the difference scheme has been carried out. Finally, numerical examples are used to illustrate the efficiency of the new difference scheme.     

A class of methods based on non-polynomial sextic spline functions for the solution of a special fifth-order boundary-value problems

A family of fourth and second-order accurate numerical schemes is presented for the solution of fifth-order boundary-value problems with two-point-boundary conditions. The non-polynomial sextic spline functions are applied to construct the numerical algorithms. This approach generalizes polynomial spline algorithms, and provides solution at every point of range of integration. Convergence of the methods is discussed through standard convergence analysis. A numerical illustration is given to show the pertinent features of the technique.     

An analytical comparison of the LP relaxations of integer models for the k-club problem

Given an undirected graph G = (V, E), a k-club is a subset of nodes that induces a subgraph with diameter at most k. The k-club problem is to find a maximum cardinality k-club. In this study, we use a linear programming relaxation standpoint to compare integer formulations for the k-club problem. The comparisons involve formulations known from the literature and new formulations, built in different variable spaces. For the case k = 3, we propose two enhanced compact formulations. From the LP relaxation standpoint these formulations dominate all other compact formulations in the literature and are equivalent to a formulation with a non-polynomial number of constraints. Also for k = 3, we compare the relative strength of LP relaxations for all formulations examined in the study (new and known from the literature). Based on insights obtained from the comparative study, we devise a strengthened version of a recursive compact formulation in the literature for the k-club problem (k > 1) and show how to modify one of the new formulations for the case k = 3 in order to accommodate additional constraints recently proposed in the literature.     

A new high accuracy non-polynomial tension spline method for the solution of one dimensional wave equation in polar co-ordinates

In this paper, we propose a new three-level implicit nine point compact finite difference formulation of O(k² + h⁴) based on non-polynomial tension spline approximation in r-direction and finite difference approximation in t-direction for the numerical solution of one dimensional wave equation in polar co-ordinates. We describe the mathematical formulation procedure in details and also discuss the stability of the method. Numerical results are provided to justify the usefulness of the proposed method.     

On a map between two K3 surfaces associated to a net of quadrics

We study the geometry of the birational map between an intersection of a net of quadrics in that contains a line and the double sextic branched along the discriminant of the net. We show that the branch locus of a smooth double sextic S ₆ is discriminant of a net of quadrics in such that S ₆ is isomorphic to the intersection of this net iff a certain configuration of rational curves on S₆ is weakly even. Received: 14 September 2005 Suported by the DFG Schwerpunktprogramm ‘Global methods in complex geometry’. The first named author is partially supported by the KBN Grant No. 1 P03A 008 28. The second named author is partially supported by the KBN Grant No. 2 P03A 016 25.     

Solving second order initial value problems by a hybrid multistep method without predictors

A three-step seventh order hybrid linear multistep method (HLMM) with three non-step points is proposed for the direct solution of the special second order initial value problems (IVPs) of the form y″ = f(x, y) with an extension to y″ = f(x, y, y′). The main method and additional methods are obtained from the same continuous scheme derived via interpolation and collocation procedures.The stability properties of the methods are discussed by expressing them as a one-step method in higher dimension. The methods are then applied in block form as simultaneous numerical integrators over non-overlapping intervals. Numerical results obtained using the proposed block form reveal that it is highly competitive with existing methods in the literature.     

Nordsieck methods with computationally verified algebraic stability

We describe the search for algebraically stable Nordsieck methods of order p = s and stage order q = p, where s is the number of stages. This search is based on the theoretical criteria for algebraic stability proposed recently by Hill, and Hewitt and Hill, for general linear methods for ordinary differential equations. These criteria, which are expressed in terms of the non-negativity of the eigenvalues of a Hermitian matrix on the unit circle, are then verified computationally for the derived Nordsieck methods of order p ? 2.     

A non-separable solution of the diffusion equation based on the Galerkin’s method using cubic splines

The two dimensional diffusion equation of the form is considered in this paper. We try a bi-cubic spline function of the form as its solution. The initial coefficients C_i,j(0) are computed simply by applying a collocation method; C_i,j = f(x_i, y_j) where f(x, y) = u(x, y, 0) is the given initial condition. Then the coefficients C_i,j(t) are computed by X(t) = e^tQX(0) where X(t) = (C_0,1, C_0,1, C_0,2, … , C_0,N, C_1,0, … , C_N,N) is a one dimensional array and the square matrix Q is derived from applying the Galerkin’s method to the diffusion equation. Note that this expression provides a solution that is not necessarily separable in space coordinates x, y. The results of sample calculations for a few example problems along with the calculation results of approximation errors for a problem with known analytical solution are included.     

The improved linear multistep methods for differential equations with piecewise continuous arguments

This paper deals with the convergence of the linear multistep methods for the equation x′(t) = ax(t) + a₀x([t]). Numerical experiments demonstrate that the 2-step Adams-Bashforth method is only of order p = 0 when applied to the given equation. An improved linear multistep methods is constructed. It is proved that these methods preserve their original convergence order for ordinary differential equations (ODEs) and some numerical experiments are given.     

On the Hermitian positive definite solutions of nonlinear matrix equation X + A∗XA = Q

Nonlinear matrix equation X^s + A∗X^−tA = Q, where A, Q are n × n complex matrices with Q Hermitian positive definite, has widely applied background. In this paper, we consider the Hermitian positive definite solutions of this matrix equation with two cases: s ? 1, 0 < t ? 1 and 0 < s ? 1, t ? 1. We derive necessary conditions and sufficient conditions for the existence of Hermitian positive definite solutions for the matrix equation and obtain some properties of the solutions. We also propose iterative methods for obtaining the extremal Hermitian positive definite solution of the matrix equation. Finally, we give some numerical examples to show the efficiency of the proposed iterative methods.     

Methods for solving singular boundary value problems using splines: a review

This paper surveys and reviews papers of spline solution of singular boundary value problems. Among a number of numerical methods used to solve two-point singular boundary value problems, spline methods provide an efficient tool. Techniques collected in this paper include cubic splines, non-polynomial splines, parametric splines, B-splines and TAGE method.     

Non-polynomial spline method for the solution of two-dimensional linear wave equations with a nonlinear source term

In this paper, two classes of methods are developed for the solution of two space dimensional wave equations with a nonlinear source term. We have used non-polynomial cubic spline function approximations in both space directions. The methods involve some parameters, by suitable choices of the parameters, a new high accuracy three time level scheme of order O(h ⁴ + k ⁴ + τ ² + τ ² h ² + τ ² k ²) has been obtained. Stability analysis of the methods have been carried out. The results of some test problems are included to demonstrate the practical usefulness of the proposed methods. The numerical results for the solution of two dimensional sine-Gordon equation are compared with those already available in literature.     

The domination numbers of cylindrical grid graphs

Let γ(P_m □ C_n) denote the domination number of the cylindrical grid graph formed by the Cartesian product of the graphs P_m, the path of length m, m ? 2 and the graph C_n, the cycle of length n, n ? 3. In this paper, methods to find the domination numbers of graphs of the form P_m □ C_n with n ? 3 and m = 2, 3 and 4 are proposed. Moreover, bounds on domination numbers of the graphs P₅ □ C_n, n ? 3 are found. The methods that are used to prove that results readily lead to algorithms for finding minimum dominating sets of the above mentioned graphs.     

Efficient integration for a class of highly oscillatory integrals

This paper presents some quadrature methods for a class of highly oscillatory integrals whose integrands may have singularities at the two endpoints of the interval. One is a Filon-type method based on the asymptotic expansion. The other is a Clenshaw-Curtis-Filon-type method which is based on a special Hermite interpolation polynomial and can be evaluated efficiently in O(N log N) operations, where N + 1 is the number of Clenshaw-Curtis points in the interval of integration. In addition, we derive the corresponding error bound in inverse powers of the frequency ω for the Clenshaw-Curtis-Filon-type method for the class of highly oscillatory integrals. The efficiency and the validity of these methods are testified by both the numerical experiments and the theoretical results.     

Positive definite solutions of the nonlinear matrix equation X + AXA = Q (q > 0)

In this paper, the nonlinear matrix equation X + A^∗X^qA = Q (q > 0) is investigated. Some necessary and sufficient conditions for existence of Hermitian positive definite solutions of the nonlinear matrix equations are derived. An effective iterative method to obtain the positive definite solution is presented. Some numerical results are given to illustrate the effectiveness of the iterative methods.     

The comparison of different mathematical methods to determine the BOD parameters,a new developed method and impacts of these parameters variations on the design of WWTPs

One of the most common tests for the determination of strength and organic content of wastewater is the biochemical oxygen demand (BOD). This test is widely applied to define organic water pollution and to control the performance of wastewater treatment plants. Generally, BOD is standardized by the measurement of oxygen consumption in 5 days (BOD₅). But, determination of the ultimate biochemical oxygen demand (BOD_u), which is taken 28 days and the reaction rate constant (k) are necessary to understand the organic strength of the wastewater. In this study, the different mathematical methods in order to determine the BOD parameters (BOD_u, k) and two different BOD test method (respirometer and dilution method) are investigated comparatively. Also, a new method based on cubic spline method to estimate ultimate BOD values is developed. Moreover, the impacts of BOD parameters on the design of an activated sludge and aerated lagoon systems are analyzed by using a written user-friend program, which is developed for designing WWTPs by the mean of C++ programming language.     

Sextic spline method for the solution of a system of obstacle problems

We use sextic spline function to develop numerical method for the solution of system of second-order boundary-value problems associated with obstacle, unilateral, and contact problems. We show that the approximate solutions obtained by the present method are better than those produced by other collocation, finite difference and spline methods. A numerical example is given to illustrate practical usefulness of our method.     

Numerical similarity reductions of the (1+3)-dimensional Burgers equation

We consider the (1+3)-dimensional Burgers equation u_t = u_xx + u_yy + u_zz + uu_x which has considerable interest in mathematical physics. Lie symmetries are used to reduce it to certain ordinary differential equations. We employ numerical methods to solve a number of these ordinary differential equations.     

Family of numerical methods based on non-polynomial splines for solution of contact problems

In this paper a new technique based on quartic non-polynomial spline functions connecting spline functions values at mid knots and their corresponding values of the fourth-order derivatives is developed. This approach leads to a family of numerical methods for computing approximations to the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is shown that the present family of methods gives better approximations. Existing second and fourth-order finite-difference and spline functions based methods developed at mid knots become special cases of the new approach. Numerical examples are given to illustrate applicability and efficiency of the new methods.