This paper presents a meshing algorithm for domains with internal boundaries. It is an extension of the gridding algorithm presented by Persson and Strang. The resulting triangulation matches all boundaries, and the triangles are all nearly equilateral. Equilateral triangles are beneficial for a finite volume discretization, as fluid flow between elements of very different size is only possible...

Sabrina Strang,* Jörg Gross,* Teresa Schuhmann, Arno Riedl, Bernd Weber, and Alexander T. Sack Center for Economics and Neuroscience, University of Bonn, 53127 Bonn, Germany, Department of Cognitive Neuroscience, Faculty of Psychology and Neuroscience, Maastricht University, 6200 MD Maastricht, The Netherlands, Department of Economics (AE1), School of Business and Economics, Maastricht Universi...

Evan Wood, MD, PhD, ABIM, FRCPC, is Co-Director of the Urban Health Research Initiative at the BC Centre for Excellence in HIV/AIDS. He is also a Professor in the Department of Medicine, Division of AIDS, at the University of British Columbia, Vancouver, British Columbia, Canada. Moira McKinnon, MD, MBBS, FAFPHM, is the Chief Medical Health Officer for Saskatchewan. Robert Strang, MD, FRCPC, is...

In this work, inspired by (Bühler & Hein, 2009), (Strang, 1983), and (Zhang et al., 2009), we give a continuous relaxation of the Cheeger cut problem on a weighted graph. We show that the relaxation is actually equivalent to the original problem. We then describe an algorithm for finding good cuts suggested by the similarities of the energy of the relaxed problem and various well studied energi...

In this paper, we consider the generalized saddle point linear system of equations which is obtained from discretizing the Euler Lagrange equations associated with image debulrring problem. This system is ill-conditioned and is of huge size. Moreover, the (2,2) block of the coefficient matrix of this system contains summation of two terms. One of these terms is a product of a Toepelitz matrix w...