Truncation Error on Wavelet Sampling Expansions

We estimate the truncation error of sampling expansions on translationinvariant spaces, generated by integer translations of a single functionand on wavelet subspaces of L ₂(R). As a byproduct of themain result, we get the classical Jagerman's bound for Shannon's samplingexpansions. We also examine this error on certain wavelet sampling expansions.     

Truncation and aliasing errors for Whittaker-Kotelnikov-Shannon sampling expansion

Let B _?? ^p , 1 ?? p < ??, be the space of all bounded functions from L _p (?) which can be extended to entire functions of exponential type ??. The uniform error bounds for truncated Whittaker-Kotelnikov-Shannon series based on local sampling are derived for functions f ?? B _?? ^p without decay assumption at infinity. Then the optimal bounds of the aliasing error and truncation error of Whittaker-Kotelnikov-Shannon expansion for non-bandlimited functions from Sobolev classes U(W _p ^r (?)) are determined up to a logarithmic factor.     

A Quadrature Formula Based On Sampling In Meyer Wavelet Subspaces

In this paper we discuss a weighted trapezoidal rule based on sampling in Meyer wavelet subspaces. For a wide class of functions, we obtain convergence and error bounds. Some examples are given to construct sampling functions.     

Local error analysis for approximate solutions of hyperbolic conservation laws

We consider approximate solutions to nonlinear hyperbolic conservation laws. If the exact solution is unavailable, the truncation error may be the only quantitative measure for the quality of the approximation. We propose a new way of estimating the local truncation error, through the use of localized test-functions. In the convex scalar case, they can be converted intoL _loc estimates, following theLip convergence theory developed by Tadmor et al. Comparisons between the local truncation error and theL _loc -error show remarkably similar behavior. Numerical results are presented for the convex scalar case, where the theory is valid, as well as for nonconvex scalar examples and the Euler equations of gas dynamics. The local truncation error has proved a reliable smoothness indicator and has been implemented in adaptive algorithms in [Karni, Kurganov and Petrova, J. Comput. Phys. 178 (2002) 323–341].     

Error estimates for irregular sampling of band-limited functions on a locally compact Abelian group

Band-limited functions f can be recovered from their sampling values (f(x_i)) by means of iterative methods, if only the sampling density is high enough. We present an error analysis for these methods, treating the typical forms of errors, i.e., jitter error, truncation error, aliasing error, quantization error, and their combinations. The derived apply uniformly to whole families of spaces, e.g., to weighted L^p-spaces over some locally compact Abelian group with growth rate up to some given order. In contrast to earlier papers we do not make use of any (relative) separation condition on the sampling sets. Furthermore we discard the assumption on polynomial growth of the weights that has been used over Euclidean spaces. Consequently, even for the case of regular sampling, i.e., sampling along lattices in G, the results are new in the given generality.     

Alternating group explicit method for the diffusion equation

A new alternating group explicit method is presented for the finite difference solution of the diffusion equation. The new method uses stable asymmetric approximations to the partial differential equation which, when coupled in groups of two adjacent points on the grid, result in implicit equations which can be easily converted to explicit form and which offer many advantages. By judicious alternation of this strategy on the grid points of the domain an algorithm which possesses unconditional stability is obtained. This approach also results in more accurate solutions because of truncation error cancellations. The stability, consistency, convergence and truncation error of the new method are briefly discussed and the results of numerical experiments presented.     

The construction of high order convergent look-ahead finite difference formulas for Zhang Neural Networks

ABSTRACT

Zhang Neural Networks rely on convergent 1-step ahead finite difference formulas of which very few are known. Those which are known have been constructed in ad-hoc ways and suffer from low truncation error orders. This paper develops a constructive method to find convergent look-ahead finite difference schemes of higher truncation error orders. The method consists of seeding the free variables of a linear system comprised of Taylor expansion coefficients followed by a minimization algorithm for the maximal magnitude root of the formula's characteristic polynomial. This helps us find new convergent 1-step ahead finite difference formulas of any truncation error order. Once a polynomial has been found with roots inside the complex unit circle and no repeated roots on it, the associated look-ahead ZNN discretization formula is convergent and can be used for solving any discretized ZNN based model. Our method recreates and validates the few known convergent formulas, all of which have truncation error orders at most 4. It also creates new convergent 1-step ahead difference formulas with truncation error orders 5 through 8.     

改进的Cotes公式及其误差分析

The truncation error of improved Cotes formula is presented in this paper.It also displays an analysis on convergence order of improved Cotes formula.Examples of numerical calculation is given in the end.     

用加权平均方法构造新的隐式线性多步法公式

在已知的线性多步法公式中,用两个较适合的线性多步法进行加权平均就能构造出一系列新的隐式线性多步法公式,而且其中有些公式可能具有较好的性质,如稳定域增大.从而使得解刚性方程时,可以根据对稳定域与截断误差不同的需求来选择公式,以达到在适合的稳定域下,截断误差最小.经过数值试验验证,本文举出的实例中用加权平均方法构造出的有些新公式的稳定域大于原来两个公式任一个的稳定域,可应用于求解常微分方程初值问题的刚性问题.     

