H2-stability of the first order Galerkin method for the Boussinesq equations with smooth and non-smooth initial data

In this paper, the $H^2$-stability of the first order fully discrete Galerkin finite element methods for the Boussinesq equations with smooth and non-smooth initial data is presented. The finite element spatial discretization for the Boussinesq equations is based on the mixed finite element method, and the temporal treatments of the spatial discrete Boussinesq equations include the implicit scheme, the semi-implicit scheme, the implicit/explicit scheme and the explicit scheme. The $H^2$-stability results of the above numerical schemes are established. Firstly, we prove that the implicit and semi-implicit schemes are the $H^2$-unconditional stable. Then we show that the implicit/explicit scheme is $H^2$-almost unconditional stable with the initial data that belong to $H^1$ and $H^2$, and the similar results are obtained for the semi-implicit/explicit scheme in the case of the initial data that belong to $L^2$. Furthermore, we show that the explicit scheme is the $H^2$-conditional stable. Finally, some numerical examples are provided to verify the established theoretical findings and confirm the corresponding $H^2$ stability analysis of the different numerical schemes.     

Practical parallel key-insulated encryption with multiple helper keys

Parallel key-insulated encryption (PKIE) usually allows two independent helper keys to be alternately used in temporary secret key update operations. At least half of temporary secret keys would be exposed and at least half of ciphertexts could be decrypted if one of the helper keys is exposed. In this paper, we propose a new PKIE scheme with $m$ helper keys, where $m\in Z,m>2$. If one of the helper keys is exposed, only $1/m$ temporary secret keys would be exposed and $1/m$ ciphertexts could be decrypted, so the new PKIE scheme can greatly decrease loss due to key-exposure. The scheme is provably secure without random oracles based on a bilinear group of composite order. Most important, the scheme is practical and much more efficient than the extended ones from the previous PKIE schemes.     

Alternating direction implicit method for solving two-dimensional cubic nonlinear Schrödinger equation

In this paper, four alternating direction implicit (ADI) schemes are presented for solving two-dimensional cubic nonlinear Schrödinger equations. Firstly, we give a Crank–Nicolson ADI scheme and a linearized ADI scheme both with accuracy $O(\mathrm{\Delta }{t}^2+h^2)$, with the same method, use fourth-order Padé compact difference approximation for the spatial discretization; two HOC-ADI schemes with accuracy $O(\mathrm{\Delta }{t}^2+h^4)$ are given. The two linearized ADI schemes apply extrapolation technique to the real coefficient of the nonlinear term to avoid iterating to solve. Unconditionally stable character is verified by linear Fourier analysis. The solution procedure consists of a number of tridiagonal matrix equations which make the computation cost effective. Numerical experiments are conducted to demonstrate the efficiency and accuracy, and linearized ADI schemes show less computational cost. All schemes given in this paper also can be used for two-dimensional linear Schrödinger equations.     

Longest paths and cycles in faulty star graphs

In this paper, we investigate the star graph $S_n$ with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of $S_n$, $n⩾4$, there is a fault-free path of length at least $n!-2f_v-1$, and there is a path of length at least $n!-2f_v-2$ joining a pair of vertices with the same color, when the number of faulty elements is $n-3$ or less. Here, $f_v$ is the number of faulty vertices. $S_n$, $n⩾4$, with at most $n-2$ faulty elements has a fault-free cycle of length at least $n!-2f_v$ unless the number of faulty elements are $n-2$ and all the faulty elements are edges incident to a common vertex. It is also shown that $S_n$, $n⩾4$, is strongly hamiltonian-laceable if the number of faulty elements is $n-3$ or less and the number of faulty vertices is one or less.     

Relations between matrix sets generated from linear matrix expressions and their applications

