Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting

In this paper we discuss Sobolev bounds on functions that vanish at scattered points in a bounded, Lipschitz domain that satisfies a uniform interior cone condition. The Sobolev spaces involved may have fractional as well as integer order. We then apply these results to obtain estimates for continuous and discrete least squares surface fits via radial basis functions (RBFs). These estimates include situations in which the target function does not belong to the native space of the RBF.

     

Adaptive boundary element methods for strongly elliptic integral equations

Summary Integral operators are nonlocal operators. The operators defined in boundary integral equations to elliptic boundary value problems, however, are pseudo-differential operators on the boundary and, therefore, provide additional pseudolocal properties. These allow the successful application of adaptive procedures to some boundary element methods. In this paper we analyze these methods for general strongly elliptic integral equations and obtain a-posteriori error estimates for boundary element solutions. We also apply these methods to nodal collocation with odd degree splines. Some numerical examples show that these adaptive procedures are reliable and effective.This work was carried out while Dr. De-hao Yu was an Alexander-von-Humboldt-Stiftung research fellow at the University of Stuttgart in 1987, 1988     

The convergence of spline collocation for strongly elliptic equations on curves

Summary Most boundary element methods for two-dimensional boundary value problems are based on point collocation on the boundary and the use of splines as trial functions. Here we present a unified asymptotic error analysis for even as well as for odd degree splines subordinate to uniform or smoothly graded meshes and prove asymptotic convergence of optimal order. The equations are collocated at the breakpoints for odd degree and the internodal midpoints for even degree splines. The crucial assumption for the generalized boundary integral and integro-differential operators is strong ellipticity. Our analysis is based on simple Fourier expansions. In particular, we extend results by J. Saranen and W.L. Wendland from constant to variable coefficient equations. Our results include the first convergence proof of midpoint collocation with piecewise constant functions, i.e., the panel method for solving systems of Cauchy singular integral equations.Dedicated to Prof. Dr. Dr. h.c. mult. Lothar Collatz on the occasion of his 75th birthdayThis work was begun at the Technische Hochschule Darmstadt where Professor Arnold was supported by a North Atlantic Treaty Organization Postdoctoral Fellowship. The work of Professor Arnold is supported by NSF grant BMS-8313247. The work of Professor Wendland was supported by the Stiftung Volkswagenwerk     

A-posteriori error analysis and adaptive finite element methods for singularly perturbed convection-diffusion equations

For singularly perturbed one-dimensional convection-diffusion equations, finite element approximations are constructed based on a so-called approximate symmetrization of the given unsymmetric problem. Local a-posteriori error estimates are established with respect to an appropriate energy norm where the bounds are proved to be realistic. The local bounds, called error indicators, provide a basis for a self-adaptive mesh refinement. For a model problem numerical results are presented showing that the adaptive method detects and resolves the boundary layer.     

A vortex axis and vortex core border grid adaptation algorithm

In the design process of hydrodynamical and aerodynamical technical applications, the numerical simulation of massively separated vortical flow is crucial for predicting, for example, lift or drag. To obtain reliable numerical results, it is mandatory to accurately predict the physical behavior of vortices. Thus, the dominant vortical flow structures have to be resolved in detail, which requires a local grid refinement and certain adaptation techniques. In this paper, a vortex flow structure adaptation algorithm is presented, which is particularly designed for local grid refinement at vortex axes positions and associated vortex core border locations. To this end, a fast and efficient vortex axis detection scheme is introduced and the algorithm for the vortex core border determination is explained. As the interaction between vortices makes the assignment of grid points to a certain vortex axis difficult, a helicity‐based vortex distinction approach in combination with a geometrical rotational sensor is developed. After describing the combined different techniques in detail, the vortex feature adaptation algorithm is applied to analytical and more realistic examples, which show that the described grid adaptation algorithm is able to enhance the grid cell resolution locally such that all significant vortical flow phenomena are resolved. Copyright © 2008 John Wiley & Sons, Ltd.     

Interpolation of coefficients and transformation of the dependent variable in finite element methods for the non-linear heat equation

Error estimates are shown for some spatially discrete Galerkin finite element methods for a non-linear heat equation. The approximation schemes studied are based on the introduction of the enthalpy as a new dependent variable, and also on the application of the Kirchhoff transformation and on interpolation of the non-linear coefficients into standard Lagrangian finite element spaces.     

Control of continuous sedimentation of ideal suspensions as an initial and boundary value problem

We present the control of continuous sedimentation in an ideal thickener as an initial and boundary value problem and construct the entropy solution.     

Meshfree Thinning of 3D Point Clouds

An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point removal algorithm, termed thinning, which outputs a data hierarchy of point-samples for multiresolution surface approximation. The thinning algorithm works with a point removal criterion, which measures the significances of the points in their local neighbourhoods, and which removes a least significant point at each step. For any point x in the current point set Y⊂X, its significance reflects the approximation quality of a local surface reconstructed from neighbouring points in Y. The local surface reconstruction is done over an estimated tangent plane at x by using radial basis functions. The approximation quality of the surface reconstruction around x is measured by using its maximal deviation from the given point-samples X in a local neighbourhood of x. The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D surface point-samples, and so it does not require any further topological information, such as point connectivities. Computational details of the thinning algorithm and the required data structures for efficient implementation are explained and its complexity is discussed. Two examples are presented for illustration. This paper is dedicated to Arieh Iserles on the occasion of his 60th anniversary.