Matrix LSQR algorithm for structured solutions to quaternionic least squares problem

In this paper, we employ matrix LSQR algorithm to deal with quaternionic least squares problem in order to find the minimum norm solutions with kinds of special structures, and propose a strategy to accelerate convergence rate of the algorithm via right–left preconditioning of the coefficient matrices. We mainly focus on analyzing the minimum norm $\eta$-Hermitian solution and the minimum norm $\eta$-biHermitian solution to the quaternionic least squares problem, $\eta \in \{\mathbf{i},\mathbf{j},\mathbf{k}\}$. Other structured solutions also can be obtained using the proposed technique. A number of numerical experiments are performed to show the efficiency of the preconditioned matrix LSQR algorithm.     

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.     

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.     

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.     

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.     

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,$     

Two guaranteed equilibrated error estimators for Harmonic formulations in eddy current problems

In this paper a guaranteed equilibrated error estimator is developed for the 3D harmonic magnetodynamic problem of Maxwell’s system. This system is recasted in the classical $\mathbf{A}?\phi$ potential formulation and solved by the Finite Element method. The error estimator is built starting from the $\mathbf{A}?\phi$ numerical solution by a local flux reconstruction technique. Its equivalence with the error in the energy norm is established. A comparison of this estimator with an equilibrated error estimator already developed through a complementary problem points out the advantages and drawbacks of these two estimators. In particular, an analytical benchmark test illustrates the obtained theoretical results and a physical benchmark test shows the efficiency of these two estimators.     

Global solution of a diffusive predator–prey model with prey-taxis

We consider the prey-taxis system:

$\left\{\begin{array}{cc}{u}_t=d_1\Delta u?\chi ??(u?v)+u(a?\mu u)+buf\left(v\right),\hfill & x\in \Omega ,t>0,\hfill \\ v_t=d_2\Delta v+v(c?\beta v)?uf\left(v\right),\hfill & x\in \Omega ,t>0\hfill \end{array}\right.$

in a smoothly bounded domain $\Omega ?{\mathbb{R}}^n$, with zero-flux boundary condition, where $a,d_1,d_2,\chi ,\mu ,b,c$ are positive constants and $\beta$ is a non-negative constant. We first investigate the global existence and local boundedness of solution for the case $\beta =0$. Moreover, when $\beta >0$, we show that the solution exists globally and is uniformly bounded provided $\mu$ is large enough.     

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.     

A spectral conjugate gradient method for solving large-scale unconstrained optimization

This paper establishes a spectral conjugate gradient method for solving unconstrained optimization problems, where the conjugate parameter and the spectral parameter satisfy a restrictive relationship. The search direction is sufficient descent without restarts in per-iteration. Moreover, this feature is independent of any line searches. Under the standard Wolfe line searches, the global convergence of the proposed method is proved when $\left|{\beta }_k\right|\le {\beta }_k^{FR}$ holds. The preliminary numerical results are presented to show effectiveness of the proposed method.     

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$.     

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).     

Extending BiCG and BiCR methods to solve the Stein tensor equation

The biconjugate gradients (BiCG) and biconjugate residual (BiCR) methods are attractive ways for solving nonsymmetric linear system $Ax=b$. In this paper, the BiCG and BiCR methods are extended to solve the high order Stein tensor equation. The convergent properties of the developed iterative algorithms are studied. Numerical examples are provided to confirm the theoretical results, which demonstrate that the proposed algorithms are effective and feasible for solving the Stein tensor equation.