On the rate of convergence of recursive kernel estimates of probability densities

1988 ◽  
Vol 16 (4) ◽  
pp. 399-409 ◽  
Author(s):  
K. I. Abdul-Al
1992 ◽  
Vol 91 (1) ◽  
pp. 133-133
Author(s):  
Peter Hall ◽  
J. S. Marron

1995 ◽  
Vol 23 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Peter Hall ◽  
Tien Chung Hu ◽  
J. S. Marron

1986 ◽  
Vol 23 (04) ◽  
pp. 1019-1024
Author(s):  
Walter Van Assche

The limit of a product of independent 2 × 2 stochastic matrices is given when the entries of the first column are independent and have the same symmetric beta distribution. The rate of convergence is considered by introducing a stopping time for which asymptotics are given.


1997 ◽  
Vol 37 (3) ◽  
pp. 191-206
Author(s):  
A. Basalykas

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 880
Author(s):  
Igoris Belovas

In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results of Hwang and Bender, we obtain a constructive proof of the central limit theorem, specifying the rate of convergence to the limiting (normal) distribution, as well as a new proof of the local limit theorem for the numbers of the tribonacci triangle.


2020 ◽  
Vol 20 (4) ◽  
pp. 783-798
Author(s):  
Shukai Du ◽  
Nailin Du

AbstractWe give a factorization formula to least-squares projection schemes, from which new convergence conditions together with formulas estimating the rate of convergence can be derived. We prove that the convergence of the method (including the rate of convergence) can be completely determined by the principal angles between {T^{\dagger}T(X_{n})} and {T^{*}T(X_{n})}, and the principal angles between {X_{n}\cap(\mathcal{N}(T)\cap X_{n})^{\perp}} and {(\mathcal{N}(T)+X_{n})\cap\mathcal{N}(T)^{\perp}}. At the end, we consider several specific cases and examples to further illustrate our theorems.


Sign in / Sign up

Export Citation Format

Share Document