Elbridge Gerry Puckett

Elbridge Gerry Puckett

Auto-generated profile, based on publicly available information

Elbridge Gerry Puckett

Department of Mathematics, University of California, Davis

Research Focus & Metrics

Academic Career Length

39Years (1988-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2000 in Journal of Computational Physics
Verified
Journal Article
Closed access
MSMark Sussman
Mark Sussman
EPElbridge Gerry Puckett
Elbridge Gerry Puckett

1 September 2004 in Journal of Computational Physics
Verified
Journal Article
Closed access
JPJames Edward Pilliod
James Edward Pilliod
EPElbridge Gerry Puckett
Elbridge Gerry Puckett

1 January 1997 in Journal of Computational Physics
Verified
Journal Article
Closed access
EPElbridge Gerry Puckett
Elbridge Gerry Puckett
AAAnn S. Almgren
Ann S. Almgren
JBJohn B. Bell
John B. Bell
DMDaniel L. Marcus
Daniel L. Marcus
WRWilliam J. Rider
William J. Rider

1 October 1996 in Journal of Computational Physics
Verified
Journal Article
Closed access
GMGregory Hale Miller
Gregory Hale Miller
EPElbridge Gerry Puckett
Elbridge Gerry Puckett

27 September 2018 in Geochemistry, Geophysics, Geosystems
Verified
Journal Article
Open access
PDF file
RGRene Gassmöller
Rene Gassmöller
HLHarsha Lokavarapu
Harsha Lokavarapu
EHEric Heien
Eric Heien
EPElbridge Gerry Puckett
Elbridge Gerry Puckett
WBWolfgang Bangerth
Wolfgang Bangerth
Particle‐in‐cell (PIC) methods couple mesh‐based methods for the solution of continuum mechanics problems with the ability to advect and evolve properties on particles. PIC methods have a long history and numerous applications in geodynamic modeling. However, they are historically either implemented in sequential codes or in parallel codes with structured, statically partitioned meshes. Yet today's codes increasingly use adaptive mesh refinement (AMR) of unstructured coarse meshes, dynamic repartitioning, and scale to thousands of processors. Optimally balancing the work per processor for a PIC method in these environments is a difficult problem, and many existing implementations are not sufficient for this task. Thus, there is a need to revisit these algorithms for future applications. Here we describe challenges and solutions to implement PIC methods in the context of large‐scale parallel geodynamic modeling codes that use dynamically changing meshes. We also provide guidance for how to address bottlenecks that impede the efficient implementation of these algorithms and demonstrate with numerical tests that our algorithms can be implemented with optimal complexity and that they are suitable for large‐scale, practical applications. We provide a reference implementation in the Advanced Solver for Problems in Earth's ConvecTion (ASPECT), an open source code for geodynamic modeling built on the DEAL.II finite element library.

7 June 1996
Verified
Conference Paper
Closed access
PDF file
JHJohn Joseph Helmsen
John Joseph Helmsen
EPElbridge Gerry Puckett
Elbridge Gerry Puckett
PCPhillip Colella
Phillip Colella
MDMilo Dorr
Milo Dorr
Two methods are presented for simulating the development of photolithographic profiles during the resist dissolution phase. These algorithms are the volume-of-fluid algorithm, and the steady level-set algorithm. These methods are compared with the ray-trace, cell and level- set techniques employed in SAMPLE-3D. The volume-of-fluid algorithm employs an Euclidean Grid with volume fractions. At each time step, the surface is reconstructed by computing an approximation of the tangent plane of the surface in each cell that contains a value between 0 and 1. The geometry constructed in this manner is used to determine flow velocity vectors and the flux across each edge. The material is then advanced by a split advection scheme. The steady level set algorithm is an extension of the iterative level set algorithm. The steady level set algorithm combines fast level set concepts and a technique for finding zero residual solutions to the eikonal function. The etch time for each cell is calculated in a time ordered manner. Use of heap sorting data structures allows the algorithm to execute extremely quickly. A similar technique was submitted by J. Sethian. Comparisons of the methods have been performed and the results are shown.