Determination of the optimal initial function and the parameters for nonlinear time-delay systems

This paper deals with dynamic systems described by nonlinear differential-difference equations of retarded type. The problem considered is to determine the initial function and certain system parameters which minimize a given cost functional. A computational method is presented and some convergence results are given. Numerical examples of linear and nonlinear systems are also included.     

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.     

Comparison theorems forL-monosplines of minimal norm

Summary LetLM _N be the set of allL-monosplines withN free knots, prescribed by a pair (x;E) of pointsx = {x _i } ₁ ⁿ ,a <x ₁ < ... <x _n <b and an incidence matrixE = (e _ij ) _i=1 ⁿ , _r-1 ^j=0 with Denote byLM _N ^O the subset ofLM _N consisting of theL-monosplines withN simple knots (n=N). We prove that theL-monosplines of minimalL _p-norms inLM _N belong toLM _N ^O .The results are reformulated as comparison theorems for quadrature formulae.     

A method for computing the tension parameters in convexity-preserving spline-in-tension interpolation

Summary This paper is concerned with the problem of convexity-preservng (orc-preserving) interpolation by using Exponential Splines in Tension (or EST's). For this purpose the notion of ac-preserving interpolant, which is usually employed in spline-in-tension interpolation, is refined and the existence ofc-preserving EST's is established for the so-calledc-admissible data sets. The problem of constructing ac-preserving and visually pleasing EST is then treated by combining a generalized Newton-Raphson method, due to Ben-Israel, with a step-length technique which serves the need for visual pleasantness. The numerical performance of the so formed iterative scheme is discussed for several examples.     

Continued fractions associated with the Newton-Padé table

Summary We discuss first the block structure of the Newton-Padé table (or, rational interpolation table) corresponding to the double sequence of rational interpolants for the data{(z _k, h(z_k)} _k =0. (The (m, n)-entry of this table is the rational function of type (m,n) solving the linearized rational interpolation problem on the firstm+n+1 data.) We then construct continued fractions that are associated with either a diagonal or two adjacent diagonals of this Newton-Padé table in such a way that the convergents of the continued fractions are equal to the distinct entries on this diagonal or this pair of diagonals, respectively. The resulting continued fractions are generalizations of Thiele fractions and of Magnus'sP-fractions. A discussion of an some new results on related algorithms of Werner and Graves-Morris and Hopkins are also given.Dedicated to the memory of Helmut Werner (1931–1985)     

Solutions rationnelles de certaines équations fonctionnelles

Dans cet article, nous démontrons essentiellement les deux résultats suivants, qui montrent que les solutions séries formelles à coefficients dans de certaines équations fonctionnelles sont rationnelles. Soient tout d'abords un entier naturel non nul, eta _i ,b _i ,(i = 1, , s), 2s nombres complexes, lesa _i étant non nuls. On définit l'ensembleA comme étant l'intersection des parties de , contenant l'origine et stables par toutes les applicationsg _i (x) = a _i x + b _i . On a alors le résultat suivant: Théorème 1.Soient f, R ₁, ,R _s s + 1 fractions rationnelles de (x), régulières à l'origine, et a_i, b_i (i = 1,, s), 2s éléments de . On suppose que les a_i sont non nuls et de module strictement inférieur à un pour tout i = 1,, s. Soit y(x) un élément de [[x]], vérifiant l'équation fonctionnelle

Hereditary optimal control problems: Numerical method based upon a padé approximation

In this paper, we consider a particular approximation scheme which can be used to solve hereditary optimal control problems. These problems are characterized by variables with a time-delayed argumentx(t – ). In our approximation scheme, we first replace the variable with an augmented statey(t) x(t - ). The two-sided Laplace transform ofy(t) is a product of the Laplace transform ofx(t) and an exponential factor. This factor is approximated by a first-order Padé approximation, and a differential relation fory(t) can be found. The transformed problem, without any time-delayed argument, can then be solved using a gradient algorithm in the usual way. Four problems are solved to illustrate the validity and usefulness of this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant NCC-2-106.     

The many limits of mixed means

The sequences introduced by Carlson (1971) are variants of the Gauss arithmetic geometric sequences (which have been elegantly discussed by D. A. Cox (1984, 1985)). Given (complex)a ₀,b ₀ we define