Chemnitz Scientific Computing Preprints

Similar documents
Clustering by optimal subsets to describe environment interdependencies. J. Glänzel, R. Unger

Fast Radial Basis Functions for Engineering Applications. Prof. Marco Evangelos Biancolini University of Rome Tor Vergata

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama

RRQR-MEX Linux and Windows 32bit Matlab MEX-Files for the rank revealing QR factorization

Sonderforschungsbereich 393 Parallele Numerische Simulation für Physik und Kontinuumsmechanik

03 - Reconstruction. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Spring 17 - Daniele Panozzo

Transformation Functions for Image Registration

Approximation of a Fuzzy Function by Using Radial Basis Functions Interpolation

Digital Geometry Processing

Surface Reconstruction

A Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods

Recent Developments in Model-based Derivative-free Optimization

Surfaces, meshes, and topology

Computer Life (CPL) ISSN: Finite Element Analysis of Bearing Box on SolidWorks

Data mining with sparse grids using simplicial basis functions

Fluid structure interaction analysis: vortex shedding induced vibrations

New Basis Functions and Their Applications to PDEs

NEW METHOD FOR MESH MOVING BASED ON RADIAL BASIS FUNCTION INTERPOLATION

Problem Set 4. Assigned: March 23, 2006 Due: April 17, (6.882) Belief Propagation for Segmentation

Surface Reconstruction. Gianpaolo Palma

PROPERTIES OF NATURAL ELEMENT COORDINATES ON ANY POLYHEDRON

A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions

Real-Time Shape Editing using Radial Basis Functions

Image Warping. Srikumar Ramalingam School of Computing University of Utah. [Slides borrowed from Ross Whitaker] 1

SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS

An advanced RBF Morph application: coupled CFD-CSM Aeroelastic Analysis of a Full Aircraft Model and Comparison to Experimental Data

On the regularizing power of multigrid-type algorithms

Comparing different interpolation methods on two-dimensional test functions

Data mining with sparse grids

A Hole-Filling Algorithm for Triangular Meshes. Abstract

Geometric Modeling in Graphics

Regularization by multigrid-type algorithms

Multilevel quasi-interpolation on a sparse grid with the Gaussian

Chemnitz Scientific Computing Preprints

Computational Physics PHYS 420

A spectral boundary element method

PATCH TEST OF HEXAHEDRAL ELEMENT

Introduction to Computer Graphics. Image Processing (1) June 8, 2017 Kenshi Takayama

Parallel Interpolation in FSI Problems Using Radial Basis Functions and Problem Size Reduction


Model Fitting. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore

A dimension adaptive sparse grid combination technique for machine learning

Image deblurring by multigrid methods. Department of Physics and Mathematics University of Insubria

An Adaptive Moving Least Squares Method for. Non-uniform Points Set Fitting

Geometric and Solid Modeling. Problems

COMPUTER AIDED ENGINEERING DESIGN (BFF2612)

Eulerian Techniques for Fluid-Structure Interactions - Part II: Applications

Edge and local feature detection - 2. Importance of edge detection in computer vision

Lecture VIII. Global Approximation Methods: I

Solve Non-Linear Parabolic Partial Differential Equation by Spline Collocation Method

Radial Basis Function Networks

RBF Interpolation with CSRBF of Large Data Sets

Adaptive Isogeometric Analysis by Local h-refinement with T-splines

CONFORMAL MAPPING POTENTIAL FLOW AROUND A WINGSECTION USED AS A TEST CASE FOR THE INVISCID PART OF RANS SOLVERS

Smart point landmark distribution for thin-plate splines

MODELING MIXED BOUNDARY PROBLEMS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD (CVBEM) USING MATLAB AND MATHEMATICA

Numerische Mathematik

Robust Poisson Surface Reconstruction

FFD, mesh morphing & reduced order models: Enablers for efficient aerodynamic shape optimization

12 Classification using Support Vector Machines

An explicit and conservative remapping strategy for semi-lagrangian advection

Isogeometric Collocation Method

Dynamic mesh: beyond Fluent

Comparison and affine combination of generalized barycentric coordinates for convex polygons

No more questions will be added

Computational Fluid Dynamics - Incompressible Flows

Non-Rigid Image Registration III

Smooth finite elements

Active Contours Using a Constraint-Based Implicit Representation

Numerical methods in physics

Skåne University Hospital Lund, Lund, Sweden 2 Deparment of Numerical Analysis, Centre for Mathematical Sciences, Lund University, Lund, Sweden

A Comparative Study of LOWESS and RBF Approximations for Visualization

