Approximation property of partition of unity and its applications

The linear combination of certain partition of unity, subordinate to certain open covering of a compact set, is proved to be capable of approximating to a continuous function at arbitrarily precision. By using proper open covering and partition of unity, the robust nonlinear controllers and adaptive laws are designed for a class of nonlinear systems with uncertainties. The states and parameters of the closed-loop systems can be stabilized in the meaning of UUB ( uniformly ultimately bounded) via the robust nonlinear controllers and adaptive laws. Finally, an example shows the validity of method in this paper.

Control synthesis for a class of nonlinear systems based on partition of unity

A partition-of-unity-based approach is proposed to derive an approximate model for a class of nonlinear systems. The precision of the approximate model is analyzed by using the modulus of continuity of continuous functions. The system stability of the approximate model is analyzed by using Lyapunov stability theory. A design algorithm for constructing tracking controllers with tracking performance related to tracking error is given based on the approximate model and the partition of unity method.

PARTITION OF UNITY FINITE ELEMENT METHOD FOR SHORT WAVE PROPAGATION IN SOLIDS

A partition of unity finite element method for numerical simulation of short wave propagation in solids is presented. The finite element spaces were constructed by multiplying the standard isoparametric finite element shape functions, which form a partition of unity, with the local subspaces defined on the corresponding shape functions, which include a priori knowledge about the wave motion equation in trial spaces and approximately reproduce the highly oscillatory properties within a single element. Numerical examples demonstrate the performance of the proposed partition of unity finite element in both computational accuracy and efficiency.

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.

Partition of Unity Finite Element Analysis of Nonlinear Transient Diffusion Problems Using p-Version Refinement

We propose a high-order enriched partition of unity finite element method for linear and nonlinear time-dependent diffusion problems.The solution of this class of problems often exhibits non-smooth features such as steep gradients and boundary layers which can be very challenging to recover using the conventional low-order finite element methods.A class of steady-state exponential functions has been widely used for enrichment and its performance to numerically solve these challenges has been demonstrated.However,these enrichment functions have been used only in context of the standard h-version refinement or the so-called q-version refinement.In this paper we demonstrate that the p-version refinement can also be a very attractive option in terms of the efficiency and the accuracy in the enriched partition of unity finite element method.First,the transient diffusion problem is integrated in time using a semi-implicit scheme and the semi-discrete problem is then integrated in space using the p-version enriched finite elements.Numerical results are presented for three test examples of timedependent diffusion problems in both homogeneous and heterogeneous media.The computed results show the significant improvement when using the p-version refined enriched approximations in the finite element analysis.In addition,these results support our expectations for a robust and high-order accurate enriched partition of unity finite element method.

Two-grid partition of unity method for second order elliptic problems

A two-grid partition of unity method for second order elliptic problems is proposed and analyzed. The standard two-grid method is a local and parallel method usually leading to a discontinuous solution in the entire computational domain. Partition of unity method is employed to glue all the local solutions together to get the global continuous one, which is optimal in HI-norm. Furthermore, it is shown that the L^2 error can be improved by using the coarse grid correction. Numerical experiments are reported to support the theoretical results.

Image Interpolation via Gaussian-Sinc Interpolators with Partition of Unity

In this paper,we propose a novel image interpolation method by using Gaussian-Sinc automatic interpolators with partition of unity property.A comprehensive comparison is made with classical image interpolation methods,such as the bicubic interpolation,Lanczos interpolation,cubic Schaum interpolation,cubic B-spline interpolation and cubic Moms interpolation.The experimental results show the effectiveness of the improved image interpolation method via some image quality metrics such as PSNR and SSIM.

A partition of unity level set method with moving knot CS-RBFs for optimizing variable stiffness composites

A partition of unity level set method with moving knot Compactly Supported Radial Basis Functions(CS-RBFs)is proposed for optimizing variable stiffness composite structures.The iso-contours of a level set function are utilized to represent the curved fiber paths,and the tan-gent vector of the iso-contour defines the orientation of fiber.The level set function of the full design domain is constructed according to the Partition of Unity(POU)method by a set of local level set functions defined on an array of overlapping subdomains,and they are constructed by using the CS-RBFs.The positions of knots are iteratively changed during the optimization to improve the performance of composite structures.Several examples of compliance minimization are presented.

On the Linear Independence and Partition of Unity of Arbitrary Degree Analysis-Suitable T-splines

