Irregular Boundary Value Problems with Discontinuous Coefficients and the Eigenvalue Parameter

In this study, a Birkhoff-irregular boundary value problem for linear ordinary differential equations of the second order with discontinuous coefficients and the spectral parameter has been considered. Therefore, at the discontinuous point, two additional boundary conditions (called transmission conditions) have been added to the boundary conditions. The eigenvalue parameter is of the second degree in the differential equation and of the first degree in a boundary condition. The equation contains an abstract linear operator which is (usually) unbounded in the space Lq(−1, 1). Isomorphism and coerciveness with defects 1 and 2 are proved for this problem. The case of the biharmonic equation is also studied.     

A-Statistical extension of the Korovkin type approximation theorem

In this paper, using the concept ofA-statistical convergence which is a regular (non-matrix) summability method, we obtain a general Korovkin type approximation theorem which concerns the problem of approximating a functionf by means of a sequenceL _n f of positive linear operators.     

Partial Geometric Difference Families

We introduce the notion of a partial geometric difference family as a variation on the classical difference family and a generalization of partial geometric difference sets. We study the relationship between partial geometric difference families and both partial geometric designs and difference families, and show that partial geometric difference families give rise to partial geometric designs. We construct several infinite families of partial geometric difference families using Galois rings and the cyclotomy of Galois fields. From these partial geometric difference families, we generate a list of infinite families of partial geometric designs and directed strongly regular graphs.     

Singular approximation in polydiscs by summability process

In this paper, we approximate a continuous function in a polydisc by means of multivariate complex singular operators which preserve the analytic functions. In this singular approximation, we mainly use a regular summability method (process) from the summability theory. We show that our results are non-trivial generalizations of the classical approximations. At the end, we display an application verifying the singular approximation via summation process, but not the usual sense.     

Mingling: mixed-integer rounding with bounds

Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This is not surprising as lifting techniques make explicit use of the bounds on variables, whereas the MIR procedure does not. In this paper we describe a simple procedure, which we call mingling, for incorporating variable bound information into MIR. By explicitly using the variable bounds, the mingling procedure leads to strong inequalities for mixed-integer sets with bounded variables. We show that facets of mixed-integer knapsack sets derived earlier by superadditive lifting techniques can be obtained by the mingling procedure. In particular, the mingling inequalities developed in this paper subsume the continuous cover and reverse continuous cover inequalities of Marchand and Wolsey (Math Program 85:15–33, 1999) as well as the continuous integer knapsack cover and pack inequalities of Atamtürk (Math Program 98:145–175, 2003; Ann Oper Res 139:21–38, 2005). In addition, mingling inequalities give a generalization of the two-step MIR inequalities of Dash and Günlük (Math Program 105:29–53, 2006) under some conditions.     

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

We present effective linear programming based computational techniques for solving nonconvex quadratic programs with box constraints (BoxQP). We first observe that known cutting planes obtained from the Boolean Quadric Polytope (BQP) are computationally effective at reducing the optimality gap of BoxQP. We next show that the Chvátal–Gomory closure of the BQP is given by the odd-cycle inequalities even when the underlying graph is not complete. By using these cutting planes in a spatial branch-and-cut framework, together with a common integrality-based preprocessing technique and a particular convex quadratic relaxation, we develop a solver that can effectively solve a well-known family of test instances. Our linear programming based solver is competitive with SDP-based state of the art solvers on small instances and sparse instances. Most of our computational techniques have been implemented in the recent version of CPLEX and have led to significant performance improvements on nonconvex quadratic programs with linear constraints.     

On a 2+1‐Dimensional Whitham–Broer–Kaup System: A Resonant NLS Connection

It is established that the Whitham–Broer–Kaup shallow water system and the “resonant” nonlinear Schrödinger equation are equivalent. A symmetric integrable 2+1‐dimensional version of the Whitham–Broer–Kaup system is constructed which, in turn, is equivalent to a recently introduced resonant Davey–Stewartson I system incorporating a Madelung–Bohm type quantum potential. A bilinear representation is adopted and resonant solitonic interaction in this new 2+1‐dimensional Kaup–Broer system is exhibited.     

Upper and lower bounds and the generalized variation-perturbation approach of many-electron theory

The theory of upper and lower bounds is used in conjunction with the “varied-portions approach” (VPA ) of the “many-electron theory of atoms and molecules” (MET ). Upper and lower bounds equations are derived. It is recognized that if a very natural portion of the full variational expression is made stationary, according to (VPA ), a for of Löwdin's lower bound wave equation results. By using the bracketing theorem it is also possible to give lower bounds to the quantities arising from the (VPA ) of (MET ). This will be useful to study in the future the (MET ) pair correlations and to supplement the computational methods currently available with lower bound estimates as well.