Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects

In this article algorithms are developed for nonlinear -term Courant element approximation of functions in ( ) on bounded polygonal domains in . Redundant collections of Courant elements, which are generated by multilevel nested triangulations allowing arbitrarily sharp angles, are investigated. Scalable algorithms are derived for nonlinear approximation which both capture the rate of the best approximation and provide the basis for numerical implementation. Simple thresholding criteria enable approximation of a target function to optimally high asymptotic rates which are determined and automatically achieved by the inherent smoothness of . The algorithms provide direct approximation estimates and permit utilization of the general Jackson-Bernstein machinery to characterize -term Courant element approximation in terms of a scale of smoothness spaces (-spaces) which govern the approximation rates.

     

Counting Split Interval Orders

A poset (X,) is a split interval order (a.k.a. unit bitolerance order, proper bitolerance order) if a real interval and a distinguished point in that interval can be assigned to each xX so that xy precisely when x's distinguished point precedes y's interval, and x's interval precedes y's distinguished point. For each |X|9, we count the split interval orders and identify all posets that are minimal forbidden posets for split interval orders. The paper is a companion to Counting Split Semiorders by Fishburn and Reeds (this issue).     

On Jump-Critical Posets with Jump-Number Equal to Width

We investigate the structure of m-jump-critical posets P with w(P) = m. We prove that the size of such posets satisfies |P| 3m ². For the special when the maximum antichain occurs as the maximal (or minimal) elements, we have the sharp upper bound |P| 3m - k; where k = min {|{Max}(P)|, |{Min}(P)|}. We give examples of posets which illustrate the explored structure of these m-jump-critical posets P with width m.     

内孔缝位置对嵌套腔体微波耦合特性的影响

 利用时域有限差分（FDTD）方法计算了不同内孔缝位置情况下微波脉冲与带缝嵌套圆柱形腔体系统的耦合过程；分别分析了内孔缝位置对外部带缝腔体和内部带缝腔体耦合特性的影响。结果表明:除了内孔缝附近区域以外，内孔缝位置对外腔耦合特性的影响很小，可以忽略不计；但内孔缝位置对内腔耦合特性的影响较大，而且内腔的屏蔽性能由外腔内的耦合场分布以及内孔缝的位置共同决定。     

The vertex isoperimetric problem for the powers of the diamond graph

We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the well-studied graphs like hypercubes, grids, and tori. In contrast to the mentioned graphs, our graph is not bipartite. We present an exact solution to the vertex isoperimetric problem on our graph by introducing a new class of orders that unifies all known isoperimetric orders defined on the cartesian powers of graphs.     

More on pooling spaces

A pooling space is a ranked poset P such that the subposet w⁺ induced by the elements above w is atomic for each element w of P. Pooling spaces were introduced in [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Math. 282 (2004) 163-169] for the purpose of giving a uniform way to construct pooling designs, which have applications to the screening of DNA sequences. Many examples of pooling spaces were given in that paper. In this paper, we clarify a few things about the definition of pooling spaces. Then we find that a geometric lattice, a well-studied structure in literature, is also a pooling space. This provides us many classes of pooling designs, some old and some new. We study the pooling designs constructed from affine geometries. We find that some of them meet the optimal bounds related to a conjecture of Erdös, Frankl and Füredi.     

q-Weighted log-concavity and q-product theorem on the normality of posets

We show that q-weighted log-concavity and the strict normalized matching property are preserved under the q-direct product over weighted posets. As consequences, two classes of weighted posets including the finite linear lattices are strictly q-weighted log-concave and strictly normal.     

First-order system least squares and the energetic variational approach for two-phase flow

This paper develops a first-order system least-squares (FOSLS) formulation for equations of two-phase flow. The main goal is to show that this discretization, along with numerical techniques such as nested iteration, algebraic multigrid, and adaptive local refinement, can be used to solve these types of complex fluid flow problems. In addition, from an energetic variational approach, it can be shown that an important quantity to preserve in a given simulation is the energy law. We discuss the energy law and inherent structure for two-phase flow using the Allen–Cahn interface model and indicate how it is related to other complex fluid models, such as magnetohydrodynamics. Finally, we show that, using the FOSLS framework, one can still satisfy the appropriate energy law globally while using well-known numerical techniques.