Stability of algebraic multigrid for Stokes problems

An investigation is made of the performance of algebraic multigrid (AMG) solvers for the discrete Stokes problem. The saddle‐point formulations are based on the direct enforcement of the fundamental conservation laws in discrete spaces and subsequently stabilised with the aid of a regular splitting of the diffusion operator. AMG solvers based on an independent coarsening of the fields (the unknown approach) and also on a common coarsening (the point approach) are investigated. Both mixed‐order and equal‐order interpolations are considered. The dependence of convergence on the ‘degree of coarsening’ is investigated by studying the ‘convergence versus coarsening’ characteristics and their variation with mesh resolution. They show a consistency in shape, which reveals two distinct performance zones, one convergent the other divergent. The transition from the convergent to the divergent zones is discontinuous and occurs at a critical coarsening factor that is largely mesh independent. It signals a breakdown in the stability of the smoothing at the coarser levels of coarse grid approximation. It is shown that the previously observed, mesh‐dependent, scaling of convergence factors, which had suggested inconsistencies in the coarse grid approximation, is not a reliable marker of inconsistency. It is an indirect consequence of the breakdown in the stability of smoothing. For stable smoothing, reduction factors are shown to be largely mesh independent. The ability of mixed‐order interpolation to permit stable smoothing and therefore to deliver mesh‐independent convergence is explained. Two expedient options are suggested for obtaining mesh‐independent convergence for those AMG codes that are based on an equal‐order interpolation. Copyright © 2012 John Wiley & Sons, Ltd.     

Invariant fibrations for some birational maps of ℂ2

Abstract

In this article, we extract and study the zero entropy subfamilies of a certain family of birational maps of the plane. We find these zero entropy mappings and give the invariant fibrations associated to them.     

High‐order implicit time integration for unsteady incompressible flows

The spatial discretization of unsteady incompressible Navier–Stokes equations is stated as a system of differential algebraic equations, corresponding to the conservation of momentum equation plus the constraint due to the incompressibility condition. Asymptotic stability of Runge–Kutta and Rosenbrock methods applied to the solution of the resulting index‐2 differential algebraic equations system is analyzed. A critical comparison of Rosenbrock, semi‐implicit, and fully implicit Runge–Kutta methods is performed in terms of order of convergence and stability. Numerical examples, considering a discontinuous Galerkin formulation with piecewise solenoidal approximation, demonstrate the applicability of the approaches and compare their performance with classical methods for incompressible flows. Copyright © 2011 John Wiley & Sons, Ltd.     

Mixed‐order interpolation for the Galerkin coarse‐grid approximations in algebraic multigrid solvers

An empirical investigation is made of AMG solver performance for the fully coupled set of Navier–Stokes equations. The investigation focuses on two different FV discretizations for the standard driven cavity test problem. One is a collocated vertex‐based discretization; the other is a cell‐centred staggered‐grid discretization. Both employ otherwise identical orthogonal Cartesian meshes. It is found that if mixed‐order interpolation is used in the construction of the Galerkin coarse‐grid approximation (CGA), a close‐to‐optimum mesh‐independent scaling of the AMG convergence is observed with similar convergence rates for both discretizations. If, on the other hand, an equal‐order interpolation is used, convergence rates are mesh‐dependent but the scaling differs in each case. For the collocated‐grid case, it depends both on the mesh size, h (or bandwidth Q～h^?1) and on the total number of grids, G, whereas for the staggered‐grid case it depends only on Q. Comparing the two characteristics reveals that the Q‐dependent parts are very similar; it is only in the G‐dependent convergence for the collocated‐grid case that they differ. This takes the form of stepped reductions in the AMG convergence rate (implying step reductions in the quality of the Galerkin CGA that correlate exactly with step increases in G). These findings reinforce previous evidence that, for optimum mesh‐independent performance, mixed‐order interpolations should be used in forming Galerkin CGAs for coupled Navier–Stokes problems. Copyright © 2010 John Wiley & Sons, Ltd.     

复微分方程组的代数解

本文研究了一类复微分方程组的代数解的存在问题.利用最大模原理和Nevanlinna值分布理论,得到了一个结论,推广和改进了一些文献的结果,例子表明结论精确.     

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h‐multigrid and p‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.     

Analysis of an aggregation‐based algebraic two‐grid method for a rotated anisotropic diffusion problem

A two‐grid convergence analysis based on the paper [Algebraic analysis of aggregation‐based multigrid, by A. Napov and Y. Notay, Numer. Lin. Alg. Appl. 18 (2011), pp. 539–564] is derived for various aggregation schemes applied to a finite element discretization of a rotated anisotropic diffusion equation. As expected, it is shown that the best aggregation scheme is one in which aggregates are aligned with the anisotropy. In practice, however, this is not what automatic aggregation procedures do. We suggest approaches for determining appropriate aggregates based on eigenvectors associated with small eigenvalues of a block splitting matrix or based on minimizing a quantity related to the spectral radius of the iteration matrix. Copyright © 2015 John Wiley & Sons, Ltd.     

Vitamin B6 cofactor derived chemosensor for the selective colorimetric detection of acetate anions

A novel vitamin B₆ cofactor derived anion sensor L for the selective colorimetric detection of acetate has been developed by the condensation of pyridoxal and 2-aminothiophenol. The sensor L showed a noteworthy change in the visible region of the spectrum and was detected by the ‘naked-eye’ for both acetate and fluoride anions in DMSO but selectively for acetate in DMSO/H₂O (88:12, v/v). The anion recognition ability of L was investigated by spectroscopic (UV–vis and ¹H NMR) and DFT methods.     

Three‐Phase Barker Arrays

A 3‐phase Barker array is a matrix of third roots of unity for which all out‐of‐phase aperiodic autocorrelations have magnitude 0 or 1. The only known truly two‐dimensional 3‐phase Barker arrays have size 2 × 2 or 3 × 3. We use a mixture of combinatorial arguments and algebraic number theory to establish severe restrictions on the size of a 3‐phase Barker array when at least one of its dimensions is divisible by 3. In particular, there exists a double‐exponentially growing arithmetic function T such that no 3‐phase Barker array of size with exists for all . For example, , , and . When both dimensions are divisible by 3, the existence problem is settled completely: if a 3‐phase Barker array of size exists, then .