Error estimate for a stabilised domain decomposition method with nonmatching grids

Summary. In this paper, we analyse a stabilisation technique for the so-called three-field formulation for nonoverlapping domain decomposition methods. The stabilisation is based on boundary bubble functions in each subdomain which are then eliminated by static condensation. The discretisation grids in the subdomains can be chosen independently as well as the grid for the final interface problem. We present the analysis of the method and we construct a set of bubble functions which guarantees the optimal rate of convergence. Received May 12, 1998 / Revised version received November 21, 2000 / Published online June 7, 2001     

The dual of a finitely generated multiplication module

This paper is based on the M. Sc. thesis written by the third author under the supervision of the first two authors. It was submitted to the University of Baghdad in 1986.     

On the augmented system approach to sparse least-squares problems

Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam     

Asymptotic expansions in sequential estimation for the first-order random coefficient autoregressive model: Regenerative approach

Edgeworth expansions for the distribution of a sequential least squares estimator in the random coefficient autoregressive (RCA) model are derived. The regenerative approach to second-order asymptotic analysis of Markov-type statistical models is developed.     

Multiderivations of Coxeter arrangements

Let V be an ℓ-dimensional Euclidean space. Let G⊂O(V) be a finite irreducible orthogonal reflection group. Let ? be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H∈? choose α _H ∈V ^* such that H=ker(α _H ). For each nonnegative integer m, define the derivation module D ^(m) (?)={θ∈Der _S |θ(α _H )∈Sα ^m _H }. The module is known to be a free S-module of rank ℓ by K. Saito (1975) for m=1 and L. Solomon-H. Terao (1998) for m=2. The main result of this paper is that this is the case for all m. Moreover we explicitly construct a basis for D ^(m) (?). Their degrees are all equal to mh/2 (when m is even) or are equal to ((m−1)h/2)+m _i (1≤i≤ℓ) (when m is odd). Here m ₁≤···≤m _ℓ are the exponents of G and h=m _ℓ+1 is the Coxeter number. The construction heavily uses the primitive derivation D which plays a central role in the theory of flat generators by K. Saito (or equivalently the Frobenius manifold structure for the orbit space of G). Some new results concerning the primitive derivation D are obtained in the course of proof of the main result. Oblatum 27-XI-2001 & 4-XII-2001?Published online: 18 February 2002     

Homology of proof-nets

This work defines homology groups for proof-structures in multiplicative linear logic (see [Gir1], [Gir2], [Dan]). We will show that these groups characterize proof-nets among arbitrary proof-structures, thus obtaining a new correctness criterion and of course a new polynomial algorithm for testing correctness. This homology also bears information on sequentialization. An unexpected geometrical interpretation of the linear connectives is given in the last section. This paper exclusively focuses onabstract proof-structures, i.e. paired-graphs. The relation with actual proofs is investigated in [Gir1], [Gir2], [Dan], [Ret] and [Tro].     

Algebraic models defined over Q of differential manifolds

Here we prove that every compact differential manifold has a smooth algebraic model defined over Q. In dimension 2 we find an algebraic model (may be singular) defined over Q and birational over Q to the projective plane.     

多目标分数变分问题的对偶性

本文利用参数逼近在函数广义（F，ρ）－凸的条件下，建立了一类多目标式变分问题关于有效解的对偶理论。     

The homotopy categorical crossed module of a CW-complex

Crossed modules have longstanding uses in homotopy theory and the cohomology of groups. The corresponding notion in the setting of categorical groups, that is, categorical crosses modules, allowed the development of a low-dimensional categorical group cohomology. Now, its relevance is also shown here to homotopy types by associating, to any pointed CW-complex (X,∗), a categorical crossed module that algebraically represents the homotopy 3-type of X.     

Uniform non-amenability of free Burnside groups

The aim of this paper is to show that free Burnside groups of sufficiently large odd exponent are non-amenable in a certain strong sense. More precisely their left regular representations are isolated from the trivial representation uniformly on finite generating sets. It follows that free Burnside groups are of uniform exponential growth. This answers a question of de la Harpe. This work has been partially supported by the NSF grant DMS-0605093 and by the RFBR Grant # 05-01-00892. Received: 25 April 2006