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.     

弱Orlicz鞅空间的弱原子分解及其应用

对3类由凹函数生成的弱Orlicz鞅空间建立了相应的弱原子分解.作为应用,首先给出了这些弱Orlicz鞅空间上次线性算子有界的一个充分条件,并在此基础上证明了一些弱型鞅不等式,然后证明了关于这些弱Orlicz鞅空间的Marcinkiewicz型插值定理.     

Interpolating solutions of the Poisson equation in the disk based on Radon projections

We consider an algebraic method for reconstruction of a function satisfying the Poisson equation with a polynomial right-hand side in the unit disk. The given data, besides the right-hand side, is assumed to be in the form of a finite number of values of Radon projections of the unknown function. We first homogenize the problem by finding a polynomial which satisfies the given Poisson equation. This leads to an interpolation problem for a harmonic function, which we solve in the space of harmonic polynomials using a previously established method. For the special case where the Radon projections are taken along chords that form a regular convex polygon, we extend the error estimates from the harmonic case to this Poisson problem. Finally we give some numerical examples.     

A new approach to constant term identities and Selberg-type integrals

Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. Built on a recent idea of Karasev and Petrov we develop a general interpolation based method that is powerful enough to establish many such identities in a simple manner. The main consequence is the proof of a conjecture of Forrester related to the Calogero–Sutherland model. In fact we prove a more general theorem, which includes Aomoto's constant term identity at the same time. We also demonstrate the relevance of the method in additive combinatorics.     

Convergence of FFT‐based homogenization for strongly heterogeneous media

The FFT‐based homogenization method of Moulinec–Suquet has recently attracted attention because of its wide range of applicability and short computational time. In this article, we deduce an optimal a priori error estimate for the homogenization method of Moulinec–Suquet, which can be interpreted as a spectral collocation method. Such methods are well‐known to converge for sufficiently smooth coefficients. We extend this result to rough coefficients. More precisely, we prove convergence of the fields involved for Riemann‐integrable coercive coefficients without the need for an a priori regularization. We show that our L² estimates are optimal and extend to mildly nonlinear situations and L^p estimates for p in the vicinity of 2. The results carry over to the case of scalar elliptic and curl ? curl‐type equations, encountered, for instance, in stationary electromagnetism. Copyright © 2014 John Wiley & Sons, Ltd.     

Acceleration of self‐consistent field convergence in ab initio molecular dynamics simulation with multiconfigurational wave function

The Lagrange interpolation of molecular orbital (LIMO) method, which reduces the number of self‐consistent field iterations in ab initio molecular dynamics simulations with the Hartree–Fock method and the Kohn–Sham density functional theories, is extended to the theory of multiconfigurational wave functions. We examine two types of treatments for the active orbitals that are partially occupied. The first treatment, as denoted by LIMO(C), is a simple application of the conventional LIMO method to the union of the inactive core and the active orbitals. The second, as denoted by LIMO(S), separately treats the inactive core and the active orbitals. Numerical tests to compare the two treatments clarify that LIMO(S) is superior to LIMO(C). Further applications of LIMO(S) to various systems demonstrate its effectiveness and robustness. © 2014 Wiley Periodicals, Inc.     

Wavelet multiresolution interpolation Galerkin method for nonlinear boundary value problems with localized steep gradients

The wavelet multiresolution interpolation for continuous functions defined on a finite interval is developed in this study by using a simple alternative of transformation matrix. The wavelet multiresolution interpolation Galerkin method that applies this interpolation to represent the unknown function and nonlinear terms independently is proposed to solve the boundary value problems with the mixed Dirichlet-Robin boundary conditions and various nonlinearities, including transcendental ones, in which the discretization process is as simple as that in solving linear problems, and only common two-term connection coefficients are needed. All matrices are independent of unknown node values and lead to high efficiency in the calculation of the residual and Jacobian matrices needed in Newton’s method, which does not require numerical integration in the resulting nonlinear discrete system. The validity of the proposed method is examined through several nonlinear problems with interior or boundary layers. The results demonstrate that the proposed wavelet method shows excellent accuracy and stability against nonuniform grids, and high resolution of localized steep gradients can be achieved by using local refined multiresolution grids. In addition, Newton’s method converges rapidly in solving the nonlinear discrete system created by the proposed wavelet method, including the initial guess far from real solutions.

     

求解二维Poisson方程的重心插值配点法

采用重心Lagrange插值配点法计算了二维Poisson方程.采用重心Lagrange插值法构造近似函数,由配点法离散Poisson方程及其边界条件.数值算例表明方法具有理论简单、计算精度高的特点.     

Constrained moving least‐squares immersed boundary method for fluid‐structure interaction analysis

A numerical method is presented for the analysis of interactions of inviscid and compressible flows with arbitrarily shaped stationary or moving rigid solids. The fluid equations are solved on a fixed rectangular Cartesian grid by using a higher‐order finite difference method based on the fifth‐order WENO scheme. A constrained moving least‐squares sharp interface method is proposed to enforce the Neumann‐type boundary conditions on the fluid‐solid interface by using a penalty term, while the Dirichlet boundary conditions are directly enforced. The solution of the fluid flow and the solid motion equations is advanced in time by staggerly using, respectively, the third‐order Runge‐Kutta and the implicit Newmark integration schemes. The stability and the robustness of the proposed method have been demonstrated by analyzing 5 challenging problems. For these problems, the numerical results have been found to agree well with their analytical and numerical solutions available in the literature. Effects of the support domain size and values assigned to the penalty parameter on the stability and the accuracy of the present method are also discussed.     

Spectrum is periodic for n-intervals

In this paper we study spectral sets which are unions of finitely many intervals in R. We show that any spectrum associated with such a spectral set Ω is periodic, with the period an integral multiple of the measure of Ω. As a consequence we get a structure theorem for such spectral sets and observe that the generic case is that of the equal interval case.