Recent Progress in the $L_p$ Theory for Elliptic and Parabolic Equations with Discontinuous Coefficients

In this paper, we review some results over the last 10-15 years on elliptic and parabolic equations with discontinuous coefficients. We begin with an approach given by N. V. Krylov to parabolic equations in the whole space with $\rm{VMO}_x$ coefficients. We then discuss some subsequent development including elliptic and parabolic equations with coefficients which are allowed to be merely measurable in one or two space directions, weighted $L_p$estimates with Muckenhoupt ($A_p$) weights, non-local elliptic and parabolic equations, as well as fully nonlinear elliptic and parabolic equations.     

The mesa problem for Neumann boundary value problem

In this paper, we study the singular limit of the Porous Medium equation u_t=Δu^m+g(x,u), as m→∞, in a bounded domain with Neumann boundary condition.     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Zeros of Orthogonal Polynomials: The Elliptic Case

Constructive Approximation - Let E = [–1, α] \cup [β, 1], –1 &;lt; α &;lt; β &;lt; 1, and let (pn) be orthogonal on E with respect to the weight function...     

一类二阶椭圆型微分方程振动性的判定

利用积分平均和完全平方技巧，给出了一类二阶椭圆型微分方程所有解在R^n的一个外区域Ω上均振动的新的充分条件。     

Identification of nonlinear elliptic equations

An optimization theoretic approach and algorithm for the estimation of state-dependent coefficients in nonlinear elliptic equation is presented. It is based on a splitting method combined with convex analysis techniques. Convergence of the algorithm is established and numerical examples are included.The research of K. Kunisch was supported in part by a grant from the Bundesministerium für Wissenschaft und Forschung, Austria.     

A graphical approach to computing Selmer groups of congruent number curves

Let E _n:y ²=x ³−n ² x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups associated with E _n to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E _n. 2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

关于解椭圆型问题的多子域D-N交替算法

构造一个求解椭圆型边值问题的多子域D—N交替算法，导出对应的容度方程和等价的迭代法，证明算法的收敛性。