Smoothing effects on the IMR and ITR

This paper is a study of the effects of smoothing on the implicit midpoint rule (IMR) and the implicit trapezoidal rule (ITR) with implications for extrapolation of the numerical solution of ordinary differential equations. We extend the study of the well-known smoothing formula of Gragg to a two-step smoothing formula and compare the effectiveness of their use with the IMR and ITR for nonstiff and strongly stiff cases. We present an analysis of the Prothero-Robinson problem and as well as experimental results on linear and nonlinear problems.     

An extrapolation method with step size control for nonlinear Volterra integral equations

Summary In [6] it has been shown that the midpoint rule applied to second kind volterra integral equations possesses an asymptotic expansion in even powers of the stepsizeh. In this paper we describe an extrapolation method based on the midpoint rule, together with a mechanism of step size control.     

The Optimal Choice of the Smoothing Constant in an Inventory Control System

In controlling stock it is necessary to make some estimate of future demand for each stock item. Exponential smoothing is a convenient and automatic means of making such an estimate and the optimal choice of the smoothing constant alpha will depend upon the order of smoothing employed, the relative magnitudes of the random and systematic variations in demand which may occur, the replenishment lead time and also the manner in which the rule used for generating replenishment orders is formulated. The dependence both of optimal alpha and of the necessary safety stock upon these factors has been investigated by means of a model which is believed to be of wide application in industry, and a method has been developed for setting up decision rules for both single and multi-stage systems.     

The superconvergence of the composite midpoint rule for the finite-part integral

The composite midpoint rule is probably the simplest one among the Newton-Cotes rules for Riemann integral. However, this rule is divergent in general for Hadamard finite-part integral. In this paper, we turn this rule to a useful one and, apply it to evaluate Hadamard finite-part integral as well as to solve the relevant integral equation. The key point is based on the investigation of its pointwise superconvergence phenomenon, i.e., when the singular point coincides with some a priori known point, the convergence rate of the midpoint rule is higher than what is globally possible. We show that the superconvergence rate of the composite midpoint rule occurs at the midpoint of each subinterval and obtain the corresponding superconvergence error estimate. By applying the midpoint rule to approximate the finite-part integral and by choosing the superconvergence points as the collocation points, we obtain a collocation scheme for solving the finite-part integral equation. More interesting is that the inverse of the coefficient matrix of the resulting linear system has an explicit expression, by which an optimal error estimate is established. Some numerical examples are provided to validate the theoretical analysis.     

Asymptotic expansions for multistep methods applied to nonlinear Volterra integral equations of the second kind

Summary This paper deals with linear multistep methods applied to nonlinear, nonsingular Volterra integral equations of the second kind. Analogously to the theory of W.B. Gragg, the existence of asymptotic expansions in the stepsizeh is proved. Under certain conditions only even powers ofh occur. As a special case, the midpoint rule is treated, a short numerical example for the applicability to extrapolation techniques is given.     

Sélection automatique du paramètre de lissage pour l'estimation non paramétrique de la régression pour des données fonctionnelles

We study regression estimation when the explanatory variable is functional. Nonparametric estimates of the regression operator have been recently introduced. They depend on a smoothing factor which controls its behaviour, and the aim of our Note is to construct some data-driven criterion for choosing this smoothing parameter. The criterion can be formulated in terms of a functional version of cross-validation ideas. Under mild assumptions on the unknown regression operator, it is seen that this rule is asymptotically optimal. As by-products of this result, we state asymptotic equivalences for several measures of accuracy for nonparametric estimate of the regression operator. To cite this article: M. Rachdi, P. Vieu, C. R. Acad. Sci. Paris, Ser. I 341 (2005).     

Control of step size and order in extrapolation codes

Extrapolation of the semi-implicit midpoint rule is an effective way to solve stiff initial value problems for a system of ordinary differential equations. The theory of the control of step size and order is advanced by investigating questions not taken up before, providing additional justification for some algorithms, and proposing an alternative to the information theory approach of Deuflhard. An experimental code SIMP implementing the algorithms proposed is shown to be as good as, and in some respects better than, the research code METAN1 of Bader and Deuflhard.     

Convexity results and sharp error estimates in approximate multivariate integration

