A Levenberg–Marquardt method for estimating polygonal regions

The problem is considered of the estimation of a polygonal region in two dimensions from data approximately marking the outline of the region. A solution is sought by formulating and solving a nonlinear least squares problem. A Levenberg–Marquardt method is developed for this problem, with an implementation which exploits the special structure so that the Levenberg–Marquardt step can be computed efficiently.     

A fast interface solver for the biharmonic Dirichlet problem on polygonal domains

Summary. In this paper we propose and analyze an efficient discretization scheme for the boundary reduction of the biharmonic Dirichlet problem on convex polygonal domains. We show that the biharmonic Dirichlet problem can be reduced to the solution of a harmonic Dirichlet problem and of an equation with a Poincaré-Steklov operator acting between subspaces of the trace spaces. We then propose a mixed FE discretization (by linear elements) of this equation which admits efficient preconditioning and matrix compression resulting in the complexity . Here is the number of degrees of freedom on the underlying boundary, is an error reduction factor, or for rectangular or polygonal boundaries, respectively. As a consequence an asymptotically optimal iterative interface solver for boundary reductions of the biharmonic Dirichlet problem on convex polygonal domains is derived. A numerical example confirms the theory. Received September 1, 1995 / Revised version received February 12, 1996     

The virtual element method in 50 lines of MATLAB

We present a 50-line MATLAB implementation of the lowest order virtual element method for the two-dimensional Poisson problem on general polygonal meshes. The matrix formulation of the method is discussed, along with the structure of the overall algorithm for computing with a virtual element method. The purpose of this software is primarily educational, to demonstrate how the key components of the method can be translated into code.     

No Dimension-Independent Core-Sets for Containment Under Homothetics

This paper deals with the containment problem under homothetics which has the minimal enclosing ball (MEB) problem as a prominent representative. We connect the problem to results in classic convex geometry and introduce a new series of radii, which we call core-radii. For the MEB problem, these radii have already been considered from a different point of view and sharp inequalities between them are known. In this paper sharp inequalities between core-radii for general containment under homothetics are obtained. Moreover, the presented inequalities are used to derive sharp upper bounds on the size of core-sets for containment under homothetics. In the MEB case, this yields a tight (dimension-independent) bound for the size of such core-sets. In the general case, we show that there are core-sets of size linear in the dimension and that this bound stays sharp even if the container is required to be symmetric.     

n-sided polygonal hybrid finite elements with unified fundamental solution kernels for topology optimization

In topology optimization, the optimized design can be obtained based on spatial discretization of design domain using natural polygonal finite elements to reduce the influence of mesh geometry on topology optimization solutions. However, the natural polygonal finite elements require separate interpolants for each type of elements and involve troublesome domain integrals. In this study, an alternative n-sided polygonal hybrid finite element possessing multiple-node connection is formulated in a unified form to compress the checkerboard patterns caused by numerical instability in topology optimization. Different from the natural polygonal finite elements, the present polygonal hybrid finite elements involve two sets of independent displacement fields. The intra-element displacement field defined inside the element is approximated by the linear combination of the fundamental solution of the problem to achieve the purpose of the local satisfaction of the governing equations of the problem, but not the specific boundary conditions and the inter-element continuity conditions. To overcome such drawback, the inter-element displacement field defined over the entire element boundary is independently approximated by means of the conventional shape function interpolation. As a result, only line integrals along the element boundary are involved in the computation, whose dimension is reduced by one compared to the domain integrals in the natural polygonal finite elements, and more importantly, allowing us to flexibly construct any polygons from Voronoi tessellations in discretizing complex design domains using same fundamental solution kernels. Numerical results obtained indicate that the present n-sided polygonal hybrid finite elements can produce more accurate displacement solutions and smaller mean compliance, compared to the standard finite elements and the natural polygonal finite elements.     

Polygon containment under translation

