Composing Scalable Nonlinear Algebraic Solvers

Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, where nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial differential equations. We have developed a software framework in order to easily explore the possible combinations of solvers. We show that the performance gains from using composed solvers can be substantial compared with gains from standard Newton-Krylov methods.Comment: 29 pages, 14 figures, 13 table

Darboux evaluations of algebraic Gauss hypergeometric functions

This paper presents explicit expressions for algebraic Gauss hypergeometric functions. We consider solutions of hypergeometric equations with the tetrahedral, octahedral and icosahedral monodromy groups. Conceptually, we pull-back such a hypergeometric equation onto its Darboux curve so that the pull-backed equation has a cyclic monodromy group. Minimal degree of the pull-back coverings is 4, 6 or 12 (for the three monodromy groups, respectively). In explicit terms, we replace the independent variable by a rational function of degree 4, 6 or 12, and transform hypergeometric functions to radical functions.Comment: The list of seed hypergeometric evaluations (in Section 2) reduced by half; uniqueness claims explained; 34 pages; Kyushu Journal of Mathematics, 201