Nonparametric estimation under length-biased sampling and Type I censoring: A moment based approach

Observation of lifetimes by means of cross-sectional surveys typically results in left-truncated, right-censored data. In some applications, it may be assumed that the truncation variable is uniformly distributed on some time interval, leading to the so-called length-biased sampling. This information is relevant, since it allows for more efficient estimation of survival and related parameters. In this work we introduce and analyze new empirical methods in the referred scenario, when the sampled lifetimes are at risk of Type I censoring from the right. We illustrate the method with real economic data. Work supported by the Grants PGIDIT02PXIA30003PR and BFM2002-03213.     

On truncations and perturbations of Markov decision problems with an application to queueing network overflow control

Conditions are provided to derive error bounds on the effect of truncations and perturbations in Markov decision problems. Both the average and finite horizon case are studied. As an application, an explicit error bound is obtained for a truncation of a Jacksonian queueing network with overflow control.     

三维热传导方程的一族两层显式格式

提出了一族三维热传导方程的两层显式差分格式,当截断误差阶为O(Δt+(Δx)2)时,稳定性条件为网格比r=Δt/(Δx)2=Δt/(Δy)2=Δt/(Δz)2≤1/2,优于其他显式差分格式。而当截断误差阶为O((Δt)2+(Δx)4)时,稳定性条件为r≤1/6,包含了已有的结果。     

二维抛物型方程的一族高精度分支稳定显格式

1 引言 在渗流、扩散、热传导等领域中经常会遇到求解二维抛物型方程的初边值问题 {(6)u/(6)=a((6)2u/(6)x2+(6)2u/(6)y2), 0＜x,y＜L,t＞0,a＞0u(x, y, 0) =φ(x, y), 0 ≤ x, y ≤ L (1)u(0,y,t) =f1(y,t),u(L,y,t) =f2...     

解三维抛物型方程的一个高精度显式差分格式

提出了求解三维抛物型方程的一个高精度显式差分格式.首先,推导了一个特殊节点处一阶偏导数(■u)/(■/t)的一个差分近似表达式,利用待定系数法构造了一个显式差分格式,通过选取适当的参数使格式的截断误差在空间层上达到了四阶精度和在时间层上达到了三阶精度.然后,利用Fourier分析法证明了当r1/6时,差分格式是稳定的.最后,通过数值试验比较了差分格式的解与精确解的区别,结果说明了差分格式的有效性.     

三维抛物型方程的一个高精度恒稳定的PC格式

对三维抛物型方程,构造了一个高精度恒稳定的PC格式,格式的截断误差阶达到O（△t^2＋△x^4）,通过数值实例验证了所得格式较现有的同类格式的精度提高了二位以上有效数字;然后将Richardson外推法应用于本文格式,得到了具有O（△t^3＋△x^6）阶精度的近似解,并将所得格式推广到了四维情形．     

Nordsieck representation of DIMSIMs

A new representation for diagonally implicit multistage integration methods (DIMSIMs) is derived in which the vector of external stages directly approximates the Nordsieck vector. The methods in this formulation are zero-stable for any choice of variable mesh. They are also easy to implement since changing step-size corresponds to a simple rescaling of the vector of external approximations. The paper contains an analysis of local truncation error and of error accumulation in a variable step-size situation. This revised version was published online in June 2006 with corrections to the Cover Date.     

解三维热传导方程的一族对称含参数高精度的显式差分格式

对求解三维热传导方程利用待定参数法构造出一族对称的含参数的，截断误差为Ｏ（Δｔ＾１＋Δｘ＾４＋Δｙ＾４＋Δｚ＾４）的便于计算的三层显格式，并讨论了其条件稳定性。     

解三维抛物型方程的一个ADI格式

构造了一个解三维抛物型方程的高精度ADI格式,格式绝对稳定,截断误差为O（△t^2＋△x^4）;然后应用Richerdson外推法,外推一次得到了具有O（△t^3＋△x^6）阶精度的近似解.     

关于Thiele型向量值连分式收敛定理的一个注记

本文利用推广的向量连分式向后递推算法重新给出了文[3]中定理1的证明,并改进了其结果。最后,在稍强的条件下,给出了这一类收敛向量连分式的一个更精致的截断误差估计。     

Regularization of a two-dimensional strongly damped wave equation with statistical discrete data

In this paper, we consider an inverse problem for a strongly damped wave equation in two dimensional with statistical discrete data. Firstly, we give a representation for the solution and then present a discretization form of the Fourier coefficients. Secondly, we show that the solution does not depend continuously on the data by stating a concrete example, which makes the solution be not stable and thus the present problem is ill-posed in the sense of Hadamard. Next, we use the trigonometric least squares method associated with the Fourier truncation method to regularize the instable solution of the problem. Finally, the convergence rate of the error between the regularized solution and the sought solution is estimated and also investigated numerically.