SETTLEMENT OF A CIRCULAR FOOTING ON SAND

Until now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple

A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings

DIGITAL TERRAIN MODELLING. Endre Katona University of Szeged Department of Informatics

A meshfree weak-strong form method

PARAMETRIC SHAPE AND TOPOLOGY OPTIMIZATION WITH RADIAL BASIS FUNCTIONS

Chapter 1 BACKGROUND

Recent advances in Metamodel of Optimal Prognosis. Lectures. Thomas Most & Johannes Will

Introduction to Geometric Algebra Lecture VI

Implicit Fitting Using Radial Basis Functions with Ellipsoid Constraint

Meshless Modeling, Animating, and Simulating Point-Based Geometry

CHAPTER 6 IMPLEMENTATION OF RADIAL BASIS FUNCTION NEURAL NETWORK FOR STEGANALYSIS

Implicit 3-D modelling of geological surfaces with the Generalized Radial Basis Functions (GRBF) algorithm

NEURAL NETWORK SHAPE: ORGAN SHAPE REPRESENTATION WITH RADIAL BASIS FUNCTION NEURAL NETWORKS

A Toolbox of Level Set Methods

Bernstein-Bezier Splines on the Unit Sphere. Victoria Baramidze. Department of Mathematics. Western Illinois University

Parameterization of triangular meshes

Geometric Registration for Deformable Shapes 2.2 Deformable Registration

Fast Multipole Accelerated Indirect Boundary Elements for the Helmholtz Equation

Multi-Objective Optimization of Gatling gun Tripod Based on Mesh. Morphing and RBF Model

A Singular Example for the Averaged Mean Curvature Flow

Iterative methods for use with the Fast Multipole Method

weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.

Meshless cubature by Green s formula

The Method of Approximate Particular Solutions for Solving Elliptic Problems with Variable Coefficients

CS 450 Numerical Analysis. Chapter 7: Interpolation

10. Cartesian Trajectory Planning for Robot Manipulators

Implicit Surface Reconstruction from 3D Scattered Points Based on Variational Level Set Method

Transcription:

Roman Unger Obstacle Description with Radial Basis Functions for Contact Problems in Elasticity CSC/09-01 Chemnitz Scientific Computing Preprints

Impressum: Chemnitz Scientific Computing Preprints ISSN 1864-0087 (1995 2005: Preprintreihe des Chemnitzer SFB393) Herausgeber: Professuren für Numerische und Angewandte Mathematik an der Fakultät für Mathematik der Technischen Universität Chemnitz Postanschrift: TU Chemnitz, Fakultät für Mathematik 09107 Chemnitz Sitz: Reichenhainer Str. 41, 09126 Chemnitz http://www.tu-chemnitz.de/mathematik/csc/

Chemnitz Scientific Computing Preprints Roman Unger Obstacle Description with Radial Basis Functions for Contact Problems in Elasticity CSC/09-01 CSC/09-01 ISSN 1864-0087 January 2009

Contents 1 Introduction 1 1.1 Abstract................................ 1 1.2 Problem description.......................... 1 2 Radial Basis Functions 2 3 Surface Approximation 4 4 Obstacle Description 6 5 Computational Example 7 5.1 Obstacle Approximation....................... 7 5.2 Some 3-d views of the deformed body................ 9 Author s addresses: Roman Unger TU Chemnitz Fakultät für Mathematik D-09107 Chemnitz http://www.tu-chemnitz.de/ uro

1 Introduction 1.1 Abstract In this paper the obstacle description with Radial Basis Functions for contact problems in three dimensional elasticity will be done. A short introduction of the idea of Radial Basis Functions will be followed by the usage of Radial Basis Functions for approximation of isosurfaces. Then this isosurfaces are used for the obstacle-description in three dimensional elasticity contact problems. In the last part some computational examples will be shown. 1.2 Problem description Let Ω R d with d {2, 3} be an elastic body with boundary Γ = Ω = Γ D Γ N. The elastic body is clamped at his dirichlet boundary Γ D and has a surface load at the neumann boundary Γ N. Volume forces inside the body can also occur. In the displacement direction of the body exists a rigid obstacle. (see figure 1) Γ N Γ D Ω OBSTACLE Figure 1: The contact problem The basic problem is now to find a valid displacement field u(x) for all x Ω such that no part of the body penetrates the obsctale. Details of the mathematical modelling and numerical solution of this problem with finite element method and subspace projection can be found in [6]. One of the important parts of the algorithm consists of the obstacle handling with projection methods which needs a fast penetration test for displaced nodes and evaluations of the outer normal of the obstacle. The performance of this parts of the algorithm depends on the mathematical description of the obstacle, best performance can be achieved with obstacle definition as isosurface, i.e. as zero set of a function F : R d R. The disadvantage

