Limit cycle bifurcations near a double homoclinic loop with a nilpotent saddle of order m

In this paper, we study the explicit expansion of the first order Melnikov function near a double homoclinic loop passing through a nilpotent saddle of order m in a near-Hamiltonian system. For any positive integer $m(m\ge 1)$, we derive the formulas of the coefficients in the expansion, which can be used to study the limit cycle bifurcations for near-Hamiltonian systems. In particular, for $m=2$, we use the coefficients to consider the limit cycle bifurcations of general near-Hamiltonian systems and give the existence conditions for 10, 11, 13, 15 and 16 (11, 13 and 16, respectively) limit cycles in the case that the homoclinic loop is of cuspidal type (smooth type, respectively) and their distributions. As an application, we consider a near-Hamiltonian system with a nilpotent saddle of order 2 and obtain the lower bounds of the maximal number of limit cycles.     

A note on spectrum distribution of constraint preconditioned generalized saddle point matrices

In this note, results concerning the eigenvalue distribution and form of the eigenvectors of the constraint preconditioned generalized saddle point matrix and its minimal polynomial are given. These results extend previous ones that appeared in the literature. Copyright © 2009 John Wiley & Sons, Ltd.     

On block preconditioners for saddle point problems with singular or indefinite (1, 1) block

We discuss a class of preconditioning methods for the iterative solution of symmetric algebraic saddle point problems, where the (1, 1) block matrix may be indefinite or singular. Such problems may arise, e.g. from discrete approximations of certain partial differential equations, such as the Maxwell time harmonic equations. We prove that, under mild assumptions on the underlying problem, a class of block preconditioners (including block diagonal, triangular and symmetric indefinite preconditioners) can be chosen in a way which guarantees that the convergence rate of the preconditioned conjugate residuals method is independent of the discretization mesh parameter. We provide examples of such preconditioners that do not require additional scaling. Copyright © 2010 John Wiley & Sons, Ltd.     

Computing Complex Airy Functions by Numerical Quadrature

Integral representations are considered of solutions of the Airy differential equation w –zw=0 for computing Airy functions for complex values of z. In a first method contour integral representations of the Airy functions are written as non-oscillating integrals for obtaining stable representations, which are evaluated by the trapezoidal rule. In a second method an integral representation is evaluated by using generalized Gauss–Laguerre quadrature; this approach provides a fast method for computing Airy functions to a predetermined accuracy. Comparisons are made with well-known algorithms of Amos, designed for computing Bessel functions of complex argument. Several discrepancies with Amos' code are detected, and it is pointed out for which regions of the complex plane Amos' code is less accurate than the quadrature algorithms. Hints are given in order to build reliable software for complex Airy functions.     

Improved RGF method to find saddle points

The predictor-corrector method for following a reduced gradient (RGF) to determine saddle points [Quapp, W. et al., J Comput Chem 1998, 19, 1087] is further accelerated by a modification allowing an implied corrector step per predictor but almost without additional costs. The stability and robustness of the RGF method are improved, and the new version in addition reduces the number of gradient and Hessian calculations.     

Linear-quadratic two-person zero-sum differential games,necessary and sufficient conditions: Comment

We give a simpler, easier-to-check, version of the theorem of the paper referred to, i.e., a necessary and sufficient condition for the existence of a saddle point to the linear-quadratic two-person zero-sum perfect information differential game.     

Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces

This paper deals with the connectedness of the cone-efficient solution set for vector optimization inlocally convex Hausdorff topological vector spaces.The connectedness of the cone-efficient solution set is provedfor multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set ofalternatives.The generalized saddle theorem plays a key role in the proof.     

Existence of Solutions and of Multiple Solutions for Nonlinear Nonsmooth Periodic Systems

In this paper we examine nonlinear periodic systems driven by the vectorial p-Laplacian and with a nondifferentiable, locally Lipschitz nonlinearity. Our approach is based on the nonsmooth critical point theory and uses the subdifferential theory for locally Lipschitz functions. We prove existence and multiplicity results for the sublinear problem. For the semilinear problem (i.e. p = 2) using a nonsmooth multidimensional version of the Ambrosetti-Rabinowitz condition, we prove an existence theorem for the superlinear problem. Our work generalizes some recent results of Tang (PAMS 126(1998)).     

Primal-Dual Solution Perturbations in Convex Optimization

Solutions to optimization problems of convex type are typically characterized by saddle point conditions in which the primal vector is paired with a dual multiplier vector. This paper investigates the behavior of such a primal-dual pair with respect to perturbations in parameters on which the problem depends. A necessary and sufficient condition in terms of certain matrices is developed for the mapping from parameter vectors to saddle points to be single-valued and Lipschitz continuous locally. It is shown that the saddle point mapping is then semi-differentiable, and that its semi-derivative at any point and in any direction can be calculated by determining the unique solutions to an auxiliary problem of extended linear-quadratic programming and its dual. A matrix characterization of calmness of the solution mapping is provided as well.     

On nonoscillating integrals for computing inhomogeneous Airy functions

Integral representations are considered of solutions of the inhomogeneous Airy differential equation . The solutions of these equations are also known as Scorer functions. Certain functional relations for these functions are used to confine the discussion to one function and to a certain sector in the complex plane. By using steepest descent methods from asymptotics, the standard integral representations of the Scorer functions are modified in order to obtain nonoscillating integrals for complex values of . In this way stable representations for numerical evaluations of the functions are obtained. The methods are illustrated with numerical results.