共查询到20条相似文献,搜索用时 296 毫秒
1.
An automatic quadrature method is presented for approximating fractional derivative Dqf(x) of a given function f(x), which is defined by an indefinite integral involving f(x). The present method interpolates f(x) in terms of the Chebyshev polynomials in the range [0, 1] to approximate the fractional derivative Dqf(x) uniformly for 0≤x≤1, namely the error is bounded independently of x. Some numerical examples demonstrate the performance of the present automatic method. 相似文献
2.
We study the problem (−Δ)su=λeu in a bounded domain Ω⊂Rn, where λ is a positive parameter. More precisely, we study the regularity of the extremal solution to this problem. Our main result yields the boundedness of the extremal solution in dimensions n≤7 for all s∈(0,1) whenever Ω is, for every i=1,...,n, convex in the xi-direction and symmetric with respect to {xi=0}. The same holds if n=8 and s?0.28206..., or if n=9 and s?0.63237.... These results are new even in the unit ball Ω=B1. 相似文献
3.
4.
We derive a Molchan–Golosov-type integral transform which changes fractional Brownian motion of arbitrary Hurst index K into fractional Brownian motion of index H. Integration is carried out over [0,t], t>0. The formula is derived in the time domain. Based on this transform, we construct a prelimit which converges in L2(P)-sense to an analogous, already known Mandelbrot–Van Ness-type integral transform, where integration is over (−∞,t], t>0. 相似文献
5.
6.
Let us fix a function f(n)=o(nlnn) and real numbers 0≤α<β≤1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both. 相似文献
7.
For a Gaussian process X and smooth function f, we consider a Stratonovich integral of f(X), defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on X such that the sequence converges in law. This gives a change-of-variable formula in law with a correction term which is an Itô integral of f? with respect to a Gaussian martingale independent of X. The proof uses Malliavin calculus and a central limit theorem from Nourdin and Nualart (2010) [8]. This formula was known for fBm with H=1/6 Nourdin et al. (2010) [9]. We extend this to a larger class of Gaussian processes. 相似文献
8.
For α∈R, let pR(t,x,x) denote the diagonal of the transition density of the α-Bessel process in (0,1], killed at 0 and reflected at 1. As a function of x, if either α≥3 or α=1, then for t>0, the diagonal is nondecreasing. This monotonicity property fails if 1≠α<3. 相似文献
9.
Let I=[0,1] and let P be a partition of I into a finite number of intervals. Let τ1, τ2; I→I be two piecewise expanding maps on P . Let G⊂I×I be the region between the boundaries of the graphs of τ1 and τ2. Any map τ:I→I that takes values in G is called a selection of the multivalued map defined by G . There are many results devoted to the study of the existence of selections with specified topological properties. However, there are no results concerning the existence of selection with measure-theoretic properties. In this paper we prove the existence of selections which have absolutely continuous invariant measures (acim). By our assumptions we know that τ1 and τ2 possess acims preserving the distribution functions F(1) and F(2). The main result shows that for any convex combination F of F(1) and F(2) we can find a map η with values between the graphs of τ1 and τ2 (that is, a selection) such that F is the η-invariant distribution function. Examples are presented. We also study the relationship of the dynamics of our multivalued maps to random maps. 相似文献
10.
This paper is devoted to construct a family of fifth degree cubature formulae for n-cube with symmetric measure and n-dimensional spherically symmetrical region. The formula forn-cube contains at most n2+5n+3 points and for n-dimensional spherically symmetrical region contains only n2+3n+3 points. Moreover, the numbers can be reduced to n2+3n+1 and n2+n+1 if n=7 respectively, the latter of which is minimal. 相似文献
11.
12.
This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α is in (0,2), equal to 2, and in (2,∞), respectively. The partial sum weakly converges to a functional of α-stable process when α<2 and converges to a functional of Brownian motion when α≥2. When the process is of short-memory and α<4, the autocovariances converge to functionals of α/2-stable processes; and if α≥4, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α and β (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2-stable processes; (ii) Rosenblatt processes (indexed by β, 1/2<β<3/4); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1] with either (i) the J1 or the M1 topology (Skorokhod, 1956); or (ii) the weaker form S topology (Jakubowski, 1997). Some statistical applications are also discussed. 相似文献
13.
Jean-Stéphane Dhersin Fabian Freund Arno Siri-Jégousse Linglong Yuan 《Stochastic Processes and their Applications》2013
In this paper, we consider Beta(2−α,α) (with 1<α<2) and related Λ-coalescents. If T(n) denotes the length of a randomly chosen external branch of the n-coalescent, we prove the convergence of nα−1T(n) when n tends to ∞, and give the limit. To this aim, we give asymptotics for the number σ(n) of collisions which occur in the n-coalescent until the end of the chosen external branch, and for the block counting process associated with the n-coalescent. 相似文献
14.
The author deals with the quasilinear parabolic equation ut=[uα+g(u)]Δu+buα+1+f(u,∇u) with Dirichlet boundary conditions in a bounded domain Ω, where f and g are lower-order terms. He shows that, under suitable conditions on f and g, whether the solution is bounded or blows up in a finite time depends only on the first eigenvalue of −Δ in Ω with Dirichlet boundary condition. For some special cases, the result is sharp. 相似文献
15.
In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2, there are finitely many distance-regular graphs Γ with valency k, diameter D≥3 and v vertices satisfying v≤αk unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3, diameter D≥3 and c2≥εk for a given 0<ε<1 unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). 相似文献
16.
By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x), u>0 in Ω, u|∂Ω=∞, where Ω is a bounded domain with smooth boundary in RN, λ>0, g∈C1[0,∞) is increasing on [0,∞), g(0)=0, g′ is regularly varying at infinity with positive index ρ, the weight b, which is non-trivial and non-negative in Ω, may be vanishing on the boundary, and the inhomogeneous term h is non-negative in Ω and may be singular on the boundary. 相似文献
17.
In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε. The cost of the algorithm is polynomial in d and ε−1, while the number of qubits is polynomial in d and logε−1. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1), with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε. The cost of the algorithm is polynomial in d, ε−1 and δ−1, while the number of qubits is polynomial in d, logε−1 and logδ−1. 相似文献
18.
The paper concerns testing long memory for fractionally integrated nonlinear processes. We show that the exact local asymptotic power is of order O[(logn)−1] for four popular nonparametric tests and is O(m−1/2), where m is the bandwidth which is allowed to grow as fast as nκ, κ∈(0,2/3), for the semiparametric Lagrange multiplier (LM) test proposed by Lobato and Robinson [I. Lobato, P.M. Robinson, A nonparametric test for I(0), Rev. Econom. Stud. 68 (1998) 475–495]. Our theory provides a theoretical justification for the empirical findings in finite sample simulations by Lobato and Robinson [I. Lobato, P.M. Robinson, A nonparametric test for I(0), Rev. Econom. Stud. 68 (1998) 475–495] and Giraitis et al. [L. Giraitis, P. Kokoszka, R. Leipus, G. Teyssiére, Rescaled variance and related tests for long memory in volatility and levels, J. Econometrics 112 (2003) 265–294] that nonparametric tests have lower power than LM tests in detecting long memory. 相似文献
19.
We consider a multidimensional diffusion X with drift coefficient b(α,Xt) and diffusion coefficient ?σ(β,Xt). The diffusion sample path is discretely observed at times tk=kΔ for k=1…n on a fixed interval [0,T]. We study minimum contrast estimators derived from the Gaussian process approximating X for small ?. We obtain consistent and asymptotically normal estimators of α for fixed Δ and ?→0 and of (α,β) for Δ→0 and ?→0 without any condition linking ? and Δ. We compare the estimators obtained with various methods and for various magnitudes of Δ and ? based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework. 相似文献
20.
Paul-Emile Maing 《Nonlinear Analysis: Theory, Methods & Applications》2008,68(12):3913-3922
This paper is concerned with the Cauchy problem for the fast diffusion equation ut−Δum=αup1 in RN (N≥1), where m∈(0,1), p1>1 and α>0. The initial condition u0 is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value u0 so that u(t,x) blows up in finite time, and we show how to get estimates on the profile of u(t,x) for small enough values of t>0. 相似文献