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     

Chain spaces via Clifford algebras

In this note we show that the chain space belonging to a quadric can be embedded into the chain geometry over a Clifford algebra via a generalized stereographic projection.     

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     

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     

Reducing systems of linear differential equations to a passive form

In this paper, an application of the Riquer-Thomas-Janet theory is described for the problem of transforming a system of partial differential equations into a passive form, i.e., to a special form which contains explicitly both the equations of the initial system and all their nontrivial differential consequences. This special representation of a system markedly facilitates the subsequent integration of the corresponding differential equations. In this paper, the modern approach to the indicated problem is presented. This is the approach adopted in the Knuth-Bendix procedure [13] for critical-pair/completion and then Buchberger's algorithm for completion of polynomial ideal bases [13] (or, alternatively, for the construction of Groebner bases for ideals in a differential operator ring [14]). The algorithm of reduction to the passive form for linear system of partial differential equations and its implementation in the algorithmic language REFAL, as well as the capabilities of the corresponding program, are outlined. Examples illustrating the power and efficiency of the system are presented.     

An algebraic characterization ofB-convergent Runge-Kutta methods

Summary In the analysis of discretization methods for stiff intial value problems, stability questions have received most part of the attention in the past.B-stability and the equivalent criterion algebraic stability are well known concepts for Runge-Kutta methods applied to dissipative problems. However, for the derivation ofB-convergence results — error bounds which are not affected by stiffness — it is not sufficient in many cases to requireB-stability alone. In this paper, necessary and sufficient conditions forB-convergence are determined.This paper was written while J. Schneid was visiting the Centre for Mathematics and Computer Science with an Erwin-Schrödinger stipend from the Fonds zur Förderung der wissenschaftlichen Forschung     

Point approximation of a space-homogeneous transport equation

Summary We present an approximation method of a space-homogeneous transport equation which we prove is convergent. The method is very promising for numerical computation. Comparison of a numerical computation with an exact solution is given for the Master equation.