MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys

Computational materials design has suffered from a lack of algorithms formulated in terms of experimentally accessible variables. Here we formulate the problem of (ternary) alloy optimization at the level of choice of atoms and their composition that is normal for synthesists. Mathematically, this is a mixed integer problem where a candidate solution consists of a choice of three elements, and how much of each of them to use. This space has the natural structure of a set of equilateral triangles. We solve this problem by introducing a novel version of the DIRECT algorithm that (1) operates on equilateral triangles instead of rectangles and (2) works across multiple triangles. We demonstrate on a test case that the algorithm is both robust and efficient. Finally, we offer an explanation of the efficacy of DIRECT—specifically, its balance of global and local search—by showing that “potentially optimal rectangles” of the original algorithm are akin to the Pareto front of the “multi-component optimization” of global and local search.     

On the relationship between finite volume and finite element methods applied to the Stokes equations

We investigate the relationship between finite volume and finite element approximations for the lower‐order elements, both conforming and nonconforming for the Stokes equations. These elements include conforming, linear velocity‐constant pressure on triangles, conforming bilinear velocity‐constant pressure on rectangles and their macro‐element versions, and nonconforming linear velocity‐constant pressure on triangles and nonconforming rotated bilinear velocity‐constant pressure on rectangles. By applying the relationship between the two methods, we obtain the convergence finite volume solutions for the Stokes equations. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 440–453, 2001.     

矩形域及三角域上Bezier曲面的转换

本文讨论了矩形域及三角域上Ｂｅｚｉｅｒ曲面的相互关系，从几何变换的角度给出了显式的转换公式及几何解释，同时也给出了相应的算法。     

Computable Finite Element Error Bounds for Poisson's Equation

New explicit finite element error bounds are presented for approximationby (1) piecewise linear elements over triangles and (2) piecewisebilinear elements over squares and rectangles. By this the errorbounds given in Bamhill, Brown & Mitchell (1981) are improved.     

Regular polygons in taxicab geometry

A polygon of n sides will be called regular in taxicab geometry if it has n equal angles and n sides of equal taxicab length. This paper will show that there are no regular taxicab triangles and no regular taxicab pentagons. The sets of taxicab rectangles and taxicab squares will be shown to be the same, respectively, as the sets of Euclidean rectangles and Euclidean squares. A method of construction for a regular taxicab 2n-gon for any n will be demonstrated.     

Spline spaces on TR-meshes with hanging vertices

Polynomial spline spaces defined on mixed meshes consisting of triangles and rectangles are studied for the C ⁰ case. These include triangulations with hanging vertices as well as T-meshes. In addition to dimension formulae, explicit basis functions are constructed, and their supports and stability are discussed. The approximation power of the spaces is also treated.     

Numerical Simulation of Heat Loads in a Cryogenic H2/O2 Rocket Combustion Chamber

A Finite Element solver for a coupled simulation of fluid and structure in an axisymmetric domain is presented. The method employs an explicit solution of the flow and structure variables. The computational domain of the fluid is discretised by unstructured triangles and rectangles while the sturcture domain is discretised by unstructured triangles only. For the purpose of code validation the solution of in total three test cases are shown. One test case deals with the structure only while the other two simulate heat transfer problems with a defined temperature distribution along a boundary wall and coupled conditions. Finally the code is used to simulate the heat load in a cryogenic H₂/O₂ rocket combustion chamber.     

A Comparison of Finite Element Error Bounds for Poisson's Equation

Computable finite element error bounds are developed for approximationby: (1) piecewise bilinear elements over rectangles and (2) piecewise linear elements over triangles. These theoretical bounds are then compared with numerical valuesobtained by solving a variety of test problems. For the energysemi-norm, the bounds are comparable to the actual errors, whichdemonstrates the usefulness of these results.     

二维等谱问题研究的计算数学框架

等谱问题是数学、物理诸学科关注的一个热点问题,本文总结并诠释了二维等谱问题的内在计算数学性质与规律:利用镜像反演讨论等谱对的几何结构(不等距而谱相等);把一般文献中假定的特殊三角形扩展到一般的三角形或者矩形;研究特征函数的正交结构,把特定的Laplace等谱问题扩展到一般零边值的二阶线性椭圆算子等谱问题.指出合理的粗网格对于研究等谱问题及其计算的重要性:两个连续问题等谱成立的充分必要条件是存在自然粗网格使其离散问题谱相等.文中给出的数值例子与特征值近似逼近验证了相应的结论,所用的方法原则上可用于研究三维乃至高维的PDE等谱问题.     

Exact constants in Poincaré type inequalities for functions with zero mean boundary traces

In this paper, we investigate Poincaré type inequalities for the functions having zero mean value on the whole boundary of a Lipschitz domain or on a measurable part of the boundary. We find exact and easily computable constants in these inequalities for some basic domains (rectangles, cubes, and right triangles) and discuss applications of the inequalities to quantitative analysis of partial differential equations. Copyright © 2014 John Wiley & Sons, Ltd.     

Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

