The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most pivoting rules are known, however, to need an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior to this work, for Zadeh’s pivoting rule [Zad80]. Also known as the Least-Entered rule, Zadeh’s pivoting method belongs to the family o...

Banded linear systems with large bandwidths can be solved by similar methods as full linear systems. In particular, parallel algorithms based on torus-wrap mapping and Gaussian elimination with partial pivoting have been used with success. These algorithms are not suitable, however , if the bandwidth is small, say, between 1 and 100. As the bandwidth limits the amount of parallelism available a...

In this paper we study advancing front methods for surface reconstruction. We propose a topological framework based on handlebody theory to implement such methods in a simple and robust way. As an example of the application of this framework we show an implementation of the Ball-Pivoting Algorithm. Triangulating the Stanford Bunny using the Ball-Pivoting advancing front algorithm.

The primary cilium which is an organelle in nearly every cell in the vertebrate body extends out of the cell surface like an antenna and is known as cell sensor of mechanical and chemical stimuli. In previous numerical simulations, researchers modeled this organelle as a cantilevered beam attached to the cell surface. In the present study, however, we present a novel model that accommodates for...

In database marketing, the behavior of customers is analyzed by studying the transactions they have performed. In order to get a global picture of the behavior of a customer, his single transactions have to be composed together. In On-Line Analytical Processing, this operation is known as reverse pivoting. With the ongoing data analysis process, reverse pivoting has to be repeated several times...