Convergence analysis of the rectangular Morley element scheme for second order problem in arbitrary dimensions

We present the convergence analysis of the rectangular Morley element scheme utilised on the second order problem in arbitrary dimensions. Specifically, we prove that the convergence of the scheme is of O(h) order in energy norm and of O(h²) order in L² norm on general d-rectangular triangulations. Moreover, when the triangulation is uniform, the convergence rate can be of O(h²) order in energy norm, and the convergence rate in L² norm is still of O(h²) order, which cannot be improved. Numerical examples are presented to demonstrate our theoretical results.     

Non-polynomial spline method for the solution of two-dimensional linear wave equations with a nonlinear source term

In this paper, two classes of methods are developed for the solution of two space dimensional wave equations with a nonlinear source term. We have used non-polynomial cubic spline function approximations in both space directions. The methods involve some parameters, by suitable choices of the parameters, a new high accuracy three time level scheme of order O(h ⁴ + k ⁴ + τ ² + τ ² h ² + τ ² k ²) has been obtained. Stability analysis of the methods have been carried out. The results of some test problems are included to demonstrate the practical usefulness of the proposed methods. The numerical results for the solution of two dimensional sine-Gordon equation are compared with those already available in literature.     

Finite element method for space-time fractional diffusion equation

In this paper, we consider two types of space-time fractional diffusion equations(STFDE) on a finite domain. The equation can be obtained from the standard diffusion equation by replacing the second order space derivative by a Riemann-Liouville fractional derivative of order β (1 < β ≤ 2), and the first order time derivative by a Caputo fractional derivative of order γ (0 < γ ≤ 1). For the 0 < γ < 1 case, we present two schemes to approximate the time derivative and finite element methods for the space derivative, the optimal convergence rate can be reached O(τ^2?γ + h²) and O(τ² + h²), respectively, in which τ is the time step size and h is the space step size. And for the case γ = 1, we use the Crank-Nicolson scheme to approximate the time derivative and obtain the optimal convergence rate O(τ² + h²) as well. Some numerical examples are given and the numerical results are in good agreement with the theoretical analysis.     

Analysis of a new finite difference/local discontinuous Galerkin method for the fractional Cattaneo equation

In this paper, we first present a new finite difference scheme to approximate the time fractional derivatives, which is defined in the sense of Caputo, and give a semidiscrete scheme in time with the truncation error O((Δt)^3?α ), where Δt is the time step size. Then a fully discrete scheme based on the semidiscrete scheme for the fractional Cattaneo equation in which the space direction is approximated by a local discontinuous Galerkin method is presented and analyzed. We prove that the method is unconditionally stable and convergent with order O(h ^k+1 + (Δt)^3?α ), where k is the degree of piecewise polynomial. Numerical examples are also given to confirm the theoretical analysis.     

Bounded projectors and duality in the spaces of functions holomorphic in the unit ball

The paper studies the Banach spaces h _∞(φ), h ₀(φ), and h ¹(η) of harmonic functions over the unit ball in R ⁿ . These spaces depend on a weight function φ and a weight measure η. For a given function φ from a sufficiently broad class of functions, we solve the duality problem. that is, we construct measures η such that h ¹(η)* ～ h _∞(φ) and h ₀(φ)* ～ h ¹(η).     

Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths

In 1982 Thomassen asked whether there exists an integer f(k,t) such that every strongly f(k,t)-connected tournament T admits a partition of its vertex set into t vertex classes V ₁,…V _t such that for all i the subtournament T[V _i] induced on T by V _i is strongly k-connected. Our main result implies an affirmative answer to this question. In particular we show that f(k, t)=O(k ⁷ t ⁴) suffices. As another application of our main result we give an affirmative answer to a question of Song as to whether, for any integer t, there exists aninteger h(t) such that every strongly h(t)-connected tournament has a 1-factor consisting of t vertex-disjoint cycles of prescribed lengths. We show that h(t)=O(t ⁵) suffices.     

Recursive polynomial interpolation algorithm (RPIA)

Two difference schemes are derived for numerically solving the one-dimensional time distributed-order fractional wave equations. It is proved that the schemes are unconditionally stable and convergent in the \(L^{\infty }\) norm with the convergence orders O(τ ² + h ²+Δγ ²) and O(τ ² + h ⁴+Δγ ⁴), respectively, where τ,h, and Δγ are the step sizes in time, space, and distributed order. A numerical example is implemented to confirm the theoretical results.     

