Trigonometrical fitting conditions for two derivative Runge-Kutta methods

Two derivative Runge-Kutta methods are Runge-Kutta methods for problems of the form y^′ = f(y) that include the second derivative y^″ = g(y) = f^′(y)f(y) and were developed in the work of Chan and Tsai (Numer. Alg. 53, 171–194 2010). Explicit methods were considered and attention was given to the construction of methods that involve one evaluation of f and many evaluations of g per step. In this work, we consider trigonometrically fitted two derivative explicit Runge-Kutta methods of the general case that use several evaluations of f and g per step; trigonometrically fitting conditions for this general case are given. Attention is given to the construction of methods that involve several evaluations of f and one evaluation of g per step. We modify methods with stages up to four, with three f and one g evaluation and with four f and one g, evaluation based on the fourth and fifth order methods presented in Chan and Tsai (Numer. Alg. 53, 171–194 2010). We provide numerical results to demonstrate the efficiency of the new methods using four test problems.     

Phase‐fitted,six‐step methods for solving x′′ = f(t,x)

An explicit, six‐step method of sixth order is presented and tuned for the numerical solution of x′′ = f(t,x). This method is explicit, hybrid, and uses two function evaluations (stages) per step. Its coefficients are varied and depend on the step size. This variance comes from the demand of the method to nullify the phase errors produced when solving the standard simple oscillator. The first and second derivative of this error vanish also. Numerical tests in a set of relevant problems illustrate the efficiency of the newly derived method.     

Fitted modifications of classical Runge‐Kutta pairs of orders 5(4)

Runge‐Kutta pairs sharing orders 5 and 4 are among the most celebrated methods for solving initial value problems. Here, after considering the phase lag as a function of frequency v, we derive a modification of a particular pair. Namely, we present a zero dissipative pair with vanished phase error and its first derivative. After extended numerical tests in various oscillatory problems, it seems that this modified pair outperforms existing methods in the literature.     

Non‐Abelian homomorphism testing,and distributions close to their self‐convolutions

In this paper, we study two questions related to the problem of testing whether a function is close to a homomorphism. For two finite groups G,H (not necessarily Abelian), an arbitrary map f : G,H, and a parameter 0 < ε < 1, say that f is ε‐close to a homomorphism if there is some homomorphism g such that g and f differ on at most ε | G | elements of G, and say that f is ε‐far otherwise. For a given f and ε, a homomorphism tester should distinguish whether f is a homomorphism, or if f is ε‐far from a homomorphism. When G is Abelian, it was known that the test which picks O(1/ε) random pairs x,y and tests that f(x) + f(y) = f(x + y) gives a homomorphism tester. Our first result shows that such a test works for all groups G. Next, we consider functions that are close to their self‐convolutions. Let A = {a_g | g ε G} be a distribution on G. The self‐convolution of A, A^′ = {a | g ε G}, is defined by It is known that A= A^′ exactly when A is the uniform distribution over a subgroup of G. We show that there is a sense in which this characterization is robust—that is, if A is close in statistical distance to A^′, then A must be close to uniform over some subgroup of G. Finally, we show a relationship between the question of testing whether a function is close to a homomorphism via the above test and the question of characterizing functions that are close to their self‐convolutions. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

On explicit two-derivative Runge-Kutta methods

The theory of Runge-Kutta methods for problems of the form y′?=?f(y) is extended to include the second derivative y′′?=?g(y):?=?f′(y)f(y). We present an approach to the order conditions based on Butcher’s algebraic theory of trees (Butcher, Math Comp 26:79–106, 1972), and derive methods that take advantage of cheap computations of the second derivatives. Only explicit methods are considered here where attention is given to the construction of methods that involve one evaluation of f and many evaluations of g per step. Methods with stages up to five and of order up to seven including some embedded pairs are presented. The first part of the paper discusses a theoretical formulation used for the derivation of these methods which are also of wider applicability. The second part presents experimental results for non-stiff and mildly stiff problems. The methods include those with the computation of one second derivative (plus many first derivatives) per step, and embedded methods for changing stepsize as well as those involving one first derivative (plus many second derivatives) per step. The experiments have been performed on standard problems and comparisons made with some standard explicit Runge-Kutta methods.     

One-step 9-stage Hermite–Birkhoff–Taylor ODE solver of order 10

