An accurate block hybrid collocation method for third order ordinary differential equations

The block hybrid collocation method with two off-step points is proposed for the direct solution of general third order ordinary differential equations. Both the main and additional methods are derived via interpolation and collocation of the basic polynomial. These methods are applied in block form to provide the approximation at five points concurrently. The stability properties of the block method are investigated. Some numerical examples are tested to illustrate the efficiency of the method. The block hybrid collocation method is also implemented to solve the nonlinear Genesio equation and the problem in thin film flow

Numerical simulations with a first order BSSN formulation of Einstein's field equations

We present a new fully first order strongly hyperbolic representation of the BSSN formulation of Einstein's equations with optional constraint damping terms. We describe the characteristic fields of the system, discuss its hyperbolicity properties, and present two numerical implementations and simulations: one using finite differences, adaptive mesh refinement and in particular binary black holes, and another one using the discontinuous Galerkin method in spherical symmetry. The results of this paper constitute a first step in an effort to combine the robustness of BSSN evolutions with very high accuracy numerical techniques, such as spectral collocation multi-domain or discontinuous Galerkin methods.Comment: To appear in Physical Review

New method for nonparaxial beam propagation

A new method for solving the wave equation is presented that is nonparaxial and can be applied to wide-angle beam propagation. It shows very good stability characteristics in the sense that relatively larger step sizes can be taken. An implementation by use of the collocation method is presented in which only simple matrix multiplications are involved and no numerical matrix diagonalization or inversion is needed. The method is hence faster and is also highly accurate

Collocating Interface Objects: Zooming into Maps

May, Dean and Barnard [10] used a theoretically based model to argue that objects in a wide range of interfaces should be collocated following screen changes such as a zoom-in to detail. Many existing online maps do not follow this principle, but move a clicked point to the centre of the subsequent display, leaving the user looking at an unrelated location. This paper presents three experiments showing that collocating the point clicked on a map so that the detailed location appears in the place previously occupied by the overview location makes the map easier to use, reducing eye movements and interaction duration. We discuss the benefit of basing design principles on theoretical models so that they can be applied to novel situations, and so designers can infer when to use and not use them

Galerkin and Runge–Kutta methods: unified formulation, a posteriori error estimates and nodal superconvergence

Abstract. We unify the formulation and analysis of Galerkin and Runge–Kutta methods for the time discretization of parabolic equations. This, together with the concept of reconstruction of the approximate solutions, allows us to establish a posteriori superconvergence estimates for the error at the nodes for all methods. 1