We present a simple and robust implementation of the phase field fracture method in Abaqus. Unlike previous works, only user material (UMAT) subroutine is used. This achieved by exploiting analogy between balance equation heat transfer, which avoids need for element mesh enables taking advantage Abaqus' in-built features. A unified theoretical framework its are presented, suitable any arbitrary...

The aim of this work is to analyze the micro mechanisms underlying the wear of macroscale tools during diamond machining of SiCp/Al6063 composites and to develop the mechanism-based diamond wear model in relation to the dominant wear behaviors. During drilling, high volume fraction SiCp/Al6063 composites containing Cu, the dominant wear mechanisms of diamond tool involve thermodynamically activ...

The conjugate gradient (CG) method is an e cient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the `1-regularized (possibly not strongly) convex QP that terminate at an optimal solution in a nite number of iterations. At each iteration, our methods rst identify a face of an orthant and ...

We present a Conforming Delaunay Triangulation (CDT) algorithm based on maximal Poisson disk sampling. Points are unbiased, meaning the probability of introducing a vertex in a disk-free subregion is proportional to its area, except in a neighborhood of the domain boundary. In contrast, Delaunay refinement CDT algorithms place points dependent on the geometry of empty circles in intermediate tr...

For certain kinds of statistical simulations and Bayesian analyses, it is necessary to generate random samples from multivariate distributions. SAS/IML software provides the RANDGEN function for generating random samples from univariate distributions. However, the only subroutine for sampling from multivariate distributions is SAS/IML’s VNORMAL call, which samples from multivariate normal distr...

A heuristic method for solving large-scale multi–facility location problems is presented. The method is analogous to Cooper’s method [3], using the authors’ single facility location method [20] as a parallel subroutine, and reassigning customers to facilities using the heuristic of Nearest Center Reclassification. Numerical results are reported.

We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect matching as a subroutine in order to efficiently explore the space of planar partitions. We apply our algorithm to the problem of hierarchical image segmentat...