A one-step 9-stage Hermite–Birkhoff–Taylor method of order 10, denoted by HBT(10)9, is constructed for solving nonstiff systems of first-order differential equations of the form y′=f(x,y), y(x ₀)=y ₀. The method uses y′ and higher derivatives y ⁽²⁾ to y ⁽⁴⁾ as in Taylor methods and is combined with a 9-stage Runge–Kutta method. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to Taylor- and Runge–Kutta-type order conditions which are reorganized into Vandermonde-type linear systems whose solutions are the coefficients of the method. The new method has a larger scaled interval of absolute stability than Dormand–Prince DP(8,7)13M. The stepsize is controlled by means of y ⁽²⁾ and y ⁽⁴⁾. HBT(10)9 is superior to DP(8,7)13M and Taylor method of order 10 in solving several problems often used to test high-order ODE solvers on the basis of the number of steps, CPU time, and maximum global error. These numerical results show the benefits of adding high-order derivatives to Runge–Kutta methods.     

On stability of Hamilton‐connectedness under the 2‐closure in claw‐free graphs

It is easy to characterize chordal graphs by every k‐cycle having at least f(k) = k ? 3 chords. I prove new, analogous characterizations of the house‐hole‐domino‐free graphs using f(k) = 2?(k ? 3)/2?, and of the graphs whose blocks are trivially perfect using f(k) = 2k ? 7. These three functions f(k) are optimum in that each class contains graphs in which every k‐cycle has exactly f(k) chords. The functions 3?(k ? 3)/3? and 3k ? 11 also characterize related graph classes, but without being optimum. I consider several other graph classes and their optimum functions, and what happens when k‐cycles are replaced with k‐paths. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:137‐147, 2011     

Operator time‐splitting techniques combined with quintic B‐spline collocation method for the generalized Rosenau–KdV equation

In this article, the generalized Rosenau–KdV equation is split into two subequations such that one is linear and the other is nonlinear. The resulting subequations with the prescribed initial and boundary conditions are numerically solved by the first order Lie–Trotter and the second‐order Strang time‐splitting techniques combined with the quintic B‐spline collocation by the help of the fourth order Runge–Kutta (RK‐4) method. To show the accuracy and reliability of the proposed techniques, two test problems having exact solutions are considered. The computed error norms L₂ and L_∞ with the conservative properties of the discrete mass Q(t) and energy E(t) are compared with those available in the literature. The convergence orders of both techniques have also been calculated. Moreover, the stability analyses of the numerical schemes are investigated.     

Solutions with boundary‐layers and spike‐layers to singularly perturbed quasilinear Dirichlet problems

The structure of nontrivial nonnegative solutions to singularly perturbed quasilinear Dirichlet problems of the form –?Δ_pu = f(u) in Ω, u = 0 on ?Ω, Ω ? R ^N a bounded smooth domain, is studied as ? → 0⁺, for a class of nonlinearities f(u) satisfying f(0) = f(z₁) = f(z₂) = 0 with 0 < z₁ < z₂, f < 0 in (0, z₁), f > 0 in (z₁, z₂) and f(u)/u^p–1 = –∞. It is shown that there are many nontrivial nonnegative solutions with spike‐layers. Moreover, the measure of each spike‐layer is estimated as ? → 0⁺. These results are applied to the study of the structure of positive solutions of the same problems with f changing sign many times in (0,∞). Uniqueness of a solution with a boundary‐layer and many positive intermediate solutions with spike‐layers are obtained for ? sufficiently small. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Direct problem and inverse problem for the supersonic plane flow past a curved wedge

In this paper, we consider the isentropic irrotational steady plane flow past a curved wedge. First, for a uniform supersonic oncoming flow, we study the direct problem: For a given curved wedge y = f(x), how to globally determine the corresponding shock y = g(x) and the solution behind the shock? Then, we solve the corresponding inverse problem: How to globally determine the curved wedge y = f(x) under the hypothesis that the position of the shock y = g(x) and the uniform supersonic oncoming flow are given? This kind of problems plays an important role in the aviation industry. Under suitable assumptions, we obtain the global existence and uniqueness for both problems. Copyright © 2011 John Wiley & Sons, Ltd.     

A Generalized Cubic Functional Equation

