Lorenz‐gauged vector potential formulations for the time‐harmonic eddy‐current problem with L∞‐regularity of material properties

In this paper, we consider some Lorenz‐gauged vector potential formulations of the eddy‐current problem for the time‐harmonic Maxwell equations with material properties having only L^∞‐regularity. We prove that there exists a unique solution of these problems, and we show the convergence of a suitable finite element approximation scheme. Moreover, we show that some previously proposed Lorenz‐gauged formulations are indeed formulations in terms of the modified magnetic vector potential, for which the electric scalar potential is vanishing. Copyright © 2007 John Wiley & Sons, Ltd.     

Web‐spline‐based finite element approximation of some quasi‐newtonian flows: Existence‐uniqueness and error bound

This article deals with the web‐spline‐based finite element approximation of quasi‐Newtonian flows. First, we consider the scalar elliptic p‐Laplace problem. Then, we consider quasi‐Newtonian flows where viscosity obeys power law or Carreau law. We prove well‐posedness at the continuous as well as the discrete level. We give some error bounds for the solution of quasi‐Newtonian flow problem based on the web‐spline method. Finally, we provide the numerical results for the p‐Laplace problem. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq31: 54–77, 2015     

On the global weak solutions for a modified two‐component Camassa‐Holm equation

In this paper, we investigate the existence of global weak solutions to the Cauchy problem of a modified two‐component Camassa‐Holm equation with the initial data satisfying lim_{x → ±∞}u₀(x) = u_±. By perturbing the Cauchy problem around a rarefaction wave, we obtain a global weak solution for the system under the assumption u_? ≤ u₊. The global weak solution is obtained as a limit of approximation solutions. The key elements in our analysis are the Helly theorem and the estimation of energy for approximation solutions in $H^1(\mathbb {R})\times H^1(\mathbb {R})In this paper, we investigate the existence of global weak solutions to the Cauchy problem of a modified two‐component Camassa‐Holm equation with the initial data satisfying lim_{x → ±∞}u₀(x) = u_±. By perturbing the Cauchy problem around a rarefaction wave, we obtain a global weak solution for the system under the assumption u_? ≤ u₊. The global weak solution is obtained as a limit of approximation solutions. The key elements in our analysis are the Helly theorem and the estimation of energy for approximation solutions in $H^1(\mathbb {R})\times H^1(\mathbb {R})$ and some a priori estimates on the first‐order derivatives of approximation solutions.     

Two‐level discretization of the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity

The r‐Laplacian has played an important role in the development of computationally efficient models for applications, such as numerical simulation of turbulent flows. In this article, we examine two‐level finite element approximation schemes applied to the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity, where r is the order of the power‐law artificial viscosity term. In the two‐level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single‐step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two‐level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide rigorous numerical analysis of the two‐level approximation scheme and derive scalings which vary based on the coefficient r, coarse mesh size H, fine mesh size h, and filter radius δ. We also investigate the two‐level algorithm in several computational settings, including the 3D numerical simulation of flow past a backward‐facing step at Reynolds number Re = 5100. In all numerical tests, the two‐level algorithm was proven to achieve the same order of accuracy as the standard one‐level algorithm, at a fraction of the computational cost. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Low‐rank approximation of tensors via sparse optimization

The goal of this paper is to find a low‐rank approximation for a given nth tensor. Specifically, we give a computable strategy on calculating the rank of a given tensor, based on approximating the solution to an NP‐hard problem. In this paper, we formulate a sparse optimization problem via an l₁‐regularization to find a low‐rank approximation of tensors. To solve this sparse optimization problem, we propose a rescaling algorithm of the proximal alternating minimization and study the theoretical convergence of this algorithm. Furthermore, we discuss the probabilistic consistency of the sparsity result and suggest a way to choose the regularization parameter for practical computation. In the simulation experiments, the performance of our algorithm supports that our method provides an efficient estimate on the number of rank‐one tensor components in a given tensor. Moreover, this algorithm is also applied to surveillance videos for low‐rank approximation.     

New fast divide‐and‐conquer algorithms for the symmetric tridiagonal eigenvalue problem