An interesting property of the midpoint rule and the trapezoidal rule, which is expressed by the so-called Hermite-Hadamard inequalities, is that they provide one-sided approximations to the integral of a convex function. We establish multivariate analogues of the Hermite-Hadamard inequalities and obtain access to multivariate integration formulae via convexity, in analogy to the univariate case. In particular, for simplices of arbitrary dimension, we present two families of integration formulae which both contain a multivariate analogue of the midpoint rule and the trapezoidal rule as boundary cases. The first family also includes a multivariate analogue of a Maclaurin formula and of the two-point Gaussian quadrature formula; the second family includes a multivariate analogue of a formula by P.C. Hammer and of Simpson's rule. In both families, we trace out those formulae which satisfy a Hermite-Hadamard inequality. As an immediate consequence of the latter, we obtain sharp error estimates for twice continuously differentiable functions.

     

AMlet,RAMlet, and GAMlet: Automatic Nonlinear Fitting of Additive Models,Robust and Generalized,With Wavelets

A simple and yet powerful method is presented to estimate nonlinearly and nonparametrically the components of additive models using wavelets. The estimator enjoys the good statistical and computational properties of the Waveshrink scatterplot smoother and it can be efficiently computed using the block coordinate relaxation optimization technique. A rule for the automatic selection of the smoothing parameters, suitable for data mining of large datasets, is derived. The wavelet-based method is then extended to estimate generalized additive models. A primal-dual log-barrier interior point algorithm is proposed to solve the corresponding convex programming problem. Based on an asymptotic analysis, a rule for selecting the smoothing parameters is derived, enabling the estimator to be fully automated in practice. We illustrate the finite sample property with a Gaussian and a Poisson simulation.     

A smoothing Newton method for NCPs with the P0-property

In this paper, we first investigate a two-parametric class of smoothing functions which contains the penalized smoothing Fischer-Burmeister function and the penalized smoothing CHKS function as special cases. Then we present a smoothing Newton method for the nonlinear complementarity problem based on the class of smoothing functions. Issues such as line search rule, boundedness of the level set, global and quadratic convergence are studied. In particular, we give a line search rule containing the common used Armijo-type line search rule as a special case. Also without requiring strict complementarity assumption at the P₀-NCP solution or the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Preliminary numerical results show the efficiency of the algorithm and provide efficient domains of the two parameters for the complementarity problems.     

Suboptimal Kronrod extension formulae for numerical quadrature

Summary We consider cases where the Stieltjes polynomial associated with a Gaussian quadrature formula has complex zeros. In such cases a Kronrod extension of the Gaussian rule does not exist. A method is described for modifying the Stieltjes polynomial so that the resulting polynomial has no complex zeros. The modification is performed in such a way that the Kronrod-type extension rule resulting from the addition of then+1 zeros of the modified Stieltjes polynomial to the original knots of the Gaussian rule has only slightly lower degree of precision than normally achieved when the Kronrod extension rule exists. As examples of the use of the method, we present some new formulae extending the classical Gauss-Hermite quadrature rules. We comment on the limited success of the method in extending Gauss-Laguerre rules and show that several modified extensions of the Gauss Gegenbauer formulae exist in cases where the standard Kronrod extension does not.     

Numerical integrators based on modified differential equations

Inspired by the theory of modified equations (backward error analysis), a new approach to high-order, structure-preserving numerical integrators for ordinary differential equations is developed. This approach is illustrated with the implicit midpoint rule applied to the full dynamics of the free rigid body. Special attention is paid to methods represented as B-series, for which explicit formulae for the modified differential equation are given. A new composition law on B-series, called substitution law, is presented.

     

求解摩擦接触问题的一个非内点光滑化算法

给出了一个求解三维弹性有摩擦接触问题的新算法,即基于NCP函数的非内点光滑化算法．首先通过参变量变分原理和参数二次规划法,将三维弹性有摩擦接触问题的分析归结为线性互补问题的求解;然后利用NCP函数,将互补问题的求解转换为非光滑方程组的求解;再用凝聚函数对其进行光滑化,最后用NEWTON法解所得到的光滑非线性方程组．方法具有易于理解及实现方便等特点．通过线性互补问题的数值算例及接触问题实例证实了该算法的可靠性与有效性．     

Trapezoidal and midpoint splittings for initial-boundary value problems

