Abstracts for the Conference on
Grid Adaptivity in Computational PDEs,
Edinburgh, July 96		Next
Previous
Index

Grid adaptation via node movement

M J Baines (Invited Presentation)

Department of Mathematics,
Univeristy of Reading,
Whiteknights,
PO Box 220,
Reading, RG6 2AX, UK

Abstract

The two principal ways of relocating nodes in approximation theory and the numerical solution of PDEs are through equidistribution and direct minimisation.

The benefits of both approaches will be briefly described together with implementations in a number of steady problems which include the numerical solution of systems of conservation laws.

The extension to time-dependent problems will also be discussed and links brought out with certain existing strategies including Moving Finite Elements. Prospects in this area will be reviewed.

ABSTRACTS
NextPreviousIndex
Last modified Fri Jun 21 19:19:09 GB-Eire 1996 (DBD)