Analysis-suitable T-splines are a topological-restricted subset of T-splines,which are optimized to meet the needs both for design and analysis(Li and Scott ModelsMethods Appl Sci 24:1141-1164,2014;Li et al.Comput Aided Geom Design 29:63-76,2012;Scott et al.Comput Methods Appl Mech Eng 213-216,2012).The paper independently derives a class of bi-degree(d_(1),d_(2))T-splines for which no perpendicular T-junction extensions intersect,and provides a new proof for the linearly independence of the blending functions.We also prove that the sum of the basis functions is one for an analysis-suitable T-spline if the T-mesh is admissible based on a recursive relation.

OPTIMAL ERROR ESTIMATES OF THE PARTITION OF UNITY METHOD WITH LOCAL POLYNOMIAL APPROXIMATION SPACES

In this paper, we provide a theoretical method（PUFEM）, which belongs to the analysis of the partition of unity finite element family of meshfree methods. The usual error analysis only shows the order of error estimate to the same as the local approximations[12]. Using standard linear finite element base functions as partition of unity and polynomials as local approximation space, in l-d case, we derive optimal order error estimates for PUFEM interpolants. Our analysis show that the error estimate is of one order higher than the local approximations. The interpolation error estimates yield optimal error estimates for PUFEM solutions of elliptic boundary value problems.

Multi-Level Partition of Unity Algebraic Point Set Surfaces

We present a multi-level partition of unity algebraic set surfaces （MPU-APSS） for surface reconstruction which can be represented by either a projection or in an implicit form. An algebraic point set surface （APSS） defines a smooth surface from a set of unorganized points using local moving least-squares （MLS） fitting of algebraic spheres. However, due to the local nature, APSS does not work well for geometry editing and modeling. Instead, our method builds an implicit approximation function for the scattered point set based on the partition of unity approach. By using an octree subdivision strategy, we first adaptively construct local algebraic spheres for the point set, and then apply weighting functions to blend together these local shape functions. Finally, we compute an error-controlled approximation of the signed distance function from the surface. In addition, we present an efficient projection operator which makes our representation suitable for point set filtering and dynamic point resampling. We demonstrate the effectiveness of our unified approach for both surface reconstruction and geometry modeling such as surface completion.

Surface Reconstruction of Scanned Human Body Using Radial Basis Functions and Adaptive Partition of Unity

It is important to reconstruct a continuous surface representation of the point cloud scanned from a human body. In this paper a new implicit surface method is proposed to reconstruct the human body surface from the points based on the combination of radial basis functions （RBFs） and adaptive partition of unity （PoU）. The whole 3D domain of the scanned human body is firstly subdivided into a set of overlapping subdomalns based on the improved octrees. The smooth local surfaces are then computed in the subdomalns based on RBFs. And finally the global human body surface is reconstructed by blending the local surfaces with the adaptive PoU functions. This method is robust for the surface reconstruction of the scanned human body even with large or non-uniform point cloud which has a sharp density variation.

Partition of unity interpolation on multivariate convex domains

In this paper,we present an algorithm for multivariate interpolation of scattered data sets lying in convex domainsΩ⊆R^(N),for any N≥2.To organize the points in a multidimensional space,we build a kd-tree space-partitioning data structure,which is used to efficiently apply a partition of unity interpolant.This global scheme is combined with local radial basis function(RBF)approximants and compactly supported weight functions.A detailed description of the algorithm for convex domains and a complexity analysis of the computational procedures are also considered.Several numerical experiments show the performances of the interpolation algorithm on various sets of Halton data points contained inΩ,whereΩcan be any convex domain,like a 2D polygon or a 3D polyhedron.Finally,an application to topographical data contained in a pentagonal domain is presented.

The Weighted Basis for PHT-Splines

PHT-splines are defined as polynomial splines over hierarchical T-meshes with very efficient local refinement properties.The original PHT-spline basis functions constructed by the truncation mechanism have a decay phenomenon,resulting in numerical instability.The non-decay basis functions are constructed as the B-splines that are defined on the 2×2 tensor product meshes associated with basis vertices in Kang et al.,but at the cost of losing the partition of unity.In the field of finite element analysis and topology optimization,forming the partition of unity is the default ingredient for constructing basis functions of approximate spaces.In this paper,we will show that the non-decay PHT-spline basis functions proposed by Kang et al.can be appropriately modified to form a partition of unity.Each non-decay basis function is multiplied by a positive weight to form the weighted basis.The weights are solved such that the sum of weighted bases is equal to 1 on the domain.We provide two methods for calculatingweights,based on geometric information of basis functions and the subdivision of PHT-splines.Weights are given in the form of explicit formulas and can be efficiently calculated.We also prove that the weights on the admissible hierarchical T-meshes are positive.

