27 research outputs found

    Reproducing Kernels of Generalized Sobolev Spaces via a Green Function Approach with Distributional Operators

    Full text link
    In this paper we introduce a generalized Sobolev space by defining a semi-inner product formulated in terms of a vector distributional operator P\mathbf{P} consisting of finitely or countably many distributional operators PnP_n, which are defined on the dual space of the Schwartz space. The types of operators we consider include not only differential operators, but also more general distributional operators such as pseudo-differential operators. We deduce that a certain appropriate full-space Green function GG with respect to L:=PTPL:=\mathbf{P}^{\ast T}\mathbf{P} now becomes a conditionally positive definite function. In order to support this claim we ensure that the distributional adjoint operator P\mathbf{P}^{\ast} of P\mathbf{P} is well-defined in the distributional sense. Under sufficient conditions, the native space (reproducing-kernel Hilbert space) associated with the Green function GG can be isometrically embedded into or even be isometrically equivalent to a generalized Sobolev space. As an application, we take linear combinations of translates of the Green function with possibly added polynomial terms and construct a multivariate minimum-norm interpolant sf,Xs_{f,X} to data values sampled from an unknown generalized Sobolev function ff at data sites located in some set XRdX \subset \mathbb{R}^d. We provide several examples, such as Mat\'ern kernels or Gaussian kernels, that illustrate how many reproducing-kernel Hilbert spaces of well-known reproducing kernels are isometrically equivalent to a generalized Sobolev space. These examples further illustrate how we can rescale the Sobolev spaces by the vector distributional operator P\mathbf{P}. Introducing the notion of scale as part of the definition of a generalized Sobolev space may help us to choose the "best" kernel function for kernel-based approximation methods.Comment: Update version of the publish at Num. Math. closed to Qi Ye's Ph.D. thesis (\url{http://mypages.iit.edu/~qye3/PhdThesis-2012-AMS-QiYe-IIT.pdf}

    Global well-posedness for a nonlocal Gross-Pitaevskii equation with non-zero condition at infinity

    Get PDF
    We study the Gross-Pitaevskii equation involving a nonlocal interaction potential. Our aim is to give sufficient conditions that cover a variety of nonlocal interactions such that the associated Cauchy problem is globally well-posed with non-zero boundary condition at infinity, in any dimension. We focus on even potentials that are positive definite or positive tempered distributions.Comment: Communications in Partial Differential Equations (2010

    Kernel-based Collocation Methods versus Galerkin Finite Element Methods for Approximating Elliptic Stochastic Partial Differential Equations

    No full text
    Summary. We compare a kernel-based collocation method (meshfree approximation method) with a Galerkin finite element method for solving elliptic stochastic partial differential equations driven by Gaussian noise. The kernel-based collocation solution is a linear combination of reproducing kernels obtained from related differential and boundary operators centered at chosen collocation points. Its random coefficients are obtained by solving a system of linear equations with multiple random right-hand sides. The finite element solution is given as a tensor product of triangular finite elements and Lagrange polynomials defined on a finite-dimensional probability space. Its coefficients are obtained by solving several deterministic finite element problems. For the kernel-based collocation method, we directly simulate the (infinite-dimensional) Gaussian noise at the collocation points. For the finite element method, however, we need to truncate the Gaussian noise into finite-dimensional noises. According to our numerical experiments, the finite element method has the same convergence rate as the kernel-based collocation method provided the Gaussian noise is truncated using a suitable number terms. Key words: Kernel-based collocation, meshfree approximation, Galerkin finite element, elliptic stochastic partial differential equations, Gaussian fields, reproducing kernel.

    Swarm Interpolation Using an Approximate Chebyshev Distribution

    No full text
    corecore