In this paper, two accelerated divide‐and‐conquer (ADC) algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost O(N²r) flops in the worst case, where N is the dimension of the matrix and r is a modest number depending on the distribution of eigenvalues. Both of these algorithms use hierarchically semiseparable (HSS) matrices to approximate some intermediate eigenvector matrices, which are Cauchy‐like matrices and are off‐diagonally low‐rank. The difference of these two versions lies in using different HSS construction algorithms, one (denoted by ADC1) uses a structured low‐rank approximation method and the other (ADC2) uses a randomized HSS construction algorithm. For the ADC2 algorithm, a method is proposed to estimate the off‐diagonal rank. Numerous experiments have been carried out to show their stability and efficiency. These algorithms are implemented in parallel in a shared memory environment, and some parallel implementation details are included. Comparing the ADCs with highly optimized multithreaded libraries such as Intel MKL, we find that ADCs could be more than six times faster for some large matrices with few deflations. Copyright © 2016 John Wiley & Sons, Ltd.     

Clique‐coloring some classes of odd‐hole‐free graphs

We consider the problem of clique‐coloring, that is coloring the vertices of a given graph such that no maximal clique of size at least 2 is monocolored. Whereas we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, the existence of a constant C such that any perfect graph is C‐clique‐colorable is an open problem. In this paper we solve this problem for some subclasses of odd‐hole‐free graphs: those that are diamond‐free and those that are bull‐free. We also prove the NP‐completeness of 2‐clique‐coloring K₄‐free perfect graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 233–249, 2006     

A series of high‐order quasi‐compact schemes for space fractional diffusion equations based on the superconvergent approximations for fractional derivatives

Based on the superconvergent approximation at some point (depending on the fractional order α, but not belonging to the mesh points) for Grünwald discretization to fractional derivative, we develop a series of high‐order quasi‐compact schemes for space fractional diffusion equations. Because of the quasi‐compactness of the derived schemes, no points beyond the domain are used for all the high‐order schemes including second‐order, third‐order, fourth‐order, and even higher‐order schemes; moreover, the algebraic equations for all the high‐order schemes have the completely same matrix structure. The stability and convergence analysis for some typical schemes are made; the techniques of treating the fractional derivatives with nonhomogeneous boundaries are introduced; and extensive numerical experiments are performed to confirm the theoretical analysis or verify the convergence orders. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1345–1381, 2015     

Two‐grid methods for time‐harmonic Maxwell equations

In this paper, we develop several two‐grid methods for the Nédélec edge finite element approximation of the time‐harmonic Maxwell equations. We first present a two‐grid method that uses a coarse space to solve the original problem and then use a fine space to solve a corresponding symmetric positive definite problem. Then, we present two types of iterative two‐grid methods, one is to add the kernel of the curl ‐operator in the fine space to a coarse mesh space to solve the original problem and the other is to use an inner iterative method for dealing with the kernel of the curl ‐operator in the fine space and the coarse space, separately. We provide the error estimates for the first two methods and present numerical experiments to show the efficiency of our methods.Copyright © 2012 John Wiley & Sons, Ltd.     

The Crank‐Nicolson/Adams‐Bashforth scheme for the time‐dependent Navier‐Stokes equations with nonsmooth initial data

In this article, we study the stability and convergence of the Crank‐Nicolson/Adams‐Bashforth scheme for the two‐dimensional nonstationary Navier‐Stokes equations with a nonsmooth initial data. A finite element method is applied for the spatial approximation of the velocity and pressure. The time discretization is based on the implicit Crank‐Nicolson scheme for the linear terms and the explicit Adams‐Bashforth scheme for the nonlinear term. Moreover, we prove that the scheme is almost unconditionally stable for a nonsmooth initial data u₀ with div u₀ = 0, i.e., the time step τ satisfies: τ ≤ C₀ if u₀ ∈ H¹ ∩ L^∞; τ |log h| ≤ C₀ if u₀ ∈ H¹ for the mesh size h and some positive constant C₀. Finally, we obtain some error estimates for the discrete velocity and pressure under the above stability condition. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 28: 155‐187, 2012     

