1-Soliton solution of the generalized KP equation with generalized evolution

This paper obtains the 1-soliton solution of three variants of the generalized KP equation with generalized evolution. The solitary wave ansatz is used to carry out the integration of such equations. The parameter domain is also identified in the process. The numerical simulations are also obtained in this paper.     

Hermitean Matrix Ensembles and Orthogonal Polynomials

In this article, we investigate orthogonal polynomials associated with complex Hermitean matrix ensembles using the combination of the methods of Coulomb fluid (or potential theory), chain sequences, and Birkhoff–Trjitzinsky theory. We give a general formula for the largest eigenvalue of the N×N Jacobi matrices (which is equivalent to estimating the largest zero of a sequence of orthogonal polynomials) and the two-level correlation function for the α ensembles (α>0) introduced previously for α>1. In the case of 0<α<1, we give a natural representation for the weight function that is a special case of the general Nevanlinna parametrization. We also discuss Hermitean matrix ensembles associated with general indeterminate moment problems.     

Ramanujan continued fractions via orthogonal polynomials

Some Ramanujan continued fractions are evaluated using asymptotics of polynomials orthogonal with respect to measures with absolutely continuous components.     

Validated Infeasible Interior-Point Predictor–Corrector Methods for Linear Programming

Many problems arising in practical applications lead to linear programming problems. Hence, they are fundamentally tractable. Recent interior-point methods can exploit problem structure to solve such problems very efficiently. Infeasible interior-point predictor–corrector methods using floating-point arithmetic sometimes compute an approximate solution with duality gap less than a given tolerance even when the problem may not have a solution. We present an efficient verification method for solving linear programming problems which computes a guaranteed enclosure of the optimal solution and which verifies the existence of the solution within the computed interval.     

Plancherel–Rotach Asymptotic Expansion for Some Polynomials from Indeterminate Moment Problems

We study the Plancherel–Rotach asymptotics of four families of orthogonal polynomials: the Chen–Ismail polynomials, the Berg–Letessier–Valent polynomials, and the Conrad–Flajolet polynomials I and II. All these polynomials arise in indeterminate moment problems, and three of them are birth and death process polynomials with cubic or quartic rates. We employ a difference equation asymptotic technique due to Z. Wang and R. Wong. Our analysis leads to a conjecture about large degree behavior of polynomials orthogonal with respect to solutions of indeterminate moment problems.     

Some Indeterminate Moment Problems and Freud-Like Weights

We study two indeterminate Hamburger moment problems and the corresponding orthogonal polynomials. The coefficients in their recurrence relations are of exponential growth or are polynomials of degree 2. The entire functions in the Nevanlinna parametrization are found. The orthogonal polynomials with polynomial recurrence coefficients resemble the Freud polynomials with a = 1/2 . Inequalities are given for the largest zero and the asymptotic behavior of the largest zero is established. April 24, 1996. Date revised: March 3, 1997.     

Elastic-plastic states of two-layer curved bar under pure bending

Analytical solution of an elastic-partially plastic two-layer curved bar subjected to couples at both ends is obtained. The solution is based on Tresca's yield criterion and its associated flow rule. Numerical results for real engineering materials in partially plastic stress state are presented in graphical form. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery

This paper addresses a location-routing problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. We propose an effective branch-and-cut algorithm for solving the LRPSPD. The proposed algorithm implements several valid inequalities adapted from the literature for the problem and a local search based on simulated annealing algorithm to obtain upper bounds. Computational results, for a large number of instances derived from the literature, show that some instances with up to 88 customers and 8 potential depots can be solved in a reasonable computation time.