Computational Mathematics and Applications Seminar

Prof Martin Skovgaard Andersen
Abstract

Classical methods for X-ray computed tomography (CT) are based on the assumption that the X-ray source intensity is known. In practice, however, the intensity is measured and hence uncertain. Under normal circumstances, when the exposure time is sufficiently high, this kind of uncertainty typically has a negligible effect on the reconstruction quality. However, in time- or dose-limited applications such as dynamic CT, this uncertainty may cause severe and systematic artifacts known as ring artifacts.
By modeling the measurement process and by taking uncertainties into account, it is possible to derive a convex reconstruction model that leads to improved reconstructions when the signal-to-noise ratio is low. We discuss some computational challenges associated with the model and illustrate its merits with some numerical examples based on simulated and real data.

  • Computational Mathematics and Applications Seminar
7 March 2019
14:00
Dr Lawrence Mitchell
Abstract

Small block overlapping, and non-overlapping, Schwarz methods are theoretically highly attractive as multilevel smoothers for a wide variety of problems that are not amenable to point relaxation methods.  Examples include monolithic Vanka smoothers for Stokes, overlapping vertex-patch decompositions for $H(\text{div})$ and  $H(\text{curl})$ problems, along with nearly incompressible elasticity, and augmented Lagrangian schemes.

 While it is possible to manually program these different schemes,  their use in general purpose libraries has been held back by a lack   of generic, composable interfaces. We present a new approach to the   specification and development such additive Schwarz methods in PETSc  that cleanly separates the topological space decomposition from the  discretisation and assembly of the equations. Our preconditioner is  flexible enough to support overlapping and non-overlapping additive  Schwarz methods, and can be used to formulate line, and plane smoothers, Vanka iterations, amongst others. I will illustrate these new features with some examples utilising the Firedrake finite element library, in particular how the design of an approriate computational interface enables these schemes to be used as building blocks inside block preconditioners.

This is joint work with Patrick Farrell and Florian Wechsung (Oxford), and Matt Knepley (Buffalo).

  • Computational Mathematics and Applications Seminar