An intersection graph of rectangles in the (x, y)-plane with sides parallel to the axes is obtained by representing each rectangle by a vertex and connecting two vertices by an edge if and only if the corresponding rectangles intersect. This paper describes algorithms for two problems on intersection graphs of rectangles in the plane. One is an O(n log n) algorithm for finding the connected components of an intersection graph of n rectangles. This algorithm is optimal to within a constant factor. The other is an O(n log n) algorithm for finding a maximum clique of such a graph. It seems interesting that the maximum clique problem is polynomially solvable, because other related problems, such as the maximum stable set problem and the minimum clique cover problem, are known to be NP-complete for intersection graphs of rectangles. Furthermore, we briefly show that the k-colorability problem on intersection graphs of rectangles is NP-complete.     

Bézier曲面在三角域和矩形域上的互化

Bezier曲面是CAD/CAM中应用最为广泛的曲面之一。它可分为两类:矩形域上张量积形式的Bezier曲面:三角域上的Bezier曲面:     

基于模拟退火算法的矩形优化排样问题的研究

考虑了一种矩形优化排样系统中遗传算法和模拟退火算法的结合算法.首先建立了该系统的通用数学模型.然后给出了求解该问题的遗传模拟退火算法.最后用VC++6.0模拟算例的结果表明该算法是一种行之有效的方法.     

An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles

This paper proposes an improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Some improvements on the fitness function of genetic algorithm for the orthogonal packing of rectangles are also suggested. Solutions of two numerical examples show the effectiveness of these improvements.     

Analysis of mixed finite element methods on locally refined grids

Summary We consider the mixed finite element method for locally refined triangulations. A local projection operator is defined to satisfy the commutation property that is required in the general theory of mixed methods. Our results can be applied to every known space of arbitrary order over rectangles or triangles. Optimal-order error estimates and superconvergence for the flux along the Gauss lines are established.     

Crouzeix-Raviart type finite elements on anisotropic meshes

Summary. The paper deals with a non-conforming finite element method on a class of anisotropic meshes. The Crouzeix-Raviart element is used on triangles and tetrahedra. For rectangles and prismatic (pentahedral) elements a novel set of trial functions is proposed. Anisotropic local interpolation error estimates are derived for all these types of element and for functions from classical and weighted Sobolev spaces. The consistency error is estimated for a general differential equation under weak regularity assumptions. As a particular application, an example is investigated where anisotropic finite element meshes are appropriate, namely the Poisson problem in domains with edges. A numerical test is described. Received May 19, 1999 / Revised version received February 2, 2000 / Published online February 5, 2001     

Tilings of Convex Polygons with Congruent Triangles

By the spectrum of a polygon A we mean the set of triples (??,??,??) such that A can be dissected into congruent triangles of angles ??,??,??. We propose a technique for finding the spectrum of every convex polygon. Our method is based on the following classification. A tiling is called regular if there are two angles of the triangles, ?? and ?? such that at every vertex of the tiling the number of triangles having angle ?? equals the number of triangles having angle ??. Otherwise the tiling is irregular. We list all pairs (A,T) such that A is a convex polygon and T is a triangle that tiles A regularly. The list of triangles tiling A irregularly is always finite, and can be obtained, at least in principle, by considering the system of equations satisfied by the angles, examining the conjugate tilings, and comparing the sides and the area of the triangles to those of A. Using this method we characterize the convex polygons with infinite spectrum, and determine the spectrum of the regular triangle, the square, all rectangles, and the regular N-gons with N large enough.     

Mathematical notions in preliterate societies

Many preliterate societies show considerable mathematical development. It is not unusual to encounter numeral systems going up to the hundreds of thousands or higher and to encounter some arithmetic ability. Many geometric notions are present, including simple forms like circles, lines, rectangles and parallelograms, and triangles, Other shapes and curves occur with less frequency. Some simpler geometric constructions are carried out, and perhaps some properties of similar right triangles are known. Logical reasoning shows up in kinship relationships and in some games of strategy. People seem to develop basic mathematical notions largely in response to what they consider important aspects of life. Large numbers come up when people need to count higher, whether counting shells used as money or yams harvested and stored or animals. More precise geometric constructions also enter in only where the society values precision. Part of determining exactly what a society has accomplished mathematically involves finding those aspects of life where the development of mathematical notions was important to the people.     

On Two Dimensional Packing

The paper considerspacking of rectanglesinto an infinite bin. Similar to theTetris game, the rectangles arrive from the top and, once placed, cannot be moved again. The rectangles are moved inside the bin to reach their place. For the case in which rotations are allowed, we design an algorithm whose performance ratio is constant. In contrast, if rotations are not allowed, we show that no algorithm of constant ratio exists. For this case we design an algorithm with performance ratio ofO(log(1/)), where is the minimum width of any rectangle. We also show that no algorithm can achieve a better ratio than for this case.     

A boundary element Galerkin method for a hypersingular integral equation on open surfaces

A hypersingular boundary integral equation of the first kind on an open surface piece Γ is solved approximately using the Galerkin method. As boundary elements on rectangles we use continuous, piecewise bilinear functions which vanish on the boundary of Γ. We show how to compensate for the effect of the edge and corner singularities of the true solution of the integral equation by using an appropriately graded mesh and obtain the same convergence rate as for the case of a smooth solution. We also derive asymptotic error estimates in lower-order Sobolev norms via the Aubin–Nitsche trick. Numerical experiments for the Galerkin method with piecewise linear functions on triangles demonstrate the effect of graded meshes and show experimental rates of convergence which underline the theoretical results.