We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
For functions in
$C^k(\mathbb {R})$
which commute with a translation, we prove a theorem on approximation by entire functions which commute with the same translation, with a requirement that the values of the entire function and its derivatives on a specified countable set belong to specified dense sets. Using this theorem, we show that if A and B are countable dense subsets of the unit circle
$T\subseteq \mathbb {C}$
with
$1\notin A$
,
$1\notin B$
, then there is an analytic function
$h\colon \mathbb {C}\setminus \{0\}\to \mathbb {C}$
that restricts to an order isomorphism of the arc
$T\setminus \{1\}$
onto itself and satisfies
$h(A)=B$
and
$h'(z)\not =0$
when
$z\in T$
. This answers a question of P. M. Gauthier.
In the present paper, an inverse result of approximation, i.e. a saturation theorem for the sampling Kantorovich operators, is derived in the case of uniform approximation for uniformly continuous and bounded functions on the whole real line. In particular, we prove that the best possible order of approximation that can be achieved by the above sampling series is the order one, otherwise the function being approximated turns out to be a constant. The above result is proved by exploiting a suitable representation formula which relates the sampling Kantorovich series with the well-known generalized sampling operators introduced by Butzer. At the end, some other applications of such representation formulas are presented, together with a discussion concerning the kernels of the above operators for which such an inverse result occurs.
We establish the mapping properties of Fourier-type transforms on rearrangement-invariant quasi-Banach function spaces. In particular, we have the mapping properties of the Laplace transform, the Hankel transforms, the Kontorovich-Lebedev transform and some oscillatory integral operators. We achieve these mapping properties by using an interpolation functor that can explicitly generate a given rearrangement-invariant quasi-Banach function space via Lebesgue spaces.
We define fractal interpolation on unbounded domains for a certain class of topological spaces and construct local fractal functions. In addition, we derive some properties of these local fractal functions, consider their tensor products, and give conditions for local fractal functions on unbounded domains to be elements of Bochner–Lebesgue spaces.
For a prescribed set of lacunary data with equally spaced knot sequence in the unit interval, we show the existence of a family of fractal splines satisfying for v = 0, 1, … ,N and suitable boundary conditions. To this end, the unique quintic spline introduced by A. Meir and A. Sharma [SIAM J. Numer. Anal. 10(3) 1973, pp. 433-442] is generalized by using fractal functions with variable scaling parameters. The presence of scaling parameters that add extra “degrees of freedom”, self-referentiality of the interpolant, and “fractality” of the third derivative of the interpolant are additional features in the fractal version, which may be advantageous in applications. If the lacunary data is generated from a function Φ satisfying certain smoothness condition, then for suitable choices of scaling factors, the corresponding fractal spline satisfies , as the number of partition points increases.
The present work constitutes a fraction of a more extensive study that is devoted to numerical methods in acoustics. More precisely, we address here the interpolation process, which is more and more frequently used in Computational Acoustics–whether it is for enabling multi-stage hybrid calculations, or for easing the proper handling of complex configurations via advanced techniques such as Chimera grids or Immersed Boundary Conditions. In that regard, we focus on high-order interpolation schemes, so as to analyze their intrinsic features and to assess their effective accuracy. Taking advantage of specific insights that had been previously achieved by the present authors regarding standard high-order interpolation schemes (of centered nature), we here focus on their so-called spectral-like optimized counterparts (of both centered and noncentered nature). The latter spectral-like optimized schemes are analyzed thoroughly thanks to dedicated theoretical developments, which allow highlighting better what their strengths and weaknesses are. Among others, the various ways such interpolation schemes can degrade acoustic signals they are applied to are carefully investigated from a theoretical point-of-view. Besides that, specific criteria that could help in optimizing interpolation schemes better are provided, along with generic rules about how to minimize the signal degradation induced by existing interpolation schemes, in practice.
This paper extends an algorithm of P1-conservative interpolation on triangular meshes to tetrahedral meshes and thus constructs an approach of solution reconstruction for three-dimensional problems. The conservation property is achieved by local mesh intersection and the mass of a tetrahedron of the current mesh is calculated by the integral on its intersection with the background mesh. For each current tetrahedron, the overlapped background tetrahedrons are detected efficiently. A mesh intersection algorithm is proposed to construct the intersection of a current tetrahedron with the overlapped background tetrahedron and mesh the intersection region by tetrahedrons. A localization algorithm is employed to search the host units in background mesh for each vertex of the current mesh. In order to enforce the maximum principle and avoid the loss of monotonicity, correction of nodal interpolated solution on tetrahedral meshes is given. The performance of the present solution reconstruction method is verified by numerical experiments on several analytic functions and the solution of the flow around a sphere.
We consider a piecewise-multilinear interpolation of a continuous random field on a d-dimensional cube. The approximation performance is measured using the integrated mean square error. Piecewise-multilinear interpolator is defined by N-field observations on a locations grid (or design). We investigate the class of locally stationary random fields whose local behavior is like a fractional Brownian field, in the mean square sense, and find the asymptotic approximation accuracy for a sequence of designs for large N. Moreover, for certain classes of continuous and continuously differentiable fields, we provide the upper bound for the approximation accuracy in the uniform mean square norm.
We give a natural geometric condition that ensures that sequences of interpolation polynomials (of fixed degree) of sufficiently differentiable functions with respect to the natural lattices introduced by Chung and Yao converge to a Taylor polynomial.
The aim of this paper is to develop the mixed spectral and pseudospectral methods for nonlinear problems outside a disc, using Fourier and generalized Laguerre functions. As an example, we consider a nonlinear strongly damped wave equation. The mixed spectral and pseudospectral schemes are proposed. The convergence is proved. Numerical results demonstrate the efficiency of this approach.
The stochastic collocation method using sparse grids has become a popular choice for performing stochastic computations in high dimensional (random) parameter space. In addition to providing highly accurate stochastic solutions, the sparse grid collocation results naturally contain sensitivity information with respect to the input random parameters. In this paper, we use the sparse grid interpolation and cubature methods of Smolyak together with combinatorial analysis to give a computationally efficient method for computing the global sensitivity values of Sobol’. This method allows for approximation of all main effect and total effect values from evaluation of f on a single set of sparse grids. We discuss convergence of this method, apply it to several test cases and compare to existing methods. As a result which may be of independent interest, we recover an explicit formula for evaluating a Lagrange basis interpolating polynomial associated with the Chebyshev extrema. This allows one to manipulate the sparse grid collocation results in a highly efficient manner.
In this paper we derive local error estimates for radial basis function interpolation on the unit sphere . More precisely, we consider radial basis function interpolation based on data on a (global or local) point set for functions in the Sobolev space with norm , where s>1. The zonal positive definite continuous kernel ϕ, which defines the radial basis function, is chosen such that its native space can be identified with . Under these assumptions we derive a local estimate for the uniform error on a spherical cap S(z;r): the radial basis function interpolant ΛXf of satisfies , where h=hX,S(z;r) is the local mesh norm of the point set X with respect to the spherical cap S(z;r). Our proof is intrinsic to the sphere, and makes use of the Videnskii inequality. A numerical test illustrates the theoretical result.
We obtain necessary and sufficient conditions for mean convergence of Lagrange interpolation at zeros of orthogonal polynomials for weights on [-1, 1], such as
The aim of this paper is to continue our investigation of the Lebesgue function of weighted Lagrange interpolation by considering Erdős weights on ℝ and weights on [−1, 1]. The main results give lower bounds for the Lebesgue function on large subsets of the relevant domains.
Let where {λn}n ∈ Ζ is a sequence of real numbers such that |λn — n| ≤ Δ for some Δ > 0 and all n ∈ ℤ . Extending an obvious property of sin πz to which the function G reduces when Δ = 0 we show that is bounded by a constant independent of n. The result is then applied to a problem concerning derivative sampling in one and several variables.
Weighted LP mean convergence of Hermite-Fejér interpolation based on the zeros of orthogonal polynomials with respect to the weight |x|2α+1(l — x2)β(α, β > — 1) is investigated. A necessary and sufficient condition for such convergence for all continuous functions is given. Meanwhile divergence of Hermite-Fejér interpolation in LP with p > 2 is obtained. This gives a possible answer to Problem 17 of P. Turân [J. Approx. Theory, 29(1980), p. 40].
Let m, n be nonnegative integers and B(m+n) be a set of m + n + 1 real interpolation points (not necessarily distinct). Let Rm,n = Pm,n/Qm.n be the unique rational function with deg Pm,n ≤ m, deg Qm,n ≤ n, that interpolates ex in the points of B(m+n). If m = mv, n = nv with mv + nv → ∞, and mv / nv → λ as v → ∞, and the sets B(m+n) are uniformly bounded, we show that locally uniformly in the complex plane C, where the normalization Qm,n(0) = 1 has been imposed. Moreover, for any compact set K ⊂ C we obtain sharp estimates for the error |ez — Rm,n(z)| when z ∈ K. These results generalize properties of the classical Padé approximants. Our convergence theorems also apply to best (real) Lp rational approximants to ex on a finite real interval.
Let (ℋ, G, U) be a continuous representation of the Lie group G by bounded operators g ↦ U(g) on the Banach space ℋ and let (ℋ, g, dU) denote the representation of the Lie algebra g obtained by differentiation. If a1,…, ad′ is a Lie algebra basis of g and Ai = dU(ai) then we examine elliptic regularity properties of the subelliptic operators where (cij) is a real-valued strictly positive-definite matrix and c0, c1,…, cd′ ∈ C. We first introduce a family of Lipschitz subspaces ℋγ, γ > 0, of ℋ which interpolate between the Cn-subspaces of the representation and for which the parameter γ is a continuous measure of differentiability. Secondly, we give a variety of characterizations of the spaces in terms of the semigroup generated by the closure of H and the group representation. Thirdly, for sufficiently large values of Re c0 the fractional powers of the closure of H are defined, and we prove that D()γ⊆γ′, for γ′ < 2γ/r where r is the rank of the basis. Further we establish that 2γ/r is the optimal regularity value and it is attained for unitary representations or for the representations obtained by restricting U to ℋγ. Many other regularity properties are obtained.
A geometric characterization is given for a collection of points in ℝd to produce a singular l1 -distance matrix. Some quantitative results are established in terms of "characteristic matrices". The results in this paper generalize those of Dyn, Light and Cheney and have application to ridge function interpolation.
We investigate convergence in a weighted L1 -norm of Hermite-Fejér and Hermite interpolation at the zeros of orthogonal polynomials associated with weights on the real line. The results are then applied to convergences of product integration rules. From the point of view of orthogonal polynomials, the new feature is that Freud and Erdös weights are treated simultaneously and that relatively few assumptions are placed on the weight. From the point of view of product integration, the rules exhibit convergence for highly oscillatory kernels (for example) and for functions of rapid growth at infinity.