The code document's structure and analysis

The purpose of this paper is twofold. Firstly it presents a preliminary and ethnomethodologically-informed analysis of the way in which the growing structure of a particular program's code was ongoingly derived from its earliest stages. This was motivated by an interest in how the detailed structure of completed program `emerged from nothing' as a product of the concrete practices of the programmer within the framework afforded by the language. The analysis is broken down into three sections that discuss: the beginnings of the program's structure; the incremental development of structure; and finally the code productions that constitute the structure and the importance of the programmer's stock of knowledge. The discussion attempts to understand and describe the emerging structure of code rather than focus on generating `requirements' for supporting the production of that structure. Due to time and space constraints, however, only a relatively cursory examination of these features was possible. Secondly the paper presents some thoughts on the difficulties associated with the analytic---in particular ethnographic---study of code, drawing on general problems as well as issues arising from the difficulties and failings encountered as part of the analysis presented in the first section.

A Mixed Discontinuous Galerkin Method for Incompressible Magnetohydrodynamics

We introduce and analyze a discontinuous Galerkin method for the numerical discretization of a stationary incompressible magnetohydrodynamics model problem. The fluid unknowns are discretized with inf-sup stable discontinuous P^3_{k}-P_{k-1} elements whereas the magnetic part of the equations is approximated by discontinuous P^3_{k}-P_{k+1} elements. We carry out a complete a-priori error analysis and prove that the energy norm error is convergent of order O(h^k) in the mesh size h. We also show that the method is able to correctly capture and resolve the strongest magnetic singularities in non-convex polyhedral domains. These results are verified in a series of numerical experiments.