An error estimate for least squares approximation

Upper and lower error bounds are obtained for the error of the bestL ₂ polynomial approximation of degreen for a function belonging toC ⁿ⁺¹ [?1, 1].     

A parallel algorithm for discrete least squares rational approximation

Summary A new method for discrete least squares linearized rational approximation is presented. It generalizes the algorithm of Rutishauser-Gragg-Harrod-Reichel for discrete least squares polynomial approximation to the rational case. The algorithm is fast in the sense that it requires orderm computation time wherem is the number of data points and is the degree of the approximant. We describe how this algorithm can be implemented in parallel.     

Error estimate in operator norm for Trotter-Kato product formula

In the present paper we study the error estimate in the operator norm for the Trotter-Kato product formula, having an intention to apply the obtained result to Schrödinger semigroups with singular potentials.     

An error analysis for absolute and relative approximation

We consider the vectorial algorithm for finding best polynomial approximationsp P _n to a given functionf C[a, b], with respect to the norm · _s , defined byp – f _s =w ₁ (p – f)+w ₂ (p – f) A bound for the modulus of continuity of the best vectorial approximation operator is given, and using the floating point calculus of J. H. Wilkinson, a bound for the rounding error in the algorithm is derived. For givenf, these estimates provide an indication of the conditioning of the problem, an estimate of the obtainable accuracy, and a practical method for terminating the iteration.This paper was supported in part by the Canadian NCR A-8108, FCAC 74-09 and G.E.T.M.A.Part of this research was done during the first-named author's visit to theB! Chair of Applied Mathematics, University of Athens, Spring term, 1975.     

Strong approximation theorems for density dependent Markov chains

A variety of continuous parameter Markov chains arising in applied probability (e.g. epidemic and chemical reaction models) can be obtained as solutions of equations of the form

$\text{X}{}_{\mathrm{N}}\text{(t)=x}{}_0\text{+∑}\text{1}\text{N}\text{lY}{}_1\text{N ∫}{}^{\mathrm{t}}{}_0\text{f}{}_1\text{(X}{}_{\mathrm{N}}\text{(s))ds}$

where $\text{l∈}\text{Z}{}^{\mathrm{t}}$, the Y₁ are independent Poisson processes, and N is a parameter with a natural interpretation (e.g. total population size or volume of a reacting solution).The corresponding deterministic model, satisfies

$\text{X(t)=x}{}_0\text{+ ∫}{}^{\mathrm{t}}{}_0\text{∑ lf}{}_1\text{(X(s))ds}$

Under very general conditions lim_N→∞X_N(t)=X(t) a.s. The process X_N(t) is compared to the diffusion processes given by

$\text{Z}{}_{\mathrm{N}}\text{(t)=x}{}_0\text{+∑}\text{1}\text{N}\text{lB}{}_1\text{N∫}{}^{\mathrm{t}}{}_0\text{ft(Z}{}_{\mathrm{N}}\text{(s))ds}$

and

$\text{V(t)=∑ l∫}{}^{\mathrm{t}}{}_0\text{f}{}_1\text{(X(s))}\text{d}\text{W}\text{?}{}_1\text{+∫}{}^{\mathrm{t}}{}_0\text{?F(X(s))·V(s)}\text{ds.}$

Under conditions satisfied by most of the applied probability models, it is shown that X_N,Z_N and V can be constructed on the same sample space in such a way that

$\text{X}{}_{\mathrm{N}}\text{(t)=Z}{}_{\mathrm{N}}\text{(t)+O}\text{logN}\text{N}$

and

$\text{N}\text{(X}{}_{\mathrm{N}}\text{(t)?X(t))=V(t)+O}\text{log N}\text{N}$

     

On the Remainder in an Asymptotic Expansion of the Double Gamma Function

We investigate the remainder R_N(z) in an asymptotic expansion of the logarithm of the double gamma function. We show that (−1)^NR_N(x) is a completely monotonic function.Research supported by the Carlsberg Foundation     