Algebraic Theory of Causal Double Products

Corresponding to each “rectangular” double product in the form of a formal power series R[h] with coefficients in the tensor product ?(?)⊙ ? (?) with itself of the Itô Hopf algebra, we construct “triangular” elements T[h] of ?(?) satisfying ΔT[h] = T[h]⁽¹⁾ R[h]T{h]⁽²⁾. In Fock space representations of ?(?) by iterated quantum stochastic integrals when ? is the algebra of Itô differentials of the calculus, these correspond to “causal” double product integrals in a single Fock space.     

High accuracy analysis of the lowest order <Emphasis Type="Italic">H</Emphasis><Superscript>1</Superscript>-Galerkin mixed finite element method for nonlinear sine-Gordon equations

The lowest order H¹-Galerkin mixed finite element method (for short MFEM) is proposed for a class of nonlinear sine-Gordon equations with the simplest bilinear rectangular element and zero order Raviart-Thomas element. Base on the interpolation operator instead of the traditional Ritz projection operator which is an indispensable tool in the traditional FEM analysis, together with mean-value technique and high accuracy analysis, the superclose properties of order O(h²)/O(h² + τ²) in H¹-norm and H(div;Ω)-norm are deduced for the semi-discrete and the fully-discrete schemes, where h, τ denote the mesh size and the time step, respectively, which improve the results in the previous literature.     

Generalized varieties of sums of powers

Let X ? P^N be an irreducible, non-degenerate variety. The generalized variety of sums of powers V S P_H^X(h) of X is the closure in the Hilbert scheme Hilb_h (X) of the locus parametrizing collections of points {x₁,..., x_h} such that the (h -1)-plane >x₁,..., x_h> passes through a fixed general point p ∈ P^N. When X = V_dⁿ is a Veronese variety we recover the classical variety of sums of powers V S P(F, h) parametrizing additive decompositions of a homogeneous polynomial as powers of linear forms. In this paper we study the birational behavior of V S P_H^X(h). In particular, we show how some birational properties, such as rationality, unirationalityand rational connectedness, of V S P_H^X(h) are inherited from the birational geometry of variety X itself.     

Error estimates for a projection-difference method for a linear differential-operator equation

We study a projection-difference method for approximately solving the Cauchy problem u′(t) + A(t)u(t) + K(t)u(t) = h(t), u(0) = 0 for a linear differential-operator equation in a Hilbert space, where A(t) is a self-adjoint operator and K(t) is an operator subordinate to A(t). Time discretization is based on a three-level difference scheme, and space discretization is carried out by the Galerkin method. Under certain smoothness conditions on the function h(t), we obtain estimates for the convergence rate of the approximate solutions to the exact solution.     

Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control

We consider the numerical solution of the generalized Lyapunov and Stein equations in \(\mathbb {R}^{n}\), arising respectively from stochastic optimal control in continuous- and discrete-time. Generalizing the Smith method, our algorithms converge quadratically and have an O(n³) computational complexity per iteration and an O(n²) memory requirement. For large-scale problems, when the relevant matrix operators are “sparse”, our algorithm for generalized Stein (or Lyapunov) equations may achieve the complexity and memory requirement of O(n) (or similar to that of the solution of the linear systems associated with the sparse matrix operators). These efficient algorithms can be applied to Newton’s method for the solution of the rational Riccati equations. This contrasts favourably with the naive Newton algorithms of O(n⁶) complexity or the slower modified Newton’s methods of O(n³) complexity. The convergence and error analysis will be considered and numerical examples provided.     

On the existence of strips inside domains convex in one direction

A plane domain Ω is convex in the positive direction if for every ω ∈ Ω, the entire half-line {ω + t: t ≥ 0} is contained in Ω. Suppose that h maps the unit disk onto such a domain Ω with the normalization h(0) = 0 and lim_t→∞h^?1(h(z) + t) = 1. We show that if ∠lim_z→?1 Re h(z) = ?∞ and ∠lim_z→?1(1 + z)h′(z) = ν ∈ (0, +∞), then Ω contains a maximal horizontal strip of width πν. We also prove a converse statement. These results provide a solution to a problem posed by Elin and Shoikhet in connection with semigroups of holomorphic functions.     

On integral Cayley sum graphs

