Algebraic interface‐based coarsening AMG preconditioner for multi‐scale sparse matrices with applications to radiation hydrodynamics computation

Coarsening is a crucial component of algebraic multigrid (AMG) methods for iteratively solving sparse linear systems arising from scientific and engineering applications. Its application largely determines the complexity of the AMG iteration operator. Usually, high operator complexities lead to fast convergence of the AMG method; however, they require additional memory and as such do not scale as well in parallel computation. In contrast, although low operator complexities improve parallel scalability, they often lead to deterioration in convergence. This study introduces a new type of coarsening strategy called algebraic interface‐based coarsening that yields a better balance between convergence and complexity for a class of multi‐scale sparse matrices. Numerical results for various model‐type problems and a radiation hydrodynamics practical application are provided to show the effectiveness of the proposed AMG solver.     

A two‐grid method for mixed finite‐element solution of reaction‐diffusion equations

We present a scheme for solving two‐dimensional, nonlinear reaction‐diffusion equations, using a mixed finite‐element method. To linearize the mixed‐method equations, we use a two grid scheme that relegates all the Newton‐like iterations to a grid Δ_H much coarser than the original one Δ_h, with no loss in order of accuracy so long as the mesh sizes obey . The use of a multigrid‐based solver for the indefinite linear systems that arise at each coarse‐grid iteration, as well as for the similar system that arises on the fine grid, allows for even greater efficiency. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 317–332, 1999     

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.     

A Petrov‐Galerkin method with quadrature for semi‐linear second‐order hyperbolic problems

We propose and analyze a Crank–Nicolson quadrature Petrov–Galerkin (CNQPG) ‐spline method for solving semi‐linear second‐order hyperbolic initial‐boundary value problems. We prove second‐order convergence in time and optimal order H² norm convergence in space for the CNQPG scheme that requires only linear algebraic solvers. We demonstrate numerically optimal order H^k, k = 0,1,2, norm convergence of the scheme for some test problems with smooth and nonsmooth nonlinearities. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

N solutions for a derivative nonlinear Schrödinger‐type equation via Riemann‐Hilbert approach

The inverse scattering transform for the derivative nonlinear Schrödinger‐type equation is studied via the Riemann‐Hilbert approach. In the direct scattering process, the spectral analysis of the Lax pair is performed, from which a Riemann‐Hilbert problem is established for the derivative nonlinear Schrödinger‐type equation. In the inverse scattering process, N‐soliton solutions of the derivative nonlinear Schrödinger‐type equation are obtained by solving Riemann‐Hilbert problems corresponding to the reflectionless cases. Moreover, the dynamics of the exact solutions are discussed.     

The unconditional stability and mass‐preserving S‐DDM scheme for solving parabolic equations in three dimensions

In this paper, the unconditional stability and mass‐preserving splitting domain decomposition method (S‐DDM) for solving three‐dimensional parabolic equations is analyzed. At each time step level, three steps (x‐direction, y‐direction, and z‐direction) are proposed to compute the solutions on each sub‐domains. The interface fluxes are first predicted by the semi‐implicit flux schemes. Second, the interior solutions and fluxes are computed by the splitting implicit solution and flux coupled schemes. Last, we recompute the interface fluxes by the explicit schemes. Due to the introduced z‐directional splitting and domain decomposition, the analysis of stability and convergence is scarcely evident and quite difficult. By some mathematical technique and auxiliary lemmas, we prove strictly our scheme meet unconditional stability and give the error estimates in L²‐norm. Numerical experiments are presented to illustrate the theoretical analysis.     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.     

Two‐grid methods for mixed finite‐element solution of coupled reaction‐diffusion systems

We develop 2‐grid schemes for solving nonlinear reaction‐diffusion systems: where p = (p, q) is an unknown vector‐valued function. The schemes use discretizations based on a mixed finite‐element method. The 2‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. The iterative algorithms examined here extend a method developed earlier for single reaction‐diffusion equations. An application to prepattern formation in mathematical biology illustrates the method's effectiveness. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 589–604, 1999     

Uniform Semi‐Latin Squares and Their Schur‐Optimality

