Unsteady micropolar fluid flow in a thin domain with Tresca fluid–solid interface law

We consider a micropolar fluid flow in a two-dimensional domain. We assume that the velocity field satisfies a non-linear slip boundary condition of friction type on a part of the boundary while the micro-rotation field satisfies non-homogeneous Dirichlet boundary conditions. We prove the existence and uniqueness of a solution. Then motivated by lubrication problems we assume that the thickness and the roughness of the domain are of order $0<\epsilon <<1$ and we study the asymptotic behaviour of the flow as $\epsilon$ tends to zero. By using the two-scale convergence technique we derive the limit problem which is totally decoupled for the limit velocity and pressure $(v^0,p^0)$ on one hand and the limit micro-rotation $Z^0$ on the other hand. Moreover we prove that $v^0$, $p^0$ and $Z^0$ are uniquely determined via auxiliary well-posed problems.     

A fast singular boundary method for 3D Helmholtz equation

This paper presents a fast singular boundary method (SBM) for three-dimensional (3D) Helmholtz equation. The SBM is a boundary-type meshless method which incorporates the advantages of the boundary element method (BEM) and the method of fundamental solutions (MFS). It is easy-to-program, and attractive to the problems with complex geometries. However, the SBM is usually limited to small-scale problems, because of the operation count of $O\left(N^3\right)$ with direct solvers or $O\left(N^2\right)$ with iterative solvers, as well as the memory requirement of $O\left(N^2\right)$. To overcome this drawback, this study makes the first attempt to employ the precorrected-FFT (PFFT) to accelerate the SBM matrix–vector multiplication at each iteration step of the GMRES for 3D Helmholtz equation. Consequently, the computational complexity can be reduced from $O\left(N^2\right)$ to $O\left(NlogN\right)$ or $O\left(N\right)$. Three numerical examples are successfully tested on a desktop computer. The results clearly demonstrate the accuracy and efficiency of the developed fast PFFT-SBM strategy.     

Existence and asymptotic behavior of positive ground state solutions for coupled nonlinear fractional Kirchhoff-type systems

This paper is concerned with the following linearly coupled fractional Kirchhoff-type system

