Integral operators with Green's function type kernel

A variant of the Nyström method based on Simpson's rule is presented. This is designed to deal with integral operators with kernels k(s, t) that are not continuous along the diagonal s = t. A complete analysis is carried out, generalizations for other interpolatory quadrature rules are proposed; also a variant using Gaussian quadrature is considered and examples are given.     

On reductions for the Steiner Problem in Graphs

Several authors have demonstrated how reductions can be used to improve the efficiency with which the Steiner Problem in Graphs can be solved. Previous reduction algorithms have been largely ad hoc in nature. This paper uses a theory of confluence to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction.     

EXISTENCE AND UNIQUENESS THEOREMS FOR HIGHER-ORDER BOUNDARY VALUE PROBLEMS

An existence and uniqueness of solutions for boundary value problemsandare established, by employing a priori estimates for all solutions and the Schau-der fixed point theorem. Some of these results extend earlier results due toUsmani(1979), Yang(1988), and Pei(1997).     

Primal separation algorithms

Given an integer polyhedron , an integer point , and a point , the primal separation problem is the problem of finding a linear inequality which is valid for P _I , violated by x ^*, and satisfied at equality by . The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.Received: November 2002, Revised: March 2003,     

Children’s use of realistic considerations in problem solving: some English evidence

This is the second of two papers exploring children’s responses to an extended version of a division-with-remainder problem intended to elicit general rather than particular realistic considerations during mathematical problem solving. Responses to two problems are analyzed. The first is a ‘realistically’ contextualised item drawn from national tests in England whose ambiguities have been previously discussed (Cooper, 1992); the second is a version of this problem revised to encourage a wider range of realistic responses. In Cooper and Harries (2002), the responses of children at the end of their first year of secondary schooling were analyzed. Here the responses of children at the end of their primary schooling are analyzed and compared with the previous results. It is shown that many children, given suitable encouragement, are willing and able to enter into an extended form of realistic thinking during problem solving, although the original test item renders this invisible.     

The Lanczos Method with Semi-Definite Inner Product

The spectral transformation Lanczos method is very popular for solving large scale real symmetric generalized eigenvalue problems. The method uses a special inner product so that the symmetric Lanczos method can be used. Sometimes, a semi-definite inner product must be used. This may lead to instabilities and break-down. In this paper, we suggest cures for breakdown by use of implicit restarting and the pseudo-Lanczos method.This revised version was published online in October 2005 with corrections to the Cover Date.     

基于Lagrange乘子法的一种二阶椭圆问题混合元格式

本文利用Lagrange乘子法的思想,修改了传统的混合变分形式,将二阶椭圆问题转化为与其等价的新的变分形工,给出了针对该新形式进行离散求解的一种混合元格式,与现在已知格式相比,用较少的自由度获得了较高的逼近阶。     

Oscillations of higher order differential equations of neutral type

In this paper, sufficient conditions have been obtained for oscillation of solutions of a class of nth order linear neutral delay-differential equations. Some of these results have been used to study oscillatory behaviour of solutions of a class of boundary value problems for neutral hyperbolic partial differential equations.     

Spectral analysis for the Gauss problem on continued fractions

We present a new derivation of the formula appearing in Babenko (1978) and Mayer and Roepstorff (1987) that gives the probability distribution of τ⁻ⁿ${\tau }^{-n}$ in terms of the eigenvalues of a symmetric operator. Here τ$\tau$ is the well-known Gauss-map.     

Growth Behavior of Two Classes of Merit Functions for Symmetric Cone Complementarity Problems

In the solution methods of the symmetric cone complementarity problem (SCCP), the squared norm of a complementarity function serves naturally as a merit function for the problem itself or the equivalent system of equations reformulation. In this paper, we study the growth behavior of two classes of such merit functions, which are induced by the smooth EP complementarity functions and the smooth implicit Lagrangian complementarity function, respectively. We show that, for the linear symmetric cone complementarity problem (SCLCP), both the EP merit functions and the implicit Lagrangian merit function are coercive if the underlying linear transformation has the P-property; for the general SCCP, the EP merit functions are coercive only if the underlying mapping has the uniform Jordan P-property, whereas the coerciveness of the implicit Lagrangian merit function requires an additional condition for the mapping, for example, the Lipschitz continuity or the assumption as in (45). The authors would like to thank the two anonymous referees for their helpful comments which improved the presentation of this paper greatly. The research of J.-S. Chen was partially supported by National Science Council of Taiwan.