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     

Large offset far infrared laser lines generation from the C-O stretching Q-branch of 13CD3OD

2 laser of wide tunability to pump ¹³CD₃OD we could observe 10 new far infrared laser lines ranging from 109 μm to 472 μm. The lines were generated by pumping infrared absorbing transitions of large offset appertaining to the C-O stretching Q-branch. All lines were characterised in wavelength, polarisation, optimum pressure of operation and precise offset measurements. Received: 17 September 1996/Revised version: 18 November 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     

随机发展方程适度解的存在唯一性(Ⅱ)

讨论如下Hilbert空间中的半线性随机发展方程的Cauchy问题 dy(t)=[Ay(t) f(t,y(t))]dt G(t,y(t))dw(t) y(O)=V_u的适度解的存在唯一性,在更一般的条件下,得到了该问题的适度解的存在唯一性。     

Convex functions, subdifferentiability and renormings

This paper through discussing subdifferentiability and convexity of convex functions shows that a Banach space admits an equivalent uniformly [locally uniformly, strictly] convex norm if and only if there exists a continuous uniformly [locally uniformly, strictly] convex function on some nonempty open convex subset of the space and presents some characterizations of super-reflexive Banach spaces. Supported by NSFC     

Surface grating formation and erasing on a-Se films

Surface relief formation at holographic recording on amorphous selenium films was demonstrated and investigated. The presence of this optical phase modulation component is essential for ensuring significant, stable and erasable optical recording in a-Se films at 290–320 K temperatures, where conventional photodarkening was known as insignificant and unstable. Photocrystallization can only be observed in super-exposed a-Se films at the given experimental conditions of hologram recording. Erasing behavior of surface relief gratings under heat treatment was also investigated in order to reveal further details of the mechanism. Photoinduced structural transformations within the amorphous phase, connected to local ordering under the condition of light-induced fluidity, are proposed as an explanation for the relief formation and erasing. The observed reversible optical recording process may be useful for the various optoelectronic applications of photoconductive a-Se layers. Received: 12 June 2000 / Accepted: 6 June 2001 / Published online: 30 August 2001     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.