A note on the complexity and tractability of the heat equation

We wish to solve the heat equation u_t=Δu-qu in I^d×(0,T), where I is the unit interval and T is a maximum time value, subject to homogeneous Dirichlet boundary conditions and to initial conditions u(·,0)=f over I^d. We show that this problem is intractable if f belongs to standard Sobolev spaces, even if we have complete information about q. However, if f and q belong to a reproducing kernel Hilbert space with finite-order weights, we can show that the problem is tractable, and can actually be strongly tractable.     

Moment vanishing properties of harmonic Bergman functions

We show that Poisson integrals belonging to certain weighted harmonic Bergman spaces b_δ^p on the upper half-space must have the moment vanishing properties. As an application, we show that b₀^p, p?1, contains a dense subspace whose members have the horizontal moment vanishing properties. Also, we derive related weighted norm inequalities for Poisson integrals. As a consequence, we obtain a characterization for Poisson integrals of continuous functions with compact support in order to belong to b_δ^p.     

Weighted approximation of functions on the real line by Bernstein polynomials

The authors give error estimates, a Voronovskaya-type relation, strong converse results and saturation for the weighted approximation of functions on the real line with Freud weights by Bernstein-type operators.     

Preservation of transform orders under a semiparametric model and its mixture

In this paper, sufficient conditions for preservation of several transform orders under a typical family of semiparametric distributions are made. The preservation properties are developed to compare mixture semiparametric distributions. Possible applications of the achieved results to compare scale family of distributions and also compare coherent systems with dependent but identical components and series and parallel systems with randomized number of components are provided.     

Multiplicity of Solutions of the Weighted p-Laplacian with Isolated Singularity and Diffusion Suppressed by Convection

In this paper, the authors study the multiplicity of solutions to the weighted p-Laplacian with isolated singularity and di?usion suppressed by convection ?div(|x|^α|?u|^p?2?u) + λ 1/|x|^β |?u|^p?2?u · x = |x|^γg(|x|) in B \ {0} subject to nonlinear Robin boundary value condition |x|^α|?u|^p?2?u · ?n = A ? ρu on ?B,where λ > 0, B ? R^N(N ≥ 2) is the unit ball centered at the origin, α > 0, p > 1, β ∈ R, γ > ?N, g ∈ C([0,1]) with g(0) > 0, A ∈ R, ρ > 0 and ?n is the unit outward normal. The same problem with di?usion promoted by convection, namely λ ≤ 0, has already been discussed by the last two authors (Song-Yin (2012)), where the existence, nonexistence and classi?cation of singularities for solutions are presented. Completely di?erent from [Song, H. J. and Yin, J. X., Removable isolated singularities of solutions to the weighted p-Laplacian with singular convection, Math. Meth. Appl. Sci., 35, 2012, 1089–1100], in the present case λ > 0, namely the di?usion is suppressed by the convection, non-singular solutions are not only existent but also may be in?nite which vary according only to the values of solutions at the isolated singular point. At the same time, the singular solutions may exist only if the di?usion dominates the convection.     

带有随机初值的复值Ginzburg-Landau方程的弱平均动力学*

本文研究了无界域上的带有随机初值的复值Ginzburg-Landau方程.首先, 基于解过程的全局适定性, 建立了带有随机初值的Ginzburg-Landau方程的平均随机动力系统.然后, 证明了弱拉回平均随机吸引子的存在唯一性以及随机吸引子的周期性,并将其进一步推广到加权空间L²(?, L²_σ(R)).     

Nonstationary Markov chains and convergence of the annealing algorithm

We study the asymptotic behavior as timet + of certain nonstationary Markov chains, and prove the convergence of the annealing algorithm in Monte Carlo simulations. We find that in the limitt + , a nonstationary Markov chain may exhibit phase transitions. Nonstationary Markov chains in general, and the annealing algorithm in particular, lead to biased estimators for the expectation values of the process. We compute the leading terms in the bias and the variance of the sample-means estimator. We find that the annealing algorithm converges if the temperatureT(t) goes to zero no faster thanC/log(t/t ₀) ast+, with a computable constantC andt ₀ the initial time. The bias and the variance of the sample-means estimator in the annealing algorithm go to zero likeO(t^–1+) for some 0<1, with =0 only in very special circumstances. Our results concerning the convergence of the annealing algorithm, and the rate of convergence to zero of the bias and the variance of the sample-means estimator, provide a rigorous procedure for choosing the optimal annealing schedule. This optimal choice reflects the competition between two physical effects: (a) The adiabatic effect, whereby if the temperature is loweredtoo abruptly the system may end up not in a ground state but in a nearby metastable state, and (b) the super-cooling effect, whereby if the temperature is loweredtoo slowly the system will indeed approach the ground state(s) but may do so extremely slowly.     

随机变量序列加权和的强收敛性

本文讨论了一般随机变量序列加权和的强收敛性．作为推论，得到一类鞅差序列加权和的收敛定理和若干经典的独立随机变量序列的强大数定律；已有的若干结论是本文结果的特例．     

同分布NA列Jamison型加权和强稳定的充要条件

本文将Ｊａｍｉｓｏｎ等（１９６５）关于ｉｉｄ列加权和强稳定的充分性结果推广到ＮＡ列的场合并且得到了ＮＡ列Ｊａｍｉｓｏｎ型加权和强稳定的必要性结果。     

A NUMERICALLY STABLE BLOCK MODIFIED GRAM-SCHMIDT ALGORITHM FOR SOLVING STIFF WEIGHTED LEAST SQUARES PROBLEMS

Recently, Wei in proved that perturbed stiff weighted pseudoinverses and stiff weighted least squares problems are stable, if and only if the original and perturbed coefficient matrices A and A^- satisfy several row rank preservation conditions. According to these conditions, in this paper we show that in general, ordinary modified Gram-Schmidt with column pivoting is not numerically stable for solving the stiff weighted least squares problem. We then propose a row block modified Gram-Schmidt algorithm with column pivoting, and show that with appropriately chosen tolerance, this algorithm can correctly determine the numerical ranks of these row partitioned sub-matrices, and the computed QR factor R^- contains small roundoff error which is row stable. Several numerical experiments are also provided to compare the results of the ordinary Modified Gram-Schmidt algorithm with column pivoting and the row block Modified Gram-Schmidt algorithm with column pivoting.