Let S be a subset of a finite abelian group G. The Cayley sum graph Cay⁺(G, S) of G with respect to S is a graph whose vertex set is G and two vertices g and h are joined by an edge if and only if g + h ∈ S. We call a finite abelian group G a Cayley sum integral group if for every subset S of G, Cay⁺(G, S) is integral i.e., all eigenvalues of its adjacency matrix are integers. In this paper, we prove that all Cayley sum integral groups are represented by Z₃ and Zn₂ ⁿ, n ≥ 1, where Z_k is the group of integers modulo k. Also, we classify simple connected cubic integral Cayley sum graphs.     

Grid analogs of two functions harmonic on the plane with a cut

For the Laplace equation in an unbounded domain (in the first quadrant, upper half-plane, plane with a cut), the Dirichlet and Neumann problems whose solutions are the imaginary and real parts of the complex function z ²lnz, respectively, are considered. Both problems are approximated on a square grid using the classic five-point difference scheme. The grid Fourier transform is applied to represent the solutions to the aforementioned grid problems in an integral form and obtain their asymptotic decompositions. It follows from the results that the accuracy of these grid solutions in the L _∞ ^h norm is O(h ²), where h is the grid step.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

Cubic spline interpolation of functions with high gradients in boundary layers

The cubic spline interpolation of grid functions with high-gradient regions is considered. Uniform meshes are proved to be inefficient for this purpose. In the case of widely applied piecewise uniform Shishkin meshes, asymptotically sharp two-sided error estimates are obtained in the class of functions with an exponential boundary layer. It is proved that the error estimates of traditional spline interpolation are not uniform with respect to a small parameter, and the error can increase indefinitely as the small parameter tends to zero, while the number of nodes N is fixed. A modified cubic interpolation spline is proposed, for which O((ln N/N)⁴) error estimates that are uniform with respect to the small parameter are obtained.     

Error estimates of numerical methods for the nonlinear Dirac equation in the nonrelativistic limit regime

We present several numerical methods and establish their error estimates for the discretization of the nonlinear Dirac equation(NLDE) in the nonrelativistic limit regime, involving a small dimensionless parameter 0 ε≤ 1 which is inversely proportional to the speed of light. In this limit regime, the solution is highly oscillatory in time, i.e., there are propagating waves with wavelength O(ε~2) and O(1) in time and space,respectively. We begin with the conservative Crank-Nicolson finite difference(CNFD) method and establish rigorously its error estimate which depends explicitly on the mesh size h and time step τ as well as the small parameter 0 ε≤ 1. Based on the error bound, in order to obtain ‘correct' numerical solutions in the nonrelativistic limit regime, i.e., 0 ε■ 1, the CNFD method requests the ε-scalability: τ = O(ε~3) and h= O(ε~(1/2)). Then we propose and analyze two numerical methods for the discretization of NLDE by using the Fourier spectral discretization for spatial derivatives combined with the exponential wave integrator and timesplitting technique for temporal derivatives, respectively. Rigorous error bounds for the two numerical methods show that their ε-scalability is improved to τ = O(ε~2) and h = O(1) when 0 ε■1. Extensive numerical results are reported to confirm our error estimates.     

Some relations among multiplicative and <Emphasis Type="Italic">q</Emphasis>-additive functions

We give all solutions of the equation f(n) = g(n) + h(n) for every n ∈ ?, where f is a completely multiplicative, g is a 2-additive, and h is a 3-additive function. We also determine all completely multiplicative functions f and all q-additive functions g for which f(n) = g ²(n) for every n ∈ ?.     

A two-stage difference method for solving the Dirichlet problem for the Laplace equation on a rectangular parallelepiped

A novel two-stage difference method is proposed for solving the Dirichlet problem for the Laplace equation on a rectangular parallelepiped. At the first stage, approximate values of the sum of the pure fourth derivatives of the desired solution are sought on a cubic grid. At the second stage, the system of difference equations approximating the Dirichlet problem is corrected by introducing the quantities determined at the first stage. The difference equations at the first and second stages are formulated using the simplest six-point averaging operator. Under the assumptions that the given boundary values are six times differentiable at the faces of the parallelepiped, those derivatives satisfy the Hölder condition, and the boundary values are continuous at the edges and their second derivatives satisfy a matching condition implied by the Laplace equation, it is proved that the difference solution to the Dirichlet problem converges uniformly as O(h ⁴lnh ^?1), where h is the mesh size.