Steven Benson - Academia.edu (original) (raw)
Uploads
Papers by Steven Benson
Wiley Series on Parallel and Distributed Computing, 2006
Page 1. CHAPTER 4 103 Parallel Combinatorial Optimization, edited by El-Ghazali Talbi Copyright ©... more Page 1. CHAPTER 4 103 Parallel Combinatorial Optimization, edited by El-Ghazali Talbi Copyright © 2006 by John Wiley & Sons, Inc. Parallel Semidefinite Programming and Combinatorial Optimization STEVEN J. BENSON ...
Optimization Methods and Software, 2006
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear com... more Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set methods that solve only one linear system of equations per iteration. The linear solver, preconditioner, and matrix structures can be chosen by the user for a particular application to achieve high parallel performance. The parallel scalability of these methods is demonstrated for some discretizations of infinite-dimensional variational inequalities.
ACM Transactions on Mathematical Software, 2008
Delaunay refinement is a widely used method for the construction of guaranteed quality triangular... more Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present the algorithm and the software for the parallel constrained Delaunay mesh generation. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel. The parallel algorithm is asynchronous with small messages which can be aggregated and exhibits low communication costs. On a heterogeneous cluster of more than 100 processors our implementation can generate over one billion triangles in less than 3 minutes, while the single-node performance is comparable to that of the fastest to our knowledge sequential guaranteed quality Delaunay meshing library (the Triangle).
Wiley Series on Parallel and Distributed Computing, 2006
Page 1. CHAPTER 4 103 Parallel Combinatorial Optimization, edited by El-Ghazali Talbi Copyright ©... more Page 1. CHAPTER 4 103 Parallel Combinatorial Optimization, edited by El-Ghazali Talbi Copyright © 2006 by John Wiley & Sons, Inc. Parallel Semidefinite Programming and Combinatorial Optimization STEVEN J. BENSON ...
Optimization Methods and Software, 2006
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear com... more Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set methods that solve only one linear system of equations per iteration. The linear solver, preconditioner, and matrix structures can be chosen by the user for a particular application to achieve high parallel performance. The parallel scalability of these methods is demonstrated for some discretizations of infinite-dimensional variational inequalities.
ACM Transactions on Mathematical Software, 2008
Delaunay refinement is a widely used method for the construction of guaranteed quality triangular... more Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present the algorithm and the software for the parallel constrained Delaunay mesh generation. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel. The parallel algorithm is asynchronous with small messages which can be aggregated and exhibits low communication costs. On a heterogeneous cluster of more than 100 processors our implementation can generate over one billion triangles in less than 3 minutes, while the single-node performance is comparable to that of the fastest to our knowledge sequential guaranteed quality Delaunay meshing library (the Triangle).