Based on the concept of domain decomposition we construct a class of alternating group explicit method for fourth order parabolic equations. Furthermore, an exponential type alternating group explicit method for 2D convection-diffusion equations is derived, which is effective in convection dominant cases. Both of the two methods have the property of unconditional stability and intrinsic paralle...

We describe a novel 3D finite difference method for solving the anisotropic inhomogeneous Poisson equation based on a multi-component additive implicit method with a 13-point stencil. The serial performance is found to be comparable to the most efficient solvers from the family of preconditioned conjugate gradient (PCG) algorithms. The proposed multicomponent additive algorithm is unconditional...

Article history: Received 20 November 2012 Received in revised form 7 June 2013 Accepted 17 June 2013 Available online 1 July 2013

Stabilized explicit-implicit domain decomposition is a group of methods for solving time-dependent partial difference equations of the parabolic type on parallel computers. They are efficient, stable, and highly parallel, but suffer from a restriction that the interface boundaries must not intersect inside the domain. Various techniques have been proposed to handle this restriction. In this pap...

We use the auxiliary principle technique to suggest and analyze an implicit method for solving the equilibrium problems on Hadamard manifolds. The convergence of this new implicit method requires only the speudomonotonicity, which is a weaker condition than monotonicity. Some special cases are also considered.

The prevalence of implicit intergroup bias in adults underscores the importance of knowing when during development such biases are most amenable to change. Although research suggests that implicit intergroup bias undergoes little change across development, no studies have directly examined whether developmental differences exist in the capacity for novel implicit associations to form or change....

In this article an explicit method (relying on representation theory) to construct packings in Grassmannian space is presented. Infinite families of configurations having only one non-trivial set of principal angles are found using 2-transitive groups. These packings are proved to reach the simplex bound and are therefore optimal w.r.t. the chordal distance. The construction is illustrated by a...