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     

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     

A posteriori error estimation with finite element methods of lines for one-dimensional parabolic systems

Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP ^th -degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910     

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.     

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.     

Dielectric and optical properties of polymer-liquid crystal composite

Dielectric properties of polymer-liquid crystal mixture, having constituent polymer, poly-butyl methacrylate (PBMA) and liquid crystal, cholesteryl nonanoate, are reported as a function of frequency and temperature. The measurement has been done in a temperature range of 300-375 K and frequency range of 100 Hz-10 MHz. The dielectric permittivity and dielectric loss shows significant changes with the addition of polymer molecules in liquid crystal. The significant feature of composite formation is that the pure liquid crystal and polymer do not show dielectric relaxation in the frequency range covered, while the composite shows relaxation peak at a particular frequency. The optical transmittance of pure liquid crystal and composite has also been measured and compared.     

Cleaving functors and controlled wild algebras

We show that the cleaving functors introduced in [Bautista et al., Invent. Math. 81 (1985) 217] as a tool for proving infinite representation type of finite-dimensional algebras can also be used to establish controlled wildness. The main application is that an algebra is controlled wild if there is an indecomposable projective module with a Loewy factor having a homogeneous direct summand which is of length at least 3. As a second application we derive Han's covering criterion.     

Absolutely indecomposable symmetric matrices

Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Mat_n(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Mat_n(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s.     

Symmetries and conservation laws of partial differential equations: Basic notions and results

The main notions and results which are necessary for finding higher symmetries and conservation laws for general systems of partial differential equations are given. These constitute the starting point for the subsequent papers of this volume. Some problems are also discussed.