The method of regularization with the Gaussian reproducing kernel is popular in the machine learning literature and successful in many practical applications. In this paper we consider the periodic version of the Gaussian kernel regularization. We show in the white noise model setting, that in function spaces of very smooth functions, such as the infinite-order Sobolev space and the space of an...

Abstract A new method for finding the exact solutions of systems of linear equations is presented. Advantage of this method is the simplicity of the procedure. There are no additional constraint conditions. The method can avoid evaluation of determinants and matrix computation, and this reduces the amount of computation. Also, the method is valid when the coefficient matrix of the linear system...

Recent advances of kernel methods have yielded a framework for representing probabilities using a reproducing kernel Hilbert space, called kernel embedding of distributions. In this paper, we propose a Monte Carlo filtering algorithm based on kernel embeddings. The proposed method is applied to state-space models where sampling from the transition model is possible, while the observation model ...

We investigate the construction of all reproducing kernel Hilbert spaces of functions on a domain Ω ⊂ R that have a countable sampling set Λ ⊂ Ω. We also characterize all the reproducing kernel Hilbert spaces that have a prescribed sampling set. Similar problems are considered for reproducing kernel Banach spaces, but now with respect to Λ as a p-sampling set. Unlike the general p-frames, we pr...

This manuscript presents a method for the numerical solution of the Cauchy type singular integral equations of the first kind, over a finite segment which is bounded at the end points of the finite segment. The Chebyshev polynomials of the second kind with the corresponding weight function have been used to approximate the density function. The force function is approximated by using the Chebys...

Purpose: In this paper, we shall present an algorithm for solving more general singular second-order multi-point boundary value problems. Methods: The algorithm is based on the quasilinearization technique and the reproducing kernel method for linear multi-point boundary value problems. Results: Three numerical examples are given to demonstrate the efficiency of the present method. Conclusions:...

Abstract. Interests in meshfree (or meshless) methods have grown rapidly in the recent years in solving boundary value problems arising in mechanics, especially in dealing with difficult problems involving large deformation, moving discontinuities, etc. Rigorous error estimates of a meshfree method, the reproducing kernel particle method (RKPM), have been theoretically derived and experimentall...

In this part of the work, a notion of generalized enrichment is proposed to construct the global partition polynomials or to enrich global partition polynomial basis with extra terms corresponding to the higher order derivatives of primary variable. This is accomplished by either multiplying enrichment functions with the original global partition polynomials, or increasing the order of global p...