Upwind solution of singular differential equations arising from steady channel flows

We study ordinary nonlinear singular differential equations which arise from steady conservation laws with source terms. An example of steady conservation laws which leads to those scalar equations is the Saint–Venant equations. The numerical solution of these scalar equations is sought by using the ideas of upwinding and discretisation of source terms. Both the Engquist–Osher scheme and the Roe scheme are used with different strategies for discretising the source terms.

Scale-invariant moving finite elements for nonlinear partial differential equations in two dimensions

A scale-invariant moving finite element method is proposed for the adaptive solution of nonlinear partial differential equations. The mesh movement is based on a finite element discretisation of a scale-invariant conservation principle incorporating a monitor function, while the time discretisation of the resulting system of ordinary differential equations is carried out using a scale-invariant time-stepping which yields uniform local accuracy in time. The accuracy and reliability of the algorithm are successfully tested against exact self-similar solutions where available, and otherwise against a state-of-the-art h-refinement scheme for solutions of a two-dimensional porous medium equation problem with a moving boundary. The monitor functions used are the dependent variable and a monitor related to the surface area of the solution manifold. (c) 2005 IMACS. Published by Elsevier B.V. All rights reserved.

Implicit-factorization preconditioning and iterative solvers for regularized saddle-point systems

We consider conjugate-gradient like methods for solving block symmetric indefinite linear systems that arise from saddle-point problems or, in particular, regularizations thereof. Such methods require preconditioners that preserve certain sub-blocks from the original systems but allow considerable flexibility for the remaining blocks. We construct a number of families of implicit factorizations that are capable of reproducing the required sub-blocks and (some) of the remainder. These generalize known implicit factorizations for the unregularized case. Improved eigenvalue clustering is possible if additionally some of the noncrucial blocks are reproduced. Numerical experiments confirm that these implicit-factorization preconditioners can be very effective in practice.

Implicit synthesis

In this reply to Neal and Hesketh and to the commentators, we argue that implicit knowledge is partly abstract and can be usefully defined by the criteria of both metaknowledge and intentional control. We suggest that the pattern of dissociations supports a claim of separate implicit and explicit learning modes. According to our characterization, implicit learning leads to knowledge that is not automatically represented as knowledge by the learning process; instead, the presence of knowledge has to be inferred by the subject (partial explicitation) if metaknowledge is gained at all. During explicit learning, knowledge is automatically labeled as knowledge by the learning process, so that metaknowledge comes immediately and to the fullest extent. Finally, we suggest that implicit knowledge may to some degree apply regardless of intention.