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     

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.     

Fundamental groups of the complements of certain plane non-tame torus sextics

The moduli space of torus sextics with the configuration of singularities {A₂+A₅+2E₆} has two connected components. We compute the fundamental groups π₁(CP²−C) for sextics C in both components and study their differences.