Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
Abstract. In the paper compressible, stationary Navier-Stokes (N-S) equations are considered. The model is well-posed, there exist weak solutions in bounded domains, subject to inh...
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and ac...
Ramin Sadre, Boudewijn R. Haverkort, Patrick Reine...
We propose an interpolating refinement method for two- and threedimensional scalar fields defined on hexahedral grids. Iterative fairing of the underlying contours (isosurfaces) p...