Home About us Contact | |||
Moving Least-squares (moving + least-square)
Terms modified by Moving Least-squares Selected AbstractsArbitrary placement of local meshes in a global mesh by the interface-element method (IEM)INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 15 2003Hyun-Gyu KimArticle first published online: 25 FEB 200 Abstract A new method is proposed to place local meshes in a global mesh with the aid of the interface-element method (IEM). The interface-elements use moving least-square (MLS)-based shape functions to join partitioned finite-element domains with non-matching interfaces. The supports of nodes are defined to satisfy the continuity condition on the interfaces by introducing pseudonodes on the boundaries of interface regions. Particularly, the weight functions of nodes on the boundaries of interface regions span only neighbouring nodes, ensuring that the resulting shape functions are identical to those of adjoining finite-elements. The completeness of the shape functions of the interface-elements up to the order of basis provides a reasonable transfer of strain fields through the non-matching interfaces between partitioned domains. Taking these great advantages of the IEM, local meshes can be easily inserted at arbitrary places in a global mesh. Several numerical examples show the effectiveness of this technique for modelling of local regions in a global domain. Copyright © 2003 John Wiley & Sons, Ltd. [source] Dynamic Sampling and Rendering of Algebraic Point Set SurfacesCOMPUTER GRAPHICS FORUM, Issue 2 2008Gaël Guennebaud Abstract Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisit the spherical fitting problem and provide a new, more generic solution that includes intuitive parameters for curvature control of the fitted spheres. As a second contribution we present a novel real-time rendering system of such surfaces using a dynamic up-sampling strategy combined with a conventional splatting algorithm for high quality rendering. Our approach also includes a new view dependent geometric error tailored to efficient and adaptive up-sampling of the surface. One of the key features of our system is its high degree of flexibility that enables us to achieve high performance even for highly dynamic data or complex models by exploiting temporal coherence at the primitive level. We also address the issue of efficient spatial search data structures with respect to construction, access and GPU friendliness. Finally, we present an efficient parallel GPU implementation of the algorithms and search structures. [source] Analysis of thick functionally graded plates by local integral equation methodINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 8 2007J. Sladek Abstract Analysis of functionally graded plates under static and dynamic loads is presented by the meshless local Petrov,Galerkin (MLPG) method. Plate bending problem is described by Reissner,Mindlin theory. Both isotropic and orthotropic material properties are considered in the analysis. A weak formulation for the set of governing equations in the Reissner,Mindlin theory with a unit test function is transformed into local integral equations considered on local subdomains in the mean surface of the plate. Nodal points are randomly spread on this surface and each node is surrounded by a circular subdomain, rendering integrals which can be simply evaluated. The meshless approximation based on the moving least-squares (MLS) method is employed in the numerical implementation. Numerical results for simply supported and clamped plates are presented. Copyright © 2006 John Wiley & Sons, Ltd. [source] Complex variable moving least-squares method: a meshless approximation techniqueINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 1 2007K. M. Liew Abstract Based on the moving least-squares (MLS) approximation, we propose a new approximation method,the complex variable moving least-squares (CVMLS) approximation. With the CVMLS approximation, the trial function of a two-dimensional problem is formed with a one-dimensional basis function. The number of unknown coefficients in the trial function of the CVMLS approximation is less than in the trial function of the MLS approximation, and we can thus select fewer nodes in the meshless method that is formed from the CVMLS approximation than are required in the meshless method of the MLS approximation with no loss of precision. The meshless method that is derived from the CVMLS approximation also has a greater computational efficiency. From the CVMLS approximation, we propose a new meshless method for two-dimensional elasticity problems,the complex variable meshless method (CVMM),and the formulae of the CVMM for two-dimensional elasticity problems are obtained. Compared with the conventional meshless method, the CVMM has a greater precision and computational efficiency. For the purposes of demonstration, some selected numerical examples are solved using the CVMM. Copyright © 2006 John Wiley & Sons, Ltd. [source] Moving least-square interpolants in the hybrid particle methodINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 4 2005H. Huang Abstract The hybrid particle method (HPM) is a particle-based method for the solution of high-speed dynamic structural problems. In the current formulation of the HPM, a moving least-squares (MLS) interpolant is used to compute the derivatives of stress and velocity components. Compared with the use of the MLS interpolant at interior particles, the boundary particles require two additional treatments in order to compute the derivatives accurately. These are the rotation of the local co-ordinate system and the imposition of boundary constraints, respectively. In this paper, it is first shown that the derivatives found by the MLS interpolant based on a complete polynomial are indifferent to the orientation of the co-ordinate system. Secondly, it is shown that imposing boundary constraints is equivalent to employing ghost particles with proper values assigned at these particles. The latter can further be viewed as placing the boundary particle in the centre of a neighbourhood that is formed jointly by the original neighbouring particles and the ghost particles. The benefit of providing a symmetric or a full circle of neighbouring points is revealed by examining the error terms generated in approximating the derivatives of a Taylor polynomial by using a linear-polynomial-based MLS interpolant. Symmetric boundaries have mostly been treated by using ghost particles in various versions of the available particle methods that are based on the strong form of the conservation equations. In light of the equivalence of the respective treatments of imposing boundary constraints and adding ghost particles, an alternative treatment for symmetry boundaries is proposed that involves imposing only the symmetry boundary constraints for the HPM. Numerical results are presented to demonstrate the validity of the proposed approach for symmetric boundaries in an axisymmetric impact problem. Copyright © 2005 John Wiley & Sons, Ltd. [source] Meshless analysis of potential problems in three dimensions with the hybrid boundary node methodINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 9 2004Jianming Zhang Abstract Combining a modified functional with the moving least-squares (MLS) approximation, the hybrid boundary node method (Hybrid BNM) is a truly meshless, boundary-only method. The method may have advantages from the meshless local boundary integral equation (MLBIE) method and also the boundary node method (BNM). In fact, the Hybrid BNN requires only the discrete nodes located on the surface of the domain. The Hybrid BNM has been applied to solve 2D potential problems. In this paper, the Hybrid BNM is extended to solve potential problems in three dimensions. Formulations of the Hybrid BNM for 3D potential problems and the MLS approximation on a generic surface are developed. A general computer code of the Hybrid BNM is implemented in C++. The main drawback of the ,boundary layer effect' in the Hybrid BNM in the 2D case is circumvented by an adaptive face integration scheme. The parameters that influence the performance of this method are studied through three different geometries and known analytical fields. Numerical results for the solution of the 3D Laplace's equation show that high convergence rates with mesh refinement and high accuracy are achievable. Copyright © 2004 John Wiley & Sons, Ltd. [source] Essential boundary condition enforcement in meshless methods: boundary flux collocation methodINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 3 2002Cheng-Kong C. Wu Abstract Element-free Galerkin (EFG) methods are based on a moving least-squares (MLS) approximation, which has the property that shape functions do not satisfy the Kronecker delta function at nodal locations, and for this reason imposition of essential boundary conditions is difficult. In this paper, the relationship between corrected collocation and Lagrange multiplier method is revealed, and a new strategy that is accurate and very simple for enforcement of essential boundary conditions is presented. The accuracy and implementation of this new technique is illustrated for one-dimensional elasticity and two-dimensional potential field problems. Copyright © 2001 John Wiley & Sons, Ltd. [source] |