GALERKIN MESHLESS METHODS BASED ON PARTITION OF UNITY QUADRATURE

Numerical quadrature is an important ingredient of Galerkin meshless methods. A new numerical quadrature technique, partition of unity quadrature （PUQ）,for Galerkin meshless methods was presented. The technique is based on finite covering and partition of unity. There is no need to decompose the physical domain into small cell. It possesses remarkable integration accuracy. Using Element-free Galerkin methods as example, Galerkin meshless methods based on PUQ were studied in detail. Meshing is always not required in the procedure of constitution of approximate function or numerical quadrature, so Galerkin meshless methods based on PUQ are “truly” meshless methods.

Incompatible numerical manifold method for fracture problems

The incompatible numerical manifold method （INMM） is based on the finite cover approximation theory, which provides a unified framework for problems dealing with continuum and discontinuities. The incompatible numerical manifold method employs two cover systems as follows. The mathematical cover system provides the nodes for forming finite covers of the solution domain and the weighted functions, and the physical cover system describes geometry of the domain and the discontinuous surfaces therein. In INMM, the mathematical finite cover approximation theory is used to model cracks that lead to interior discontinuities in the process of displacement. Therefore, the discontinuity is treated mathematically instead of empirically by the existing methods. However, one cover of a node is divided into two irregular sub-covers when the INMM is used to model the discontinuity. As a result, the method sometimes causes numerical errors at the tip of a crack. To improve the precision of the INMM, the analytical solution is used at the tip of a crack, and thus the cover displacement functions are extended with higher precision and computational efficiency. Some numerical examples are given.

THEORETICAL STUDY OF THREE-DIMENSIONAL NUMERICAL MANIFOLD METHOD

The three-dimensional numerical manifold method（NMM） is studied on the basis of two-dimensional numerical manifold method. The three-dimensional cover displacement function is studied. The mechanical analysis and Hammer integral method of three-dimensional numerical manifold method are put forward. The stiffness matrix of three-dimensional manifold element is derived and the dissection rules are given. The theoretical system and the numerical realizing method of three-dimensional numerical manifold method are systematically studied. As an example, the cantilever with load on the end is calculated, and the results show that the precision and efficiency are agreeable.

Virtual homological eigenvalues and the Weil-Petersson translation length

For any pseudo-Anosov automorphism on an orientable closed surface,an inequality is established by bounding certain growth of virtual homological eigenvalues with the Weil-Petersson translation length.The new inequality fits nicely with other known inequalities due to Kojima and McShane(2018)and Lê(2014).The new quantity to be considered is the square sum of the logarithmic radii of the homological eigenvalues(with multiplicity)outside the complex unit circle,called the homological Jensen square sum.The main theorem is as follows.For any cofinal sequence of regular finite covers of a given surface,together with lifts of a given pseudo-Anosov,the homological Jensen square sum of the lifts grows at most linearly fast compared with the covering degree,and the square root of the growth rate is at most 1/√4πtimes the Weil-Petersson translation length of the given pseudo-Anosov.

Contact theory

Contacts between two general blocks are the fundamental problem for discontinuous analysis. There are different contact points in different block positions, and there may have infinite contact point pairs in the same block position. In this paper, a new concept of an entrance block for solving the contacts between two general blocks is introduced. The boundary of an entrance block is a contact cover system. Contact covers may consist of contact vectors, edges, angles or polygons. Each contact cover defines a contact point and all closed-contact points define the movements, rotations and deformations of all blocks as in real cases. Given a reference point, the concept of entrance block simplifies the contact computation in the following ways.(1) The shortest distance between two blocks can be computed by the shortest distance between the reference point and the surface of the entrance block.(2) As the reference point outside the entrance block moves onto the surface of entrance block, the first entrance takes place. This first entrance point on the entrance block surface defines the contact points and related contact locations.(3) If the reference point is already inside the entrance block, it will exit the entrance block along the shortest path. The corresponding shortest exit point on the entrance block surface defines the contact points and related contact locations. All blocks and angles here are defined by inequality equations. Algebraic operations on blocks and angles are described here. Since the blocks and angles are point sets with infinite points, the geometric computations are difficult, and therefore the geometric computations are performed by related algebraic operations.

THE RATES OF CONVERGENCE OF M-ESTIMATORS FOR PARTLY LINEAR MODELS IN DEPENDENT CASES

The author proves several embedding theorems for finite covering maps, principal G-bundlesinto bundles. The main results are1. Let π: E→X be a finite covering mapt and X a connected locally pathconnectedparacompact space. If cat X≤5 k, then the finite covering space π: E→X can be embeddedinto the trivial real k-plane bundle.2. Let x: E→ X be a principal G-bundle over a paracompact space. If there exists alinear action of G on F (F = R or C) and cat X≤ k, then π: E→X can be embedded intofor any F-vector bundles ζi, i = 1,’’’ k.