Minimally supported error representations and approximation by the constants

Summary. Distribution theory is used to construct minimally supported Peano kernel type representations for linear functionals such as the error in multivariate Hermite interpolation. The simplest case is that of representing the error in approximation to f by the constant polynomial f(a) in terms of integrals of the first order derivatives of f. This is discussed in detail. Here it is shown that suprisingly there exist many representations which are not minimally supported, and involve the integration of first order derivatives over multidimensional regions. The distance of smooth functions from the constants in the uniform norm is estimated using our representations for the error. Received June 30, 1997 / Revised version received April 6, 1999 / Published online February 17, 2000     

A Note on Equivalent Theorem for Beta Operators

In this paper, we give an equivalent theorem concerning on the whole interval [0, +∞). Both the direct and converse theorems are derived. These results bridge the gap between the point-wise conclusions and global conclusions.     

Zu einem Interpolationsproblem für ganze Funktionen

Ohne Zusammenfassung

---

     

The Complete Asymptotic Expansion for Bernstein–Durrmeyer Operators with Jacobi Weights

The purpose of this paper is the investigation of the local asymptotic behavior of the Bernstein-Durrmeyer polynomials and their derivatives with respect to Jacobi-weights. The main result is the complete asymptotic expansion for these polynomials and their derivatives. All coefficients are calculated explicitely.     

On orders of approximation of plane curves by parametric cubic splines

The aim of the present paper is to show that the convergence rate of the parametric cubic spline approximation of a plane curve is of order four instead of order three. For the first and second derivatives, the rates are of order three and two, respectively. Finally some numerical examples are given to illustrate the predicted error behaviour.     

A note on circulant transition matrices in Markov chains

Let g and n be positive integers and gcd(g,n)=1. Let C=(c_ij) be a g-circulant transition matrix of order n of Markov chain. We are interested in studying and lim_k→∞C^k.     

The Lebesgue measure of the algebraic difference of two random Cantor sets

In this paper we consider a family of random Cantor sets on the line. We give some sufficient conditions when the Lebesgue measure of the arithmetic difference is positive. Combining this with the main result of a recent joint paper of the second author with M. Dekking we construct random Cantor sets F₁, F₂ such that the arithmetic difference set F₂ − F₁ does not contain any intervals but ?eb(F₂ − F₁)> 0 almost surely, conditioned on non-extinction.     

A necessary and sufficient condition for noncertain extinction of a branching process in a random environment (BPRE)

It is known that a branching process in a random environment (BPRE) which is subcritical or critical either dies with probability one or, in the trivial case, corresponds to an immortal sterile population. In the supercritical case, various conditions are known to be necessary for noncertain extinction while other conditions are known to be sufficient. In this paper, a necessary and sufficient condition for noncertain extinction of a supercritical BPRE is given. In particular, it is shown that a supercritical BPRE has noncertain extinction if and only if there exists a random truncation, depending only on the environmental sequence, such that the truncated BPRE is supercritical and such that the sequence of truncation points grows more slowly than any exponential sequence.     

A note on AC-join-semilattices

The concept ofp-compatibility is studied in AC-join-semilattices. Some properties of AC-join-semilattices are obtained.     

On best error bounds for approximation by piecewise polynomial functions

Summary An analog of the well-known Jackson-Bernstein-Zygmund theory on best approximation by trigonometric polynomials is developed for approximation methods which use piecewise polynomial functions. Interpolation and best approximation by polynomial splines, Hermite and finite element functions are examples of such methods. A direct theorem is proven for methods which are stable, quasi-linear and optimally accurate for sufficiently smooth functions. These assumptions are known to be satisfied in many cases of practical interest. Under a certain additional assumption, on the family of meshes, an inverse theorem is proven which shows that the direct theorem is sharp.The work presented in this paper was supported by the ERDA Mathematics and Computing Laboratory, Courant Institute of Mathematical Sciences, New York University, under Contract E(11-1)-3077 with the Energy Research and Development Administration.