Let n and k be integers, with and . An semi‐Latin square S is an array, whose entries are k‐subsets of an ‐set, the set of symbols of S, such that each symbol of S is in exactly one entry in each row and exactly one entry in each column of S. Semi‐Latin squares form an interesting class of combinatorial objects which are useful in the design of comparative experiments. We say that an semi‐Latin square S is uniform if there is a constant μ such that any two entries of S, not in the same row or column, intersect in exactly μ symbols (in which case ). We prove that a uniform semi‐Latin square is Schur‐optimal in the class of semi‐Latin squares, and so is optimal (for use as an experimental design) with respect to a very wide range of statistical optimality criteria. We give a simple construction to make an semi‐Latin square S from a transitive permutation group G of degree n and order , and show how certain properties of S can be determined from permutation group properties of G. If G is 2‐transitive then S is uniform, and this provides us with Schur‐optimal semi‐Latin squares for many values of n and k for which optimal semi‐Latin squares were previously unknown for any optimality criterion. The existence of a uniform semi‐Latin square for all integers is shown to be equivalent to the existence of mutually orthogonal Latin squares (MOLS) of order n. Although there are not even two MOLS of order 6, we construct uniform, and hence Schur‐optimal, semi‐Latin squares for all integers . & 2012 Wiley Periodicals, Inc. J. Combin. Designs 00: 1–13, 2012     

Finite difference schemes for the two‐dimensional semilinear wave equation

In this article, two finite difference schemes for solving the semilinear wave equation are proposed. The unique solvability and the stability are discussed. The second‐order accuracy convergence in both time and space in the discrete H¹‐norm for the two proposed difference schemes is proved. Numerical experiments are performed to support our theoretical results.     

A multigrid‐based shifted Laplacian preconditioner for a fourth‐order Helmholtz discretization

In this paper, an iterative solution method for a fourth‐order accurate discretization of the Helmholtz equation is presented. The method is a generalization of that presented in (SIAM J. Sci. Comput. 2006; 27 :1471–1492), where multigrid was employed as a preconditioner for a Krylov subspace iterative method. The multigrid preconditioner is based on the solution of a second Helmholtz operator with a complex‐valued shift. In particular, we compare preconditioners based on a point‐wise Jacobi smoother with those using an ILU(0) smoother, we compare using the prolongation operator developed by de Zeeuw in (J. Comput. Appl. Math. 1990; 33 :1–27) with interpolation operators based on algebraic multigrid principles, and we compare the performance of the Krylov subspace method Bi‐conjugate gradient stabilized with the recently introduced induced dimension reduction method, IDR(s). These three improvements are combined to yield an efficient solver for heterogeneous problems. Copyright © 2009 John Wiley & Sons, Ltd.     

On semi‐classical d‐orthogonal polynomials

In this paper a general theory of semi‐classical d‐orthogonal polynomials is developed. We define the semi‐classical linear functionals by means of a distributional equation , where Φ and Ψ are matrix polynomials. Several characterizations for these semi‐classical functionals are given in terms of the corresponding d‐orthogonal polynomials sequence. They involve a quasi‐orthogonality property for their derivatives and some finite‐type relations.     

Numerical analysis nonlinear multi‐term time fractional differential equation with collocation method via fractional B‐spline

In this work, we present numerical analysis for nonlinear multi‐term time fractional differential equation which involve Caputo‐type fractional derivatives for . The proposed method is based on utilization of fractional B‐spline basics in collocation method. The scheme can be readily obtained efficient and quite accurate with less computational work numerical result. The proposal approach transform nonlinear multi‐term time fractional differential equation into a suitable linear system of algebraic equations which can be solved by a suitable numerical method. The numerical experiments will be verify to demonstrate the effectiveness of our method for solving one‐ and two‐dimensional multi‐term time fractional differential equation.     

A note on the upper bound in SA AMG convergence analysis

