5,753 research outputs found
Scattered Data Interpolation on Embedded Submanifolds with Restricted Positive Definite Kernels: Sobolev Error Estimates
In this paper we investigate the approximation properties of kernel
interpolants on manifolds. The kernels we consider will be obtained by the
restriction of positive definite kernels on , such as radial basis
functions (RBFs), to a smooth, compact embedded submanifold \M\subset \R^d.
For restricted kernels having finite smoothness, we provide a complete
characterization of the native space on \M. After this and some preliminary
setup, we present Sobolev-type error estimates for the interpolation problem.
Numerical results verifying the theory are also presented for a one-dimensional
curve embedded in and a two-dimensional torus
RBF multiscale collocation for second order elliptic boundary value problems
In this paper, we discuss multiscale radial basis function collocation methods for solving elliptic partial differential equations on bounded domains. The approximate solution is constructed in a multi-level fashion, each level using compactly supported radial basis functions of smaller scale on an increasingly fine mesh. On each level, standard symmetric collocation is employed. A convergence theory is given, which builds on recent theoretical advances for multiscale approximation using compactly supported radial basis functions. We are able to show that the convergence is linear in the number of levels. We also discuss the condition numbers of the arising systems and the effect of simple, diagonal preconditioners, now proving rigorously previous numerical observations
Application of Fredholm integral equations inverse theory to the radial basis function approximation problem
This paper reveals and examines the relationship between the solution and stability of Fredholm integral equations and radial basis function approximation or interpolation. The underlying system (kernel) matrices are shown to have a smoothing property which is dependent on the choice of kernel. Instead of using the condition number to describe the ill-conditioning, hence only looking at the largest and smallest singular values of the matrix, techniques from inverse theory, particularly the Picard condition, show that it is understanding the exponential decay of the singular values which is critical for interpreting and mitigating instability. Results on the spectra of certain classes of kernel matrices are reviewed, verifying the exponential decay of the singular values. Numerical results illustrating the application of integral equation inverse theory are also provided and demonstrate that interpolation weights may be regarded as samplings of a weighted solution of an integral equation. This is then relevant for mapping from one set of radial basis function centers to another set. Techniques for the solution of integral equations can be further exploited in future studies to find stable solutions and to reduce the impact of errors in the data
Analysis of moving least squares approximation revisited
In this article the error estimation of the moving least squares
approximation is provided for functions in fractional order Sobolev spaces. The
analysis presented in this paper extends the previous estimations and explains
some unnoticed mathematical details. An application to Galerkin method for
partial differential equations is also supplied.Comment: Journal of Computational and Applied Mathematics, 2015 Journal of
Computational and Applied Mathematic
A high-order approximation method for semilinear parabolic equations on spheres
We describe a novel discretisation method for numerically solving (systems of) semilinear parabolic equations on Euclidean spheres. The new approximation method is based upon a discretisation in space using spherical basis functions and can be of arbitrary order. This, together with the fact that the solutions of semilinear parabolic problems are known to be infinitely smooth, at least locally in time, allows us to prove stability and convergence of the discretisation in a straight-forward way
Evaluating the Differences of Gridding Techniques for Digital Elevation Models Generation and Their Influence on the Modeling of Stony Debris Flows Routing: A Case Study From Rovina di Cancia Basin (North-Eastern Italian Alps)
Debris \ufb02ows are among the most hazardous phenomena in mountain areas. To cope
with debris \ufb02ow hazard, it is common to delineate the risk-prone areas through
routing models. The most important input to debris \ufb02ow routing models are the
topographic data, usually in the form of Digital Elevation Models (DEMs). The quality
of DEMs depends on the accuracy, density, and spatial distribution of the sampled
points; on the characteristics of the surface; and on the applied gridding methodology.
Therefore, the choice of the interpolation method affects the realistic representation
of the channel and fan morphology, and thus potentially the debris \ufb02ow routing
modeling outcomes. In this paper, we initially investigate the performance of common
interpolation methods (i.e., linear triangulation, natural neighbor, nearest neighbor,
Inverse Distance to a Power, ANUDEM, Radial Basis Functions, and ordinary kriging)
in building DEMs with the complex topography of a debris \ufb02ow channel located
in the Venetian Dolomites (North-eastern Italian Alps), by using small footprint full-
waveform Light Detection And Ranging (LiDAR) data. The investigation is carried
out through a combination of statistical analysis of vertical accuracy, algorithm
robustness, and spatial clustering of vertical errors, and multi-criteria shape reliability
assessment. After that, we examine the in\ufb02uence of the tested interpolation algorithms
on the performance of a Geographic Information System (GIS)-based cell model for
simulating stony debris \ufb02ows routing. In detail, we investigate both the correlation
between the DEMs heights uncertainty resulting from the gridding procedure and
that on the corresponding simulated erosion/deposition depths, both the effect of
interpolation algorithms on simulated areas, erosion and deposition volumes, solid-liquid
discharges, and channel morphology after the event. The comparison among the tested
interpolation methods highlights that the ANUDEM and ordinary kriging algorithms
are not suitable for building DEMs with complex topography. Conversely, the linear
triangulation, the natural neighbor algorithm, and the thin-plate spline plus tension and completely regularized spline functions ensure the best trade-off among accuracy
and shape reliability. Anyway, the evaluation of the effects of gridding techniques on
debris \ufb02ow routing modeling reveals that the choice of the interpolation algorithm does
not signi\ufb01cantly affect the model outcomes
The use of the mesh free methods (radial basis functions) in the modeling of radionuclide migration and moving boundary value problems
Recently, the mesh free methods (radial basis functions-RBFs) have emerged as a novel computing method in the scientific and engineering computing community. The numerical solution of partial differential equations (PDEs) has been usually obtained by finite difference methods (FDM), finite element methods (FEM) and boundary elements methods (BEM). These conventional numerical methods still have some drawbacks. For example, the construction of the mesh in two or more dimensions is a nontrivial problem. Solving PDEs using radial basis function (RBF) collocations is an attractive alternative to these traditional methods because no tedious mesh generation is required. We compare the mesh free method, which uses radial basis functions, with the traditional finite difference scheme and analytical solutions. We will present some examples of using RBFs in geostatistical analysis of radionuclide migration modeling. The advection-dispersion equation will be used in the Eulerian and Lagrangian forms. Stefan's or moving boundary value problems will also be presented. The position of the moving boundary will be simulated by the moving data centers method and level set method
Quantification of airfoil geometry-induced aerodynamic uncertainties - comparison of approaches
Uncertainty quantification in aerodynamic simulations calls for efficient
numerical methods since it is computationally expensive, especially for the
uncertainties caused by random geometry variations which involve a large number
of variables. This paper compares five methods, including quasi-Monte Carlo
quadrature, polynomial chaos with coefficients determined by sparse quadrature
and gradient-enhanced version of Kriging, radial basis functions and point
collocation polynomial chaos, in their efficiency in estimating statistics of
aerodynamic performance upon random perturbation to the airfoil geometry which
is parameterized by 9 independent Gaussian variables. The results show that
gradient-enhanced surrogate methods achieve better accuracy than direct
integration methods with the same computational cost
- …