Nonparametric Estimation of Derivatives of Average of $\mu $-Densities with Convergence rates and Applications

1978 ◽  
Vol 35 (4) ◽  
pp. 637-649 ◽  
Author(s):  
R. S. Singh
2011 ◽  
Vol 14 (07) ◽  
pp. 979-1004
Author(s):  
CLAUDIO ALBANESE

Bidirectional valuation models are based on numerical methods to obtain kernels of parabolic equations. Here we address the problem of robustness of kernel calculations vis a vis floating point errors from a theoretical standpoint. We are interested in kernels of one-dimensional diffusion equations with continuous coefficients as evaluated by means of explicit discretization schemes of uniform step h > 0 in the limit as h → 0. We consider both semidiscrete triangulations with continuous time and explicit Euler schemes with time step so small that the Courant condition is satisfied. We find uniform bounds for the convergence rate as a function of the degree of smoothness. We conjecture these bounds are indeed sharp. The bounds also apply to the time derivatives of the kernel and its first two space derivatives. The proof is constructive and is based on a new technique of path conditioning for Markov chains and a renormalization group argument. We make the simplifying assumption of time-independence and use longitudinal Fourier transforms in the time direction. Convergence rates depend on the degree of smoothness and Hölder differentiability of the coefficients. We find that the fastest convergence rate is of order O(h2) and is achieved if the coefficients have a bounded second derivative. Otherwise, explicit schemes still converge for any degree of Hölder differentiability except that the convergence rate is slower. Hölder continuity itself is not strictly necessary and can be relaxed by an hypothesis of uniform continuity.


Author(s):  
Robert Gaunt

We use Stein's method to obtain explicit bounds on the rate of convergence for the Laplace approximation of two different sums of independent random variables; one being a random sum of mean zero random variables and the other being a deterministic sum of mean zero random variables in which the normalisation sequence is random. We make technical advances to the framework of Pike and Ren \cite {pike} for Stein's method for Laplace approximation, which allows us to give bounds in the Kolmogorov and Wasserstein metrics. Under the additional assumption of vanishing third moments, we obtain faster convergence rates in smooth test function metrics. As part of the derivation of our bounds for the Laplace approximation for the deterministic sum, we obtain new bounds for the solution, and its first two derivatives, of the Rayleigh Stein equation.


2016 ◽  
Vol 8 (6) ◽  
pp. 911-931 ◽  
Author(s):  
Jingtang Ma ◽  
Zhiqiang Zhou

AbstractThis paper studies a system of semi-linear fractional diffusion equations which arise in competitive predator-prey models by replacing the second-order derivatives in the spatial variables with fractional derivatives of order less than two. Moving finite element methods are proposed to solve the system of fractional diffusion equations and the convergence rates of the methods are proved. Numerical examples are carried out to confirm the theoretical findings. Some applications in anomalous diffusive Lotka-Volterra and Michaelis-Menten-Holling predator-prey models are studied.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
J. F. Wang ◽  
S. Y. Hao ◽  
Y. M. Cheng

The interpolating moving least-squares (IMLS) method is discussed in detail, and a simpler formula of the shape function of the IMLS method is obtained. Then, based on the IMLS method and the Galerkin weak form, an interpolating element-free Galerkin (IEFG) method for two-point boundary value problems is presented. The IEFG method has high computing speed and precision. Then error analysis of the IEFG method for two-point boundary value problems is presented. The convergence rates of the numerical solution and its derivatives of the IEFG method are presented. The theories show that, if the original solution is sufficiently smooth and the order of the basis functions is big enough, the solution of the IEFG method and its derivatives are convergent to the exact solutions in terms of the maximum radius of the domains of influence of nodes. For the purpose of demonstration, two selected numerical examples are given to confirm the theories.


2011 ◽  
Vol 61 (9) ◽  
pp. 989-1000 ◽  
Author(s):  
Jean-Paul Berrut ◽  
Michael S. Floater ◽  
Georges Klein

Sign in / Sign up

Export Citation Format

Share Document