In this paper, we determine the general solution of the functional equation f1 （2x ＋ y） ＋ f2（2x - y） = f3（x ＋ y） ＋ f4（x - y） ＋ f5（x） without assuming any regularity condition on the unknown functions f1,f2,f3, f4, f5 ： R→R. The general solution of this equation is obtained by finding the general solution of the functional equations f（2x ＋ y） ＋ f（2x - y） = g（x ＋ y） ＋ g（x - y） ＋ h（x） and f（2x ＋ y） - f（2x - y） = g（x ＋ y） - g（x - y）. The method used for solving these functional equations is elementary but exploits an important result due to Hosszfi. The solution of this functional equation can also be determined in certain type of groups using two important results due to Szekelyhidi.     

Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function

Let f(n) = min{χ(G × H) : G and H are n‐chromatic digraphs} and g(n) = min{χ(G × H) : G and H are n‐chromatic graphs}. We prove that f is bounded if and only if g is bounded. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Controllability of second‐order Sobolev‐type impulsive delay differential systems

In this paper, we study some controllability results for second‐order Sobolev‐type impulsive integrodifferential systems with finite delay. The results are obtained by using the concepts of measure of noncompactness and Mönch's fixed point theorem. Particularly, we consider the damping term y′(·) and find a control u such that the mild solution satisfies y(T) = y_T and . Finally, an application is given to illustrate the obtained results.     

On the functional equation f(x+g(y))-f(y+g(y))=f(x)-f(y) on groups

We solve the equation

A comparative study of functional equations characterising sine and cosine

A comparative study of the functional equationsf(x+y)f(x–y)=f ²(x)–f ²(y),f(y){f(x+y)+f(x–y)}=f(x)f(2y) andf(x+y)+f(x–y)=2f(x){1–2f ²(y/2)} which characterise the sine function has been carried out. The zeros of the functionf satisfying any one of the above equations play a vital role in the investigations. The relation of the equationf(x+y)+f(x–y)=2f(x){1–2f ²(y/2)} with D'Alembert's equation,f(x+y)+f(x–y)=2f(x)f(y) and the sine-cosine equationg(x–y)=g(x)g(y) +f(x)f(y) has also been investigated.     

An upper and lower solution approach for singular boundary value problems with sign changing non‐linearities

We obtain via Schauder's fixed point theorem new results for singular second‐order boundary value problems where our non‐linear term f(t,y,z) is allowed to change sign. In particular, our problem may be singular at y=0, t=0 and/or t=1. Copyright © 2002 John Wiley & Sons, Ltd.     

Runge–Kutta Methods for Systems of Differential Equation with Piecewise Continuous Arguments: Convergence and Stability

This work deals with the convergence and stability of Runge–Kutta methods for systems of differential equation with piecewise continuous arguments x^′(t) = Px(t)+Qx([t+1∕2]) under two cases for coe?cient matrix. First, when P and Q are complex matrices, the su?cient condition under which the analytic solution is asymptotically stable is given. It is proven that the Runge–Kutta methods are convergent with order p. Moreover, the su?cient condition under which the analytical stability region is contained in the numerical stability region is obtained. Second, when P and Q are commutable Hermitian matrices, using the theory of characteristic, the necessary and su?cient conditions under which the analytic solution and the numerical solution are asymptotically stable are presented, respectively. Furthermore, whether the Runge–Kutta methods preserve the stability of analytic solution are investigated by the theory of Padé approximation and order star. To demonstrate the theoretical results, some numerical experiments are adopted.     

A new highly accurate discretization for three‐dimensional singularly perturbed nonlinear elliptic partial differential equations

We employ a new fourth‐order compact finite difference formula based on arithmetic average discretization to solve the three‐dimensional nonlinear singularly perturbed elliptic partial differential equation ε(u_xx + u_yy + u_zz) = f(x, y, z, u, u_x, u_y, u_z), 0 < x, y, z < 1, subject to appropriate Dirichlet boundary conditions prescribed on the boundary, where ε > 0 is a small parameter. We also describe new fourth‐order methods for the estimates of (?u/?x), (?u/?y), and (?u/?z), which are quite often of interest in many physical problems. In all cases, we require only a single computational cell with 19 grid points. The proposed methods are directly applicable to solve singular problems without any modification. We solve three test problems numerically to validate the proposed derived fourth‐order methods. We compare the advantages and implementation of the proposed methods with the standard central difference approximations in the context of basic iterative methods. Numerical examples are given to verify the fourth‐order convergence rate of the methods. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006