Optimal Point Placement for Mesh Smoothing

We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.Comment: 12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This is the final version, and will appear in a special issue of J. Algorithms for papers from SODA '9

Numerical variational methods applied to cylinder buckling

We review and compare different computational variational methods applied to a system of fourth order equations that arises as a model of cylinder buckling. We describe both the discretization and implementation, in particular how to deal with a 1 dimensional null space. We show that we can construct many different solutions from a complex energy surface. We examine numerically convergence in the spatial discretization and in the domain size. Finally we give a physical interpretation of some of the solutions found.Comment: 23 pages, 12 figures, 6 table