Overlapping Domain Decomposition Finite Difference Algorithm for Compact Difference Scheme of the Heat Conduction Equation

In this paper, a modified additive Schwarz finite difference algorithm is applied in the heat conduction equation of the compact difference scheme. The algorithm is on the basis of domain decomposition and the subspace correction. The basic train of thought is the introduction of the units function decomposition and reasonable distribution of the overlap of correction. The residual correction is conducted on each subspace while the computation is completely parallel. The theoretical analysis shows that this method is completely characterized by parallel.

CONVERGENCE ANALYSIS OF SOME FINITE ELEMENT PARALLEL ALGORITHMS FOR THE STATIONARY INCOMPRESSIBLE MHD EQUATIONS

By combination of iteration methods with the partition of unity method(PUM),some finite element parallel algorithms for the stationary incompressible magnetohydrodynamics(MHD)with different physical parameters are presented and analyzed.These algorithms are highly efficient.At first,a global solution is obtained on a coarse grid for all approaches by one of the iteration methods.By parallelized residual schemes,local corrected solutions are calculated on finer meshes with overlapping sub-domains.The subdomains can be achieved flexibly by a class of PUM.The proposed algorithm is proved to be uniformly stable and convergent.Finally,one numerical example is presented to confirm the theoretical findings.

A partition-of-unity based three-node triangular element with continuous nodal stress using radial-polynomial basis functions

A partition-of-unity （PU） based ＂FE-Meshfree＂ three-node triangular element （Trig3-RPIM） was recently developed for linear elastic problems. This Trig3-RPIM element employs hybrid shape functions that combine the shape functions of three-node triangular element （Trig3） and radial-polynomial basis functions for the purpose of synergizing the merits of both finite element method and meshfree method. Although Trig3-RPIM element is capable of obtaining higher accuracy and convergence rate than the Trig3 element and four-node iso-parametric quadrilateral element without adding extra nodes or degrees of freedom （DOFs）, the nodal stress field through Trig3-RP1M element is not continuous and extra stress smooth operations are still needed in the post processing stage. To further improve the property of Trig3-RPIM element, a new PU-based triangular element with continuous nodal stress, called Trig3-RPIMcns, is developed. Numerical examples including several linear, free vibration and forced vibration test problems, have confirmed the correctness and feasibility of the proposed Trig3-RPIMcns element.

A novel four-node quadrilateral element with continuous nodal stress

Formulation and numerical evaluation of a novel four-node quadrilateral element with continuous nodal stress（Q4-CNS）are presented.Q4-CNS can be regarded as an improved hybrid FE-meshless four-node quadrilateral element（FE-LSPIM QUAD4）, which is a hybrid FE-meshless method.Derivatives of Q4-CNS are continuous at nodes, so the continuous nodal stress can be obtained without any smoothing operation.It is found that,compared with the standard four-node quadrilateral element（QUAD4）,Q4- CNS can achieve significantly better accuracy and higher convergence rate.It is also found that Q4-CNS exhibits high tolerance to mesh distortion.Moreover,since derivatives of Q4-CNS shape functions are continuous at nodes,Q4-CNS is potentially useful for the problem of bending plate and shell models.

EXPANDABLE PARALLEL FINITE ELEMENT METHODS FOR LINEAR ELLIPTIC PROBLEMS

In this article,two kinds of expandable parallel finite element methods,based on two-grid discretizations,are given to solve the linear elliptic problems.Compared with the classical local and parallel finite element methods,there are two attractive features of the methods shown in this article:1)a partition of unity is used to generate a series of local and independent subproblems to guarantee the final approximation globally continuous;2)the computational domain of each local subproblem is contained in a ball with radius of O(H)(H is the coarse mesh parameter),which means methods in this article are more suitable for parallel computing in a large parallel computer system.Some a priori error estimation are obtained and optimal error bounds in both H^1-normal and L^2-normal are derived.Finally,numerical results are reported to test and verify the feasibility and validity of our methods.

A novel virtual node method for polygonal elements

A novel polygonal finite element method （PFEM） based on partition of unity is proposed, termed the virtual node method （VNM）. To test the performance of the present method, numerical examples are given for solid mechanics problems. With a polynomial form, the VNM achieves better results than those of traditional PFEMs, including the Wachspress method and the mean value method in standard patch tests. Compared with the standard triangular FEM, the VNM can achieve better accuracy. With the ability to construct shape functions on polygonal elements, the VNM provides greater flexibility in mesh generation. Therefore, several fracture problems are studied to demonstrate the potential implementation. With the advantage of the VNM, the convenient refinement and remeshing strategy are applied.