The polygon containment problem is the problem of deciding whether a polygon P can be translated to fit inside another polygon P'. We present algorithms for two cases of the polygon containment problem: when both P and P' are rectilinearly convex, and when P is convex and P' is arbitrary. In both cases the algorithms run in time O(n²logn), where n is the sum of the number of bounding edges of the two polygons. Applications to an inspection problem and a stock-cutting problem are discussed, as is the containment problem when both P and P' are nonconvex.     

A finite element method for interface problems in domains with smooth boundaries and interfaces

This paper is concerned with the analysis of a finite element method for nonhomogeneous second order elliptic interface problems on smooth domains. The method consists in approximating the domains by polygonal domains, transferring the boundary data in a natural way, and then applying a finite element method to the perturbed problem on the approximate polygonal domains. It is shown that the error in the finite element approximation is of optimal order for linear elements on a quasiuniform triangulation. As such the method is robust in the regularity of the data in the original problem.     

Distributed containment control of second‐order multiagent systems with input delays under general protocols

This article addresses the distributed containment control problem in a group of agents governed by second‐order dynamics with directed network topologies. Considering there are multiple leaders, we study a general second‐order containment controller which can realize several different consensus modes by adjusting control gains. A necessary and sufficient condition on the control gains of the general containment controller is provided. Moreover, the delay sensitivity of the closed‐loop multiagent system under the general containment controller is studied; the maximal upper bound of the constant delays is obtained. Finally, several numerical examples are used to illustrate the theoretical results. © 2015 Wiley Periodicals, Inc. Complexity 21: 112–120, 2016     

On a module containment theorem of piecewise continuous almost periodic functions and its application

This paper is concentrated on giving a module containment theorem for piecewise continuous almost periodic functions (pcap function for short). One first analyses the relationship between the translation number set and some Fourier exponents of a pcap function. And then, combining with Kronecker’s theorem, a module containment theorem for a pcap function is established for the first time. As an application, the module structure of a pcap solution for an impulsive differential equation is characterized. Some remarks and a corollary are given to show the advantage of the module containment theorem.     

On a variational approximation method for a class of elliptic eigenvalue problems in composite structures

We consider a second-order elliptic eigenvalue problem on a convex polygonal domain, divided in nonoverlapping subdomains. The conormal derivative of the unknown function is continuous on the interfaces, while the function itself is discontinuous. We present a general finite element method to obtain a numerical solution of the eigenvalue problem, starting from a nonstandard formally equivalent variational formulation in an abstract setting in product Hilbert spaces. We use standard Lagrange finite element spaces on the subdomains. Moreover, the bilinear forms are approximated by suitable numerical quadrature formulas. We obtain error estimates for both the eigenfunctions and the eigenvalues, allowing for the case of multiple exact eigenvalues, by a pure variational method.

     

Algorithm for generating a conformal quasi-hierarchical triangular mesh that weakly δ-approximates given polygonal lines

An algorithm is proposed for generating a conformal quasi-hierarchical triangular mesh that approximates a set of given polygonal lines to accuracy δ. The solvability of the problem is guaranteed by the possibility of shifting the polygonal lines within their δ-neighborhood. The resulting mesh consists of a small number of triangles and admits a multigrid implementation. An estimate is given for the growing number of mesh triangles with decreasing δ (of order log ₂ ² δ^?1). The algorithm is applied to a particular set of polygonal lines.     

Subspace Interpolation with Applications to Elliptic Regularity

In this paper, we prove new embedding results by means of subspace interpolation theory and apply them to establishing regularity estimates for the biharmonic Dirichlet problem and for the Stokes and the Navier–Stokes systems on polygonal domains. The main result of the paper gives a stability estimate for the biharmonic problem at the threshold index of smoothness. The classic regularity estimates for the biharmonic problem are deduced as a simple corollary of the main result. The subspace interpolation tools and techniques presented in this paper can be applied to establishing sharp regularity estimates for other elliptic boundary value problems on polygonal domains.     

