Noel J. Walkington
Carnegie Mellon University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Noel J. Walkington.
symposium on the theory of computing | 1995
Gary L. Miller; Dafna Talmor; Shang-Hua Teng; Noel J. Walkington
We present new geometrical and numerical analysis structure theorems for the Delaunay diagram of point sets in R~ for a fixed d where the point sets arise naturally in numerical methods. In particular, we show that if the largest ratio of the circum-radius to the length of smallest edge over all simplexes in the Delaunay diagram of P, DT(P), is bounded, (called the bounded radius-edge ratio property), then DT(P) is a subgraph of a density graph, the Delaunay spheres form a k-ply system for a constant k, and that we get optimal rates of convergence for approximate solutions of Poisson’s equation constructed using control volume techniques. The density graph result implies that DT(P) has a partition of cost O(rrl ‘Id) that can be efficiently found by the geometric separator algorithm of Miller, Teng, Thurston, and Vavasis and therefore the numerical linear system defined on D7’(P) using the finite-volume method can be solved efficiently on a parallel machine (either by a director an iterative method). The constant ply structure of Delaunay spheres leads to a linear-space point location structure for these Delaunay diagrams with O(log n) time per query. Moreover, we present a new parallel algorithm for computing the Delaunay diagram for these point sets in any fixed dimension in O(log n) random parallel time and n processors. Our results show that the bounded radius-edge ratio property is desirable for well-shaped triangular meshes for numerical methods such as finite element, finite difference, and in particular, finite volume methods.
SIAM Journal on Numerical Analysis | 2000
Chun Liu; Noel J. Walkington
The numerical solution of the flow of a liquid crystal governed by a particular instance of the Ericksen--Leslie equations is considered. Convergence of finite element approximations is established under appropriate regularity hypotheses, and numerical experiments exhibiting the interaction of singularities and the coupling of the director and momentum equations are presented.
symposium on the theory of computing | 2000
Herbert Edelsbrunner; Xiang-Yang Li; Gary L. Miller; Andreas Stathopoulos; Dafna Talmor; Shang-Hua Teng; Alper Üngör; Noel J. Walkington
A sliver is a tetrahedron whose four vertices lie close to a plane and whose perpendicular projection to that plane is a convex quadrilateral with no short edge. Slivers axe both undesirable and ubiquitous in 3-dimensional Delaunay triangulations. Even when the point-set is well-spaced, slivers may result. This paper shows that such a point set permits a small perturbation whose Delaunay triangulation contains no slivers. It also gives deterministic algorithms that compute the perturbation of n points in time O(n logn) with one processor and in time O(log n) with O(n) processors.
Journal of Intelligent Material Systems and Structures | 1993
Roy A. Nicolaides; Noel J. Walkington
An algorithm is proposed for the solution of non-convex variational problems. In order to avoid representing highly oscillatory functions on a mesh, an associated Young measure, which characterizes such oscillations, is also approximated. Sample calculations demonstrate the viability of this approach.
SIAM Journal on Numerical Analysis | 1996
Noel J. Walkington
We propose a finite element algorithm for computing the motion of a surface moving by mean curvature. The algorithm uses the level set formulation so that changes in topology of the surface can be accommodated. Stability is deduced by showing that the discrete solutions satisfy both
Siam Journal on Mathematical Analysis | 1991
R. E. Showalter; Noel J. Walkington
L^\infty
Numerische Mathematik | 1993
Lisa A. Baughman; Noel J. Walkington
and
SIAM Journal on Numerical Analysis | 2006
Konstantinos Chrysafinos; Noel J. Walkington
W^{1,1}
SIAM Journal on Numerical Analysis | 1999
Gary L. Miller; Dafna Talmor; Shang-Hua Teng; Noel J. Walkington
bounds. Existence of discrete solutions and connections with Brakke flows are established. Some numerical examples and application to related problems, such as the phase field equations, are also presented.
SIAM Journal on Numerical Analysis | 2007
Chun Liu; Noel J. Walkington
A system of quasilinear degenerate parabolic equations arising in the modeling of diffusion in a fissured medium is studied. There is one such equation in the local cell coordinates at each point of the medium, and these are coupled through a similar equation in the global coordinates. It is shown that the initial boundary value problems are well posed in the appropriate spaces.