Let $A+BXC$ and $A+BX+YC$ be two linear matrix expressions, and denote by $\{A+BXC\}$ and $\{A+BX+YC\}$ the collections of the two matrix expressions when $X$ and $Y$ run over the corresponding matrix spaces. In this paper, we study relationships between the two matrix sets $\{A_1+B_1{X}_1{C}_1\}$ and $\{A_2+B_2{X}_2{C}_2\}$, as well as the two sets $\{A_1+B_1{X}_1+Y_1{C}_1\}$ and $\{A_2+B_2{X}_2+Y_2{C}_2\}$, by using some rank formulas for matrices. In particular, we give necessary and sufficient conditions for the two matrix set inclusions $\{A_1+B_1{X}_1{C}_1\}?\{A_2+B_2{X}_2{C}_2\}$ and $\{A_1+B_1{X}_1+Y_1{C}_1\}?\{A_2+B_2{X}_2+Y_2{C}_2\}$ to hold. We also use the results obtained to characterize relations of solutions of some linear matrix equations.     

Innovation based on Gaussian elimination to compute generalized inverse AT,S(2)

In this paper, we execute elementary row and column operations on the partitioned matrix $\left(\begin{array}{cc}\hfill GAG\hfill & \hfill G\hfill \\ \hfill G\hfill & \hfill 0\hfill \end{array}\right)$ into $\left(\begin{array}{cc}\hfill \left(\begin{array}{cc}\hfill I_s\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill \end{array}\right)\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill ?A_{T,S}^{\left(2\right)}\hfill \end{array}\right)$to compute generalized inverse $A_{T,S}^{\left(2\right)}$ of a given complex matrix $A$, where $G$ is a matrix such that $R\left(G\right)=T$ and $N\left(G\right)=S$. The total number of multiplications and divisions operations is $T(m,n,s)=2m{n}^2+\frac{4m?s?1}{2}ns+(m?s)ns+mns$ and the upper bound of $T(m,n,s)$ is less than $6m{n}^2?\frac{3}{2}{n}^3?\frac{1}{2}{n}^2$ when $n\le m$. A numerical example is shown to illustrate that this method is correct.     

State complexity of power

The number of states in a deterministic finite automaton (DFA) recognizing the language $L^k$, where $L$ is regular language recognized by an $n$-state DFA, and $k?2$ is a constant, is shown to be at most $n{2}^{(k?1)n}$ and at least $(n?k)2^{(k?1)(n?k)}$ in the worst case, for every $n>k$ and for every alphabet of at least six letters. Thus, the state complexity of $L^k$ is $\Theta \left(n{2}^{(k?1)n}\right)$. In the case $k=3$ the corresponding state complexity function for $L^3$ is determined as $\frac{6n?3}{8}{4}^n?(n?1)2^n?n$ with the lower bound witnessed by automata over a four-letter alphabet. The nondeterministic state complexity of $L^k$ is demonstrated to be $nk$. This bound is shown to be tight over a two-letter alphabet.     

Lattice Boltzmann method based on Dual-MRT model for three-dimensional natural convection and entropy generation in CuO–water nanofluid filled cuboid enclosure included with discrete active walls

In the present study, the three-dimensional natural convection and entropy generation in a cuboid enclosure included with various discrete active walls is analyzed using lattice Boltzmann method. The enclosure is filled with CuO–water nanofluid. To predict thermo-physical properties, dynamic viscosity and thermal conductivity, of CuO–water nanofluid, the KKL model is applied to consider the effect of Brownian motion on nanofluid properties. In lattice Boltzmann simulation, two different MRT models are used to solve the problem. The D3Q7-MRT model is used to solve the temperature filed, and the D3Q19 is employed to solve the fluid flow of natural convection within the enclosure. The influences of different Rayleigh numbers $\left(10^3<Ra<10^6\right)$ and solid volume fractions $\left(0<\phi <0.04\right)$ and four different arrangements of discrete active walls on the fluid flow, heat transfer, total entropy generation, local heat transfer irreversibility and local fluid friction irreversibility are presented comprehensively.