$\left\{\begin{array}{c}\left(a+b{\int }_{{\mathbb{R}}^3}|{(?△)}^{\frac{\alpha }{2}}u{|}^2\mathrm{d}x\right){(?△)}^{\alpha }u+\lambda u=f\left(u\right)+\gamma v,\text{in}{\mathbb{R}}^3,\hfill \\ \left(c+d{\int }_{{\mathbb{R}}^3}|{(?△)}^{\frac{\alpha }{2}}v{|}^2\mathrm{d}x\right){(?△)}^{\alpha }v+\mu v=g\left(v\right)+\gamma u,\text{in}{\mathbb{R}}^3,\hfill \\ u,v\in H^{\alpha }\left({\mathbb{R}}^3\right),\hfill \end{array}\right.$

where $a,c,\lambda ,\mu >0$, $b,d\ge 0$ are constants, $\alpha \in [\frac{3}{4},1)$ and $\gamma >0$ is a coupling parameter. Under the general Berestycki–Lions conditions on the nonlinear terms $f$ and $g$, we prove the existence of positive vector ground state solutions of Poho?aev type for the above system via variational methods. Moreover, the asymptotic behavior of these solutions as $\gamma \to 0^{+}$ is explored as well. Recent results from the literature are generally improved and extended.     

An accelerated cyclic-reduction-based solvent method for solving quadratic eigenvalue problem of gyroscopic systems

The quadratic eigenvalue problem (QEP) $({\lambda }^{2}M+\lambda G+K)x=0$, with $M^T=M$ being positive definite, $K^T=K$ being negative definite and $G^T=?G$, is associated with gyroscopic systems. In Guo (2004), a cyclic-reduction-based solvent (CRS) method was proposed to compute all eigenvalues of the above mentioned QEP. Firstly, the problem is converted to find a suitable solvent of the quadratic matrix equation (QME) $M{X}^2+GX+K=0$. Then using a Cayley transformation and a proper substitution, the QME is transformed into the nonlinear matrix equation (NME) $Z+A^T{Z}^{?1}A=Q$ with $A=M+K+G$ and $Q=2(M?K)$. The problem finally can be solved by applying the CR method to obtain the maximal symmetric positive definite solution of the NME as long as the QEP has no eigenvalues on the imaginary axis or for some cases where the QEP has eigenvalues on the imaginary axis. However, when all eigenvalues of the QEP are far away from or near the origin, the Cayley transformation seems not to be the best one and the convergence rate of the CRS method proposed in Guo (2004) might be further improved. In this paper, inspired by using a doubling algorithm to solve the QME, we use a Möbius transformation instead of the Cayley transformation to present an accelerated CRS (ACRS) method for solving the QEP of gyroscopic systems. In addition, we discuss the selection strategies of optimal parameter for the ACRS method. Numerical results demonstrate the efficiency of our method.     

Superconvergence analysis of nonconforming finite element method for time-fractional nonlinear parabolic equations on anisotropic meshes

In this paper, we prove a novel result of the consistency error estimate with order $O\left(h^2\right)$ for $E{Q}_1^{rot}$ element (see Lemma 2) on anisotropic meshes. Then, a linearized fully discrete Galerkin finite element method (FEM) is studied for the time-fractional nonlinear parabolic problems, and the superclose and superconvergent estimates of order $O(\tau +h^2)$ in broken $H^1$-norm on anisotropic meshes are derived by using the proved character of $E{Q}_1^{rot}$ element, which improve the results in the existing literature. Numerical results are provided to confirm the theoretical analysis.     

Dynamic behavior of droplet through a confining orifice:A lattice Boltzmann study

The motion of gravity-driven deformable droplets passing through a confining orifice in two-dimensional ($2D$) space is numerically studied by the phase-field-based multiple-relaxation-time (MRT) lattice Boltzmann (LB) model, and the ratio of orifice-to-droplet diameter is less than 1. Droplets are placed just above a sink with an orifice in the middle, accelerate under gravity and encounter the orifice plate. In this work, we mainly consider the effects of the Bond number ($Bo$), orifice-to-droplet diameter ratio ($r=d∕D$), plate thickness ($H_t$), wettability (or contact angle) and the diameter ratio of two droplets ($r_d=D_1∕D_2$) on the dynamic behavior of droplet through the orifice. The results show that these issues have great influences on the typical flow patterns (i.e., release and capture). With the decrease of contact angle, the droplet is more easily captured, and there exists a critical equilibrium contact angle ${\theta }^{eq}$ when the Bond number and the orifice-to-droplet diameter ratio as well as the thickness of the plate are specified. For the case with $\theta >{\theta }^{eq}$, the droplet can finally pass through the orifice, otherwise, the droplet cannot pass through the orifice. In addition, the droplet is more likely to pass through the orifice as the thickness of the obstacle increases. Actually, when the obstacle thickness is large enough, droplet breaks into three segments and a liquid slug is formed in a hydrophilic orifice. Finally, for the evolution of two droplets with a larger diameter ratio ($r_d=1.0$), the combined droplet finally passes through the orifice due to greater inertia than the cases with $r_d=0$ and $r_d=0.43$. Besides, we also establish the relation $r=0.57^{\frac{2}{3}}B{o}^{?\frac{1}{3}}$ which can be used to separate droplet release from capture at $H_t=1.2mm$.     

Global well-posedness of the d-D Oldroyd-B type models with fractional Laplacian dissipation

This paper focuses on the Cauchy problem of the d-dimensional incompressible Oldroyd-B type models for viscoelastic flow with fractional Laplacian dissipation, namely, with ${(?\Delta )}^{{\eta }_1}u$ and ${(?\Delta )}^{{\eta }_2}\tau$. For ${\eta }_1\ge \frac{1}{2}+\frac{d}{4}$, ${\eta }_2>0$ and ${\eta }_1+{\eta }_2\ge 1+\frac{d}{2}$, we obtain the global regularity of strong solutions when the initial data $(u_0,{\tau }_0)$ are sufficiently smooth.     

On the absence of global solutions for quantum versions of Schrödinger equations and systems

We, first, consider the quantum version of the nonlinear Schrödinger equation

$i^q{D}_{q|t}u(t,x)+\Delta u(qt,x)=\lambda |u(qt,x){|}^p,t>0,x\in {\mathbb{R}}^N,$

where $0<q<1$, $i^q$ is the principal value of $i^q$, $D_{q|t}$ is the $q$-derivative with respect to $t$, $\Delta$ is the Laplacian operator in ${\mathbb{R}}^N$, $\lambda \in ??\left\{0\right\}$, $p>1$, and $u(t,x)$ is a complex-valued function. Sufficient conditions for the nonexistence of global weak solution to the considered equation are obtained under suitable initial data. Next, we study the system of nonlinear coupled equations

$i^q{D}_{q|t}u(t,x)+\Delta u(qt,x)=\lambda |v(qt,x){|}^p,t>0,x\in {\mathbb{R}}^N,$

$i^q{D}_{q|t}v(t,x)+\Delta v(qt,x)=\lambda |u(qt,x){|}^m,t>0,x\in {\mathbb{R}}^N,$     

Note on nonparametric spectral analysis of wideband spectrum with missing data via sample-and-hold interpolation and deconvolution

In [1] a procedure for bias-free estimation of the autocorrelation function is introduced for equidistantly sampled data with randomly occurring samples being invalid. The method incorporates sample-and-hold interpolation of the missing data points. The occurring dynamic error of the primary estimate of the correlation function is treated by a deconvolution procedure with two parameters $c_0$ and $c_1$ with $c_0+2c_1=1$, which are the on-diagonal and the aside-diagonal parameters of a specific correction matrix (at all lag times except zero). The parameters $c_0$ and $c_1$ were obtained as a function of the probability α of a sample to be valid by numerical simulation. However, explicit expressions for the parameters $c_0(\alpha )=1-\frac{2}{\alpha }+\frac{2}{{\alpha }^2}$ and $c_1(\alpha )=\frac{1}{\alpha }-\frac{1}{{\alpha }^2}$ can be derived, which might improve the usability of the deconvolution procedure in [1].     

Ground state solutions of Pohoz̆aev type for fractional Choquard equations with general nonlinearities

In this paper, we study the fractional Choquard equation

${(?\Delta )}^{s}u+u=\left(\right|x{|}^{?\mu }1F\left(u\right))f\left(u\right),\text{in}{\mathbb{R}}^N,$

where $N\ge 3$, $0<s<1$, $0<\mu <min\{N,4s\}$, and $f\in C(\mathbb{R},\mathbb{R})$ satisfies the general Berestycki–Lions conditions. Combining constrained variational method with deformation lemma, we obtain a ground state solution of Pohoz?aev type for the above equation. The result improves some ones in Shen et al. (2016).     

Two-grid method for the two-dimensional time-dependent Schrödinger equation by the finite element method

In this paper, we construct a backward Euler full-discrete two-grid finite element scheme for the two-dimensional time-dependent Schrödinger equation. With this method, the solution of the original problem on the fine grid is reduced to the solution of same problem on a much coarser grid together with the solution of two Poisson equations on the same fine grid. We analyze the error estimate of the standard finite element solution and the two-grid solution in the $H^1$ norm. It is shown that the two-grid algorithm can achieve asymptotically optimal approximation as long as the mesh sizes satisfy $H=O\left(h^{\frac{k}{k+1}}\right)$. Finally, a numerical experiment indicates that our two-grid algorithm is more efficient than the standard finite element method.     

A remark concerning divergence accuracy order for H(div)-conforming finite element flux approximations

The construction of finite element approximations in $\mathbf{H}(\text{div},\Omega )$ usually requires the Piola transformation to map vector polynomials from a master element to vector fields in the elements of a partition of the region $\Omega$. It is known that degradation may occur in convergence order if non affine geometric mappings are used. On this point, we revisit a general procedure for the improvement of two-dimensional flux approximations discussed in a recent paper of this journal (Comput. Math. Appl. 74 (2017) 3283–3295). The starting point is an approximation scheme, which is known to provide $L^2$-errors with accuracy of order $k+1$ for sufficiently smooth flux functions, and of order $r+1$ for flux divergence. An example is $R{T}_k$ spaces on quadrilateral meshes, where $r=k$ or $k?1$ if linear or bilinear geometric isomorphisms are applied. Furthermore, the original space is required to be expressed by a factorization in terms of edge and internal shape flux functions. The goal is to define a hierarchy of enriched flux approximations to reach arbitrary higher orders of divergence accuracy $r+n+1$ as desired, for any $n\ge 1$. The enriched versions are defined by adding higher degree internal shape functions of the original family of spaces at level $k+n$, while keeping the original border fluxes at level $k$. The case $n=1$ has been discussed in the mentioned publication for two particular examples. General stronger enrichment $n>1$ shall be analyzed and applied to Darcy’s flow simulations, the global condensed systems to be solved having same dimension and structure of the original scheme.     

Quasi gradient-based inversion-free iterative algorithm for solving a class of the nonlinear matrix equations

Inspired by the gradient-based and inversion-free iterations, a new quasi gradient-based inversion-free iterative algorithm is proposed for solving the nonlinear matrix equation $X+A^{\mathrm{T}}{X}^{?n}A=I$. The convergence proof of the suggested algorithm is given. Several matrix norm inequalities are established to depict the convergence properties of this algorithm. Three numerical examples are given to illustrate the effectiveness of the suggested algorithms.     

Stability and convergence of semi-implicit time-stepping algorithm for stationary incompressible magnetohydrodynamics

For the stationary incompressible magnetohydrodynamics (MHD) equations, we provide a new uniqueness assumption (A0) and show the exponential stability of the solution. Then, the semi-implicit time-stepping algorithm is used to solve the stationary MHD equations. The algorithm is proved to be unconditionally stable. The discrete velocity and magnetic field are bounded in $L^{\infty }(0,+\infty ;{\mathit{L}}^{\infty }\left(\Omega \right))$ for any space and time step sizes. The error estimates for the algorithm are deduced under the uniqueness conditions. Finally, numerical experiments are performed to testify our theoretical analysis.     

GPU implementation of Borůvka’s algorithm to Euclidean minimum spanning tree based on Elias method

We present both sequential and data parallel approaches to build hierarchical minimum spanning forest (MSF) or tree (MST) in Euclidean space (EMSF/EMST) for applications whose input $N$ points are uniformly or boundedly distributed in Euclidean space. Each iteration of the sequential approach takes $O\left(N\right)$ time complexity through combining Borůvka’s algorithm with an improved component-based neighborhood search algorithm, namely sliced spiral search, which is a newly proposed improvement to Bentley’s spiral search for finding a component graph’s closest outgoing point on the plane. It works based on the uniqueness property in Euclidean space, and allows $O\left(1\right)$ time complexity for one search from a query point to find the component’s closest outgoing point at different iterations of Borůvka’s algorithm. The data parallel approach includes a newly proposed two-direction breadth-first search (BFS) implementation on graphics processing unit (GPU) platform, which is specialized for selecting a spanning tree’s shortest outgoing edge. This GPU two-direction parallel BFS enables a tree traversal operation to start from any one of its vertex acting as root. These GPU parallel implementations work by assigning $N$ threads with one thread associated to one input point, one thread occupies $O\left(1\right)$ local memory and the whole algorithm occupies $O\left(N\right)$ global memory. Experiments are conducted on both uniformly distributed data sets and TSPLIB database. We evaluate computation time of the proposed approaches on more than 80 benchmarks with size $N$ growing up to $10^6$ points on personal laptop.