Verschärfung eines Satzes von Borel-Okada über Summierbarkeit von Potenzreihen

Ohne Zusammenfassung

---

     

A variable metric algorithm for unconstrained minimization without evaluation of derivatives

Summary This paper presents a modification of the BFGS-method for unconstrained minimization that avoids computation of derivatives. The gradients are approximated by the aid of differences of function values. These approximations are calculated in such a way that a complete convergence proof can be given. The presented algorithm is implementable, no exact line search is required. It is shown that, if the objective function is convex and some usually required conditions hold, the algorithm converges to a solution. If the Hessian matrix of the objective function is positive definite and satisfies a Lipschitz-condition in a neighbourhood of the solution, then the rate of convergence is superlinear.     

Monotony by some Newton-like methods

The article treats the monotone behaviour of successive approximations computed by some Newton-like method for solving a nonlinear operator equation in a Banach space endowed with a partial ordering for which it is a Banach lattice.     

Characteristic functional equations of polynomials and the morera-carleman theorem

Several characteristic functional equations satisfied by classes of polynomials of bounded degree are examined in connection with certain generalizations of the Morera-Carleman Theorem. Certain functional equations which have nonanalytic polynomial solutions are also considered.     

Stability of multistep-methods on variable grids

Summary This paper is concerned with the stability of multistep methods for ordinary initial-value problems on grids with variable mesh-sizes. A necessary and sufficient condition for stability is given from which generalizations of recent results by Gear et al. and by Zlatev can be obtained as special cases. As an application the stability of the variable BDF-formulas is treated.     

Point processes and multivariate extreme values

A new model for point processes is developed which assumes that the interarrival times are exponentially distributed and follow joint multivariate extreme value distributions. It is shown that such processes may arise via natural generating procedures, and that, under very weak assumptions, that they can be approximated as closely as desired by appropriate finite models.     

On a class of martingale inequalities

Let Z = {Z₀, Z₁, Z₂,…} be a martingale, with difference sequence X₀ = Z₀, X_i = Z_i ? Z_{i ? 1}, i ≥ 1. The principal purpose of this paper is to prove that the best constant in the inequality λP(sup_i |X_i| ≥ λ) ≤ C sup_iE |Z_i|, for λ > 0, is C = (log 2)^?1. If Z is finite of length n, it is proved that the best constant is $\text{C}{}_{\mathrm{n}}\text{= [n(2}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{? 1)]}{}^{\mathrm{?1}}$. The analogous best constant C_n(z) when Z₀ ≡ z is also determined. For these finite cases, examples of martingales attaining equality are constructed. The results follow from an explicit determination of the quantity G_n(z, E) = sup_zP(max_i=1,…,n |X_i| ≥ 1), the supremum being taken over all martingales Z with Z₀ ≡ z and E|Z_n| = E. The expression for G_n(z,E) is derived by induction, using methods from the theory of moments.     

The uniqueness of the near hexagon on 729 points

We prove that any regular near hexagon with 729 vertices and lines of size 3 is derived from the ternary Golay code, thus settling the last case in doubt among the regular near hexagons with lines of size 3.