Computational Mathematics and Applications
|
Thu, 19/01/2006 14:00 |
Dr Stephen Langdon (University of Reading) |
Computational Mathematics and Applications |
Comlab |
|
Standard finite element or boundary element methods for high frequency scattering problems, with piecewise polynomial approximation spaces, suffer from the limitation that the number of degrees of freedom required to achieve a prescribed level of accuracy grows at least linearly with respect to the frequency. Here we present a new boundary element method for which, by including in the approximation space the products of plane wave basis functions with piecewise polynomials supported on a graded mesh, we can demonstrate a computational cost that grows only logarithmically with respect to the frequency. |
|||
|
Thu, 26/01/2006 14:00 |
Prof Chris Farmer (Schlumberger) |
Computational Mathematics and Applications |
Comlab |
|
Using the one-dimensional diffusion equation as an example, this seminar looks at ways of constructing approximations to the solution and coefficient functions of differential equations when the coefficients are not fully defined. There may, however, be some information about the solution. The input data, usually given as values of a small number of functionals of the coefficients and the solution, is insufficient for specifying a well-posed problem, and so various extra assumptions are needed. It is argued that looking at these inverse problems as problems in Bayesian statistics is a unifying approach. We show how the standard methods of Tikhonov Regularisation are related to special forms of random field. The numerical approximation of stochastic partial differential Langevin equations to sample generation will be discussed. |
|||
|
Thu, 02/02/2006 14:00 |
Prof Mark Ainsworth (University of Strathclyde) |
Computational Mathematics and Applications |
Comlab |
|
This Seminar has been cancelled and will now take place in Trinity Term, Week 3, 11 MAY. |
|||
|
Thu, 09/02/2006 14:00 |
Prof Jeremy Levesley (University of Leicester) |
Computational Mathematics and Applications |
Comlab |
|
I will describe some application areas for radial basis function, and discuss how the computational problems can be overcome by the use of preconditioning methods and fast evaluation techniques. |
|||
|
Thu, 16/02/2006 14:00 |
Dr David Kay (University of Sussex) |
Computational Mathematics and Applications |
Comlab |
| The Cahn-Hilliard equations provides a model of phase transitions when two or more immiscible fluids interact. When coupled with the Navier-Stokes equations we obtain a model fro the dynamics of multiphase flow. This model takes into account the viscosity and densities of the various fluids present. A finite element discretisation of the variable density Cahn-Hilliard-Navier-Stokes equations is presented. An analysis of the discretisation and a reliable efficient numerical solution method are presented. | |||
|
Thu, 23/02/2006 14:00 |
Prof Gabriel Gatica (Univ. de Concepcion) |
Computational Mathematics and Applications |
Comlab |
|
We present a new stabilized mixed finite element method for the linear elasticity problem. The approach is based on the introduction of Galerkin least-squares terms arising from the constitutive and equilibrium equations, and from the relation defining the rotation in terms of the displacement. We show that the resulting augmented variational formulation and the associated Galerkin scheme are well posed, and that the latter becomes locking-free and asymptotically locking-free for Dirichlet and mixed boundary conditions, respectively. In particular, the discrete scheme allows the utilization of Raviart-Thomas spaces of lowest order for the stress tensor, piecewise linear elements for the displacement, and piecewise constants for the rotation. In the case of mixed boundary conditions, the essential one (Neumann) is imposed weakly, which yields the introduction of the trace of the displacement as a suitable Lagrange multiplier. This trace is then approximated by piecewise linear elements on an independent partition of the Neumann boundary whose mesh size needs to satisfy a compatibility condition with the mesh size associated to the triangulation of the domain. A reliable and efficient a-posteriori error estimate is also described. Finally, several numerical results illustrating the performance of the augmented scheme are reported. |
|||
|
Thu, 02/03/2006 14:00 |
Dr Matthias Bollhoefer (TU Braunschweig) |
Computational Mathematics and Applications |
Rutherford Appleton Laboratory, nr Didcot |
|
In this talk we will review classical multigrid methods and give an overview on algebraic multigrid methods, in particular the "classical" approach to AMG by Ruge and Stueben. After that we will introduce a new class of multilevel methods. These new AMGs on one hand and exploit information based on filtering vectors and on the other hand, information about the inverse matrix is used to drive the coarsening process. This new kind of AMG will be discussed and compared with "classical" AMG from a theoretical point of view as well as by showing some numerical examples. |
|||
|
Thu, 09/03/2006 14:00 |
Dr Daniel Loghin (University of Birmingham) |
Computational Mathematics and Applications |
Rutherford Appleton Laboratory, nr Didcot |
|
The use of preconditioned Newton-Krylov methods is in many applications mandatory for computing efficiently the solution of large nonlinear systems of equations. However, the available preconditioners are often sub-optimal, due to the changing nature of the linearized operator. This the case, for instance, for quasi-Newton methods where the Jacobian (and its preconditioner) are kept fixed at each non-linear iteration, with the rate of convergence usually degraded from quadratic to linear. Updated Jacobians, on the other hand require updated preconditioners, which may not be readily available. In this work we introduce an adaptive preconditioning technique based on the Krylov subspace information generated at previous steps in the nonlinear iteration. In particular, we use to advantage an adaptive technique suggested for restarted GMRES to enhance existing preconditioners with information about (almost) invariant subspaces constructed by GMRES at previous stages in the nonlinear iteration. We provide guidelines on the choice of invariant-subspace basis used in the construction of our preconditioner and demonstrate the improved performance on various test problems. As a useful general application we consider the case of augmented systems preconditioned by block triangular matrices based on the structure of the system matrix. We show that a sufficiently good solution involving the primal space operator allows for an efficient application of our adaptive technique restricted to the space of dual variables. |
|||