Effects of multiple blade interaction on the containment of blade fragments during a rotor failure

A finite element analysis is used to study the impact and the containment aspects of rotor blade fragments that are produced during a aircraft jet engine rotor failure. The impact and containment studies are performed on a ring-type containment structure and various fragment types are considered in this study. For each type of fragment, the ring thickness is varied incrementally and the ring response, residual kinetic energy level of the fragments, magnitude of impact forces and the overall containment or failure are determined. First, only a single fragment is considered and the rotor is assumed to contain no other blades. Next, the remaining blades are introduced and the effects of multiple collisions with the other blades on the containment are analyzed. The explicit, nonlinear finite element code Dyna3d is used for the numerical computations in this study and the results are compared with the experimental results performed on a T58 rotor at the spin facility of the Naval Air Propulsion Test Center.     

Monotone operator theory in convex optimization

In this paper, we establish tractable sum of squares characterizations of the containment of a convex set, defined by a SOS-concave matrix inequality, in a non-convex set, defined by difference of a SOS-convex polynomial and a support function, with Slater’s condition. Using our set containment characterization, we derive a zero duality gap result for a DC optimization problem with a SOS-convex polynomial and a support function, its sum of squares polynomial relaxation dual problem, the semidefinite representation of this dual problem, and the dual problem of the semidefinite programs. Also, we present the relations of their solutions. Finally, through a simple numerical example, we illustrate our results. Particularly, in this example we find the optimal solution of the original problem by calculating the optimal solution of its associated semidefinite problem.     

On the finite element approximation of a cascade flow problem

Summary The finite element analysis of a cascade flow problem with a given velocity circulation round profiles is presented. The nonlinear problem for the stream function with nonstandard boundary conditions is discretized by conforming linear triangular elements. We deal with the properties of the discrete problem and study the convergence of the method both for polygonal and nonpolygonal domains, including the effect of numerical integration.     

HIERARCHICAL BASIS METHOD FOR COVOLUME METHOD FOR NONSYMMETRIC AND INDEFINITE ELLIPTIC PROBLEM

In this paper, hierarchical basis method for second order nonsymmetric and indefinite elliptic problem on a polygonal domain (possibly nonconvex) discreted by a vertex-centered covolume method is constructed.     

ACCURACY ENHANCEMENT FOR THE SIGNORINI PROBLEM WITH FINITE ELEMENT METHOD

In this paper,we study the accuracy enhancement for the frictionless Signorini problem on a polygonal domain with linear finite elements.Numerical test is given to verify our result.     

Location of an undesirable facility in a polygonal region with forbidden zones

In this paper, we develop the problem of locating an undesirable facility in a bounded polygonal region (with forbidden polygonal zones), using Euclidean distances, under an objective function that generalizes the maximin and maxisum criteria, and includes other criteria such as the linear combinations of these criterions. We identify a finite dominating set (finite set of points to which an optimal solution must belong) for this problem and show that an optimum solution can be found in polynomial time in the number of vertices of the polygons in the model and the number of existing facilities.     

Asymptotic Expansion for the Derivative of Finite Elements

It is proved in this paper that there exists an expansion for the derivative of the linear finite element approximation to a model Dirichlet problem in a polygonal domain with a piecewise uniform triangulation.     

具有包容关系的结构异质DEA效率评价方法

指标结构同质是数据包络分析（DEA）方法的基本假设之一;然而,现实问题的复杂性使得该假设常常难以完全被满足.针对具有包容关系的产出结构异质问题,通过解析决策单元（DMU）之间生产结构的内在关系来构建一种分阶段的DEA效率评价方法.该方法充分考虑了不同结构DMU的主观偏好,较好地规避了传统DEA方法在结构异质DMU效率评价过程中的不公平性.随后,该方法分别被拓展至投入结构异质和多重结构异质的情境中.最后,通过两个算例来说明本文方法的有效性与实用性.