Strang‐type preconditioners applied to ordinary and neutral differential‐algebraic equations

This paper deals with boundary‐value methods (BVMs) for ordinary and neutral differential‐algebraic equations. Different from what has been done in Lei and Jin (Lecture Notes in Computer Science, vol. 1988. Springer: Berlin, 2001; 505–512), here, we directly use BVMs to discretize the equations. The discretization will lead to a nonsymmetric large‐sparse linear system, which can be solved by the GMRES method. In order to accelerate the convergence rate of GMRES method, two Strang‐type block‐circulant preconditioners are suggested: one is for ordinary differential‐algebraic equations (ODAEs), and the other is for neutral differential‐algebraic equations (NDAEs). Under some suitable conditions, it is shown that the preconditioners are invertible, the spectra of the preconditioned systems are clustered, and the solution of iteration converges very rapidly. The numerical experiments further illustrate the effectiveness of the methods. Copyright © 2011 John Wiley & Sons, Ltd.     

A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree

In this paper, we consider the convergence rate of a smoothed aggregation algebraic multigrid method, which uses a simple polynomial (1 ? t)^ν or an optimal Chebyshev‐like polynomial to construct the smoother and prolongation operator. The result is purely algebraic, whereas a required main weak approximation property of the tentative interpolation operator is verified for a spectral element agglomeration version of the method. More specifically, we prove that, for partial differential equations (PDEs), the two‐grid method converges uniformly without any regularity assumptions. Moreover, the convergence rate improves uniformly when the degree of the polynomials used for the smoother and the prolongation increases. Such a result, as is well‐known, would imply uniform convergence of the multilevel W‐cycle version of the algorithm. Numerical results, for both PDE and non‐PDE (graph Laplacian) problems are presented to illustrate the theoretical findings. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.     

Determination of a control function in three‐dimensional parabolic equations by Legendre pseudospectral method

A Legendre pseudospectral method is proposed for solving approximately an inverse problem of determining an unknown control parameter p(t) which is the coefficient of the solution u(x, y, z, t) in a diffusion equation in a three‐dimensional region. The diffusion equation is to be solved subject to suitably prescribed initial‐boundary conditions. The presence of the unknown coefficient p(t) requires an extra condition. This extra condition considered as the integral overspecification over the spacial domain. For discretizing the problem, after homogenization of the boundary conditions, we apply the Legendre pseudospectral method in a matrix based manner. As a results a system of nonlinear differential algebraic equations is generated. Then by using suitable transformation, the problem will be converted to a homogeneous time varying system of linear ordinary differential equations. Also a pseudospectral method for efficient solving of the resulted system of ordinary differential equations is proposed. The solution of this system gives the approximation to values of u and p. The matrix based structure of the present method makes it easy to implement. Numerical experiments are presented to demonstrate the accuracy and the efficiency of the proposed computational procedure. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 74‐93, 2012     

Analytical and numerical solutions of a two‐dimensional multi‐term time‐fractional Oldroyd‐B model

In this paper, we consider a two‐dimensional multi‐term time‐fractional Oldroyd‐B equation on a rectangular domain. Its analytical solution is obtained by the method of separation of variables. We employ the finite difference method with a discretization of the Caputo time‐fractional derivative to obtain an implicit difference approximation for the equation. Stability and convergence of the approximation scheme are established in the L_∞ ‐norm. Two examples are given to illustrate the theoretical analysis and analytical solution. The results indicate that the present numerical method is effective for this general two‐dimensional multi‐term time‐fractional Oldroyd‐B model.     

An asymptotic‐induced one‐dimensional model to describe fires in tunnels II: the stationary problem

We study stationary solutions of a one‐dimensional low‐Mach‐number model derived in Gasser and Struckmeier (Math. Meth. Appl. Sci. 2002; 25 (14): 1231) to describe fire events in long tunnels. The existence of solutions of the corresponding stationary model is shown to be equivalent to the existence of solutions of an algebraic problem. Multiple solutions are shown to be possible. The relation between different formulations of the problem is analysed. Weak and special distributional solutions are considered. Finally, numerical examples of realistic tunnel data with single and multiple solutions of the stationary problem are given. Copyright © 2003 John Wiley & Sons, Ltd.     