In this paper we consider various multi-component splittings based on the trapezoidal rule and the implicit midpoint rule. It will be shown that an important requirement on such methods is internal stability. The methods will be applied to initial-boundary value problems. Along with a theoretical analysis, some numerical test results will be presented.

     

Determination of an Optimal Forecast Model for Ambulance Demand Using Goal Programming

A multistep approach to determining the optimal parameters of an exponential smoothing model was used to forecast emergency medical service (E.M.S.) demand for four counties of South Carolina. Daily emergency and routine (non-emergency) demand data were obtained and forecast statistics generated for each county sampled, using Winters' exponential smoothing model. A goal programme was formulated to combine forecast results for emergency calls with routine call forecasts. The goal programme gave a higher priority to accurate forecasting of emergency demand. The forecast model generated implicitly weights demand by severity and provides a reliable estimate of demand overall. The optimal parameter values for the smoothing model were obtained by minimizing the objective function value of the goal programming problem. The parameter values obtained were used to forecast demand for E.M.S. in the selected counties. The results of the model were compared to those using a multiple linear regression model and a single-objective-based exponential smoothing model for 2 months of data. When compared with two single-objective forecast models, the multiple-objective approach yielded more accurate forecasts and, therefore, was more cost-effective for the planner. The model presents and demonstrates a theoretical approach to improving the accuracy of ambulance demand forecasts. The possible impact of this approach on planning efficiency is discussed.     

Numerical solution of a certain hypersingular integral equation of the first kind

In this paper, we first discuss the midpoint rule for evaluating hypersingular integrals with the kernel sin ⁻²[(x−s)/2] defined on a circle, and the key point is placed on its pointwise superconvergence phenomenon. We show that this phenomenon occurs when the singular point s is located at the midpoint of each subinterval and obtain the corresponding supercovergence analysis. Then we apply the rule to construct a collocation scheme for solving the relevant hypersingular integral equation, by choosing the midpoints as the collocation points. It’s interesting that the inverse of coefficient matrix for the resulting linear system has an explicit expression, by which an optimal error estimate is established. At last, some numerical experiments are presented to confirm the theoretical analysis.     

Numerical solution of a heat diffusion problem by boundary element methods using the Laplace transform

This paper is concerned with a heat diffusion problem in a half-space which is motivated by the detection of material defects using thermal measurements. This problem is solved by inverting the Laplace transform with respect to time on a contour in the complex plane using an exponentially convergent quadrature rule. This leads to a finite number of time-independent problems, which can be solved in parallel using boundary integral equation methods. We provide a full numerical analysis of this scheme on compact time intervals. Our results are formulated in a way that they can easily be used for other diffusion problems in exterior or interior domains.     

Computational aspects of Boolean cubature

Boolean methods of interpolation [1,4] have been applied to construct multivariate quadrature rules for periodic functions of Korobov classes which are comparable with lattice rules of numerical integration [6,7]. In particular, we introducedd-variate Boolean trapezoidal rules [3,4] andd-variate Boolean midpoint rules [2,4]. The basic tools for constructing Boolean midpoint rules are Boolean midpoint sums. It is the purpose of this paper to use a modification of these Boolean midpoint sums to compute Boolean trapezoidal rules in an efficient way.     

Capacitated Lot Sizing for Injection Moulding: A Case Study

This paper considers the medium-term production smoothing problem for the injection moulding department of a Belgian firm. The problem is formulated as a series of one machine capacitated dynamic lot sizing problems, which are then solved by heuristic procedures. Computational results for real-life data are presented. It follows that the capacitated lot sizing approach succeeds in smoothing production such that subcontracting, which was often necessary with the E.O.Q. approach used by the firm, could be avoided in the future. Moreover, total set-up and inventory costs are reduced by about 20%.     

On convergence of a smoothing Broyden-like method for P0-NCP

A smoothing Broyden-like method is proposed for solving nonlinear complementarity problem in this paper. The algorithm considered here is based on the smooth approximation Fischer–Burmeister function and makes use of the line search rule of Li and Fukushima [A derivative-free line search and global convergence of Broyden-like method for nonlinear equations, Optim. Methods Software 13(3) (2000) 181–201]. Under suitable conditions, the iterates generated by the proposed method converge to a solution of the nonlinear complementarity problem globally and superlinearly.