of this description is, that only simple geometries can be defined in closed analytical form. The aim of this paper is to introduce a kind of obstacle description as isosurface with the help of Radial Basis Functions which allows the description of complicated surfaces too. 2 Radial Basis Functions The basic problem for the usage of Radial Basis Functions is to solve a interpolation problem of N arbitrary sampling points x 1, x 2 x N R d and given values y 1, y 2 y N R to find a function f : R d R which fulfills the interpolation condition f(x i ) = y i i = 1 N. (1) To find an ansatz for this function f at first some basis functions will be introduced. A function φ i : R d R is a radial basis function if there exists a function ξ : R R satisfying φ i (x) = ξ( x x i ) for a fixed point x i R d. Commonly used types of RBF ansatz functions ξ(r) with r = x x i are Gaussian: ξ(r) = exp( βr 2 ) for β > 0 Multiquadric: ξ(r) = r 2 + 1 { r k Polyharmonic spline: ξ(r) = r k log(r) Thin plate spline: ξ(r) = r 2 log(r) if k is odd if k is even Other possibilities, especially for a large number of samplepoints are Radial Basis Functions with compact support, for example the so called Wendland functions [1]. With such basis functions the resulting interpolation system becomes sparse. For simple contact geometries the number of samplepoints is moderate and so this kind of basis is not used in this work. Now let in every sampling point x i, i = 1 N such a radial basis function φ i be defined. The ususal ansatz for an interpolation function is f(x) = N β i φ i (x) (2) i=1 2

Together with the interpolation-condition (1) this leads to linear equations N f(x i ) := β j φ j (x i ) = y i j=1 which can be written as a linear system i = 1 N Φβ RBF = y with the system matrix Φ := [φ j (x i )] N i,j=1 the vector βrbf = [β 1, β 2 β N ] T of unknown coefficients and the right hand side y = [y 1, y 2 y N ] T. Obvisiously the system matrix Φ is symmetric, one can show ([2]) that for a big variety of radial basis functions it is positive definite too. The disadvantage of the radial basis function ansatz alone is that a high number of sample points is needed to get a sufficient exact approximation of a constant or a linear function. One possibility to cope with this problem is to add a polynomial part. f(x) = N i=1 β RBF i φ i + p(x) (3) where the d-variate polynomial p π m (R d ) of degree at most m is defined as p(x) = M j=1 β poly j p j (x), with M = dim(π m (R d )) and basis polynomials p j j = 1 M. Consequently one receive (N + M) unknown coefficients, the interpolation system (1) consists of N equations, therefore a side condition N j=1 β RBF j p(x j ) = 0 for all p π m (R d ) (4) is imposed. This leads to a linear system of dimension (N + M) [ ] [ ] [ ] Φ P β RBF y P T 0 β P OLY = 0 A simple but good choice for π m (R d ) are linear polynomials, i.e. p 1 (x) = x 1 p 2 (x) = x 2 p d (x) = x d p M (x) = 1 (5) 3

for x R d, M = d + 1 and x i as the i-th component of x. This leads to a matrix P x T 1 1 P = x T 2 1. x T N 1 [ β RBF The solution β = ] of (5) holds the coefficients for the whole interpolation function β P OLY f(x) = N β i φ i (x) + i=1 M β (N+i) p i (x). (6) i=1 3 Surface Approximation In computational geometry one of the most useful descriptions of surfaces is the description by an implicit function. With the help of a function F with F : R 3 R a surface is defined by the zero level of this function, i.e. we set as surface Σ Σ := {x R d : F (x) = 0}. (7) For example with F : R 3 R F (x) := x 2 1 + x 2 2 + x 2 3 R 2 the zero level of this F is the sphere with radius R and center x = 0. Unfortuneality it is not possible to describe complicated surfaces like tool contours in deforming tools with simple analytical functional terms. So the idea of the approximation of such surfaces comes up. The detailed description and examples of surfaces from scanned point clouds and their reconstruction can be found for example in [4] and [3]. For the explanation of the reconstruction idea see the 2 dimensional analogon of a curve reconstruction in the R 2 in figure 2. We choose N samplepoints x 1 x N and fix sampelvalues y 1 y N with x 1, x 4 x N 2 x 2, x 5 x N 1 x 3, x 6 x N on the surface inside the surface outside the surface 4

x N 1 x N 2 x N x 5 x 4 x 6 x x 3 x 2 1 F (x) = 1 F (x) = 0 F (x) = 1 Figure 2: 2-d curve approximation and set the corresponding values y i = 0 for i = 1, 4, N 2 y i = 1 for i = 2, 5, N 1 y i = 1 for i = 3, 6, N Then the radial basis interpolation system 5 is set up, solved and the surface defining function F is choosen as the RBF-interpolation from (6) as F (x) = N β i φ i (x) + i=1 M β (N+i) p i (x). (8) Depending on the smoothness of the surface it is also possible to use most of the sampling points on the zero level set on only a small number of samples with values not equal zero, but at least one sample must hold a value not equal zero to avoid the trivial zero solution β = 0 which leads to F (x) = 0 x. i=1 5

4 Obstacle Description A detailed description of the obstacle handling can be found in [5] and [6]. Especially a obstacle description by implicit functions F with F : R 3 R with = 0 x on the obstacle boundary F (x) < 0 x inside the obstacle > 0 x outside the obstacle. is done and implemented in the 2 and 3-dimensional adaptive finite element programs for elasticity problems. To add a new kind of obstacle description with Radial Basis Functions the existing code was extented by the evaluation of the RBF-interpolation with precomputed coefficients β. So the penetration test can be done in the same manner by evaluation of F (x + u). In case of penetration the outer normal of the surface is needed to define the subspace projector, it holds n = F Therefore a gradient evaluation of (8) is needed. Depending on the choice of the Radial Basis Functions φ i this can be done by analytical differentiation of the basis functions or by a numerical gradient approximation with the help of the difference quotient F F (x + εe i) F (x εe i ) (9) x i 2ε with the unit vector e i = [0, 0, 0, 1, 0, 0] T R d and a small ε > 0. 6

5 Computational Example 5.1 Obstacle Approximation In the last section an numerical example will be shown. The surface points are sampled from the isosurface Σ := {x R 3 : F (x) = 0} with F (x) := x 3 + 0.2((0.7x 1 ) 3 + 2(cos( π 2 x 2) 1) + 3.7. (10) The obstacle is sampled over a regular x 1, x 2 grid with 9 steps in x 1 and 19 steps in x 2 direction. Every gridpoint creates 3 samplepoints, one for the zero niveau ( the red marked points in figure 3 ) one for a positive niveau above and one negative niveau under the surface. This leads to 513 samplepoints, together with a linear polynomial approach the dimension of the interpolation system (5) becomes 517. After solving this system the resulting coefficients are used in the radial basis approximation 6 as approximation to 10. In figure 4 the deformable elastic body is shown in his start position, it will be moved in negative z direction by a dirichlet boundary condition on the top of the half ball. Figure 5 shows the deformed body in contact with the obstacle. The color of the boundary surfaces of the body is choosen by the contact pressure value, zones without contact have a zero contact pressure. Figure 3: The Obstacle 7

Figure 4: The elastic body in start position Figure 5: The deformed body with colored contact pressure 8

5.2 Some 3-d views of the deformed body In this section some views of the boundary surfaces of the deformed body in different viewing angels are shown. The color of the body matchs with the contact pressure. Blue color stands for zero pressure (not in contact) and red parts are zones with maximal contact pressure. Figure 6: Some views 9

10 Figure 7: Some views

Figure 8: Some views 11

12 Figure 9: Some views

Figure 10: Some views 13

14 Figure 11: Some views

Figure 12: Some views 15

16 Figure 13: Some views

References [1] M. Buhmann. Radial basis functions. Acta Numerica, 9:1 38, 2000. [2] M. D. Buhmann. Radial Basis Functions. Cambridge University Press, 2004. [3] J. Carr, R. K. Beatson, J. Cherrie, T. J. Mitchell, W. R. Fright, B. C. Mc- Callum, T. R. Evans. Reconstruction and representation of 3d objects with radial basis functions. ACM SIGGRAPH 2001, :67 76, 2001. [4] J. C. Carr, W. R. Fright, R. K. Beatson. Surface interpolation with radial basis functions for medical imaging. IEEE Transactions on Medical Imaging, 16:96 107, 1997. [5] A. Meyer, R. Unger. Projection methods for contact problems in elasticity. Preprint SFB393 04-04 TU Chemnitz, 2004. [6] R. Unger. Unterraum-CG-Techniken zur Bearbeitung von Kontaktproblemen. Dissertation TU Chemnitz, 2007. 17

18

Chemnitz Scientific Computing Preprints ISSN 1864-0087