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.