In [M. Brezina, P. Vaněk and P. S. Vassilevski, An improved convergence of smoothed aggregation algebraic multigrid, Numer. Linear Algebra Appl., 19 (2012), pp. 441–469], a uniform convergence bound for smoothed aggregation algebraic multigrid with aggressive coarsening and massive polynomial prolongator and multigrid smoothers is established provided that the number of smoothing steps is equal to the coarsening ratio parameter ν. The final convergence estimate needs the uniform bound for the constant C_ν ∕ (2ν + 1). In this note, we give an improved upper bound. Copyright © 2013 John Wiley & Sons, Ltd.     

An explicit spectral collocation method using nonpolynomial basis functions for the time‐dependent Schrödinger equation

We propose a spectral collocation method for the numerical solution of the time‐dependent Schrödinger equation, where the newly developed nonpolynomial functions in a previous study are used as basis functions. Equipped with the new basis functions, various boundary conditions can be imposed exactly. The preferable semi‐implicit time marching schemes are employed for temporal discretization. Moreover, the new basis functions build in a free parameter λ intrinsically, which can be chosen properly so that the semi‐implicit scheme collapses to an explicit scheme. The method is further applied to linear Schrödinger equation set in unbounded domain. The transparent boundary conditions are constructed for time semidiscrete scheme of the linear Schrödinger equation. We employ spectral collocation method using the new basis functions for the spatial discretization, which allows for the exact imposition of the transparent boundary conditions. Comprehensive numerical tests both in bounded and unbounded domain are performed to demonstrate the attractive features of the proposed method.     

On the global well‐posedness of discrete Boltzmann systems with chemical reaction

We study an initial‐boundary value problem in one‐space dimension for the discrete Boltzmann equation extended to a diatomic gas undergoing both elastic multiple collisions and chemical reactions. By integration of conservation equations, we prove a global existence result in the half‐space for small initial data N₀∈??∩L¹. Copyright © 2005 John Wiley & Sons, Ltd.     

An algebraic multigrid method for Q2−Q1 mixed discretizations of the Navier–Stokes equations

Algebraic multigrid (AMG) preconditioners are considered for discretized systems of partial differential equations (PDEs) where unknowns associated with different physical quantities are not necessarily colocated at mesh points. Specifically, we investigate a Q ₂? Q ₁ mixed finite element discretization of the incompressible Navier–Stokes equations where the number of velocity nodes is much greater than the number of pressure nodes. Consequently, some velocity degrees of freedom (DOFs) are defined at spatial locations where there are no corresponding pressure DOFs. Thus, AMG approaches leveraging this colocated structure are not applicable. This paper instead proposes an automatic AMG coarsening that mimics certain pressure/velocity DOF relationships of the Q ₂? Q ₁ discretization. The main idea is to first automatically define coarse pressures in a somewhat standard AMG fashion and then to carefully (but automatically) choose coarse velocity unknowns so that the spatial location relationship between pressure and velocity DOFs resembles that on the finest grid. To define coefficients within the intergrid transfers, an energy minimization AMG (EMIN‐AMG) is utilized. EMIN‐AMG is not tied to specific coarsening schemes and grid transfer sparsity patterns, and so it is applicable to the proposed coarsening. Numerical results highlighting solver performance are given on Stokes and incompressible Navier–Stokes problems.     

Interaction among a lump,periodic waves,and kink solutions to the fractional generalized CBS‐BK equation

The Hirota bilinear method is prepared for searching the diverse soliton solutions for the fractional generalized Calogero‐Bogoyavlenskii‐Schiff‐Bogoyavlensky‐Konopelchenko (CBS‐BK) equation. Also, the Hirota bilinear method is used to finding the lump and interaction with two stripe soliton solutions. Interaction among lumps, periodic waves, and multi‐kink soliton solutions will be investigated. Also, the solitary wave, periodic wave, and cross‐kink wave solutions will be examined for the fractional gCBS‐BK equation. The graphs for various fractional order α are plotted to contain 3D plot, contour plot, density plot, and 2D plot. We construct the exact lump and interaction among other types solutions, by solving the under‐determined nonlinear system of algebraic equations for the associated parameters. Finally, analysis and graphical simulation are presented to show the dynamical characteristics of our solutions and the interaction behaviors are revealed. The existence conditions are employed to discuss the available got solutions.