57,320 research outputs found
On spherical averages of radial basis functions
A radial basis function (RBF) has the general form
where the coefficients a 1,âŠ,a n are real numbers, the points, or centres, b 1,âŠ,b n lie in â d , and Ï:â d ââ is a radially symmetric function. Such approximants are highly useful and enjoy rich theoretical properties; see, for instance (Buhmann, Radial Basis Functions: Theory and Implementations, [2003]; Fasshauer, Meshfree Approximation Methods with Matlab, [2007]; Light and Cheney, A Course in Approximation Theory, [2000]; or Wendland, Scattered Data Approximation, [2004]). The important special case of polyharmonic splines results when Ï is the fundamental solution of the iterated Laplacian operator, and this class includes the Euclidean norm Ï(x)=âxâ when d is an odd positive integer, the thin plate spline Ï(x)=âxâ2log ââxâ when d is an even positive integer, and univariate splines. Now B-splines generate a compactly supported basis for univariate spline spaces, but an analyticity argument implies that a nontrivial polyharmonic spline generated by (1.1) cannot be compactly supported when d>1. However, a pioneering paper of Jackson (Constr. Approx. 4:243â264, [1988]) established that the spherical average of a radial basis function generated by the Euclidean norm can be compactly supported when the centres and coefficients satisfy certain moment conditions; Jackson then used this compactly supported spherical average to construct approximate identities, with which he was then able to derive some of the earliest uniform convergence results for a class of radial basis functions. Our work extends this earlier analysis, but our technique is entirely novel, and applies to all polyharmonic splines. Furthermore, we observe that the technique provides yet another way to generate compactly supported, radially symmetric, positive definite functions. Specifically, we find that the spherical averaging operator commutes with the Fourier transform operator, and we are then able to identify Fourier transforms of compactly supported functions using the PaleyâWiener theorem. Furthermore, the use of Haar measure on compact Lie groups would not have occurred without frequent exposure to Iserlesâs study of geometric integration
Toward an Iterative Algorithm for Spline Interpolation
One of the fundamental results in spline interpolation theory is the famous Schoenberg-Whitney Theorem, which completely characterizes those distributions of interpolation points which admit unique interpolation by splines. However, until now there exists no iterative algorithm for the explicit computation of the interpolating spline function, and the only practicable method to obtain this function is to solve explicitly the corresponding system of linear equation's. In this paper we suggest a method which computes iteratively the coefficients of the interpolating function in its B-spline basis representation; the starting values of our one-step iteration scheme are quotients of two low order determinants in general,and sometimes even just of two real numbers. Furthermore, we present a generalization of Newton's interpolation formula for polynomials to the case of spline interpolation, which corresponds to a result of G. MĂŒhlbach for Haar spaces
Many-body theory of positron-atom interactions
A many-body theory approach is developed for the problem of positron-atom
scattering and annihilation. Strong electron-positron correlations are included
non-perturbatively through the calculation of the electron-positron vertex
function. It corresponds to the sum of an infinite series of ladder diagrams,
and describes the physical effect of virtual positronium formation. The vertex
function is used to calculate the positron-atom correlation potential and
nonlocal corrections to the electron-positron annihilation vertex. Numerically,
we make use of B-spline basis sets, which ensures rapid convergence of the sums
over intermediate states. We have also devised an extrapolation procedure that
allows one to achieve convergence with respect to the number of
intermediate-state orbital angular momenta included in the calculations. As a
test, the present formalism is applied to positron scattering and annihilation
on hydrogen, where it is exact. Our results agree with those of accurate
variational calculations. We also examine in detail the properties of the large
correlation corrections to the annihilation vertex.Comment: 25 pages, 16 figure
Interpolation Revisited
Based on the theory of approximation, this paper presents a unified analysis of interpolation and resampling techniques. An important issue is the choice of adequate basis functions. We show that, contrary to the common belief, those that perform best are not interpolating. By opposition to traditional interpolation, we call their use generalized interpolation; they involve a prefiltering step when correctly applied. We explain why the approximation order inherent in any basis function is important to limit interpolation artifacts. The decomposition theorem states that any basis function endowed with approximation order can be expressed as the convolution of a B-spline of the same order with another function that has none. This motivates the use of splines and spline-based functions as a tunable way to keep artifacts in check without any significant cost penalty. We discuss implementation and performance issues, and we provide experimental evidence to support our claims
Wavelet Theory Demystified
In this paper, we revisit wavelet theory starting from the representation of a scaling function as the convolution of a B-spline (the regular part of it) and a distribution (the irregular or residual part). This formulation leads to some new insights on wavelets and makes it possible to rederive the main results of the classical theoryâincluding some new extensions for fractional ordersâin a self-contained, accessible fashion. In particular, we prove that the B-spline component is entirely responsible for five key wavelet properties: order of approximation, reproduction of polynomials, vanishing moments, multiscale differentiation property, and smoothness (regularity) of the basis functions. We also investigate the interaction of wavelets with differential operators giving explicit time domain formulas for the fractional derivatives of the basis functions. This allows us to specify a corresponding dual wavelet basis and helps us understand why the wavelet transform provides a stable characterization of the derivatives of a signal. Additional results include a new peeling theory of smoothness, leading to the extended notion of wavelet differentiability in the -sense and a sharper theorem stating that smoothness implies order
Adaptive chaotic particle swarm algorithm for isogeometric multi-objective size optimization of FG plates
An effective multi-objective optimization methodology that combines the isogeometric analysis (IGA) and adaptive chaotic particle swarm algorithm is presented for optimizing ceramic volume fraction (CVF) distribution of functionally graded plates (FGPs) under eigenfrequencies. The CVF distribution is represented by the B-spline basis function. Mechanical behaviors of FGPs are obtained with NURBS-based IGA and the recently developed simple first-order shear theory. The design variables are the CVFs at control points in the thickness direction, and the optimization objective is to minimize the mass of structure and maximize the first natural frequency. A recently developed multi-objective adaptive chaotic particle swarm algorithm with high efficiency is employed as an optimizer. All desirable features of the developed approach will be illustrated through four numerical examples, confirming its effectiveness and reliability
- âŠ