An algorithm for computing Jordan chains and inverting analytic matrix functions

We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)⁻¹b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic.     

REML estimation for binary data in GLMMs

The restricted maximum likelihood (REML) procedure is useful for inferences about variance components in mixed linear models. However, its extension to hierarchical generalized linear models (HGLMs) is often hampered by analytically intractable integrals. Numerical integration such as Gauss-Hermite quadrature (GHQ) is generally not recommended when the dimensionality of the integral is high. With binary data various extensions of the REML method have been suggested, but they have had unsatisfactory biases in estimation. In this paper we propose a statistically and computationally efficient REML procedure for the analysis of binary data, which is applicable over a wide class of models and design structures. We propose a bias-correction method for models such as binary matched pairs and discuss how the REML estimating equations for mixed linear models can be modified to implement more general models.     

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

In this paper we design a fast new algorithm for reducing an N × N quasiseparable matrix to upper Hessenberg form via a sequence of N − 2 unitary transformations. The new reduction is especially useful when it is followed by the QR algorithm to obtain a complete set of eigenvalues of the original matrix. In particular, it is shown that in a number of cases some recently devised fast adaptations of the QR method for quasiseparable matrices can benefit from using the proposed reduction as a preprocessing step, yielding lower cost and a simplification of implementation.     

Differential operators on Hilbert modular forms

We investigate differential operators and their compatibility with subgroups of SL₂n(R). In particular, we construct Rankin-Cohen brackets for Hilbert modular forms, and more generally, multilinear differential operators on the space of Hilbert modular forms. As an application, we explicitly determine the Rankin-Cohen bracket of a Hilbert-Eisenstein series and an arbitrary Hilbert modular form. We use this result to compute the Petersson inner product of such a bracket and a Hilbert modular cusp form.     

Symplectic Yang–Mills theory,Ricci tensor,and connections

A Yang–Mills theory in a purely symplectic framework is developed. The corresponding Euler–Lagrange equations are derived and first integrals are given. We relate the results to the work of Bourgeois and Cahen on preferred symplectic connections.     

Engel Values in Residually Finite Groups

The following theorem is proved. Let n be a positive integer and q a power of a prime p. There exists a number m = m(n, q) depending only on n and q such that if G is any residually finite group satisfying the identity ([x _1,n y ₁] ⋯ [x _m,n y _m ])^q ≡ 1, then the verbal subgroup of G corresponding to the nth Engel word is locally finite.     

Ordered OLPS and CF Nth numerators

Definitions, theorems and examples are established for a general model of Laurent polynomial spaces and ordered orthogonal Laurent polynomial sequences, ordered with respect to ordered bases and orthogonal with respect to inner products ·=L°⊙ decomposed into transition functional ⊙ and strong moment functional, or, more generally, sample functional L couplings. Under this formulation that is shown to subsume those in the existing literature, new fundamental results are produced, including necessary and sufficient conditions for ordered OLPS to be sequences of nth numerators of continued fractions, in contrast to the classical result concerning nth denominators which is shown to hold only in special cases.     

Grothendieck groups of unbounded complexes of finitely generated modules

Let Λ be a left Artinian ring, D⁺(mod Λ) (resp., D⁻(mod Λ), D(mod Λ)) the derived category of bounded below complexes (resp., bounded above complexes, unbounded complexes) of finitely generated left Λ-modules. We show that the Grothendieck groups K₀(D⁺(mod Λ)), K₀(D⁻(mod Λ)) and K₀(D(mod Λ)) are trivial. Received: 7 April 2005     

A large deviation principle for 2D stochastic Navier–Stokes equation

In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property.