On universal subsets of Banach spaces

We prove that to most of the known hypercyclic operators A on separable Banach spaces there exist compact (compact convex, compact connected) subsets K of E such that each compact (compact convex, compact connected) subset of E can be approximated with respect to Hausdorff's distance by for suitable . Received July 8, 1997, in final form October 17, 1997     

Optimality of the double exponential formula – functional analysis approach –

Summary. In the light of the functional analysis theory we establish the optimality of the double exponential formula. The argument consists of the following three ingredients: (1) introduction of a number of spaces of functions analytic in a strip region about the real axis, each space being characterized by the decay rate of their elements (functions) in the neighborhood of the infinity; (2) proof of the (near-) optimality of the trapezoidal formula in each space introduced in (1) by showing the (near-) equality between an upper estimate for the error norm of the trapezoidal formula and a lower estimate for the minimum error norm of quadratures; (3) nonexistence theorem for the spaces, the characterizing decay rate of which is more rapid than the double exponential. Received September 15, 1995 / Accepted December 14, 1995     

Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces

We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP ⁿ . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP ⁿ and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH ⁿ . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996     

A dual graph-norm refinement indicator for finite volume approximations of the Euler equations

Summary. We generalise and apply a refinement indicator of the type originally designed by Mackenzie, Süli and Warnecke in [15] and [16] for linear Friedrichs systems to the Euler equations of inviscid, compressible fluid flow. The Euler equations are symmetrized by means of entropy variables and locally linearized about a constant state to obtain a symmetric hyperbolic system to which an a posteriori error analysis of the type introduced in [15] can be applied. We discuss the details of the implementation of the refinement indicator into the DLR--Code which is based on a finite volume method of box type on an unstructured grid and present numerical results. Received May 15, 1995 / Revised version received April 17, 1996     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

提高前馈神经网络推广能力的若干实际方法

提高前馈神经网络的推广能力是深受关注的问题，本文根据我们最近提出了一个网络有效推广的准则，从提高网络特征提取能力，分类能力和修改神经元激活函数等几方面给出了若干实际方案，我们在任意手写数字识别问题上的实验结果证实了这些方法的有效性。     

Angle theorems for the Lagrangian mean curvature flow

We prove that symplectic maps between Riemann surfaces L, M of constant, nonpositive and equal curvature converge to minimal symplectic maps, if the Lagrangian angle for the corresponding Lagrangian submanifold in the cross product space satisfies . If one considers a 4-dimensional K?hler-Einstein manifold of nonpositive scalar curvature that admits two complex structures J, K which commute and assumes that is a compact oriented Lagrangian submanifold w.r.t. J such that the K?hler form w.r.t.K restricted to L is positive and , then L converges under the mean curvature flow to a minimal Lagrangian submanifold which is calibrated w.r.t. . Received: 11 April 2001 / Published online: 29 April 2002