q‐Voronovskaya type theorems for q‐Baskakov operators

In the present paper, we prove quantitative q‐Voronovskaya type theorems for q‐Baskakov operators in terms of weighted modulus of continuity. We also present a new form of Voronovskaya theorem, that is, q‐Grüss‐Voronovskaya type theorem for q‐Baskakov operators in quantitative mean. Hence, we describe the rate of convergence and upper bound for the error of approximation, simultaneously. Our results are valid for the subspace of continuous functions although classical ones is valid for differentiable functions. Copyright © 2015 John Wiley & Sons, Ltd.     

On the mixed problem for the semilinear Darcy‐Forchheimer‐Brinkman PDE system in Besov spaces on creased Lipschitz domains

The purpose of this paper is to study the mixed Dirichlet‐Neumann boundary value problem for the semilinear Darcy‐Forchheimer‐Brinkman system in L _p ‐based Besov spaces on a bounded Lipschitz domain in ${\mathbb{R}}^3$, with p in a neighborhood of 2. This system is obtained by adding the semilinear term | u | u to the linear Brinkman equation. First, we provide some results about equivalence between the Gagliardo and nontangential traces, as well as between the weak canonical conormal derivatives and the nontangential conormal derivatives. Various mapping and invertibility properties of some integral operators of potential theory for the linear Brinkman system, and well‐posedness results for the Dirichlet and Neumann problems in L _p ‐based Besov spaces on bounded Lipschitz domains in ${\mathbb{R}}^n$(n ≥3) are also presented. Then, using integral potential operators, we show the well‐posedness in L ₂‐based Sobolev spaces for the mixed problem of Dirichlet‐Neumann type for the linear Brinkman system on a bounded Lipschitz domain in ${\mathbb{R}}^n$(n ≥3). Further, by using some stability results of Fredholm and invertibility properties and exploring invertibility of the associated Neumann‐to‐Dirichlet operator, we extend the well‐posedness property to some L _p ‐based Sobolev spaces. Next, we use the well‐posedness result in the linear case combined with a fixed point theorem to show the existence and uniqueness for a mixed boundary value problem of Dirichlet and Neumann type for the semilinear Darcy‐Forchheimer‐Brinkman system in L _p ‐based Besov spaces, with p ∈(2?ε ,2+ε ) and some parameter ε >0.     

Hierarchies in φ‐spaces and applications

We establish some results on the Borel and difference hierarchies in φ‐spaces. Such spaces are the topological counterpart of the algebraic directed‐complete partial orderings. E.g., we prove analogs of the Hausdorff Theorem relating the difference and Borel hierarchies and of the Lavrentyev Theorem on the non‐collapse of the difference hierarchy. Some of our results generalize results of A. Tang for the space Pω. We also sketch some older applications of these hierarchies and present a new application to the question of characterizing the ω‐ary Boolean operations generating a given level of the Wadge hierarchy from the open sets. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The transmutation operator method for efficient solution of the inverse Sturm‐Liouville problem on a half‐line

The inverse Sturm‐Liouville problem on a half‐line is considered. With the aid of a Fourier‐Legendre series representation of the transmutation integral kernel and the Gel'fand‐Levitan equation, the numerical solution of the problem is reduced to a system of linear algebraic equations. The potential q is recovered from the first coefficient of the Fourier‐Legendre series. The resulting numerical method is direct and simple. The results of the numerical experiments are presented.     

Restricted b‐factors in bipartite graphs and t‐designs

We present a new equivalence result between restricted b‐factors in bipartite graphs and combinatorial t‐designs. This result is useful in the construction of t‐designs by polyhedral methods. We propose a novel linear integer programming formulation, which we call GDP, for the problem of finding t‐designs that has a noteworthy advantage compared to the traditional set‐covering formulation. We analyze some polyhedral properties of GPD, implement a branch‐and‐cut algorithm using it and solve several instances of small designs to compare with another point‐block formulation found in the literature. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 169–182, 2006