Motivation in action: A process model of L2 motivation

As part of a long-term project aimed at designing classroom interventions to motivate language learners, we have searched for a motivation model that could serve as a theoretical basis for the methodological applications. We have found that none of the existing models we considered were entirely adequate for our purpose for three reasons: (1) they did not provide a sufficiently comprehensive and detailed summary of all the relevant motivational influences on classroom behaviour; (2) they tended to focus on how and why people choose certain courses of action, while ignoring or playing down the importance of motivational sources of executing goal-directed behaviour; and (3) they did not do justice to the fact that motivation is not static but dynamically evolving and changing in time, making it necessary for motivation constructs to contain a featured temporal axis. Consequently, partly inspired by Heckhausen and Kuhl's 'Action Control Theory', we have developed a new 'Process Model of L2 Motivation', which is intended both to account for the dynamics of motivational change in time and to synthesise many of the most important motivational conceptualisations to date. In this paper we describe the main components of this model, also listing a number of its limitations which need to be resolved in future research.

Hexagonal patterns in finite domains

In many mathematical models for pattern formation, a regular hexagonal pattern is stable in an infinite region. However, laboratory and numerical experiments are carried out in finite domains, and this imposes certain constraints on the possible patterns. In finite rectangular domains, it is shown that a regular hexagonal pattern cannot occur if the aspect ratio is rational. In practice, it is found experimentally that in a rectangular region, patterns of irregular hexagons are often observed. This work analyses the geometry and dynamics of irregular hexagonal patterns. These patterns occur in two different symmetry types, either with a reflection symmetry, involving two wavenumbers, or without symmetry, involving three different wavenumbers. The relevant amplitude equations are studied to investigate the detailed bifurcation structure in each case. It is shown that hexagonal patterns can bifurcate subcritically either from the trivial solution or from a pattern of rolls. Numerical simulations of a model partial differential equation are also presented to illustrate the behaviour.

Adaptive discontinuous Galerkin methods for eigenvalue problems arising in incompressible fluid flows

In this article we consider the a posteriori error estimation and adaptive mesh refinement of discontinuous Galerkin finite element approximations of the hydrodynamic stability problem associated with the incompressible Navier-Stokes equations. Particular attention is given to the reliable error estimation of the eigenvalue problem in channel and pipe geometries. Here, computable a posteriori error bounds are derived based on employing the generalization of the standard Dual-Weighted-Residual approach, originally developed for the estimation of target functionals of the solution, to eigenvalue/stability problems. The underlying analysis consists of constructing both a dual eigenvalue problem and a dual problem for the original base solution. In this way, errors stemming from both the numerical approximation of the original nonlinear flow problem, as well as the underlying linear eigenvalue problem are correctly controlled. Numerical experiments highlighting the practical performance of the proposed a posteriori error indicator on adaptively refined computational meshes are presented.

Discontinuous Galerkin Methods for Advection-Diffusion-Reaction Problems on Anisotropically Refined Meshes

In this paper we consider the a posteriori and a priori error analysis of discontinuous Galerkin interior penalty methods for second-order partial differential equations with nonnegative characteristic form on anisotropically refined computational meshes. In particular, we discuss the question of error estimation for linear target functionals, such as the outflow flux and the local average of the solution. Based on our a posteriori error bound we design and implement the corresponding adaptive algorithm to ensure reliable and efficient control of the error in the prescribed functional to within a given tolerance. This involves exploiting both local isotropic and anisotropic mesh refinement. The theoretical results are illustrated by a series of numerical experiments.

A class of domain decomposition preconditioners for hp-discontinuous Galerkin finite element methods

In this article we address the question of efficiently solving the algebraic linear system of equations arising from the discretization of a symmetric, elliptic boundary value problem using hp-version discontinuous Galerkin finite element methods. In particular, we introduce a class of domain decomposition preconditioners based on the Schwarz framework, and prove bounds on the condition number of the resulting iteration operators. Numerical results confirming the theoretical estimates are also presented.