We give a short survey of a general discretization method based on the theory of reproducing kernels. We believe our method will become the next generation method for solving analytical problems by computers. For example, for solving linear PDEs with general boundary or initial value conditions, independently of the domains. Furthermore, we give an ultimate sampling formula and a realization of reproducing kern...
We found a very general discretization method for solving wide classes of mathematical problems by applying the theory of reproducing kernels. An illustration of the generality of the method is here performed by considering several distinct classes of problems to which the method is applied. In fact, one of the advantages of the present method -- in comparison to other well-known and well established methods --...
We would like to propose a new method in view to catch smoothing properties and analyticity of functions by computers. Of course, in the strict sense, such goal is impossible. However, we would like to propose some practical method that may be applied for many concrete cases for some good functions (but not for bad functions, in a sense). Therefore, this may be viewed as a procedure proposal which includes nume...