Compactness and convergence rates in the combinatorial integral approximation decomposition

The combinatorial integral approximation decomposition splits the optimization of a discrete-valued control into two steps: solving a continuous relaxation of the discrete control problem, and computing a discrete-valued approximation of the relaxed control. Different algorithms exist for the second step to construct piecewise constant discrete-valued approximants that are defined on given decompositions of the domain. It is known that the resulting discrete controls can be constructed such that they converge to a relaxed control in the \(\hbox {weak}^*\) topology of \(L^\infty \) if the grid constant of this decomposition is driven to zero. We exploit this insight to formulate a general approximation result for optimization problems, which feature discrete and distributed optimization variables, and which are governed by a compact control-to-state operator. We analyze the topology induced by the grid refinements and prove convergence rates of the control vectors for two problem classes. We use a reconstruction problem from signal processing to demonstrate both the applicability of the method outside the scope of differential equations, the predominant case in the literature, and the effectiveness of the approach.

     

Constructing Invariant Fairness Measures for Surfaces

The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined.     

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.     

Correlated polarization propagator calculations of static polarizabilities

We present a systematic comparison of the correlation contribution at the level of the second-order polarization propagator approximation (SOPPA ) and MP 2 to the static dipole polarizability of (1) Be, BeH^?, BH, CH⁺, MgH^?, AIH, SiH⁺, and GeH⁺; (2) BH₃, CH₄, NH₃, H₂O, HF, BF, and F₂; and (3) N₂, CO, CN^?, HCN, C₂H₂, and HCHO . Fairly extended basis sets were used in the calculations. We find that the agreement with experimental values is improved in SOPPA and MP .2 over the results at the SCF level. The signs and magnitudes of the correlation contribution in SOPPA are similar to those obtained in analytical derivative MP 2 calculations. However, it is not possible to say, in general, which method gives the largest correlation contribution or the best agreement with experiment, nor is it possible to make a priori prediction of the sign of the correlation contribution. For the first group of molecules, which have a quasi-degenerate ground state, additional CCDPPA and CCSDPPA calculations were performed and compared with polarizabilities obtained as analytical/numerical derivatives of the CCD and CCSD energies. The CCSDPPA results were found to be in better agreement with other calculations than were the SOPPA results, demonstrating the necessity of using methods based on infinite-order perturbation theory for these systems. © 1994 John Wiley & Sons, Inc.