P-stable methods for periodic initial value problems of second order differential equations

A class ofP-stable finite difference methods is discussed for solving initial value problems of second order differential equations which have periodic solutions. The methods depend upon a parameterp>0, and reduce to the classical Störmer-Cowell methods forp=0. It is shown that whenp is chosen for linear problems as the square of the frequency of the periodic solution, the methods areP-stable and for some suitable choice ofp, they have extended finite interval of periodicity.     

Algorithm for forming derivative-free optimal methods

We develop a simple yet effective and applicable scheme for constructing derivative free optimal iterative methods, consisting of one parameter, for solving nonlinear equations. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on k+1 evaluations could achieve a maximum convergence order of $2^{k}$ . Through the scheme, we construct derivative free optimal iterative methods of orders two, four and eight which request evaluations of two, three and four functions, respectively. The scheme can be further applied to develop iterative methods of even higher orders. An optimal value of the free-parameter is obtained through optimization and this optimal value is applied adaptively to enhance the convergence order without increasing the functional evaluations. Computational results demonstrate that the developed methods are efficient and robust as compared with many well known methods.     

Optimal order diagonally implicit Runge-Kutta methods

In this paper, the optimal order of non-confluent Diagonally Implicit Runge-Kutta (DIRK) methods with non-zero weights is examined. It is shown that the order of aq-stage non-confluent DIRK method with non-zero weights cannot exceedq+1. In particular the optimal order of aq stage non-confluent DIRK method with non-zero weights isq+1 for 1q5. DIRK methods of orders five and six in four and five stages respectively are constructed. It is further shown that the optimal order of a non-confluentq stage DIRK method with non-zero weights isq, forq6.     

Edge sets contained in circuits

A graphG withn vertices has propertyp(r, s) ifG contains a path of lengthr and if every such path is contained in a circuit of lengths. G. A. Dirac and C. Thomassen [Math. Ann.203 (1973), 65–75] determined graphs with propertyp(r,r+1). We determine the least number of edges in a graphG in order to insure thatG has propertyp(r,s), we determine the least number of edges possible in a connected graph with propertyp(r,s) forr=1 and alls, forr=k ands=k+2 whenk=2, 3, 4, and we give bounds in other cases. Some resulting extremal graphs are determined. We also consider a generalization of propertyp(2,s) in which it is required that each pair of edges is contained in a circuit of lengths. Some cases of this last property have been treated previously by U. S. R. Murty [inProof Techniques in Graph Theory, ed. F. Harary, Academic Press, New York, 1969, pp. 111–118].     

Parameter variation for the solution of two-point boundary-value problems and applications in the calculus of variations

In the parameter variation method, a scalar parameterk, k[0, 1], is introduced into the differential equations. The parameterk is inserted in such a way that, whenk=0, the solution of the boundary-value problem is known or readily calculated and, whenk=1, the problem is identical with the original problem. Thus, bydeforming the solution step-by-step throughk-space fromk=0 tok=1, the original problem may be solved. These solutions then provide good starting values for any convergent, iterative scheme such as the Newton-Raphson method.The method is applied to the solution of problems with various types of boundary-value specifications and is further extended to take account of situations arising in the solution of problems from variational calculus (e.g., total elapsed time not specified, optimum control not a simple function of the variables).     

A-stable block implicit one-step methods

A class of methods for solving the initial value problem for ordinary differential equations is studied. We developr-block implicit one-step methods which compute a block ofr new values simultaneously with each step of application. These methods are examined for the property ofA-stability. A sub-class of formulas is derived which is related to Newton-Cotes quadrature and it is shown that for block sizesr=1,2,..., 8 these methods areA-stable while those forr=9,10 are not. We constructA-stable formulas having arbitrarily high orders of accuracy, even stiffly (strongly)A-stable formulas.     

Stabilized multistep methods for index 2 Euler-Lagrange DAEs

We consider multistep discretizations, stabilized by -blocking, for Euler-Lagrange DAEs of index 2. Thus we may use nonstiff multistep methods with an appropriate stabilizing difference correction applied to the Lagrangian multiplier term. We show that orderp =k + 1 can be achieved for the differential variables with orderp =k for the Lagrangian multiplier fork-step difference corrected BDF methods as well as for low orderk-step Adams-Moulton methods. This approach is related to the recently proposed half-explicit Runge-Kutta methods.     

On the order of summability of the Fourier inversion formula

In this article we show that the order of the point value, in the sense of Łojasiewicz, of a tempered distribution and the order of summability of the pointwise Fourier inversion formula are closely related. Assuming that the order of the point values and certain order of growth at infinity are given for a tempered distribution, we estimate the order of summability of the Fourier inversion formula. For Fourier series, and in other cases, it is shown that if the distribution has a distributional point value of order k, then its Fourier series is e.v. Cesàro summable to the distributional point value of order k+1. Conversely, we also show that if the pointwise Fourier inversion formula is e.v. Cesàro summable of order k, then the distribution is the (k+1)-th derivative of a locally integrable function, and the distribution has a distributional point value of order k+2. We also establish connections between orders of summability and local behavior for other Fourier inversion problems.     

On the two classes of high‐order convergent methods of approximate inverse preconditioners for solving linear systems

Two classes of methods for approximate matrix inversion with convergence orders p =3?2^k +1 (Class 1) and p =5?2^k ?1 (Class 2), k ≥1 an integer, are given based on matrix multiplication and matrix addition. These methods perform less number of matrix multiplications compared to the known hyperpower method or p th‐order method for the same orders and can be used to construct approximate inverse preconditioners for solving linear systems. Convergence, error, and stability analyses of the proposed classes of methods are provided. Theoretical results are justified with numerical results obtained by using the proposed methods of orders p =7,13 from Class 1 and the methods with orders p =9,19 from Class 2 to obtain polynomial preconditioners for preconditioning the biconjugate gradient (BICG) method for solving well‐ and ill‐posed problems. From the literature, methods with orders p =8,16 belonging to a family developed by the effective representation of the p th‐order method for orders p =2^k , k is integer k ≥1, and other recently given high‐order convergent methods of orders p =6,7,8,12 for approximate matrix inversion are also used to construct polynomial preconditioners for preconditioning the BICG method to solve the considered problems. Numerical comparisons are given to show the applicability, stability, and computational complexity of the proposed methods by paying attention to the asymptotic convergence rates. It is shown that the BICG method converges very quickly when applied to solve the preconditioned system. Therefore, the cost of constructing these preconditioners is amortized if the preconditioner is to be reused over several systems of same coefficient matrix with different right sides.     

Small complete caps inPG(2,q), forq an odd square

An interesting class ofk-arcs withk=4(–1) in the projective plane overGF(q) is constructed forq an odd square; the construction yields many complete arcs of small size inPG(2,q) whenq2401.The research was supported by Italian MURST progetto 40%Strutture Geometriche, Combinatoria e loro applicazioni and by CNR Progetto StrategicoApplicazioni della matematica per la tecnologia e la società sottoprogettoCalcolo simbolico and by GNSAGA.