Nonlinear stability and convergence of finite-difference methods for the “good” Boussinesq equation

Summary The good Boussinesq equationu _tt =–u _xxxx +u _xx +(u ²) _xx has recently been found to possess an interesting soliton-interaction mechanism. In this paper we study the nonlinear stability and the convergence of some simple finite-difference schemes for the numerical solution of problems involving the good Boussinesq equation. Numerical experimentas are also reported.     

Fully discrete Galerkin approximations of parabolic boundary-value problems with nonsmooth boundary data

Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL _p[O,T;L ₂()] norms for boundary conditions inL _p[O,T;L ₂()], 1p.     

Gaussian collocation via defect correction

Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h ²), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully.     

The Weierstrass mean

Theorem.Let the sequences {e _i ⁽ⁿ⁾ },i=1, 2, 3,n=0, 1, 2, ...be defined by where the e ⁽⁰⁾ s satisfy and where all square roots are taken positive. Then where the convergence is quadratic and monotone and where The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding.     

A shape-optimization technique for the capillary surface problem

Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme.     

Tracking poles and representing Hankel operators directly from data

Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL ² fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL ² which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF     

低场脉冲核磁共振测定二醋酸纤维素丝束中油剂

研究了采用低场脉冲核磁共振(NMR)测定二醋酸纤维素丝束油剂的新方法，给出NMR法测定二醋酸纤维素丝束油荆含量的标准曲线。同时对NMR法测量二醋酸纤维素丝束油荆不确定度进行了评估。结果表明，NMR法具有分析速度快、无污染、无损伤和准确度高的优点，适合于二醋酸纤维素丝束油荆的分析。     

Likelihood estimation of soft-core interaction potentials for Gibbsian point patterns

The likelihood method is developed for the analysis of socalled regular point patterns. Approximating the normalizing factor of Gibbs canonical distribution, we simultaneously estimate two parameters, one for the scale and the other which measures the softness (or hardness), of repulsive interactions between points. The approximations are useful up to a considerably high density. Some real data are analyzed to illustrate the utility of the parameters for characterizing the regular point pattern.     

Asymptotic expansions andL ∞-error estimates for mixed finite element methods for second order elliptic problems

Summary Asymptotic expansions for mixed finite element approximations of the second order elliptic problem are derived and Richardson extrapolation can be applied to increase the accuracy of the approximations. A new procedure, which is called the error corrected method, is presented as a further application of the asymptotic error expansion for the first order BDM approximation of the scalar field. The key point in deriving the asymptotic expansions for the error is an establishment ofL ¹-error estimates for mixed finite element approximations for the regularized Green's functions. As another application of theL ¹-error estimates for the regularized Green's functions, we shall present maximum norm error estimates for mixed finite element methods for second order elliptic problems.     

A fast ‘Monte-Carlo cross-validation’ procedure for large least squares problems with noisy data

Summary We propose a fast Monte-Carlo algorithm for calculating reliable estimates of the trace of the influence matrixA involved in regularization of linear equations or data smoothing problems, where is the regularization or smoothing parameter. This general algorithm is simply as follows: i) generaten pseudo-random valuesw ₁, ...,w _n , from the standard normal distribution (wheren is the number of data points) and letw=(w ₁, ...,w _n ) ^T , ii) compute the residual vectorw–A w, iii) take the normalized inner-product (w ^T (w–A w))/(w ^T w) as an approximation to (1/n)tr(I–A ). We show, both by theoretical bounds and by numerical simulations on some typical problems, that the expected relative precision of these estimates is very good whenn is large enough, and that they can be used in practice for the minimization with respect to of the well known Generalized Cross-Validation (GCV) function. This permits the use of the GCV method for choosing in any particular large-scale application, with only a similar amount of work as the standard residual method. Numerical applications of this procedure to optimal spline smoothing in one or two dimensions show its efficiency.