Robust multilevel methods for quadratic finite element anisotropic elliptic problems

This paper discusses a class of multilevel preconditioners based on approximate block factorization for conforming finite element methods employing quadratic trial and test functions. The main focus is on diffusion problems governed by a scalar elliptic partial differential equation with a strongly anisotropic coefficient tensor. The proposed method provides a high robustness with respect to non‐grid‐aligned anisotropy, which is achieved by the interaction of the following components: (i) an additive Schur complement approximation to construct the coarse‐grid operator; (ii) a global block (Jacobi or Gauss–Seidel) smoother complementing the coarse‐grid correction based on (i); and (iii) utilization of an augmented coarse grid, which enhances the efficiency of the interplay between (i) and (ii). The performed analysis indicates the high robustness of the resulting two‐level method. Moreover, numerical tests with a nonlinear algebraic multilevel iteration method demonstrate that the presented two‐level method can be applied successfully in the recursive construction of uniform multilevel preconditioners of optimal or nearly optimal order of computational complexity. Copyright © 2013 John Wiley & Sons, Ltd.     

Capable Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field

In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field. Moreover, the explicit structure of such Lie algebras of class 3 is given.     

A new framework for implicit restarting of the Krylov–Schur algorithm

This paper introduces a new framework for implicit restarting of the Krylov–Schur algorithm. It is shown that restarting with arbitrary polynomial filter is possible by reassigning some of the eigenvalues of the Rayleigh quotient through a rank‐one correction, implemented using only the elementary transformations (translation and similarity) of the Krylov decomposition. This framework includes the implicitly restarted Arnoldi (IRA) algorithm and the Krylov–Schur algorithm with implicit harmonic restart as special cases. Further, it reveals that the IRA algorithm can be turned into an eigenvalue assignment method. Copyright © 2014 John Wiley & Sons, Ltd.     

Properties of mono-weakly hyponormal 2-variable weighted shifts

In this paper, we study several properties for mono-weakly hyponormal 2-variable weighted shifts. First, we consider propagation phenomena for mono-weakly hyponormal (resp. mono-polynomially hyponormal) 2-variable weighted shifts. Next, we contemplate the mono-weak hyponormality under the Schur product. Finally, we study whether the mono-weak hyponormality is invariant under powers.     

Schur indices of perfect groups

It has been noticed by many authors that the Schur indices of the irreducible characters of many quasi-simple finite groups are at most . A conjecture has emerged that the Schur indices of all irreducible characters of all quasi-simple finite groups are at most . We prove that this conjecture cannot be extended to the set of all finite perfect groups. Indeed, we prove that, given any positive integer , there exist irreducible characters of finite perfect groups of chief length which have Schur index .

     

On the norm of an idempotent Schur multiplier on the Schatten class

We show that if the norm of an idempotent Schur multiplier on the Schatten class lies sufficiently close to , then it is necessarily equal to . We also give a simple characterization of those idempotent Schur multipliers on whose norm is .

     

The Structure of the (Outer) Automorphism Group of a Bieberbach Group

Referring to Tits alternative, we develop a necessary and sufficient condition to decide whether the normalizer of a finite group of integral matrices is polycyclic-by-finite or is containing a non-Abelian free group. This result is of fundamental importance to conclude whether the (outer) automorphism group of a Bieberbach group is polycyclic-by-finite or has a non-cyclic free subgroup.     

Analysis of Henrici's Transformation for Singular Problems

Henrici's transformation is the underlying scheme that generates, by cycling, Steffensen's method for the approximation of the solution of a nonlinear equation in several variables. The aim of this paper is to analyze the asymptotic behavior of the obtained sequence (s _n ^* ) by applying Henrici's transformation when the initial sequence (s _n ) behaves sublinearly. We extend the work done in the regular case by Sadok [17] to vector sequences in the singular case. Under suitable conditions, we show that the slowest convergence rate of (s _n ^* ) is to be expected in a certain subspace N of R ^p . More precisely, if we write s _n ^* =s _n ^* ,N+s _n ^* ,N, the orthogonal decomposition into N and N , then the convergence is linear for (s _n ^* ,N) but ( _n ^* ,N) converges to the same limit faster than the initial one. In certain cases, we can have N=R ^p and the convergence is linear everywhere.     

Numerical analysis of a quadratic matrix equation

The quadratic matrix equation AX²+ BX + C = 0in n x nmatricesarises in applications and is of intrinsic interest as oneof the simplest nonlinear matrix equations. We give a completecharacterization of solutions in terms of the generalized Schurdecomposition and describe and compare various numerical solutiontechniques. In particular, we give a thorough treatment offunctional iteration methods based on Bernoulli’s method.Other methods considered include Newton’s method with exact line searches, symbolic solution and continued fractions.We show that functional iteration applied to the quadraticmatrix equation can provide an efficient way to solve the associated quadratic eigenvalue problem (²A + B + C)x = 0.     

Decomposition Numbers and Canonical Bases

We obtain some simple relations between decomposition numbers of quantized Schur algebras at an nth root of unity (over a field of characteristic 0). These relations imply that every decomposition number for such an algebra occurs as a decomposition number for some Hecke algebra of type A. We prove similar relations between coefficients of the canonical basis of the q-deformed Fock space representation of . It follows that these coefficients can all be expressed in terms of those of the global crystal basis of the irreducible subrepresentation generated by the vacuum vector. As a consequence, using the works of Ariki and Varagnolo and Vasserot, it is possible to give a new proof of Lusztig"s character formula for the simple U _v (sl _r )-modules at roots of unity, which does not involve representations of of negative level.