Approximation and Interpolation Employing Divergence–free Radial Basis Functions with Applications

نویسندگان

  • SVENJA LOWITZSCH
  • Francis J. Narcowich
  • Joseph D. Ward
  • Joseph E. Pasciak
  • Natarajan Sivakumar
  • Randall L. Eubank
  • William Rundell
  • Svenja Lowitzsch
چکیده

Approximation and Interpolation Employing Divergence–free Radial Basis Functions with Applications. (May 2002) Svenja Lowitzsch, Dipl., Georg-August University, Göttingen Co–Chairs of Advisory Committee: Dr. Francis J. Narcowich Dr. Joseph D. Ward Approximation and interpolation employing radial basis functions has found important applications since the early 1980’s in areas such as signal processing, medical imaging, as well as neural networks. Several applications demand that certain physical properties be fulfilled, such as a function being divergence free. No such class of radial basis functions that reflects these physical properties was known until 1994, when Narcowich and Ward introduced a family of matrix-valued radial basis functions that are divergence free. They also obtained error bounds and stability estimates for interpolation by means of these functions. These divergence-free functions are very smooth, and have unbounded support. In this thesis we introduce a new class of matrix-valued radial basis functions that are divergence free as well as compactly supported. This leads to the possibility of applying fast solvers for inverting interpolation matrices, as these matrices are not only symmetric and positive definite, but also sparse because of this compact support. We develop error bounds and stability estimates which hold for a broad class of functions. We conclude with applications to the numerical solution of the Navier-Stokes equation for certain incompressible fluid flows.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation of a Fuzzy Function by Using Radial Basis Functions Interpolation

In the present paper, Radial Basis Function interpolations are applied to approximate a fuzzy function $tilde{f}:Rrightarrow mathcal{F}(R)$, on a discrete point set $X={x_1,x_2,ldots,x_n}$, by a fuzzy-valued function $tilde{S}$. RBFs are based on linear combinations of terms which include a single univariate function. Applying RBF to approximate a fuzzy function, a linear system wil...

متن کامل

An approximation to the solution of Benjamin-Bona-Mahony-Burgers equation

In this paper, numerical solution of the Benjamin-Bona-Mahony-Burgers (BBMB) equation is obtained by using the mesh-free method based on the collocation method with radial basis functions (RBFs). Stability analysis of the method is discussed. The method is applied to several examples and accuracy of the method is tested in terms of $L_2$ and $L_infty$ error norms.

متن کامل

Error estimates for matrix-valued radial basis function interpolation

We introduce a class of matrix-valued radial basis functions (RBFs) of compact support that can be customized, e.g. chosen to be divergence-free. We then derive and discuss error estimates for interpolants and derivatives based on these matrixvalued RBFs.

متن کامل

Numerical Simulation of 1D Linear Telegraph Equation With Variable Coefficients Using Meshless Local Radial Point Interpolation (‎MLRPI)

In the current work, we implement the meshless local radial point interpolation (MLRPI) method to find numerical solution of one-dimensional linear telegraph equations with variable coefficients. The MLRPI method, as a meshless technique, does not require any background integration cells and all integrations are carried out locally over small quadrature domains of regular shapes, such as lines ...

متن کامل

A new trust-region algorithm based on radial basis function interpolation

Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002